EM-Based iterative channel estimation and sequence detection for space-time coded modulation

Reliable detection of signals transmitted over a wireless communication channel requires knowledge of the channel estimate. In this work, the application of expectationmaximization (EM) algorithm to estimation of unknown channel and detection of space-time coded modulation (STCM) signals is investigated. An STCM communication system is presented which includes symbol interleaving at the transmitter and iterative EM-based soft-output decoding at the receiver. The channel and signal model are introduced with a quasi-static and time-varying Rayleigh fading channels considered to evaluate the performance of the communication system. Performance of the system employing Kalman filter with per-survivor processing to do the channel estimation and Viterbi algorithm for sequence detection is used as a reference. The first approach to apply the EM algorithm to channel estimation presents a design of an online receiver with sliding data window. Next, a block-processing EM-based iterative receiver is presented which utilizes soft values of a posteriori probabilities (APP) with maximum a posteriori probability (MAP) as the criterion of optimality in both: detection and channel estimation stages (APP-EM receiver). In addition, a symbol interleaver is introduced at the transmitter which has a great desirable impact on system performance. First, it eliminates error propagation between the detection and channel estimation stages in the receiver EM loop. Second, the interleaver increases the diversity advantage to combat deep fades of a fast fading channel. In the first basic version of the APP-EM iterative receiver, it is assumed that noise variance at the receiver input is known. Then a modified version of the receiver is presented where such assumption is not made. In addition to sequence detection and channel estimation, the EM iteration loop includes the estimation of unknown additive white Gaussian noise variance. Finally, different properties of the APP-EM iterative receiver are investigated including the effects of training sequence length on system performance, interleaver and channel correlation length effects and the performance of the system at different Rayleigh channel fading rates

Adaptive equalisation for fading digital communication channels

This thesis considers the design of new adaptive equalisers for fading digital communication channels. The role of equalisation is discussed in the context of the functions of a digital radio communication system and both conventional and more recent novel equaliser designs are described. The application of recurrent neural networks to the problem of equalisation is developed from a theoretical study of a single node structure to the design of multinode structures. These neural networks are shown to cancel intersymbol interference in a manner mimicking conventional techniques and simulations demonstrate their sensitivity to symbol estimation errors. In addition the error mechanisms of conventional maximum likelihood equalisers operating on rapidly time-varying channels are investigated and highlight the problems of channel estimation using delayed and often incorrect symbol estimates. The relative sensitivity of Bayesian equalisation techniques to errors in the channel estimate is studied and demonstrates that the structure's equalisation capability is also susceptible to such errors. Applications of multiple channel estimator methods are developed, leading to reduced complexity structures which trade performance for a smaller computational load. These novel structures are shown to provide an improvement over the conventional techniques, especially for rapidly time-varying channels, by reducing the time delay in the channel estimation process. Finally, the use of confidence measures of the equaliser's symbol estimates in order to improve channel estimation is studied and isolates the critical areas in the development of the technique — the production of reliable confidence measures by the equalisers and the statistics of symbol estimation error bursts

Interference Mitigation in Wireless Communications

The primary objective of this thesis is to design advanced interference resilient schemes for asynchronous slow frequency hopping wireless personal area networks (FH-WPAN) and time division multiple access (TDMA) cellular systems in interference dominant environments. We also propose an interference-resilient power allocation method for multiple-input-multiple-output (MIMO) systems. For asynchronous FH-WPANs in the presence of frequent packet collisions, we propose a single antenna interference canceling dual decision feedback (IC-DDF) receiver based on joint maximum likelihood (ML) detection and recursive least squares (RLS) channel estimation. For the system level performance evaluation, we propose a novel geometric method that combines bit error rate (BER) and the spatial distribution of the traffic load of CCI for the computation of packet error rate (PER). We also derived the probabilities of packet collision in multiple asynchronous FH-WPANs with uniform and nonuniform traffic patterns. For the design of TDMA receivers resilient to CCI in frequency selective channels, we propose a soft output joint detection interference rejection combining delayed decision feedback sequence estimation (JD IRC-DDFSE) scheme. In the proposed scheme, IRC suppresses the CCI, while DDFSE equalizes ISI with reduced complexity. Also, the soft outputs are generated from IRC-DDFSE decision metric to improve the performance of iterative or non-iterative type soft-input outer code decoders. For the design of interference resilient power allocation scheme in MIMO systems, we investigate an adaptive power allocation method using subset antenna transmission (SAT) techniques. Motivated by the observation of capacity imbalance among the multiple parallel sub-channels, the SAT method achieves high spectral efficiency by allocating power on a selected transmit antenna subset. For 4 x 4 V-BLAST MIMO systems, the proposed scheme with SAT showed analogous results. Adaptive modulation schemes combined with the proposed method increase the capacity gains. From a feasibility viewpoint, the proposed method is a practical solution to CCI-limited MIMO systems since it does not require the channel state information (CSI) of CCI.Ph.D.Committee Chair: Professor Gordon L. StBe

Low-complexity iterative detection techniques for Slow-Frequency-Hop spread-spectrum communications with Reed-Solomon coding.

Slow-frequency-hop (SFH) spread-spectrum communications provide a high level of robustness in packet-radio networks for both military and commercial applications. The use of a Reed-Solomon (R-S) code has proven to be a good choice for use in a SFH system for countering the critical channel impairments of partial-band fading and partial-band interference. In particular, it is effective when reliability information of dwell intervals and individual code symbols can be obtained and errors-and-erasures decoding (EE) can be employed at the receiver. In this dissertation, we consider high-data-rate SFH communications for which the channel in each frequency slot is frequency selective, manifesting itself as intersymbol interference (ISI) at the receiver. The use of a packet-level iterative equalization and decoding technique is considered in conjunction with a SFH system employing R-S coding. In each packet-level iteration, MLSE equalization followed by bounded distance EE decoding is used in each dwell interval. Several per-dwell interleaver designs are considered for the SFH systems and it is shown that packet-level iterations result in a significant improvement in performance with a modest increase in detection complexity for a variety of ISI channels. The use of differential encoding in conjunction with the SFH system and packet-level iterations is also considered, and it is shown to provide further improvements in performance with only a modest additional increase in detection complexity. SFH systems employing packet-level iterations with and without differential encoding are evaluated for channels with partial-band interference. Comparisons are made between the performance of this system and the performance of SFH systems using some other codes and iterative decoding techniques

Iterative receivers and multichannel equalisation for time division multiple access systems

The thesis introduces receiver algorithms improving the performance of TDMA mobile radio systems. Particularly, we consider receivers utilising side information, which can be obtained from the error control coding or by having a priori knowledge of interference sources. Iterative methods can be applied in the former case and interference suppression techniques in the latter. Convolutional coding adds redundant information into the signal and thereby protects messages transmitted over a radio channel. In the coded systems the receiver is usually comprised of separate channel estimation, detection and channel decoding tasks due to complexity restrictions. This suboptimal solution suffers from performance degradation compared to the optimal solution achieved by optimising the joint probability of information bits, transmitted symbols and channel impulse response. Conventional receiver utilises estimated channel state information in the detection and detected symbols in the channel decoding to finally obtain information bits. However, the channel decoder provides also extrinsic information on the bit probabilities, which is independent of the received information at the equaliser input. Therefore it is beneficial to re-perform channel estimation and detection using this new extrinsic information together with the original input signal. We apply iterative receiver techniques mainly to Enhanced General Packet Radio System (EGPRS) using GMSK modulation for iterative channel estimation and 8-PSK modulation for iterative detection scheme. Typical gain for iterative detection is around 2 dB and for iterative channel estimation around 1 dB. Furthermore, we suggest two iteration rounds as a reasonable complexity/performance trade-off. To obtain further complexity reduction we introduce the soft trellis decoding technique that reduces the decoder complexity significantly in the iterative schemes. Cochannel interference (CCI) originates from the nearby cells that are reusing the same transmission frequency. In this thesis we consider CCI suppression by joint detection (JD) technique, which detects simultaneously desired and interfering signals. Because of the complexity limitations we only consider JD for two binary modulated signals. Therefore it is important to find the dominant interfering signal (DI) to achieve the best performance. In the presence of one strong DI, the JD provides major improvement in the receiver performance. The JD requires joint channel estimation (JCE) for the two signals. However, the JCE makes the implementation of the JD more difficult, since it requires synchronised network and unique training sequences with low cross-correlation for the two signals.reviewe

Equalization of doubly selective channels using iterative and recursive methods

Novel iterative and recursive schemes for the equalization of time-varying frequency selective channels are proposed. Such doubly selective channels are shown to be common place in mobile communication systems, for example in second generation systems based on time division multiple access (TDMA) and so-called beyond third generation systems most probably utilizing orthogonal frequency division multiplexing (OFDM). A new maximum likelihood approach for the estimation of the complex multipath gains (MGs) and the real Doppler spreads (DSs) of a parametrically modelled doubly selective single input single output (SISO) channel is derived. Considerable complexity reduction is achieved by exploiting the statistical properties of the training sequence in a TDMA system. The Cramer-Rao lower bound for the resulting estimator is derived and simulation studies are employed to confirm the statistical efficiency of the scheme. A similar estimation scheme is derived for the MGs and DSs in the context of a multiple input multiple output (MIMO) TDMA system. A computationally efficient recursive equalization scheme for both a SISO and MIMO TDMA system which exploits the estimated MGs and DSs is derived on the basis of repeated application of the matrix inversion lemma. Bit error rate (BER) simulations confirm the advantage of this scheme over equalizers which have limited knowledge of such parameters. For OFDM transmission over a general random doubly selective SISO channel, the time selectivity is mitigated with an innovative relatively low complexity iterative method. Equalization is in effect split into two stages: one which exploits the sparsity in the associated channel convolution matrix and a second which performs a posteriori detection of the frequency domain symbols. These two procedures interact in an iterative manner, exchanging information between the time and frequency domains. Simulation studies show that the performance of the scheme approaches the matched filter bound when interleaving is also introduced to aid in decorrelation. Finally, to overcome the peak to average power problem in conventional OFDM transmission, the iterative approach is extended for single carrier with cyclic prefix (SCCP) systems. The resulting scheme has particularly low complexity and is shown by simulation to have robust performance.EThOS - Electronic Theses Online ServiceGBUnited Kingdo