Near-Capacity Turbo Trellis Coded Modulation Design

Bandwidth efficient parallel-concatenated Turbo Trellis Coded Modulation (TTCM) schemes were designed for communicating over uncorrelated Rayleigh fading channels. A symbol-based union bound was derived for analysing the error floor of the proposed TTCM schemes. A pair of In-phase (I) and Quadrature-phase (Q) interleavers were employed for interleaving the I and Q components of the TTCM coded symbols, in order to attain an increased diversity gain. The decoding convergence of the IQ-TTCM schemes was analysed using symbol based EXtrinsic Information Transfer (EXIT) charts. The best TTCM component codes were selected with the aid of both the symbol-based union bound and non-binary EXIT charts for the sake of designing capacity-approaching IQ-TTCM schemes in the context of 8PSK, 16QAM and 32QAM signal sets. It will be shown that our TTCM design is capable of approaching the channel capacity within 0.5 dB at a throughput of 4 bit/s/Hz, when communicating over uncorrelated Rayleigh fading channels using 32QAM

Self-concatenated code design and its application in power-efficient cooperative communications

In this tutorial, we have focused on the design of binary self-concatenated coding schemes with the help of EXtrinsic Information Transfer (EXIT) charts and Union bound analysis. The design methodology of future iteratively decoded self-concatenated aided cooperative communication schemes is presented. In doing so, we will identify the most important milestones in the area of channel coding, concatenated coding schemes and cooperative communication systems till date and suggest future research directions

Performance Analysis and Enhancement of Multiband OFDM for UWB Communications

In this paper, we analyze the frequency-hopping orthogonal frequency-division multiplexing (OFDM) system known as Multiband OFDM for high-rate wireless personal area networks (WPANs) based on ultra-wideband (UWB) transmission. Besides considering the standard, we also propose and study system performance enhancements through the application of Turbo and Repeat-Accumulate (RA) codes, as well as OFDM bit-loading. Our methodology consists of (a) a study of the channel model developed under IEEE 802.15 for UWB from a frequency-domain perspective suited for OFDM transmission, (b) development and quantification of appropriate information-theoretic performance measures, (c) comparison of these measures with simulation results for the Multiband OFDM standard proposal as well as our proposed extensions, and (d) the consideration of the influence of practical, imperfect channel estimation on the performance. We find that the current Multiband OFDM standard sufficiently exploits the frequency selectivity of the UWB channel, and that the system performs in the vicinity of the channel cutoff rate. Turbo codes and a reduced-complexity clustered bit-loading algorithm improve the system power efficiency by over 6 dB at a data rate of 480 Mbps.Comment: 32 pages, 10 figures, 1 table. Submitted to the IEEE Transactions on Wireless Communications (Sep. 28, 2005). Minor revisions based on reviewers' comments (June 23, 2006

Exploiting diversity in wireless channels with bit-interleaved coded modulation and iterative decoding (BICM-ID)

This dissertation studies a state-of-the-art bandwidth-efficient coded modulation technique, known as bit interleaved coded modulation with iterative decoding (BICM-ID), together with various diversity techniques to dramatically improve the performance of digital communication systems over wireless channels. For BICM-ID over a single-antenna frequency non-selective fading channel, the problem of mapping over multiple symbols, i.e., multi-dimensional (multi-D) mapping, with 8-PSK constellation is investigated. An explicit algorithm to construct a good multi-D mapping of 8-PSK to improve the asymptotic performance of BICM-ID systems is introduced. By comparing the performance of the proposed mapping with an unachievable lower bound, it is conjectured that the proposed mapping is the global optimal mapping. The superiority of the proposed mapping over the best conventional (1-dimensional complex) mapping and the multi-D mapping found previously by computer search is thoroughly demonstrated. In addition to the mapping issue in single-antenna BICM-ID systems, the use of signal space diversity (SSD), also known as linear constellation precoding (LCP), is considered in BICM-ID over frequency non-selective fading channels. The performance analysis of BICM-ID and complex N-dimensional signal space diversity is carried out to study its performance limitation, the choice of the rotation matrix and the design of a low-complexity receiver. Based on the design criterion obtained from a tight error bound, the optimality of the rotation matrix is established. It is shown that using the class of optimal rotation matrices, the performance of BICM-ID systems over a frequency non-selective Rayleigh fading channel approaches that of the BICM-ID systems over an additive white Gaussian noise (AWGN) channel when the dimension of the signal constellation increases. Furthermore, by exploiting the sigma mapping for any M-ary quadrature amplitude modulation (QAM) constellation, a very simple sub-optimal, yet effective iterative receiver structure suitable for signal constellations with large dimensions is proposed. Simulation results in various cases and conditions indicate that the proposed receiver can achieve the analytical performance bounds with low complexity. The application of BICM-ID with SSD is then extended to the case of cascaded Rayleigh fading, which is more suitable to model mobile-to-mobile communication channels. By deriving the error bound on the asymptotic performance, it is first illustrated that for a small modulation constellation, a cascaded Rayleigh fading causes a much more severe performance degradation than a conventional Rayleigh fading. However, BICM-ID employing SSD with a sufficiently large constellation can close the performance gap between the Rayleigh and cascaded Rayleigh fading channels, and their performance can closely approach that over an AWGN channel. In the next step, the use of SSD in BICM-ID over frequency selective Rayleigh fading channels employing a multi-carrier modulation technique known as orthogonal frequency division multiplexing (OFDM) is studied. Under the assumption of correlated fading over subcarriers, a tight bound on the asymptotic error performance for the general case of applying SSD over all N subcarriers is derived and used to establish the best achievable asymptotic performance by SSD. It is then shown that precoding over subgroups of at least L subcarriers per group, where L is the number of channel taps, is sufficient to obtain this best asymptotic error performance, while significantly reducing the receiver complexity. The optimal joint subcarrier grouping and rotation matrix design is subsequently determined by solving the Vandermonde linear system. Illustrative examples show a good agreement between various analytical and simulation results. Further, by combining the ideas of multi-D mapping and subcarrier grouping, a novel power and bandwidth-efficient bit-interleaved coded modulation with OFDM and iterative decoding (BI-COFDM-ID) in which multi-D mapping is performed over a group of subcarriers for broadband transmission in a frequency selective fading environment is proposed. A tight bound on the asymptotic error performance is developed, which shows that subcarrier mapping and grouping have independent impacts on the overall error performance, and hence they can be independently optimized. Specifically, it is demonstrated that the optimal subcarrier mapping is similar to the optimal multi-D mapping for BICM-ID in frequency non-selective Rayleigh fading environment, whereas the optimal subcarrier grouping is the same with that of OFDM with SSD. Furthermore, analytical and simulation results show that the proposed system with the combined optimal subcarrier mapping and grouping can achieve the full channel diversity without using SSD and provide significant coding gains as compared to the previously studied BI-COFDM-ID with the same power, bandwidth and receiver complexity. Finally, the investigation is extended to the application of BICM-ID over a multiple-input multiple-output (MIMO) system equipped with multiple antennas at both the transmitter and the receiver to exploit both time and spatial diversities, where neither the transmitter nor the receiver knows the channel fading coefficients. The concentration is on the class of unitary constellation, due to its advantages in terms of both information-theoretic capacity and error probability. The tight error bound with respect to the asymptotic performance is also derived for any given unitary constellation and mapping rule. Design criteria regarding the choice of unitary constellation and mapping are then established. Furthermore, by using the unitary constellation obtained from orthogonal design with quadrature phase-shift keying (QPSK or 4-PSK) and 8-PSK, two different mapping rules are proposed. The first mapping rule gives the most suitable mapping for systems that do not implement iterative processing, which is similar to a Gray mapping in coherent channels. The second mapping rule yields the best mapping for systems with iterative decoding. Analytical and simulation results show that with the proposed mappings of the unitary constellations obtained from orthogonal designs, the asymptotic error performance of the iterative systems can closely approach a lower bound which is applicable to any unitary constellation and mapping

Signal mapping designs for bit-interleaved coded modulation with iterative decoding (BICM-ID)

Bit-interleaved coded modulation with iterative decoding (BICM-ID)is a spectral efficient coded modulation technique to improve the performance of digital communication systems. It has been widely known that for fixed signal constellation, interleaver and error control code, signal mapping plays an important role in determining the error performance of a BICM-ID system. This thesis concentrates on signal mapping designs for BICM-ID systems. To this end, the distance criteria to find the best mapping in terms of the asymptotic performance are first analytically derived for different channel models. Such criteria are then used to find good mappings for various two-dimensional 8-ary constellations. The usefulness of the proposed mappings of 8-ary constellations is verified by both the error floor bound and simulation results. Moreover, new mappings are also proposed for BICM-ID systems employing the quadrature phase shift keying (QPSK) constellation. The new mappings are obtained by considering many QPSK symbols over a multiple symbol interval, which essentially creates hypercube constellations. Analytical and simulation results show that the use of the proposed mappings together with very simple convolutional codes can offer significant coding gains over the conventional BICM-ID systems for all the channel models considered. Such coding gains are achieved without any bandwidth nor power expansion and with a very small increase in the system complexity

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

Channel Estimation in Coded Modulation Systems

With the outstanding performance of coded modulation techniques in fading channels, much research efforts have been carried out on the design of communication systems able to operate at low signal-to-noise ratios (SNRs). From this perspective, the so-called iterative decoding principle has been applied to many signal processing tasks at the receiver: demodulation, detection, decoding, synchronization and channel estimation. Nevertheless, at low SNRs, conventional channel estimators do not perform satisfactorily. This thesis is mainly concerned with channel estimation issues in coded modulation systems where different diversity techniques are exploited to combat fading in single or multiple antenna systems. First, for single antenna systems in fast time-varying fading channels, the thesis focuses on designing a training sequence by exploiting signal space diversity (SSD). Motivated by the power/bandwidth efficiency of the SSD technique, the proposed training sequence inserts pilot bits into the coded bits prior to constellation mapping and signal rotation. This scheme spreads the training sequence during a transmitted codeword and helps the estimator to track fast variation of the channel gains. A comprehensive comparison between the proposed training scheme and the conventional training scheme is then carried out, which reveals several interesting conclusions with respect to both error performance of the system and mean square error of the channel estimator. For multiple antenna systems, different schemes are examined in this thesis for the estimation of block-fading channels. For typical coded modulation systems with multiple antennas, the first scheme makes a distinction between the iteration in the channel estimation and the iteration in the decoding. Then, the estimator begins iteration when the soft output of the decoder at the decoding iteration meets some specified reliability conditions. This scheme guarantees the convergence of the iterative receiver with iterative channel estimator. To accelerate the convergence process and decrease the complexity of successive iterations, in the second scheme, the channel estimator estimates channel state information (CSI) at each iteration with a combination of the training sequence and soft information. For coded modulation systems with precoding technique, in which a precoder is used after the modulator, the training sequence and data symbols are combined using a linear precoder to decrease the required training overhead. The power allocation and the placement of the training sequence to be precoded are obtained based on a lower bound on the mean square error of the channel estimation. It is demonstrated that considerable performance improvement is possible when the training symbols are embedded within data symbols with an equi-spaced pattern. In the last scheme, a joint precoder and training sequence is developed to maximize the achievable coding gain and diversity order under imperfect CSI. In particular, both the asymptotic performance behavior of the system with the precoded training scheme under imperfect CSI and the mean square error of the channel estimation are derived to obtain achievable diversity order and coding gain. Simulation results demonstrate that the joint optimized scheme outperforms the existing training schemes for systems with given precoders in terms of error rate and the amount of training overhead