Precoder-Aided Iterative Detection Assisted Multilevel Coding and Three-Dimensional EXIT-Chart Analysis

A novel three-dimensional (3D) EXIT chart is developed for investigating the iterative behaviour of Multilevel Coding (MLC) invoking Multistage Decoding (MSD). The extrinsic information transfer characteristics of both the symbol-to-bit demapper used and those of the differentprotection constituent decoders suggest that potential improvements can be achieved by appropriately designing the demapper. The proposed 3D EXIT chart is then invoked for studying the precoder-aided multilevel coding scheme employing both MSD and Parallel Independent Decoding (PID) for communicating over AWGN and uncorrelated Rayleigh fading channels with the aid of 8PSK modulation. At BER=10?5, the precoder was capable of enhancing the achievable Eb/N0 performance by 0.5dB to 2.5dB over AWGN and Rayleigh channels, respectively

EQUALISATION TECHNIQUES FOR MULTI-LEVEL DIGITAL MAGNETIC RECORDING

A large amount of research has been put into areas of signal processing, medium design, head and servo-mechanism design and coding for conventional longitudinal as well as perpendicular magnetic recording. This work presents some further investigation in the signal processing and coding aspects of longitudinal and perpendicular digital magnetic recording. The work presented in this thesis is based upon numerical analysis using various simulation methods. The environment used for implementation of simulation models is C/C + + programming. Important results based upon bit error rate calculations have been documented in this thesis. This work presents the new designed Asymmetric Decoder (AD) which is modified to take into account the jitter noise and shows that it has better performance than classical BCJR decoders with the use of Error Correction Codes (ECC). In this work, a new method of designing Generalised Partial Response (GPR) target and its equaliser has been discussed and implemented which is based on maximising the ratio of the minimum squared euclidean distance of the PR target to the noise penalty introduced by the Partial Response (PR) filter. The results show that the new designed GPR targets have consistently better performance in comparison to various GPR targets previously published. Two methods of equalisation including the industry's standard PR, and a novel Soft-Feedback- Equalisation (SFE) have been discussed which are complimentary to each other. The work on SFE, which is a novelty of this work, was derived from the problem of Inter Symbol Interference (ISI) and noise colouration in PR equalisation. This work also shows that multi-level SFE with MAP/BCJR feedback based magnetic recording with ECC has similar performance when compared to high density binary PR based magnetic recording with ECC, thus documenting the benefits of multi-level magnetic recording. It has been shown that 4-level PR based magnetic recording with ECC at half the density of binary PR based magnetic recording has similar performance and higher packing density by a factor of 2. A novel technique of combining SFE and PR equalisation to achieve best ISI cancellation in a iterative fashion has been discussed. A consistent gain of 0.5 dB and more is achieved when this technique is investigated with application of Maximum Transition Run (MTR) codes. As the length of the PR target in PR equalisation increases, the gain achieved using this novel technique consistently increases and reaches up to 1.2 dB in case of EEPR4 target for a bit error rate of 10-5

Serially Concatenated Continuous Phase Modulation with SOVA Turbo Decoding

For a Serially Concatenated Continuous Phase Modulation (SCCPM) system that concatenates a rate of 1/2 Convolutional Code (CC) and an M-ary full response continuous phase modulation (CPM) signal, we design a turbo decoding scheme using the Soft Output Viterbi algorithm (SOVA) and study the system performance. A decomposition model is used in CPM to reduce the number of states and separate the continuous phase encoder (CPE) with the modulator. As a soft-input soft-output (SISO) decoding algorithm, SOVA is used to generate and update the soft information of decoded signal symbols during the iterative process for both the CPM signal and the CC. Newly generated soft information from one component decoder will be used by the other component decoder to constitute an iterative, i.e., turbo, decoding process. Simulation results show that a decoding gain of at least 1 dB can be obtained by using turbo decoding compared to that without turbo decoding

A STUDY OF ERASURE CORRECTING CODES

This work focus on erasure codes, particularly those that of high performance, and the related decoding algorithms, especially with low computational complexity. The work is composed of different pieces, but the main components are developed within the following two main themes. Ideas of message passing are applied to solve the erasures after the transmission. Efficient matrix-representation of the belief propagation (BP) decoding algorithm on the BEG is introduced as the recovery algorithm. Gallager's bit-flipping algorithm are further developed into the guess and multi-guess algorithms especially for the application to recover the unsolved erasures after the recovery algorithm. A novel maximum-likelihood decoding algorithm, the In-place algorithm, is proposed with a reduced computational complexity. A further study on the marginal number of correctable erasures by the In-place algoritinn determines a lower bound of the average number of correctable erasures. Following the spirit in search of the most likable codeword based on the received vector, we propose a new branch-evaluation- search-on-the-code-tree (BESOT) algorithm, which is powerful enough to approach the ML performance for all linear block codes. To maximise the recovery capability of the In-place algorithm in network transmissions, we propose the product packetisation structure to reconcile the computational complexity of the In-place algorithm. Combined with the proposed product packetisation structure, the computational complexity is less than the quadratic complexity bound. We then extend this to application of the Rayleigh fading channel to solve the errors and erasures. By concatenating an outer code, such as BCH codes, the product-packetised RS codes have the performance of the hard-decision In-place algorithm significantly better than that of the soft-decision iterative algorithms on optimally designed LDPC codes

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

Cross-Layer design and analysis of cooperative wireless networks relying on efficient coding techniques

2011/2012This thesis work aims at analysing the performance of efficient cooperative techniques and of smart antenna aided solutions in the context of wireless networks. Particularly, original contributions include a performance analysis of distributed coding techniques for the physical layer of communication systems, the design of practical efficient coding schemes that approach the analytic limiting bound, the cross-layer design of cooperative medium access control systems that incorporate and benefit from advanced physical layer techniques, the study of the performance of such solutions under realistic network assumptions, and, finally the design of access protocols where nodes are equipped with smart antenna systems.XXV Ciclo198

Formes d'ondes avancées et traitements itératifs pour les canaux non linéaires satellites

L'augmentation de l'efficacité spectrale des transmissions mono-porteuses sur un lien de diffusion par satellite est devenu un défi d'envergure afin de pallier la demande croissante en débits de transmission. Si des techniques émergentes de transmissions encouragent l'utilisation de modulations à ordre élevé telles que les modulations de phase et d'amplitude (APSK), certaines dégradations sont encourues lors du traitement à bord du satellite. En effet, en raison de l'utilisation d'amplificateurs de puissance ainsi que de filtres à mémoires, les modulations d'ordre élevé subissent des distorsions non-linéaires dues à la fluctuation de leur enveloppe, ce qui nécessite des traitements au sein de l'émetteur ou bien au sein du récepteur. Dans cette thèse, nous nous intéressons au traitement de l'interférence non-linéaire au sein du récepteur, avec une attention particulière aux égaliseurs itératifs qui améliorent les performances du système au prix d'une complexité élevée. A partir du modèle temporel des interférences non-linéaires induites par l'amplificateur de puissance, des algorithmes de réception optimaux et sous optimaux sont dérivés, et leurs performances comparées. Des égaliseurs à complexité réduite sont aussi étudiés dans le but d'atteindre un compromis performances-complexité satisfaisant. Ensuite, un modèle des non-linéarités est dérivé dans le domaine fréquentiel, et les égaliseurs correspondants sont présentés. Dans un second temps, nous analysons et dérivons des récepteurs itératifs pour l'interférence entre symboles non linéaire. L'objectif est d'optimiser les polynômes de distributions d'un code externe basé sur les codes de contrôle de parité à faible densité (LDPC) afin de coller au mieux à la sortie de l'égaliseur. Le récepteur ainsi optimisé atteint de meilleures performances comparé à un récepteur non optimisé pour le canal non-linéaire. Finalement, nous nous intéressons à une classe spécifique de techniques de transmissions mono-porteuse basée sur le multiplexage par division de fréquence (SC-OFDM) pour les liens satellites. L'avantage de ces formes d'ondes réside dans l'efficacité de leur égaliseur dans le domaine fréquentiel. Des formules analytiques de la densité spectrale de puissance et du rapport signal sur bruit et interférence sont dérivées et utilisées afin de prédire les performances du système. ABSTRACT : Increasing both the data rate and power efficiency of single carrier transmissions over broadcast satellite links has become a challenging issue to comply with the urging demand of higher transmission rates. If emerging transmission techniques encourage the use of high order modulations such as Amplitude and Phase Shift Keying (APSK) and Quadrature Amplitude Modulation (QAM), some channel impairments arise due to onboard satellite processing. Indeed, due to satellite transponder Power Amplifiers (PA) as well as transmission filters, high order modulations incur non linear distortions due to their high envelope fluctuations which require specific processing either at the transmitter or at the receiver. In this thesis, we investigate on non linear interference mitigation at the receiver with a special focus on iterative equalizers which dramatically enhance the performance at the cost of additional complexity. Based on the time domain model of the non linear interference induced by the PA, optimal and sub-optimal receiving algorithms are proposed and their performance compared. Low complexity implementations are also investigated for the sake of a better complexity-performance trade-off. Then, a non linear frequency domain model is derived and the corresponding frequency equalizers are investigated. In the second part, we analyse and design an iterative receiver for the non linear Inter Symbol Interference (ISI) channel. The objective is to optimize an outer Low Density Parity Check (LDPC) code distribution polynomials so as to best fit the inner equalizer Extrinsic information. The optimized receiver is shown to achieve better performance compared to a code only optimized for linear ISI channel. Finally, we investigate on a specific class of single carrier transmissions relying on Single Carrier Orthogonal Frequency Division Multiplexing (SCO-FDM) for satellite downlink. The advantage of such waveforms lies in their practical receiver implementation in the frequency domain. General analytical formulas of the power spectral density and signal to noise and interference ratio are derived and used to predict the bit error rate for frequency selective multiplexers

Capacity estimation and code design principles for continuous phase modulation (CPM)

Continuous Phase Modulation is a popular digital modulation scheme for systems which have tight spectral efficiency and Peak-to-Average ratio (PAR) constraints. In this thesis we propose a method of estimating the capacity for a Continuous Phase Modulation (CPM) system and also describe techniques for design of codes for this system. We note that the CPM modulator can be decomposed into a trellis code followed by a memoryless modulator. This decomposition enables us to perform iterative demodulation of the signal and improve the performance of the system. Thus we have the option of either performing iterative demodulation, where the channel decoder and the demodulator are invoked in an iterative fashion, or a non-iterative demodulation, where the demodulation is performed only once followed by the decoding of the message. We highlight the recent results in the estimation of capacity for channels with memory and apply it to a CPM system. We estimate two different types of capacity of the CPM system over an Additive White Gaussian Noise (AWGN). The first capacity assumes that optimum demodulation and decoding is done, and the second one assumes that the demodulation is done only once. Having obtained the capacity of the system we try to approach this capacity by designing outer codes matched to the CPM system. We utilized LDPC codes, since they can be designed to perform very close to capacity limit of the system. The design complexity for LDPC codes can be reduced by assuming that the input to the decoder is Gaussian distributed. We explore three different ways of approximating the CPM demodulator output to a Gaussian distribution and use it to design LDPC codes for a Bit Interleaved Coded Modulation (BICM) system. Finally we describe the design of Multi Level Codes (MLC) for CPM systems using the capacity matching rule