Array imperfection calibration for wireless channel multipath characterisation

As one of the fastest growing technologies in modern telecommunications, wireless networking has become a very important and indispensable part in our life. A good understanding of the wireless channel and its key physical parameters are extremely useful when we want to apply them into practical applications. In wireless communications, the wireless channel refers to the propagation of electromagnetic radiation from a transmitter to a receiver. The estimation of multipath channel parameters, such as angle of depature (AoD), angle of arrival (AoA), and time difference of arrival (TDoA), is an active research problem and its typical applications are radar, communication, vehicle navigation and localization in the indoor environment where the GPS service is impractical. However, the performance of the parameter estimation deteriorates significantly in the presence of array imperfections, which include the mutual coupling, antenna location error, phase uncertainty and so on. These array imperfections are hardly to be calibrated completely via antenna design. In this thesis, we experimentally evaluate an B matrix method to cope with these array imperfection, our results shows a great improvement of AoA estimation results

Adaptive antenna array beamforming using a concatenation of recursive least square and least mean square algorithms

In recent years, adaptive or smart antennas have become a key component for various wireless applications, such as radar, sonar and cellular mobile communications including worldwide interoperability for microwave access (WiMAX). They lead to an increase in the detection range of radar and sonar systems, and the capacity of mobile radio communication systems. These antennas are used as spatial filters for receiving the desired signals coming from a specific direction or directions, while minimizing the reception of unwanted signals emanating from other directions.Because of its simplicity and robustness, the LMS algorithm has become one of the most popular adaptive signal processing techniques adopted in many applications, including antenna array beamforming. Over the last three decades, several improvements have been proposed to speed up the convergence of the LMS algorithm. These include the normalized-LMS (NLMS), variable-length LMS algorithm, transform domain algorithms, and more recently the constrained-stability LMS (CSLMS) algorithm and modified robust variable step size LMS (MRVSS) algorithm. Yet another approach for attempting to speed up the convergence of the LMS algorithm without having to sacrifice too much of its error floor performance, is through the use of a variable step size LMS (VSSLMS) algorithm. All the published VSSLMS algorithms make use of an initial large adaptation step size to speed up the convergence. Upon approaching the steady state, smaller step sizes are then introduced to decrease the level of adjustment, hence maintaining a lower error floor. This convergence improvement of the LMS algorithm increases its complexity from 2N in the case of LMS algorithm to 9N in the case of the MRVSS algorithm, where N is the number of array elements.An alternative to the LMS algorithm is the RLS algorithm. Although higher complexity is required for the RLS algorithm compared to the LMS algorithm, it can achieve faster convergence, thus, better performance compared to the LMS algorithm. There are also improvements that have been made to the RLS algorithm families to enhance tracking ability as well as stability. Examples are, the adaptive forgetting factor RLS algorithm (AFF-RLS), variable forgetting factor RLS (VFFRLS) and the extended recursive least squares (EX-KRLS) algorithm. The multiplication complexity of VFFRLS, AFF-RLS and EX-KRLS algorithms are 2.5N2 + 3N + 20 , 9N2 + 7N , and 15N3 + 7N2 + 2N + 4 respectively, while the RLS algorithm requires 2.5N2 + 3N .All the above well known algorithms require an accurate reference signal for their proper operation. In some cases, several additional operating parameters should be specified. For example, MRVSS needs twelve predefined parameters. As a result, its performance highly depends on the input signal.In this study, two adaptive beamforming algorithms have been proposed. They are called recursive least square - least mean square (RLMS) algorithm, and least mean square - least mean square (LLMS) algorithm. These algorithms have been proposed for meeting future beamforming requirements, such as very high convergence rate, robust to noise and flexible modes of operation. The RLMS algorithm makes use of two individual algorithm stages, based on the RLS and LMS algorithms, connected in tandem via an array image vector. On the other hand, the LLMS algorithm is a simpler version of the RLMS algorithm. It makes use of two LMS algorithm stages instead of the RLS – LMS combination as used in the RLMS algorithm.Unlike other adaptive beamforming algorithms, for both of these algorithms, the error signal of the second algorithm stage is fed back and combined with the error signal of the first algorithm stage to form an overall error signal for use update the tap weights of the first algorithm stage.Upon convergence, usually after few iterations, the proposed algorithms can be switched to the self-referencing mode. In this mode, the entire algorithm outputs are swapped, replacing their reference signals. In moving target applications, the array image vector, F, should also be updated to the new position. This scenario is also studied for both proposed algorithms. A simple and effective method for calculate the required array image vector is also proposed. Moreover, since the RLMS and the LLMS algorithms employ the array image vector in their operation, they can be used to generate fixed beams by pre-setting the values of the array image vector to the specified direction.The convergence of RLMS and LLMS algorithms is analyzed for two different operation modes; namely with external reference or self-referencing. Array image vector calculations, ranges of step sizes values for stable operation, fixed beam generation, and fixed-point arithmetic have also been studied in this thesis. All of these analyses have been confirmed by computer simulations for different signal conditions. Computer simulation results show that both proposed algorithms are superior in convergence performances to the algorithms, such as the CSLMS, MRVSS, LMS, VFFRLS and RLS algorithms, and are quite insensitive to variations in input SNR and the actual step size values used. Furthermore, RLMS and LLMS algorithms remain stable even when their reference signals are corrupted by additive white Gaussian noise (AWGN). In addition, they are robust when operating in the presence of Rayleigh fading. Finally, the fidelity of the signal at the output of the proposed algorithms beamformers is demonstrated by means of the resultant values of error vector magnitude (EVM), and scatter plots. It is also shown that, the implementation of an eight element uniform linear array using the proposed algorithms with a wordlength of nine bits is sufficient to achieve performance close to that provided by full precision

Mutual Coupling in Phased Arrays: A Review

The mutual coupling between antenna elements affects the antenna parameters like terminal impedances, reflection coefficients and hence the antenna array performance in terms of radiation characteristics, output signal-to-interference noise ratio (SINR), and radar cross section (RCS). This coupling effect is also known to directly or indirectly influence the steady state and transient response, the resolution capability, interference rejection, and direction-of-arrival (DOA) estimation competence of the array. Researchers have proposed several techniques and designs for optimal performance of phased array in a given signal environment, counteracting the coupling effect. This paper presents a comprehensive review of the methods that model and mitigate the mutual coupling effect for different types of arrays. The parameters that get affected due to the presence of coupling thereby degrading the array performance are discussed. The techniques for optimization of the antenna characteristics in the presence of coupling are also included

Subspace methods for self-calibration of ULAs with unknown mutual coupling: A false-peak analysis

Self-calibration can mitigate the adverse effect of array imperfections in direction-of-arrival (DoA) estimation. In this paper, we consider self-calibration of uniform linear arrays (ULAs) with unknown mutual coupling and focus on subspace-based methods. By modeling the effect of mutual coupling through complex symmetric Toeplitz matrices, we first analyze its influence to existing subspace methods. Our analytical results illustrate that mutual coupling can induce false peaks in spatial spectra of these methods, and more importantly, most of these peaks are predictable. Based on the analytical results, we then propose new spectra to suppress these predictable false peaks, and new self-calibration algorithms for the proposed spectra. Simulations are performed to validate our analytical results and to illustrate the advantages of the proposed algorithms

Generalized DOA and Source Number Estimation Techniques for Acoustics and Radar

The purpose of this thesis is to emphasize the lacking areas in the field of direction of arrival estimation and to propose building blocks for continued solution development in the area. A review of current methods are discussed and their pitfalls are emphasized. DOA estimators are compared to each other for usage on a conformal microphone array which receives impulsive, wideband signals. Further, many DOA estimators rely on the number of source signals prior to DOA estimation. Though techniques exist to achieve this, they lack robustness to estimate for certain signal types, particularly in the case where multiple radar targets exist in the same range bin. A deep neural network approach is proposed and evaluated for this particular case. The studies detailed in this thesis are specific to acoustic and radar applications for DOA estimation

Estimation of DOAs of Acoustic Sources in the Presence of Sensors with Uncertainties

Direction of Arrival (DOA) estimation finds its practical importance in sophisticated video conferencing by audio visual means, locating underwater bodies, removing unwanted interferences from desired signals etc. Some efficient algorithms for DOA estimation are already developed by the researchers . The performance of these algorithms is limited by the fact that the receiving antenna array is affected by some uncertainties like mutual coupling, antenna gain and phase error etc. So considerable attention is there in recent research on this area. In this research work the effect of mutual coupling and the effect of antenna gain and phase error in uniform linear array (ULA) on the direction finding of acoustic sources is studied. Also this effect for different source spacing is compared. For that, estimates of the directions of arrival of all uncorrelated acoustic signals in the presence of unknown mutual coupling has been found using conventional Estimation of Signal Parameters via Rotational Invariance Technique (ESPRIT). Also DOAs are computed after knowing the coupling coefficients so that we can compare the two results. Simulation results have shown the fact that the degradation in performance of the algorithm due to mutual coupling becomes more if the sources become closer to each other. Also we have estimated DOAs in the presence of unknown sensor gain and phase errors and we have compared this results with the results we got by considering ideal array. Finally in this case also the effect of gain and phase error as the source spacing varies has been tested. Simulation results verify that performance degradation is more if the sources become closer

Asymptotically Optimal Blind Calibration of Uniform Linear Sensor Arrays for Narrowband Gaussian Signals

An asymptotically optimal blind calibration scheme of uniform linear arrays for narrowband Gaussian signals is proposed. Rather than taking the direct Maximum Likelihood (ML) approach for joint estimation of all the unknown model parameters, which leads to a multi-dimensional optimization problem with no closed-form solution, we revisit Paulraj and Kailath's (P-K's) classical approach in exploiting the special (Toeplitz) structure of the observations' covariance. However, we offer a substantial improvement over P-K's ordinary Least Squares (LS) estimates by using asymptotic approximations in order to obtain simple, non-iterative, (quasi-)linear Optimally-Weighted LS (OWLS) estimates of the sensors gains and phases offsets with asymptotically optimal weighting, based only on the empirical covariance matrix of the measurements. Moreover, we prove that our resulting estimates are also asymptotically optimal w.r.t. the raw data, and can therefore be deemed equivalent to the ML Estimates (MLE), which are otherwise obtained by joint ML estimation of all the unknown model parameters. After deriving computationally convenient expressions of the respective Cram\'er-Rao lower bounds, we also show that our estimates offer improved performance when applied to non-Gaussian signals (and/or noise) as quasi-MLE in a similar setting. The optimal performance of our estimates is demonstrated in simulation experiments, with a considerable improvement (reaching an order of magnitude and more) in the resulting mean squared errors w.r.t. P-K's ordinary LS estimates. We also demonstrate the improved accuracy in a multiple-sources directions-of-arrivals estimation task.Comment: in IEEE Transactions on Signal Processin