Channel modeling, estimation and equalization in wireless communication

The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file.Title from title screen of research.pdf file viewed on (May 25, 2006)Includes bibliographical references.Vita.Thesis (Ph. D.) University of Missouri-Columbia 2005.Dissertations, Academic -- University of Missouri--Columbia -- Electrical engineering.Channel modeling, estimation and equalization are discussed throughout this dissertation. Relevant research topics are first studied at the beginning of each chapter and the new methods are proposed to improve the system performance. MLSE is an optimum equalizer for all the case. However, due to its computational complexity, it is impractical for today technologies in third generation wireless communication. Thus, a suboptimum equalizer so-called perturbation equalizer is proposed, which outperforms the RSSE equalizer in the sense of bit error rate or computational complexity. In order to improve the system performance dramatically, the iterative equalization algorithm is implemented. It has been shown that the turbo equalization using the trellis based Maximum A Posteriori equalizer is a powerful receiver that yielding the optimum system performance. Unfortunately, due to its exhausted computational complexity, a suboptimal equalizer is required. An improved DFE algorithm, which only requires low computational complexity, is proposed for turbo equalization. The promising simulation results indicate that the proposed equalizer provides significant improvement in bit error rate while compared to the conventional DFE algorithm. Prior to channel equalization, channel estimation enable us to extract the necessary channel information from the pilot symbols for equalizers. Least-squares algorithm is a promising estimation algorithm providing the channel is time-invariant in a given period. Based on the derivations, we show that the channel is no longer constant and a new least-squares based algorithm is proposed to estimate the channel accurately. Simulation results convince us that the new algorithm provides the equalizer more reliable information. Besides, antenna diversity is another promising technique implemented practically to improve the system performance provided that the channels of antennas are not correlated. A new three dimensional multiple-input multiple-output abstract model is proposed for the investigation and understanding of the correlation of fading channel. The new model allows us to consider the channel correlation of which the mobile stations receive the incoming waves from any directions and angle spreads. Based on this abstract model, the closed form and mathematical tractable formula is derived for space-time correlation function. The new function can be further simplified other known special cases

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

Investigation of coding and equalization for the digital HDTV terrestrial broadcast channel

Includes bibliographical references (p. 241-248).Supported by the Advanced Telecommunications Research Program.Julien J. Nicolas

Spatial diversity in MIMO communication systems with distributed or co-located antennas

The use of multiple antennas in wireless communication systems has gained much attention during the last decade. It was shown that such multiple-input multiple-output (MIMO) systems offer huge advantages over single-antenna systems. Typically, quite restrictive assumptions are made concerning the spacing of the individual antenna elements. On the one hand, it is typically assumed that the antenna elements at transmitter and receiver are co-located, i.e., they belong to some sort of antenna array. On the other hand, it is often assumed that the antenna spacings are sufficiently large, so as to justify the assumption of independent fading. In this thesis, the above assumptions are relaxed. In the first part, it is shown that MIMO systems with distributed antennas and MIMO systems with co-located antennas can be treated in a single, unifying framework. In the second part this fact is utilized, in order to develop appropriate transmit power allocation strategies for co-located and distributed MIMO systems. Finally, the third part focuses on specific synchronization problems that are of interest for distributed MIMO systems

Reduced Receivers for Faster-than-Nyquist Signaling and General Linear Channels

Fast and reliable data transmission together with high bandwidth efficiency are important design aspects in a modern digital communication system. Many different approaches exist but in this thesis bandwidth efficiency is obtained by increasing the data transmission rate with the faster-than-Nyquist (FTN) framework while keeping a fixed power spectral density (PSD). In FTN consecutive information carrying symbols can overlap in time and in that way introduce a controlled amount of intentional intersymbol interference (ISI). This technique was introduced already in 1975 by Mazo and has since then been extended in many directions. Since the ISI stemming from practical FTN signaling can be of significant duration, optimum detection with traditional methods is often prohibitively complex, and alternative equalization methods with acceptable complexity-performance tradeoffs are needed. The key objective of this thesis is therefore to design reduced-complexity receivers for FTN and general linear channels that achieve optimal or near-optimal performance. Although the performance of a detector can be measured by several means, this thesis is restricted to bit error rate (BER) and mutual information results. FTN signaling is applied in two ways: As a separate uncoded narrowband communication system or in a coded scenario consisting of a convolutional encoder, interleaver and the inner ISI mechanism in serial concatenation. Turbo equalization where soft information in the form of log likelihood ratios (LLRs) is exchanged between the equalizer and the decoder is a commonly used decoding technique for coded FTN signals. The first part of the thesis considers receivers and arising stability problems when working within the white noise constraint. New M-BCJR algorithms for turbo equalization are proposed and compared to reduced-trellis VA and BCJR benchmarks based on an offset label idea. By adding a third low-complexity M-BCJR recursion, LLR quality is improved for practical values of M. M here measures the reduced number of BCJR computations for each data symbol. An improvement of the minimum phase conversion that sharpens the focus of the ISI model energy is proposed. When combined with a delayed and slightly mismatched receiver, the decoding allows a smaller M without significant loss in BER. The second part analyzes the effect of the internal metric calculations on the performance of Forney- and Ungerboeck-based reduced-complexity equalizers of the M-algorithm type for both ISI and multiple-input multiple-output (MIMO) channels. Even though the final output of a full-complexity equalizer is identical for both models, the internal metric calculations are in general different. Hence, suboptimum methods need not produce the same final output. Additionally, new models working in between the two extremes are proposed and evaluated. Note that the choice of observation model does not impact the detection complexity as the underlying algorithm is unaltered. The last part of the thesis is devoted to a different complexity reducing approach. Optimal channel shortening detectors for linear channels are optimized from an information theoretical perspective. The achievable information rates of the shortened models as well as closed form expressions for all components of the optimal detector of the class are derived. The framework used in this thesis is more general than what has been previously used within the area

Advanced Trends in Wireless Communications

Physical limitations on wireless communication channels impose huge challenges to reliable communication. Bandwidth limitations, propagation loss, noise and interference make the wireless channel a narrow pipe that does not readily accommodate rapid flow of data. Thus, researches aim to design systems that are suitable to operate in such channels, in order to have high performance quality of service. Also, the mobility of the communication systems requires further investigations to reduce the complexity and the power consumption of the receiver. This book aims to provide highlights of the current research in the field of wireless communications. The subjects discussed are very valuable to communication researchers rather than researchers in the wireless related areas. The book chapters cover a wide range of wireless communication topics