Space-time block coded and IQ-interleaved TCM, TTCM, BICM AND BICM-ID assisted OFDM

We investigate trellis coded modulation (TCM) and turbo trellis coded modulation (TTCM) assisted iterative parallel interference cancellation aided CDMA schemes. The symbol-based maximum a posteriori (MAP) algorithm is invoked in both the TTCM and TCM decoder. In the context of the 8PSK TCM/TTCM CDMA schemes, typically two iterations are necessary for approaching the best possible performance attained with the aid of an infinite number of iterations. By contrast, the number of iterations has to be increased to three or four in conjunction with 16QAM when the effective information throughput is increased from 2 to 3 bits per symbol.

In this paper, we have proposed a bandwidth efficient turbo trellis-coded modulation scheme for the non-coherent multiple-antenna Rayleigh fading channel, where the channel state information (CSI) is not necessary both at the transmitter and the receiver. In this scheme, we merge the unitary space-time modulation (USTM) as constellations with the turbo trellis-coded modulation, resulting in the turbo trellis-coded USTM (TTC-USTM), with the trellis-coded USTM encoder as the component encoders. We have also derived the iterative maximum a posteriori (MAP) algorithm. Through computer simulations, we demonstrated that without bandwidth expansion, TTC-USTM produces significant coding gains over its uncoded counterparts.

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 8 PSK, 16 QAM and 32 QAM 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 32 QAM.

We present an improved channel equalizing scheme to be used in Coded OFDM systems over an ISI channel. The scheme uses Turbo Trellis Coded Modulation (TTCM) which retains a powerful error correction capability while elegantly incorporating turbo coding into the Trellis Coded Modulation (TCM). In OFDM over wireless communications, M-ary Quadrature Amplitude Modulation (M-QAM) schemes have been widely used to achieve high bandwidth efficiency. However, M-QAM signals require linear amplification to avoid spectral regrowth and severe performance degradation due to their large envelope fluctuations. Moreover, the OFDM transmitter shapes the signal with a linear pulse shaping filter. The combination of a linear filter with a High Power Amplifier (HPA) forms a nonlinear system with memory, which severely degrades performance. We propose an efficient one-tap-equalizer using a modified LMS algorithm and a novel adaptive predistortion technique to compensate for the nonlinear distortion caused by the high power amplifier cascaded with a linear filter in TTCM-OFDM systems. The performance of this method is compared with methods that have been used previously with OFDM. A computer simulation confirms that the proposed approach is superior to the conventional methods.

Removed.

The combination of multiple-input multiple-output (MIMO) and bit-interleaved coded modulation (BICM)/BICM with iterative demapping (BICM-ID) is one of the key technologies to meet the high-transmission-rate requirement of the next generation broadcasting systems. However, conventional low-density parity check (LDPC) coded MIMO BICM schemes always show poor performance with iterative demapping, and vice versa. In this paper, a subset of spatially coupled codes, finite-length spatially coupled (SC-) quasi-cyclic (QC-) LDPC code, is proposed and the universality of spatially coupled codes is utilized to achieve a good tradeoff between MIMO BICM and BICM-ID schemes. Due to the specific code structure of SC-QC-LDPC, the tool of multi-edge type density evolution (MET-DE) is employed for the performance analysis and code optimization. As an example, a finite-length SC-QC-LDPC code is optimized in binary-input additive white Gaussian noise channel, and then bit error rate simulations are carried out to verify the universality of the designed code in MIMO BICM and BICM-ID schemes.

Multi-input multi-output (MIMO) systems are often realized with low cost front-end architectures, e.g. the so called direct conversion architectures. However, such systems are very sensitive to imperfections in the analog front-end, resulting in radio frequency (RF) impairments such as in-phase/quadrature-phase (IQ) imbalance and carrier frequency offset (CFO). The RF impairments in such low cost front-end systems are unavoidable and can result in a severe performance degradation. In this paper we propose a generally applicable equalization technique for space-time block coded (STBC) MIMO orthogonal frequency division multiplexing (OFDM) communication systems. The Alamouti based STBC scheme is examined in detail. It is shown that the compensation scheme can be easily extended to other higher order STBC systems. We consider a digital compensation scheme for joint transmitter and receiver IQ imbalance along with front-end filter mismatch, CFO and frequency selective channel distortions.

The principle of coding in the signal space follows directly from Shannon’s analysis of waveform Gaussian channels subject to an input constraint. The early design of communication systems focused separately on modulation, namely signal design and detection, and error correcting codes, which deal with errors introduced at the demodulator of the underlying waveform channel. The correct perspective of signal-space coding, although never out of sight of information theorists, was brought back into the focus of coding theorists and system designers by Imai’s and Ungerböck’s pioneering works on coded modulation. More recently, powerful families of binary codes with a good tradeoff between performance and decoding complexity have been (re-)discovered. Bit-Interleaved Coded Modulation (BICM) is a pragmatic approach combining the best out of both worlds: it takes advantage of the signal-space coding perspective, whilst allowing for the use of powerful families of binary codes with virtually any modulation format. BICM avoids the need for the complicated and somewhat less flexible design typical of coded modulation. As a matter of fact, most of today’s systems that achieve high spectral efficiency such as DSL, Wireless LANs, WiMax and evolutions thereof, as well as systems based on low spectral efficiency orthogonal modulation, feature BICM, making BICM the de-facto general coding technique for waveform channels. The theoretical characterization of BICM is at the basis of efficient coding design techniques and also of improved BICM decoders, e.g., those based on the belief propagation iterative algorithm and approximations thereof. In this text, we review the theoretical foundations of BICM under the unified framework of error exponents for mismatched decoding. This framework allows an accurate analysis without any particular assumptions on the length of the interleaver or independence between the multiple bits in a symbol. We further consider the sensitivity of the BICM capacity with respect to the signal-to-noise ratio (SNR), and obtain a wideband regime (or low-SNR regime) characterization. We review efficient tools for the error probability analysis of BICM that go beyond the standard approach of considering infinite interleaving and take into consideration the dependency of the coded bit observations introduced by the modulation. We also present bounds that improve upon the union bound in the region beyond the cutoff rate, and are essential to characterize the performance of modern randomlike codes used in concatenation with BICM. Finally, we turn our attention to BICM with iterative decoding, we review extrinsic information transfer charts, the area theorem and code design via curve fitting. We conclude with an overview of some applications of BICM beyond the classical coherent Gaussian channel.

Space Division Multiple Access (SDMA) aided Orthogonal Frequency Division Multiplexing (OFDM) systems assisted by efficient Multi-User Detection (MUD) techniques have recently attracted intensive research interests. As expected, Maximum Likelihood (ML) detection was found to attain the best performance, although this was achieved at the cost of a high computational complexity. Forward Error Correction (FEC) schemes such as Turbo Trellis Coded Modulation (TTCM) can be efficiently amalgamated with SDMA-OFDM systems for the sake of improving the achievable performance without bandwidth expansion. In this contribution, a MMSE-aided Iterative GA (IGA) MUD is proposed for employment in a TTCM-assisted SDMA-OFDM system, which is capable of achieving a similar performance to that attained by its optimum ML-aided counterpart at a significantly lower complexity, especially at high user loads. Moreover, when the proposed novel Biased Q-function Based Mutation (BQM) scheme is employed, the IGA-aided system’s performance can be further improved by achieving an Eb/N0 gain of about 6dB in comparison to the TTCM-aided MMSE-SDMA-OFDM benchmarker system both in low- and high-throughput modem scenarios, respectively, while still maintaining a modest complexity.

It was shown earlier that the combination of bit interleaved coded modulation (BICM) with space time block codes (STBC) for OFDM systems leads to the maximum diversity order in space and frequency. In this paper we present low complexity decoding of BICM-STBC systems. First, the maximum likelihood (ML) bit metric calculations are simplified from a distance on the complex plane to a distance on the real line. Furthermore, we present log-likelihood-ratio (LLR) approximations to maximum likelihood (ML) decoding metrics to achieve easier to implement soft decision bit metrics with the same high performance. The LLR bit metrics are specifically calculated for M-ary QAM signal constellations used in IEEE 802.11a/g networks. Simulation results also show that while achieving a substantial improvement in decoder complexity, the proposed bit metrics achieve the same high performance.

Orthogonal frequency division multiplexing (OFDM) is a multicarrier modulation scheme widely used in 4G. It is effective for reducing the effects of multipath delay in wireless communication. For OFDM system, total delay spread (Td) is less than symbol period (T); it can be combined with antenna arrays at transmitter and receiver (MIMO) to increase diversity gain called as MIMO-OFDM system. MIMO-OFDM improves system capacity on time-variant and frequency-selective channels. The quality of service provided by a system greatly depends upon the correct selection of modulation scheme. In this paper, analysis and simulation of OFDM-MIMO system with different digital modulation schemes like BPSK, 8-PSK, QPSK, and QAM is performed using Alamouti space–time block codes (STBC). STBC uses spatial and time dimensions for error control unlike traditional methods that uses only time dimension. A comparison study shows that for a given data rate and channel conditions, OFDM-MIMO using STBC with BPSK modulation is better compared with other digital modulation techniques in terms of error performance. OFDM-MIMO using STBC with BPSK modulation is further analyzed and simulated for various antenna configurations. It is observed that as numbers of antennas at transmitter and receiver side are increased, the system diversity increases and gives better performance in terms of BER.

Turbo trellis-coded modulation (TCM) with code matched interleaver (CMI) is applied to develop a trellis coded quantization (TCQ). It can been shown that TCQ of memoryless Gaussian sources results in substantial improvement of performance with iterative decoding of turbo TCM and iterative optimization of minimum overall distortion between the source input and decoding output. Numerical results indicate substantial improvement of performance because optimal TCQ based on turbo TCM can be achieved at moderate to high signal-to-noise ratio (SNR) on an additive white Gaussian noise (AWGN) channel for a memoryless Gaussian source and a memoryless uniform source.

Burts-by-burst (BbB) adaptive high-speed down-link packet access (HSDPA) style multicarrier systems are reviewed, identifying their most critical design aspects. These systems exhibit numerous attractive features, rendering them eminently eligible for employment in next-generation wireless systems. It is argued that BbB-adaptive or symbol-by-symbol adaptive orthogonal frequency division multiplex (OFDM) modems counteract the near instantaneous channel quality variations and hence attain an increased throughput or robustness in comparison to their fixed-mode counterparts. Although they act quite differently, various diversity techniques, such as Rake receivers and space-time block coding (STBC) are also capable of mitigating the channel quality variations in their effort to reduce the bit error ratio (BER), provided that the individual antenna elements experience independent fading. By contrast, in the presence of correlated fading imposed by shadowing or time-variant multiuser interference, the benefits of space-time coding erode and it is unrealistic to expect that a fixed-mode space-time coded system remains capable of maintaining a near-constant BER. Following a basic portrayal of adaptive OFDM, the paper investigates a combined system constituted by a constant-power adaptive modem employing space-time coded diversity techniques in the context of both OFDM and multicarrier code division multiple access (MC-CDMA). The combined system is configured to produce a constant uncoded BER and exhibits virtually error-free performance when a turbo convolutional code is concatenated with a space-time block code. Again, it was found that the advantage of rendering the multiple-input multiple-output (MIMO)-aided modem BbB-adaptive erodes, when the affordable system complexity facilitates the implementation of multiple transmitters and receivers, if it can be ensured that no shadowing and no multiuser interference fluctuation is experienced. By contrast, in the presence of these impairments, only BbB-adaptive transceivers can provide a near-constant BER.

Turbo-trellis coded modulation (TTCM) schemes are designed for reliable transmission over quasi-static fading channels. Assuming pilot-assisted channel estimation, practical limitations in power and the number of pilots lead to imperfect channel estimates. A general method for robust receiver design under channel estimation errors was recently proposed by Sadough and Duhamel. In this paper, this technique is applied to improve the TTCM reception performance under channel estimation errors. We compare our proposed reception method to conventional receivers (also called mismatched receivers) in terms of bit error rate and EXIT chart analysis. Our results confirm the adequacy of the proposed receiver for improving TTCM iterative decoding performance under channel estimation errors.

A low bit-rate video coding techniques using the H.26L standard codec for robust transmission in mobile multimedia environments are presented. For the sake of achieving error resilience, the source codec has to make provisions for error detection, resynchronization and error concealment. Thus a packetization technique invoking adaptive bit-rate control was used in conjunction with the various modulation scheme employed. In this contribution, we propose a burst-by-burst adaptive coded modulation-aided joint detection-based CDMA (ACM-JD-CDMA) scheme for wireless video telephony and characterise its performance when communicating over the UTRA wideband vehicular fading channels. The coded modulation schemes invoked in our fixed modulation mode based systems are low density parity check code based block coded modulation (LDPC-BCM) and turbo trellis coded modulation (TTCM). The performance of LDPC-BCM was evaluated and compared to that of TTCM in the context of the ACM-JD-CDMA system using a practical modem mode switching regime. Both schemes exhibited a similar transmission integrity, although the LDPC arrangement is capable of achieving this at a lower complexity.