The Error-Pattern-Correcting Turbo Equalizer

The error-pattern correcting code (EPCC) is incorporated in the design of a turbo equalizer (TE) with aim to correct dominant error events of the inter-symbol interference (ISI) channel at the output of its matching Viterbi detector. By targeting the low Hamming-weight interleaved errors of the outer convolutional code, which are responsible for low Euclidean-weight errors in the Viterbi trellis, the turbo equalizer with an error-pattern correcting code (TE-EPCC) exhibits a much lower bit-error rate (BER) floor compared to the conventional non-precoded TE, especially for high rate applications. A maximum-likelihood upper bound is developed on the BER floor of the TE-EPCC for a generalized two-tap ISI channel, in order to study TE-EPCC's signal-to-noise ratio (SNR) gain for various channel conditions and design parameters. In addition, the SNR gain of the TE-EPCC relative to an existing precoded TE is compared to demonstrate the present TE's superiority for short interleaver lengths and high coding rates.Comment: This work has been submitted to the special issue of the IEEE Transactions on Information Theory titled: "Facets of Coding Theory: from Algorithms to Networks". This work was supported in part by the NSF Theoretical Foundation Grant 0728676

Design and analysis of iteratively decodable codes for ISI channels

Recent advancements in iterative processing have allowed communication systems to perform close to capacity limits withmanageable complexity.For manychannels such as the AWGN and flat fading channels, codes that perform only a fraction of a dB from the capacity have been designed in the literature. In this dissertation, we will focus on the design and analysis of near-capacity achieving codes for another important class of channels, namely inter-symbol interference (ISI)channels. We propose various coding schemes such as low-density parity-check (LDPC) codes, parallel and serial concatenations for ISI channels when there is no spectral shaping used at the transmitter. The design and analysis techniques use the idea of extrinsic information transfer (EXIT) function matching and provide insights into the performance of different codes and receiver structures. We then present a coding scheme which is the concatenation of an LDPC code with a spectral shaping block code designed to be matched to the channel??s spectrum. We will discuss how to design the shaping code and the outer LDPC code. We will show that spectral shaping matched codes can be used for the parallel concatenation to achieve near capacity performance. We will also discuss the capacity of multiple antenna ISI channels. We study the effects of transmitter and receiver diversities and noisy channel state information on channel capacity

Applications of iterative decoding to magnetic recording channels.

Finally, Q-ary LDPC (Q-LDPC) codes are considered for MRCs. Belief propagation decoding for binary LDPC codes is extended to Q-LDPC codes and a reduced-complexity decoding algorithm for Q-LDPC codes is developed. Q-LDPC coded systems perform very well with random noise as well as with burst erasures. Simulations show that Q-LDPC systems outperform RS systems.Secondly, binary low-density parity-check (LDPC) codes are proposed for MRCs. Random binary LDPC codes, finite-geometry LDPC codes and irregular LDPC codes are considered. With belief propagation decoding, LDPC systems are shown to have superior performance over current Reed-Solomon (RS) systems at the range possible for computer simulation. The issue of RS-LDPC concatenation is also addressed.Three coding schemes are investigated for magnetic recording systems. Firstly, block turbo codes, including product codes and parallel block turbo codes, are considered on MRCs. Product codes with other types of component codes are briefly discussed.Magnetic recoding channels (MRCs) are subject to noise contamination and error-correcting codes (ECCs) are used to keep the integrity of the data. Conventionally, hard decoding of the ECCs is performed. In this dissertation, systems using soft iterative decoding techniques are presented and their improved performance is established

MMSE equalizers and precoders in turbo equalization.

Thesis (M.Sc.Eng.)-University of Natal, Durban, 2003.Transmission of digital information through a wireless channel with resolvable multipaths or a bandwidth limited channel results in intersymbol interference (1SI) among a number of adjacent symbols. The design of an equalizer is thus important to combat the ISI problem for these types of channels and hence provides reliable communication. Channel coding is used to provide reliable data transmission by adding controlled redundancy to the data. Turbo equalization (TE) is the joint design of channel coding and equalization to approach the achievable uniform input information rate of an ISI channel. The main focus of this dissertation is to investigate the different TE techniques used for a static frequency selective additive white Gaussian noise (AWGN) channel. The extrinsic information transfer (EXIT) chart is used to analyse the iterative equalization/decoding process and to determine the minimum signal to noise ratio (SNR) in order to achieve convergence. The use of the Minimum Mean Square Error (MMSE) Linear Equalizer (LE) using a priori information has been shown to achieve the same performance compared with the optimal trellis based Maximum A Posterior (MAP) equalizer for long block lengths. Motivated by improving the performance of the MMSE LE, two equalization schemes are initially proposed: the MMSE Linear Equalizer with Extrinsic information Feedback (LE-EF (1) and (U)). A general structure for the MMSE LE, MMSE Decision Feedback Equalizer (DFE) and two MMSE LE-EF receivers, using a priori information is also presented. The EXIT chart is used to analyse the two proposed equalizers and their characteristics are compared to the existing MAP equalizer, MMSE LE and MMSE DFE. It is shown that the proposed MMSE LE-EF (1) does have an improved performance compared with the existing MMSE LE and approaches the MMSE Linear Equalizer with Perfect Extrinsic information Feedback (LE-PEF) only after a large number of iterations. For this reason the MMSE LE-EF is shown to suffer from the error propagation problem during the early iterations. A novel way to reduce the error propagation problem is proposed to further improve the performance of the MMSE LE-EF (I). The MAP equalizer was shown to offer a much improved performance over the MMSE equalizers, especially during the initial iterations. Motivated by using the good quality of the MAP equalizer during the early iterations and the hybrid MAP/MMSE LE-EF (l) is proposed in order to suppress the error propagation problem inherent in the MMSE LE-EF (I). The EXIT chart analysis reveals that the hybrid MAP/MMSE LE-EF (l) requires fewer iterations in order to achieve convergence relative to the MMSE LE-EF (l). Simulation results demonstrate that the hybrid MAP/MMSE LE-EF (I) has a superior performance compared to the MMSE LE-EF (I) as well as approaches the performance of both the MAP equalizer and MMSE LE-PEF at high SNRs, at the cost of increased complexity relative to the MMSE LEEF (I) receiver. The final part of this dissertation considers the use of precoders in a TE system. It was shown in the literature that a precoder drastically improves the system performance. Motivated by this, the EXIT chart is used to analyse the characteristics of four different precoders for long block lengths. It was shown that using a precoder results in a loss in mutual information during the initial equalization stage. However" we show by analysis and simulations that this phenomenon is not observed in the equalization of all precoded channels. The slope of the transfer function, relating to the MAP equalization of a precoded ISI channel (MEP), during the high input mutual information values is shown to play an important role in determining the convergence of precoded TE systems. Simulation results are presented to show how the precoders' weight affects the convergence of TE systems. The design of the hybrid MAP/MEP equalizer is also proposed. We also show that the EXIT chart can be used to compute the trellis code capacity of a precoded ISI channel

Near-Instantaneously Adaptive HSDPA-Style OFDM Versus MC-CDMA Transceivers for WIFI, WIMAX, and Next-Generation Cellular Systems

Burts-by-burst (BbB) adaptive high-speed downlink 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

Near-capacity fixed-rate and rateless channel code constructions

Fixed-rate and rateless channel code constructions are designed for satisfying conflicting design tradeoffs, leading to codes that benefit from practical implementations, whilst offering a good bit error ratio (BER) and block error ratio (BLER) performance. More explicitly, two novel low-density parity-check code (LDPC) constructions are proposed; the first construction constitutes a family of quasi-cyclic protograph LDPC codes, which has a Vandermonde-like parity-check matrix (PCM). The second construction constitutes a specific class of protograph LDPC codes, which are termed as multilevel structured (MLS) LDPC codes. These codes possess a PCM construction that allows the coexistence of both pseudo-randomness as well as a structure requiring a reduced memory. More importantly, it is also demonstrated that these benefits accrue without any compromise in the attainable BER/BLER performance. We also present the novel concept of separating multiple users by means of user-specific channel codes, which is referred to as channel code division multiple access (CCDMA), and provide an example based on MLS LDPC codes. In particular, we circumvent the difficulty of having potentially high memory requirements, while ensuring that each user’s bits in the CCDMA system are equally protected. With regards to rateless channel coding, we propose a novel family of codes, which we refer to as reconfigurable rateless codes, that are capable of not only varying their code-rate but also to adaptively modify their encoding/decoding strategy according to the near-instantaneous channel conditions. We demonstrate that the proposed reconfigurable rateless codes are capable of shaping their own degree distribution according to the nearinstantaneous requirements imposed by the channel, but without any explicit channel knowledge at the transmitter. Additionally, a generalised transmit preprocessing aided closed-loop downlink multiple-input multiple-output (MIMO) system is presented, in which both the channel coding components as well as the linear transmit precoder exploit the knowledge of the channel state information (CSI). More explicitly, we embed a rateless code in a MIMO transmit preprocessing scheme, in order to attain near-capacity performance across a wide range of channel signal-to-ratios (SNRs), rather than only at a specific SNR. The performance of our scheme is further enhanced with the aid of a technique, referred to as pilot symbol assisted rateless (PSAR) coding, whereby a predetermined fraction of pilot bits is appropriately interspersed with the original information bits at the channel coding stage, instead of multiplexing pilots at the modulation stage, as in classic pilot symbol assisted modulation (PSAM). We subsequently demonstrate that the PSAR code-aided transmit preprocessing scheme succeeds in gleaning more information from the inserted pilots than the classic PSAM technique, because the pilot bits are not only useful for sounding the channel at the receiver but also beneficial for significantly reducing the computational complexity of the rateless channel decoder

Joint bit allocation and precoding for filterbank transceivers in NOFDM systems

Recently, the non orthogonal frequency division multiplexing (NOFDM) systems have attracted increased interest. They have several advantages over traditional OFDM systems: higher bandwidth efficiency; reduced sensitivity to carrier frequency offsets, oscillator phase noise and narrowband interference; and reduced intersymbol/intercarrier interference (ISI/ICI). In particular, low ISI/ICI will be important for future systems where Doppler frequencies will be larger (equivalently, channel variations will be faster) due to higher carrier frequencies and higher mobile velocities. In the first part of this thesis the duality of multicarrier systems and Gabor frames is discussed and applied to the design of a generalized multicarrier system based on a filterbank structure. The efficient polyphase implementation is also discussed. In this thesis the channel capacity of a GMC systems is evaluated through the diagonalization of an equivalent matrix model where intersymbol and intercarrier interferences have been included. Exploiting the majorization theory, the mutual information can be represented as a Schur-concave function and it is maximized through a joint transceiver design adding a linear precoder at the transmitter and a LMMSE equalizer at the receiver. The capacity is derived by the eigenvalue decomposition of the global system matrix including the noise colored by the receiver filtering and employing a power allocation of the transmitted power according to the well-known water-filling solution. This thesis investigates also the behaviour of the NOFDM systems when a power and bit allocation algorithm (like the Campello one) is employed in order to satisfy a certain QoS constrain. A comparison of the performances with OFDM systems is included. Finally a simple application of the cognitive radio paradigm employing filterbankbased multicarrier systems is developed and some interesting results are showed

Reduced complexity detection for massive MIMO-OFDM wireless communication systems

PhD ThesisThe aim of this thesis is to analyze the uplink massive multiple-input multipleoutput with orthogonal frequency-division multiplexing (MIMO-OFDM) communication systems and to design a receiver that has improved performance with reduced complexity. First, a novel receiver is proposed for coded massive MIMO-OFDM systems utilizing log-likelihood ratios (LLRs) derived from complex ratio distributions to model the approximate effective noise (AEN) probability density function (PDF) at the output of a zero-forcing equalizer (ZFE). These LLRs are subsequently used to improve the performance of the decoding of low-density parity-check (LDPC) codes and turbo codes. The Neumann large matrix approximation is employed to simplify the matrix inversion in deriving the PDF. To verify the PDF of the AEN, Monte-Carlo simulations are used to demonstrate the close-match fitting between the derived PDF and the experimentally obtained histogram of the noise in addition to the statistical tests and the independence verification. In addition, complexity analysis of the LLR obtained using the newly derived noise PDF is considered. The derived LLR can be time consuming when the number of receive antennas is very large in massive MIMO-OFDM systems. Thus, a reduced complexity approximation is introduced to this LLR using Newton’s interpolation with different orders and the results are compared to exact simulations. Further simulation results over time-flat frequency selective multipath fading channels demonstrated improved performance over equivalent systems using the Gaussian approximation for the PDF of the noise. By utilizing the PDF of the AEN, the PDF of the signal-to-noise ratio (SNR) is obtained. Then, the outage probability, the closed-form capacity and three approximate expressions for the channel capacity are derived based on that PDF. The system performance is further investigated by exploiting the PDF of the AEN to derive the bit error rate (BER) for the massive MIMO-OFDM system with different M-ary modulations. Then, the pairwise error probability (PEP) is derived to obtain the upper-bounds for the convolutionally coded and turbo coded massive MIMO-OFDM systems for different code generators and receive antennas. Furthermore, the effect of the fixed point data representation on the performance of the massive MIMO-OFDM systems is investigated using reduced detection implementations for MIMO detectors. The motivation for the fixed point analysis is the need for a reduced complexity detector to be implemented as an optimum massive MIMO detector with low precision. Different decomposition schemes are used to build the linear detector based on the IEEE 754 standard in addition to a user-defined precision for selected detectors. Simulations are used to demonstrate the behaviour of several matrix inversion schemes under reduced bit resolution. The numerical results demonstrate improved performance when using QR-factorization and pivoted LDLT decomposition schemes at reduced precision.Iraqi Government and the Iraqi Ministry of Higher Education and Scientific researc