Efficient blind symbol rate estimation and data symbol detection algorithms for linearly modulated signals

Blind estimation of unknown channel parameters and data symbol detection represent major open problems in non-cooperative communication systems such as automatic modulation classification (AMC). This thesis focuses on estimating the symbol rate and detecting the data symbols. A blind oversampling-based signal detector under the circumstance of unknown symbol period is proposed. The thesis consists of two parts: a symbol rate estimator and a symbol detector. First, the symbol rate is estimated using the EM algorithm. In the EM algorithm, it is difficult to obtain the closed form of the log-likelihood function and the density function. Therefore, both functions are approximated by using the Particle Filter (PF) technique. In addition, the symbol rate estimator based on cyclic correlation is proposed as an initialization estimator since the EM algorithm requires initial estimates. To take advantage of the cyclostationary property of the received signal, there is a requirement that the sampling period should be at least four times less than the symbol period on the receiver side. Second, the blind data symbol detector based on the PF algorithm is designed. Since the signal is oversampled at the receiver side, a delayed multi-sampling PF detector is proposed to manage inter-symbol interference, which is caused by over- sampling, and to improve the demodulation performance of the data symbols. In the PF algorithm, the hybrid importance function is used to generate both data samples and channel model coe±cients, and the Mixture Kalman Filter (MKF) algorithm is used to marginalize out the fading channel coe±cients. At the end, two resampling schemes are adopted

Timing and Carrier Synchronization in Wireless Communication Systems: A Survey and Classification of Research in the Last 5 Years

Timing and carrier synchronization is a fundamental requirement for any wireless communication system to work properly. Timing synchronization is the process by which a receiver node determines the correct instants of time at which to sample the incoming signal. Carrier synchronization is the process by which a receiver adapts the frequency and phase of its local carrier oscillator with those of the received signal. In this paper, we survey the literature over the last 5 years (2010–2014) and present a comprehensive literature review and classification of the recent research progress in achieving timing and carrier synchronization in single-input single-output (SISO), multiple-input multiple-output (MIMO), cooperative relaying, and multiuser/multicell interference networks. Considering both single-carrier and multi-carrier communication systems, we survey and categorize the timing and carrier synchronization techniques proposed for the different communication systems focusing on the system model assumptions for synchronization, the synchronization challenges, and the state-of-the-art synchronization solutions and their limitations. Finally, we envision some future research directions

Joint Blind Symbol Rate Estimation and Data Symbol Detection for Linearly Modulated Signals

This paper focuses on non-data aided estimation of the symbol rate and detecting the data symbols in linearlymodulated signals. A blind oversampling-based signal detector under the circumstance of unknown symbol period is proposed. First, the symbol rate is estimated using the Expectation Maximization (EM) algorithm. However, within the framework of EM algorithm, it is difficult to obtain a closed form for the loglikelihood function and the density function. Therefore, these two functions are approximated in this paper by using the Particle Filter (PF) technique. In addition, a symbol rate estimator that exploits the cyclic correlation information is proposed as an initialization estimator for the EM algorithm. Second, the blind data symbol detector based on the PF algorithm is designed.Since the signal is oversampled at the receiver side, a delayed multi-sampling PF detector is proposed to manage the intersymbol interference caused by oversampling, and to improve the demodulation performance of the data symbols. In the PF algorithm, the hybrid importance function is used to generate both data samples and channel model coefficients, and the Mixture Kalman Filter (MKF) algorithm is used to marginalize out the fading channel coefficients

Efficient blind symbol rate estimation and data symbol detection algorithms for linearly modulated signals

Blind estimation of unknown channel parameters and data symbol detection represent major open problems in non-cooperative communication systems such as automatic modulation classification (AMC). This thesis focuses on estimating the symbol rate and detecting the data symbols. A blind oversampling-based signal detector under the circumstance of unknown symbol period is proposed. The thesis consists of two parts: a symbol rate estimator and a symbol detector. First, the symbol rate is estimated using the EM algorithm. In the EM algorithm, it is difficult to obtain the closed form of the log-likelihood function and the density function. Therefore, both functions are approximated by using the Particle Filter (PF) technique. In addition, the symbol rate estimator based on cyclic correlation is proposed as an initialization estimator since the EM algorithm requires initial estimates. To take advantage of the cyclostationary property of the received signal, there is a requirement that the sampling period should be at least four times less than the symbol period on the receiver side. Second, the blind data symbol detector based on the PF algorithm is designed. Since the signal is oversampled at the receiver side, a delayed multi-sampling PF detector is proposed to manage inter-symbol interference, which is caused by over- sampling, and to improve the demodulation performance of the data symbols. In the PF algorithm, the hybrid importance function is used to generate both data samples and channel model coe±cients, and the Mixture Kalman Filter (MKF) algorithm is used to marginalize out the fading channel coe±cients. At the end, two resampling schemes are adopted

Lookahead Strategies for Sequential Monte Carlo

Based on the principles of importance sampling and resampling, sequential Monte Carlo (SMC) encompasses a large set of powerful techniques dealing with complex stochastic dynamic systems. Many of these systems possess strong memory, with which future information can help sharpen the inference about the current state. By providing theoretical justification of several existing algorithms and introducing several new ones, we study systematically how to construct efficient SMC algorithms to take advantage of the "future" information without creating a substantially high computational burden. The main idea is to allow for lookahead in the Monte Carlo process so that future information can be utilized in weighting and generating Monte Carlo samples, or resampling from samples of the current state.Comment: Published in at http://dx.doi.org/10.1214/12-STS401 the Statistical Science (http://www.imstat.org/sts/) by the Institute of Mathematical Statistics (http://www.imstat.org

Asynchronous device detection for cognitive device-to-device communications

Dynamic spectrum sharing will facilitate the interference coordination in device-to-device (D2D) communications. In the absence of network level coordination, the timing synchronization among D2D users will be unavailable, leading to inaccurate channel state estimation and device detection, especially in time-varying fading environments. In this study, we design an asynchronous device detection/discovery framework for cognitive-D2D applications, which acquires timing drifts and dynamical fading channels when directly detecting the existence of a proximity D2D device (e.g. or primary user). To model and analyze this, a new dynamical system model is established, where the unknown timing deviation follows a random process, while the fading channel is governed by a discrete state Markov chain. To cope with the mixed estimation and detection (MED) problem, a novel sequential estimation scheme is proposed, using the conceptions of statistic Bayesian inference and random finite set. By tracking the unknown states (i.e. varying time deviations and fading gains) and suppressing the link uncertainty, the proposed scheme can effectively enhance the detection performance. The general framework, as a complimentary to a network-aided case with the coordinated signaling, provides the foundation for development of flexible D2D communications along with proximity-based spectrum sharing