Low Error Floor Concatenated LDPC for MIMO Systems

Forward Error Correction code (FEC) is important for Wireless Communication and Cryptography applications to perform the Error Detection and Correction (EDC) mechanisms. FEC codes are classified into two types such as Convolutional code and Block code. Various FEC codes can be used in Wireless Communication likes Viterbi code, Reed Solomon code, Golay, BCH, Multidimensional parity, Hamming code and LDPC codes. In this paper, an analysis between Reed Solomon code, Bose, Chaudhuri, and Hocquenghem (BCH) code and LDPC codes are presented. A Low Density Parity Check (LDPC) code provides low area and high speed than all other codes. Simulation is carried out by ModelSim6.3C and Synthesis is carried out by Xilinx10.1.

Forward error correction (FEC) coding, modulation formats like differential phase shift keying (DPSK) and adaptive electronic equalization to mitigate, e.g. polarization mode dispersion (PMD) are some of the methods applied in current direct-detection optical communication systems, which are limited to a spectral efficiency of 1 bit/s/Hz. Coherent single-carrier QPSK systems with polarization multiplexing (PolMUX) allows to attain an spectral efficiency of up to 4 bit/s/Hz. However, to guarantee a bit error rate (BER) <; 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-15</sup> adaptive multiple-input multiple-output (MIMO) equalization as well as outer FEC coding has to be included which results in less than 4 bit/s/Hz in commercial 40 Gbit/s systems. From wireline and wireless systems it is well known that larger symbol alphabets in combination with FEC coding (denoted as coded modulation) and orthogonal frequency division multiplexing (OFDM) can significantly enhance the spectral efficiency. However, in order to exploit the channel capacity of the fiber the modulation itself needs to be capacity achieving. In this contribution we apply capacity achieving constellations in an optical OFDM system and jointly design mapping and low-density parity-check (LDPC) codes for an iterative decoding scheme, namely bit-interleaved coded modulation with iterative decoding (BICM-ID). The authors expect this coding scheme to be most appropriate for future optical transponders to utilize long haul communications close to channel capacity.

One of the key weaknesses of low-density parity-check (LDPC) codes is the error floor that they typically exhibit at high signal-to-noise ratios (SNRs). Such an error floor is usually attributed to problematic structures known as trapping sets (TSs). The overwhelming majority of existing error floor estimation schemes consider the case of binary phase shift keying (BPSK) signalling. Unfortunately, these schemes are not readily extensible to estimate the error floor of high order LDPC coded modulation systems considered herein. To provide such a scheme, in this work, we use mean-shift importance sampling (MS-IS) to develop a novel error floor estimation methodology for high-order pulse amplitude modulation (PAM) and quadrature amplitude modulation (QAM) LDPC coded systems. First, a computationally efficient graphical-based approach is used to identify the TSs of a given LDPC code. Subsequently, a novel analytical approach is devised to identify the TSs that are likely to have a higher contribution in the error floor. These TSs are referred to as potentially dominant TSs (PDTSs). Finally, a new methodology for categorizing the PDTSs into equivalence classes is developed. A representative PDTS of each equivalence class is chosen and an MS-IS framework is devised to obtain the error rate corresponding to each equivalence class. To arrive at the desired MS-IS scheme, we develop an algorithm that invokes the geometry of the constellation to determine the MS value. In contrast with the conventional MS-IS method used in BPSK signalling, in the proposed MS-IS scheme, the MS value is a variable that is determined based on the TS and the transmitted codeword. The computational complexity of the three main steps of our methodology, viz. extracting the PDTSs, determining the MS values, and applying the MS-IS scheme, depends merely on the size of the constellation and the structure of the code, but not on the SNR. Numerical simulations confirm the efficacy and accuracy of the proposed technique at different SNRs.

Ultra low bit error rate (BER) is required in high speed communications such as the 100 Gbit/s long haul optic communications. In this paper, a type of simple product codes is proposed using low density parity check (LDPC) codes with very high rate algebraic block codes by exploiting the sparsity of LDPC decoding failure and sparse error distribution in an LDPC frame with errors. Specifically, different with traditional product codes, the information bits are first encoded with very high rate algebraic block codes of low encoding and decoding complexity. Even the block codes correcting a single error using algebraic decoding method can be used. Then, LDPC codes are used as the inner code to obtain a low decoding threshold using iterative decoding. This design scheme can achieve the ultra low bit error rate at relatively low signal-to-noise ratios. The cost of the proposed scheme is the relatively large latency, which is not so critical for the ultra high speed communications.

The Fifth Generation (5G) cell systems are imminent. The 5G grant higher information exchange limit constrain than the fourth period supporting broadband. The 5G will support ultra-strong device to-device and gigantic machine form correspondence. For laying out the 5G organizes new coding designs are displayed. The coding plans are Low Density Parity Check (LDPC), Low Density Symbol Check (LDSC). The coding plan, LDPC is utilized for information and polar codes for control data. What’s more, another coding plan LDSC is used to check a tiny bit at a time investigation. These coding plans are utilized for blunder adjustment and enhanced information rates. Inside the paper, proposes an estimation technique for a low Bit Error Rate (BER) of LDSC codes. The execution of Sum Product Algorithm (SPA) inside LDSC decoder is portrayed in this paper. The redress term is utilized to enhance the deciphering execution of min whole calculation. For LDSC decoder, BER diminishes with increment in the Signal to Noise Ratio (SNR).

Low-density parity check (LDPC) codes with their near-Shannon capacity limit error correcting performance and iterative decoding algorithm are being evaluated for digital communications applications. For LDPC codes to be used in real systems, their error floors need to be investigated. In this paper, we evaluate the performance of disjoint difference set (DDS)-based LDPC codes (with column weights 3, 4, 5) and array code-based LDPC codes (with column weights 3, 4, 5) in the additive white Gaussian noise (AWGN) channel using a high-speed field programmable gate array (FPGA) simulation platform. The error floor regions (bit error rates down to 10/sup -12/) of those codes are presented. For better performance of array codes, a girth optimization method is proposed and the FPGA evaluation results are presented.

Adaptive coded modulation (ACM) is a key technique to increase spectral as well as power efficiency for orthogonal frequency division multiplexing (OFDM) systems. In this paper, an efficient rate adaptive low density parity check (LDPC) coded modulation (RALCM) algorithm is proposed, which maximizes the payload rate for OFDM systems under the constraint of the given transmit power and the target bit error rate (BER). Taking advantage of the two dimensional look up table for the signal to noise ratio (SNR) thresholds, the RALCM algorithm assigns different combinations of the LDPC code rates and quadrature amplitude modulation (QAM) modulations for subcarriers according to the channel frequency response (CFR). Both theoretical analysis and computer simulation show that the proposed algorithm not only efficiently improves the payload rate of the LDPC coded OFDM system over frequency selective fading channels, but also inherently reduces the computational complexity of the system optimization.

Turbo codes are attractive compared with Low Density Parity Check (LDPC) codes for Forward Error Correction (FEC) applications mainly due to their superior performance, especially at low Signal-to-Noise Ratio (SNR) such as are common in Powerline channels. For example, IEEE 1901-FFT PHY used the Turbo coding scheme defined in the HomePlug AV standards. However, patent fees are usually required for each turbo-code enabled manufactured device. The objective of this paper is to examine whether unlicensed LDPC codes, with optimized choices of block lengths, could be a viable alternative for future Powerline Communications (PLC) applications. The paper shows that the performance of the LDPC codes can approximate that of the Turbo codes with higher block lengths, on channels with typical and realistic PLC characteristics. The paper also shows that the additional complexity associated with this increase in block length can be mitigated by the use of Quasi-Cyclic LDPC (QC-LDPC) codes.

In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over the general linear group with those for non-binary LDPC codes over finite field transmitted over the q-ary memoryless symmetric channel under belief propagation decoding. To analyze non-binary LDPC codes defined over both general linear group GL(m, F 2 ) and finite field F 2m , we investigate non-binary LDPC codes defined over GL(m 3 , F 2m4 ). We propose a method to lower the error floors for non-binary LDPC codes. In this analysis, we see that the optimized non-binary LDPC codes defined over general linear group have the same decoding performance in the error floors as those defined over finite field. The non-binary LDPC codes defined over general linear group have more choices of the labels in the edges which satisfy the condition for the optimization.

Forward error correction code with Low Density Parity Check (LDPC) gives substantial results very close to Shannon limit. This can be achieved when complexity and delay time is unlimited. Thus, it is significant to recognize the limitation of those parameters in the decoding of LDPC. In this research, a study of LDPC performance with three decoding algorithms namely; bit-flipping, log domain, and prob domain are presented. The first one is related to hard decision family while the last two types are the soft decision that follows the sum-product algorithm. A simulation model of a wireless communication system included LDPC are evaluated with the motioned three types of decoding using Matlab Package, version 2018a. The results show that the log domain and prob domain are outperforming the bit-flipping algorithm by a significant amount of Signal to Noise Ratio (SNR). Finally, optimum values of LDPC parameters are chosen according to the achieved results that will give better results are presented.

Low-density parity checks (LDPC) codes are considered good performance error correction codes. However, decoder complexity increases with increasing code length. In this study, we introduce short-length serially concatenated LDPC codes. The proposed technique uses pairs of compatible LDPC codes that act as outer and inner serially concatenated codes. In this code pair, the inner code takes input that is the same length as the outer LDPC encoder output. This study examined two cases of LDPC codes as compatible pairs with low numbers of iterations and compared bit error rate (BER) performance to a standalone LDPC code with an additive white Gaussian noise channel. We also considered the quadrature phase shift keying QPSK, 16-quadrature amplitude modulation (QAM), and 64-QAM system modulation schemes. Simulation results demonstrate that the proposed system has good BER performance compared to a standalone LDPC code, the results summarized in table and performance curves.

In this paper, we propose a concatenated code by combining a Recursive Systematic Convolutional (RSC) code with a Low-Density Parity-Check (LDPC) code. The proposed concatenated code is encoded in parallel by an RSC encoder and an LDPC encoder without interleavers between them. When decoding the proposed concatenated code, the information bits are decoded by two decoding algorithms, and soft information is exchanged between the RSC decoder and the LDPC decoder. This allows for the elimination of wrong codewords output by each decoder. The use of an LDPC code allows us to halt the decoding process when the valid codeword is obtained. We evaluate the error rate performance of the proposed concatenated code by computer simulations. We show that the proposed concatenated code does not have a high error floor, and achieves better BLock Error Rate (BLER) performance than either conventional LDPC codes or conventional turbo codes in the high Eb/No region. We also show that since the proposed concatenated code can correct wrong codewords output by each decoder, it achieves better BLER than the regular LDPC code at the same Bit Error Rate (BER).

We propose a novel concatenated coding scheme combined Low Density Parity Check(LDPC) code and vertical Bell Labs layered space-time (VBLAST) code to improve the bit error rate (BER) performance for Free-space optical (FSO) communication links with On Off Keying(OOK) modulation. In the scheme, π-rotation encoding and belief-propagation (BP) decoding algorithm are employed in LDPC code, and minimum mean-square error (MMSE) soft-decision decoding algorithm is used for VBLAST code. Moreover, a joint iterative detection and decoding algorithm of VBLAST code and LDPC code is used to improve the overall link performance. At last, the BER of the proposed scheme over lognormal atmospheric turbulent fading channels is analyzed by using Monte Carlo method. The result shows that the BER of the proposed concatenated coding scheme is much improved than that only use VBLAST code scheme.

The Non-Orthogonal Multiple Access (NOMA) and the Orthogonal Frequency Division Multiple Access (OFDMA) are promising techniques for next-generation wireless systems. Although much attention in the literature considered these techniques, an effective combination between such systems as hybrid multiple access (HMA) needs more attention. For this reason, this paper devotes to proposing two different scenarios of HMA using multi-user OFDM (MU-OFDM) and power domain (PD) NOMA for downlink transmission to overcome the limitations of both Orthogonal Multiple Access (OMA) and NOMA. Due to the randomness of a wireless channel, different user grouping strategies and dynamic power allocation (DPA) strategies are employed to satisfy users’ requirements. The proposed systems give high flexibility utilizing bitrate allocation and user fairness. System results show superior performance to traditional OMA and NOMA systems. The achieved variety of fairness is helpful for the diversity of applications which is a principal requirement for beyond-fifth-generation (B5G) networks. The next step in this analysis is to enhance the proposed systems’ spectral efficiency (SE) by introducing beamforming for massive Multiple-Input Multiple-Output (MIMO) systems. The bit error rate (BER) result of the proposed system achieves almost the same error floor with a benefit of approximately 10 dB signalto-noise ratio (SNR) when 90 resource blocks (RBs) are used.

Digital Video Broadcasting-Terrestrial second generation (DVB-T2) systems are increasingly deployed for high quality terrestrial broadcasting. However, low Signal-to-Noise Ratio (SNR) conditions in urban and fringe coverage areas pose significant challenges, resulting in elevated Bit Error Rates (BER) and degraded service reliability. Forward Error Correction (FEC) techniques, particularly Low-Density Parity-Check (LDPC) and Bose Chaudhuri Hocquenghem (BCH) codes, play a crucial role in mitigating transmission errors and ensuring robust communication. This study investigates a systematic approach to optimizing LDPC and BCH FEC schemes to enhance transmission reliability and minimize BER under low-SNR conditions in DVB-T2 networks. Using simulation-based analyses, the study evaluates multiple LDPC code rates (e.g., 1/2, 2/3, 3/4) in combination with BCH codeword lengths and error-correcting capabilities. Results indicate that an optimized LDPC (64800, 32400) configuration combined with a BCH (255, 239) code significantly reduces BER, achieving approximately 10⁻⁵ at an SNR of 2 dB, compared to a BER of 10⁻³ using standard DVB-T2 FEC configurations. Additionally, iterative decoding algorithms for LDPC were fine-tuned to balance convergence speed and error correction performance, demonstrating a 25% reduction in decoding iterations without compromising reliability. The analysis also explores trade-offs between redundancy, throughput and latency, highlighting the practical considerations for real-world deployment. The findings underscore that strategic optimization of LDPC/BCH FEC parameters is critical for maintaining broadcast quality in low-SNR scenarios. By enhancing error resilience and reducing BER, the proposed approach improves signal integrity, supports consistent reception in fringe areas and maximizes spectrum efficiency. This work provides a foundation for adaptive FEC strategies in future DVB T2 systems, enabling broadcasters to deliver reliable high-definition content even under challenging channel conditions.