Yes / In the equivalent frequency-based model, the antenna array gain is utilised to characterise the frequency response of the beam squint effect generated by the antenna array. This impact is considered for a wide range of uniform linear array (ULA) and uniform planar array (UPA) designs, including those with and without tapering configurations. For a closer look at how the frequency response of the array adapts to the variations in the incidence angle of the signal, the bandwidth of the spectrum is varied and investigated. To study this effect, we have considered using the gain array response as an equivalent channel model in our approach. Beam squinting caused by distortion in the frequency response gain can be verified by one of two equalisers: a zero-forcing (ZF) equaliser or a minimum mean square error (MMSE) equaliser. Different cases with their analysis and results are studied and compared in terms of coded and uncoded modulations. / This work was supported in part by the Satellite Network of Experts V under Contract 4000130962/20/NL/NL/FE, and in part by the Innovation Program under Grant H2020-MSCA-ITN-2016 SECRET-722424.

This thesis considers statistical issues in source localization from the received signal strength (RSS) measurements at sensor locations, under the practical assumption of log-normal shadowing. Distance information of source from sensor locations can be estimated from RSS measurements and many algorithms directly use powers of distances to localize the source, even though distance measurements are not directly available. The first part of the thesis considers the statistical analysis of distance estimation from RSS measurments. We show that the underlying problem is inefficient and there is only one unbiased estimator for this problem and its mean square error (MSE) grows exponentially with noise power. Later, we provide the linear minimum mean square error (MMSE) estimator whose bias and MSE are bounded in noise power. The second part of the thesis establishes an isomorphism between estimates of differences between squares of distances and the source location. This is used to completely characterize the class of unbiased estimates of the source location and to show that their MSEs grow exponentially with noise powers. Later, we propose an estimate based on the linear MMSE estimate of distances that has error variance and bias that is bounded in the noise variance.

The study of the spatial aspects of multipath in wireless communications environments is an increasingly important addition to the study of the temporal aspects in the search for ways to increase the utilization of the available wireless channel capacity. Traditionally, multipath has been viewed as an encumbrance in wireless communications, two of the major impairments being signal fading and intersymbol interference. However, recently the potential advantages of the diversity offered by multipath rich environments in multiuser communications have been recognised. Space time coding, for example, is a recent technique which relies on a rich scattering environment to create many practically uncorrelated signal transmission channels. Most often, statistical models have been used to describe the multipath environments in such applications. This approach has met with reasonable success but is limited when the statistical nature of a field is not easily determined or is not readily described by a known distribution.¶ Our primary aim in this thesis is to probe further into the nature of multipath environments in order to gain a greater understanding of their characteristics and diversity potential. We highlight the shortcomings of beamforming in a multipath multiuser access environment. We show that the ability of a beamformer to resolve two or more signals in angle directly limits its achievable capacity.¶ We test the probity of multipath as a source of spatial diversity, the limiting case of which is co-located users. We introduce the concept of separability to define the fundamental limits of a receiver to extract the signal of a desired user from interfering users’ signals and noise. We consider the separability performances of the minimum mean square error (MMSE), decorrelating (DEC) and matched filter (MF) detectors as we bring the positions of a desired and an interfering user closer together. We show that both the MMSE and DEC detectors are able to achieve acceptable levels of separability with the users as close as λ/10.¶ In seeking a better understanding of the nature of multipath fields themselves, we take two approaches. In the first we take a path oriented approach. The effects on the variation of the field power of the relative values of parameters such as amplitude and propagation direction are considered for a two path field. The results are applied to a theoretical analysis of the behaviour of linear detectors in multipath fields. This approach is insightful for fields with small numbers of multipaths, but quickly becomes mathematically complex.¶ In a more general approach, we take a field oriented view, seeking to quantify the complexity of arbitrary fields. We find that a multipath field has an intrinsic dimensionality of (πe)R/λ≈8.54R/λ, for a field in a two dimensional circular region, increasing only linearly with the radius R of the region. This result implies that there is no such thing as an arbitrarily complicated multipath field. That is, a field generated by any number of nearfield and farfield, specular and diffuse multipath reflections is no more complicated than a field generated by a limited number of plane waves. As such, there are limits on how rich multipath can be. This result has significant implications including means: i) to determine a parsimonious parameterization for arbitrary multipath fields and ii) of synthesizing arbitrary multipath fields with arbitrarily located nearfield or farfield, spatially discrete or continuous sources. The theoretical results are corroborated by examples of multipath field analysis and synthesis.

Orthogonal Frequency Division Multiplexing (OFDM) techniques have been used in many wireless communication systems to improve the system capacity and achieve high data-rate. It possesses good spectral efficiency and robustness against interferences. The OFDM system has been adopted in many communication standards, such as the 802.11a/g standards for the high-speed WLAN, HIPERLAN2, and IEEE 802.16 standard, and meanwhile, it is also employed in the European DAB and DVB systems. To avoid the inter-block interference (IBI), usually, in the transmitter of OFDM systems the redundancy with sufficient length is introduced, it allows us to overcome the IBI problem, due to highly dispersive channel. Many redundancy insertion methods have been proposed in the literatures, there are cyclic prefix (CP), zero padding (ZP) and the pseudorandom postfix (PRP). Under such system we have still to know the correct channel state information for equalizing the noisy block signal. Especially, in time-varying channel, the incorrect channel state information may introduce serious inter-symbol interference (ISI), if the channel estimation could not perform correctly. In this thesis, the PRP-OFDM system is considered. According to the PRP-OFDM scheme, the redundancy with pseudorandom postfix (PRP) approach is employed to make semi-blind channel estimation with order-one statistics of the received signal. But these statistic characteristics may not be available under time-varying channel. Hence, in this thesis, we propose a modified PRP-OFDM system with assistant training sequences, which is equipped with minimum mean-square-error equalizer and utilize Kalman filter algorithm to implement time-varying channel estimation. To do so, we first model time-varying channel estimation problem with a dynamic system, and adopt the Kalman filter algorithm to estimate the true channel coefficients. Unfortunately, since most parameters in dynamic system are random and could not to be known in advance. We need to apply effective estimation schemes to estimate the statistics of true parameters for implementing the Kalman filter algorithm. When the channel state information is known, MMSE equalizer follows to suppress the inter-symbol interference (ISI). Moreover, after making decision the binary data can be used to re-modulate PRP-OFDM symbol and to be re-used in Kalman filter to obtain more accurate CSI to improve the effectiveness of the equalizer. Via computer simulations, we verify that desired performance in terms of bit error rate (BER), can be achieved compared with the CP-OFDM systems.

A number of topics related to Fourier imaging are investigated. Relationships between the magnitude of errors in the amplitude and phase of the Fourier transform of images and the mean square error in reconstructed images are derived. The differing effects of amplitude and phase errors are evaluated, and "equivalent" amplitude and phase errors are derived. A model of the probability density function of the Fourier amplitudes of images is derived. The fundamental basis of phase dominance is studied and quantitated. Inconsistencies in published counter-examples of phase dominance are highlighted. The key characteristics of natural images that lead to their observed power spectral behaviour with spatial frequency are determined.

This thesis is concerned with distributed estimation in a wireless sensor network (WSN) with analog transmission. For a scenario in which a large number of sensors are deployed under a limited bandwidth constraint, a semi-orthogonal multiple-access channelization (MAC) approach is proposed to provide transmission of observations from K sensors to a fusion center (FC) via N orthogonal channels, where K≥N. The proposed semi-orthogonal MAC can be implemented with either fixed sensor grouping or adaptive sensor grouping. The mean squared error (MSE) is adopted as the performance criterion and it is first studied under equal power allocation. The MSE can be expressed in terms of two indicators: the channel noise suppression capability and the observation noise suppression capability. The fixed version of the semi-orthogonal MAC is shown to have the same channel noise suppression capability and two times the observation noise suppression capability when compared to the orthogonal MAC under the same bandwidth resource. For the adaptive version, the performance improvement of the semi-orthogonal MAC over the orthogonal MAC is even more significant. In fact, the semi-orthogonal MAC with adaptive sensor grouping is shown to perform very close to that of the hybrid MAC, while requiring a much smaller amount of feedback. Another contribution of this thesis is an analysis of the behavior of the average MSE in terms of the number of sensors, namely the scaling law, under equal power allocation. It is shown that the proposed semi-orthogonal MAC with adaptive sensor grouping can achieve the optimal scaling law of the analog WSN studied in this thesis. Finally, improved power allocations for the proposed semi-orthogonal MAC are investigated. First, the improved power allocations in each sensor group for different scenarios are provided. Then an optimal solution of power allocation among sensor groups is obtained by the convex optimization theory, and shown to outperform equal power allocation. The issue of balancing between the performance improvement and extra feedback required by the improved power allocation is also thoroughly discussed.

In wireless communications systems, the transmission channel between the transmitter and the receiver antennas is one of the main sources of disruption for the signal. The multicarrier modulations, such as the orthogonal frequency division multiplexing (OFDM), are very robust against the multipath effect, and allow to recover the transmitted signal with a low error rate, when they are combined with a channel encoding. The channel estimation then plays a key role in the performance of the communications systems. In this PhD thesis, we study techniques based on least square (LS) and minimum mean square error (MMSE) estimators. The MMSE is optimal, but is much more complex than LS, and requires the a priori knowledge of the second order moment of the channel and the noise. In this presentation, two methods that allow to reach a performance close to the one of LMMSE while getting around its drawback are investigated. In another way, a third part of the presentation investigates the errors of estimation due to the interpolations.

This thesis investigates optimality of heuristic forecasting. According to Goldstein a Gigerenzer (2009), heuristics can be viewed as predictive models, whose simplicity is exploiting the bias-variance trade-off. Economic agents learning in the context of rational expectations (Marcet a Sargent 1989) employ, on the contrary, complex models of the whole economy. Both of these approaches can be perceived as an optimal response complexity of the prediction task and availability of observations. This work introduces a straightforward extension to the standard model of decision making under uncertainty, where agents utility depends on accuracy of their predictions and where model complexity is moderated by regularization parameter. Results of Monte Carlo simulations reveal that in complicated environments, where few observations are at disposal, it is beneficial to construct simple models resembling heuristics. Unbiased models are preferred in more convenient conditions.

Realised Stochastic Volatility model of Koopman and Scharth (2011) is applied to the five stocks listed on NYSE in this thesis. Aim of this thesis is to investigate the effect of speeding up the trade data processing by skipping the cleaning rule requiring the quote data. The framework of the Realised Stochastic Volatility model allows the realised measures to be biased estimates of the integrated volatility, which further supports this approach. The number of errors in recorded trades has decreased significantly during the past years. Different sample lengths were used to construct one day-ahead forecasts of realised measures to examine the forecast precision sensitivity to the rolling window length. Use of the longest window length does not lead to the lowest mean square error. The dominance of the Realised Stochastic Volatility model in terms of the lowest mean square errors of one day-ahead out-of-sample forecasts has been confirmed.

City busses are operated on roads where the GPS signal is weak, because of the tall buildings surrounding these roads. The localization of city busses, needs to therefore rely on alternate technique in order to improve the accuracy. Recent standardization of inter vehicular communication has made this a readily available tool which can be used for localization. This thesis presents an approach towards localization of a city bus by means of vehicular ad hoc network. The two main components of localization by this approach is the initialization of location estimate component, and the real time location estimation component. In particular, the thesis develops the use of minimum mean square estimation for initialization and an extended Kalman filtering approach for real time location estimation. The localization method is mathematically described, considering the operating scenarios of a city bus. The accuracy of the proposed method is mathematically evaluated. The developed localization method is implemented in a simulation tool kit for inter vehicular communication. Simulation experiments were performed for operating scenarios of city bus. The result of initialization by minimum mean square error is compared to that of initialization by GPS, in-terms of localization accuracy. Different setups of road side units are compared in-terms of accuracy and update interval. The results show that the proposed method is feasible for localization of a city bus. This thesis was carried out in association with Scania AB, Södertälje. / Stadsbussar åker på vägar som är omgivna av byggnader, vilket försämrar stadsbussarnas GPSmottagning. Lokaliseringen av stadsbussar måste därför förlita sig på alternativ teknik för att förbättra noggrannheten. Nyligen standardiserad kommunikation mellan fordon har blivit till ett lättillgängligt verktyg som kan användas för lokalisering. Den här uppsatsen presenterar en strategi för lokalisering av en stadsbuss med hjälp av fordonets ad hoc-nätverk. Huvudkomponenterna för lokalisering är en initialiseringskomponent och realtidslägesuppskattningskomponent. Speciellt utvecklar arbetet användningen av minsta medelkvadratberäkning för initialisering och en utvidgad kalmanfiltreringsmetod för realtidslägesuppskattning. Lokaliseringsmetoden beskrivs matematiskt med tanke på driftsscenarierna för en stadsbuss. Noggrannheten hos den föreslagna metoden utvärderas matematiskt. Den utvecklade lokaliseringsmetoden implementeras i ett simuleringsverktyg för kommunikation mellan fordon. Simuleringsexperiment utfördes för driftsscenarier för stadsbussar. Resultatet av initialisering med minsta medelkvadratberäkning jämförs med initialiseringen med GPS, i termer av lokaliseringsnoggrannhet. Olika inställningar av vägrensenheter jämförs med avseende på noggrannhet och uppdateringsintervall. Resultaten visar att den föreslagna metoden är möjlig för lokalisering av en stadsbuss. Denna arbetet genomfördes i samarbete med Scania AB, Södertälje.