Conditional maximum likelihood timing recovery: estimators and bounds

This paper is concerned with the derivation of new estimators and performance bounds for the problem of timing estimation of (linearly) digitally modulated signals. The conditional maximum likelihood (CML) method is adopted, in contrast to the classical low-SNR unconditional ML (UML) formulation that is systematically applied in the literature for the derivation of non-data-aided (NDA) timing-error-detectors (TEDs). A new CML TED is derived and proved to be self-noise free, in contrast to the conventional low-SNR-UML TED. In addition, the paper provides a derivation of the conditional Cramér–Rao Bound (CRB ), which is higher (less optimistic) than the modified CRB (MCRB) [which is only reached by decision-directed (DD) methods]. It is shown that the CRB is a lower bound on the asymptotic statistical accuracy of the set of consistent estimators that are quadratic with respect to the received signal. Although the obtained bound is not general, it applies to most NDA synchronizers proposed in the literature. A closed-form expression of the conditional CRB is obtained, and numerical results confirm that the CML TED attains the new bound for moderate to high Eg/No.Peer Reviewe

Advances in parameter estimation, source enumeration, and signal identification for wireless communications

Parameter estimation and signal identification play an important role in modern wireless communication systems. In this thesis, we address different parameter estimation and signal identification problems in conjunction with the Internet of Things (IoT), cognitive radio systems, and high speed mobile communications. The focus of Chapter 2 of this thesis is to develop a new uplink multiple access (MA) scheme for the IoT in order to support ubiquitous massive uplink connectivity for devices with sporadic traffic pattern and short packet size. The proposed uplink MA scheme removes the Media Access Control (MAC) address through the signal identification algorithms which are employed at the gateway. The focus of Chapter 3 of this thesis is to develop different maximum Doppler spread (MDS) estimators in multiple-input multiple-output (MIMO) frequency-selective fading channel. The main idea behind the proposed estimators is to reduce the computational complexity while increasing system capacity. The focus of Chapter 4 and Chapter 5 of this thesis is to develop different antenna enumeration algorithms and signal-to-noise ratio (SNR) estimators in MIMO timevarying fading channels, respectively. The main idea is to develop low-complexity algorithms and estimators which are robust to channel impairments. The focus of Chapter 6 of this thesis is to develop a low-complexity space-time block codes (STBC)s identification algorithms for cognitive radio systems. The goal is to design an algorithm that is robust to time-frequency transmission impairments

Efficient Beamspace Eigen-Based Direction of Arrival Estimation schemes

The Multiple SIgnal Classification (MUSIC) algorithm developed in the late 70\u27s was the first vector subspace approach used to accurately determine the arrival angles of signal wavefronts impinging upon an array of sensors. As facilitated by the geometry associated with the common uniform linear array of sensors, a root-based formulation was developed to replace the computationally intensive spectral search process and was found to offer an enhanced resolution capability in the presence of two closely-spaced signals. Operation in beamspace, where sectors of space are individually probed via a pre-processor operating on the sensor data, was found to offer both a performance benefit and a reduced computationa1 complexi ty resulting from the reduced data dimension associated with beamspace processing. Little progress, however, has been made in the development of a computationally efficient Root-MUSIC algorithm in a beamspace setting. Two approaches of efficiently arriving at a Root-MUSIC formulation in beamspace are developed and analyzed in this Thesis. In the first approach, a structura1 constraint is placed on the beamforming vectors that can be exploited to yield a reduced order polynomial whose roots provide information on the signal arrival angles. The second approach is considerably more general, and hence, applicable to any vector subspace angle estimation algorithm. In this approach, classical multirate digital signal processing is applied to effectively reduce the dimension of the vectors that span the signal subspace, leading to an efficient beamspace Root-MUSIC (or ESPRIT) algorithm. An auxiliaay, yet important, observation is shown to allow a real-valued eigenanalysis of the beamspace sample covariance matrix to provide a computational savings as well as a performance benefit, particularly in the case of correlated signal scenes. A rigorous theoretical analysis, based upon derived large-sample statistics of the signal subspace eigenvectors, is included to provide insight into the operation of the two algorithmic methodologies employing the real-valued processing enhancement. Numerous simulations are presented to validate the theoretical angle bias and variance expressions as well as to assess the merit of the two beamspace approaches

GNSS/5G Hybridization for urban navigation

Over the past few years, the need for positioning, and thus the number of positioning services in general, has been in constant growth. This need for positioning has been increasingly focused on constrained environments, such as urban or indoor environments, where GNSS is known to have significant limitations: multipath as well as the lack of Line-of-Sight satellite visibility degrades the GNSS positioning solution and makes it unsuitable for some urban or indoor applications. In order to improve the GNSS positioning performance in constrained environments, many solutions are already available: hybridization with additional sensors or the use of signals of opportunity for example. Concerning SoO, mobile communication signals, such as the 4G Long Term Evolution or 5G, are naturally envisioned for positioning. Indeed, a significant number of users are expected to be “connected-users” and 5G systems offers promising opportunities. 5G technology is being standardized at 3GPP; the first complete release of 5G specifications, Release-15, was provided to the community in June 2018. 5G is an emerging technology and its positioning performance, as well as a potential generic receiver scheme to conduct positioning operations, is still under analysis. In order to study the potential capabilities provided by 5G systems and to develop a 5Gbased generic positioning module scheme, the first fundamental step is to develop mathematical models of the processed 5G signals at each stage of the receiver for realistic propagation channel models: the mathematical expression of the useful received 5G signal as well as the AWG (Additive White Gaussian) noise statistics. In the Ph.D., the focus is given to the correlation operation which is the basic function implemented by typical ranging modules for 4G LTE signals, DVB signals, and GNSS. In fact, the knowledge of the correlation output mathematical model could allow for the development of optimal 5G signal processing techniques for ranging positioning. Previous efforts were made to provide mathematical models of received signals at the different receiver signal processing stages for signals with similar structures to 5G signals – Orthogonal ²Frequency Division Multiplexing (OFDM) signals as defined in 3GPP standard. OFDM signal-type correlator output mathematical model and acquisition techniques were derived. Moreover, tracking techniques were proposed, analyzed and tested based on the correlator output mathematical model. However, these models were derived by assuming a constant propagation channel over the duration of the correlation. Unfortunately, when the Channel Impulse Response (CIR) provided by a realistic propagation channel is not considered to be constant over the duration of the correlation, the correlator output mathematical models are slightly different from the mathematical models proposed in the literature