Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance

Parameters of LDPC codes, such as minimum distance, stopping distance, stopping redundancy, girth of the Tanner graph, and their influence on the frame error rate performance of the BP, ML and near-ML decoding over a BEC and an AWGN channel are studied. Both random and structured LDPC codes are considered. In particular, the BP decoding is applied to the code parity-check matrices with an increasing number of redundant rows, and the convergence of the performance to that of the ML decoding is analyzed. A comparison of the simulated BP, ML, and near-ML performance with the improved theoretical bounds on the error probability based on the exact weight spectrum coefficients and the exact stopping size spectrum coefficients is presented. It is observed that decoding performance very close to the ML decoding performance can be achieved with a relatively small number of redundant rows for some codes, for both the BEC and the AWGN channels

Performance Prediction of Nonbinary Forward Error Correction in Optical Transmission Experiments

In this paper, we compare different metrics to predict the error rate of optical systems based on nonbinary forward error correction (FEC). It is shown that the correct metric to predict the performance of coded modulation based on nonbinary FEC is the mutual information. The accuracy of the prediction is verified in a detailed example with multiple constellation formats, FEC overheads in both simulations and optical transmission experiments over a recirculating loop. It is shown that the employed FEC codes must be universal if performance prediction based on thresholds is used. A tutorial introduction into the computation of the threshold from optical transmission measurements is also given.Comment: submitted to IEEE/OSA Journal of Lightwave Technolog

A Unified Framework for Linear-Programming Based Communication Receivers

It is shown that a large class of communication systems which admit a sum-product algorithm (SPA) based receiver also admit a corresponding linear-programming (LP) based receiver. The two receivers have a relationship defined by the local structure of the underlying graphical model, and are inhibited by the same phenomenon, which we call 'pseudoconfigurations'. This concept is a generalization of the concept of 'pseudocodewords' for linear codes. It is proved that the LP receiver has the 'maximum likelihood certificate' property, and that the receiver output is the lowest cost pseudoconfiguration. Equivalence of graph-cover pseudoconfigurations and linear-programming pseudoconfigurations is also proved. A concept of 'system pseudodistance' is defined which generalizes the existing concept of pseudodistance for binary and nonbinary linear codes. It is demonstrated how the LP design technique may be applied to the problem of joint equalization and decoding of coded transmissions over a frequency selective channel, and a simulation-based analysis of the error events of the resulting LP receiver is also provided. For this particular application, the proposed LP receiver is shown to be competitive with other receivers, and to be capable of outperforming turbo equalization in bit and frame error rate performance.Comment: 13 pages, 6 figures. To appear in the IEEE Transactions on Communication

Error-Correction Performance of Regular Ring-Linear LDPC Codes over Lee Channels

Most low-density parity-check (LDPC) code constructions are considered over finite fields. In this work, we focus on regular LDPC codes over integer residue rings and analyze their performance with respect to the Lee metric. Their error-correction performance is studied over two channel models, in the Lee metric. The first channel model is a discrete memoryless channel, whereas in the second channel model an error vector is drawn uniformly at random from all vectors of a fixed Lee weight. It is known that the two channel laws coincide in the asymptotic regime, meaning that their marginal distributions match. For both channel models, we derive upper bounds on the block error probability in terms of a random coding union bound as well as sphere packing bounds that make use of the marginal distribution of the considered channels. We estimate the decoding error probability of regular LDPC code ensembles over the channels using the marginal distribution and determining the expected Lee weight distribution of a random LDPC code over a finite integer ring. By means of density evolution and finite-length simulations, we estimate the error-correction performance of selected LDPC code ensembles under belief propagation decoding and a low-complexity symbol message passing decoding algorithm and compare the performances

Coded-GFDM for Reliable Communication in Underwater Acoustic Channels

The performance of the coded generalized frequency division multiplexing (GFDM) transceiver has been evaluated in a shallow underwater acoustic channel (UAC). Acoustic transmission is the scheme of choice for communication in UAC since radio waves suffer from absorption and light waves scatter. Although orthogonal frequency division multiplexing (OFDM) has found its ground for multicarrier acoustic underwater communication, it suffers from high peak to average power ratio (PAPR) and out of band (OOB) emissions. We propose a coded-GFDM based multicarrier system since GFDM has a higher spectral efficiency compared to a traditional OFDM system. In doing so, we assess two block codes, namely Bose, Chaudari, and Hocquenghem (BCH) codes, Reed-Solomon (RS) codes, and several convolutional codes. We present the error performances of these codes when used with GFDM. Furthermore, we evaluate the performance of the proposed system using two equalizers: Matched Filter (MF) and Zero-Forcing (ZF). Simulation results show that among the various block coding schemes that we tested, BCH (31,6) and RS (15,3) give the best error performance. Among the convolutional codes that we tested, rate 1/4 convolutional codes give the best performance. However, the performance of BCH and RS codes is much better than the convolutional codes. Moreover, the performance of the ZF equalizer is marginally better than the MF equalizer. In conclusion, using the channel coding schemes with GFDM improves error performance manifolds thereby increasing the reliability of the GFDM system despite slightly higher complexity.This research was funded by a grant from the Spanish Ministry of Science and Innovation in the framework of the project “NAUTILUS: Swarms of underwater autonomous vehicles guided by artificial intelligence: its time has come” (PID2020-112502RB/AEI/10.13039/501100011033). The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work by Grant Code: (22UQU4300148DSR01). Partial funding for open access charge: Universidad de Málag

Investigation of non-binary trellis codes designed for impulsive noise environments

PhD ThesisIt is well known that binary codes with iterative decoders can achieve near Shannon limit performance on the additive white Gaussian noise (AWGN) channel, but their performance on more realistic wired or wireless channels can become degraded due to the presence of burst errors or impulsive noise. In such extreme environments, error correction alone cannot combat the serious e ect of the channel and must be combined with the signal processing techniques such as channel estimation, channel equalisation and orthogonal frequency division multiplexing (OFDM). However, even after the received signal has been processed, it can still contain burst errors, or the noise present in the signal maybe non Gaussian. In these cases, popular binary coding schemes such as Low-Density Parity-Check (LDPC) or turbo codes may not perform optimally, resulting in the degradation of performance. Nevertheless, there is still scope for the design of new non-binary codes that are more suitable for these environments, allowing us to achieve further gains in performance. In this thesis, an investigation into good non-binary trellis error-correcting codes and advanced noise reduction techniques has been carried out with the aim of enhancing the performance of wired and wireless communication networks in di erent extreme environments. These environments include, urban, indoor, pedestrian, underwater, and powerline communication (PLC). This work includes an examination of the performance of non-binary trellis codes in harsh scenarios such as underwater communications when the noise channel is additive S S noise. Similar work was also conducted for single input single output (SISO) power line communication systems for single carrier (SC) and multi carrier (MC) over realistic multi-path frequency selective channels. A further examination of multi-input multi-output (MIMO) wired and wireless systems on Middleton class A noise channel was carried out. The main focus of the project was non-binary coding schemes as it is well-known that they outperform their binary counterparts when the channel is bursty. However, few studies have investigated non-binary codes for other environments. The major novelty of this work is the comparison of the performance of non-binary trellis codes with binary trellis codes in various scenarios, leading to the conclusion that non-binary codes are, in most cases, superior in performance to binary codes. Furthermore, the theoretical bounds of SISO and MIMO binary and non-binary convolutional coded OFDM-PLC systems have been investigated for the rst time. In order to validate our results, the implementation of simulated and theoretical results have been obtained for di erent values of noise parameters and on di erent PLC channels. The results show a strong agreement between the simulated and theoretical analysis for all cases.University of Thi-Qar for choosing me for their PhD scholarship and the Iraqi Ministry of Higher Education and Scienti c Research (MOHESR) for granting me the funds to study in UK. In addition, there was ample support towards my stay in the UK from the Iraqi Cultural Attach e in Londo

Asymptotically Good Quantum Codes

Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.Comment: 15 pages, 1 figur