A Novel Interleaving Scheme for Concatenated Codes on Burst-Error Channel

In the paper, a class of LDPC coded continuous phase modulation (CPM) systems is proposed for reliable communication over burst-error channels. A series of binary LDPC codes with code rates 1/4, 1/2 and 2/3 are chosen for binary and quaternary CPM schemes. A non-recursive decomposition of CPM is incorporated to eliminate the error propagation caused by burst errors. To reduce the complexity, an improved demodulation algorithm for noncoherent soft in soft out (N-SISO) is considered. Simulation results show that the proposed LDPC coded CPM offers a better error performance and is abler to recover the transmitted information under severe burst errors than current systems.

In this paper, we evaluate the performances of the Reed–Solomon (RS) and low density parity check (LDPC) codes in order to propose an efficient coding system for the outer code in high density optical recording channels. Hard decision decoding (HDD) RS code, iterative soft decision decoding (SDD) RS code or LDPC code is used as the outer code and LDPC code is used as the inner code. We compare the bit error rate (BER) performance of each coding system for various code rates, code lengths and burst errors. Simulation results show that the LDPC code has a better BER performance than the HDD RS and iterative SDD RS codes as the outer code in high density optical channels. Therefore, the LDPC code could be more attractive as the outer code than the RS code in high density optical channels.

In general, a concatenated RS/BCH code consists of an outer RS code and an inner BCH code with separation by an interleaver. We create a novel BCS code using a new methodology by combining an outer BCH code with an inner RS code appended by an interleaver to randomize burst errors and help the RS code in correcting the errors. Generally, BCH codes handle binary data, whereas RS codes handle non-binary data. Hence, RS (7, 1) inner code is proposed to achieve compatibility with BCH (15, 5) outer codes and ultimately create a novel BCS code to handle binary data. The proposed BCS code is compared with familiar concatenated RS/BCH codes and single codes (RS and BCH) for BPSK and QPSK modulation schemes. Results show the downlink LTE system performance using the proposed BCS code is significantly better than the uncoded LTE system and single codes (RS and BCH). Moreover, the proposed BCS code also outperforms familiar concatenated RS/BCH codes for both schemes. In contrast, the system performance is improved further when the number of antennas in the MIMO channel is increased from $$2 \times 2$$ to $$4 \times 4$$ . Therefore, the proposed BCS code can be considered a stronger code with high reliability in wireless communication systems.

Link-16, an excellent tactical data link developed by US army, provides security and reliable tactical data for aeroamphibious platforms and it's communication terminal, Joint Tactical Information Distribution System (JTIDS), features Reed-Solomon (RS) codes for random error, interlaced codes to for burst error. In the past decades, a variety of new-style electromagnetic weapons are constantly emerging and military communication environment becomes more and more complex and inscrutability, the BER performance of original JTIDS will be difficult to adapt to modern warfare increasingly harsh channel environment. In this paper, we establish a new burst-error channel to simulate the attack of electromagnetic weapons and we find a sharp fall in jam-resistant performance of original JTIDS. Furthermore, a new JTIDS based on LDPC codes over GF(q) which are capacity-approaching codes is proposed for confronting the new channel model.

We present a silicon photonic dual parallel multielectrode Mach-Zehnder modulator (MEMZM) based transmitter targeting 200 Gb/s four-level pulse amplitude modulation (PAM4) short reach transceivers. The MEMZMs have an average V <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">π</sub> and electro-optic (EO) bandwidth of 5 V and 38 GHz, respectively. The transmitter is characterized versus receiver equalizer taps, received signal power, driving voltage swing, crosstalk voltage swing, bitrate, and reach. Results reveal that using only a three-tap equalizer at the receiver, 100 Gb/s PAM4 net rate per lane can be achieved at a bit error rate (BER) below the KP4 forward error correction (KP4-FEC) threshold of 2.4 × 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-4</sup> . Moreover, up to 128 Gb/s can be received at a BER below the KP4-FEC threshold using only 2 Vpp and 1 Vpp driving the MEMZM segments. Then, both MEMZMs are driven simultaneously to assess the crosstalk impact on the BER performance at parallel operation. Driven by four binary signals, we demonstrate 200 Gb/s PAM4 transmission over up to 10 km of single mode fiber at a BER below the KP4-FEC threshold.

In this paper, a new coding scheme, named Turbo-LDPC code, is proposed. It applies LDPC codes to the product coding scheme, and performs the decoding operation iteratively between the two component codes. Besides, to boost the decoding performance, a linear extrinsic information normalization (EIN) method is also devised, which greatlyreduces the problem of belief propagation distortion ofextrinsic information after message interleaving. Altogether,the decoding performances of Turbo-LDPC codes are muchhigher than those of the original LDPC codes undercomparable computational complexities. Compared to blockturbo code combined with BCH codes, the proposed Turbo-LDPC code also has much better decoding performance as wellas lower computational complexity.

Problem statement. Deep neural networks are successfully used in channel coding to improve the quality of decoding. However, modern neural channel decoders cannot achieve high decoding performance and low complexity at the same time. To overcome this problem, it is necessary to develop a decoder with a double residual neuron. By integrating residual input and residual learning into the neural channel decoder architecture, it will significantly improve decoding performance while maintaining low complexity. Goal. Development of a decoder architecture with a dual residual neural network, which provides high decoding performance in channel coding with low model complexity and computational costs. Results. The simulation results show that the proposed decoder with a double residual neural network provides a significant increase in decoding performance. Compared to a neural decoder based on a trust propagation algorithm, a decoder with a dual residual neural network provides an additional 0.5-1.8 dB encoding gain compared to different channel codes. Compared to the hypergraph neural decoder, which has the best error correction capability among all existing neural channel decoders, the dual residual neural network decoder also provides similar or even better decoding performance for different channel codes. Practical significance. The results obtained can be used to improve decoding efficiency and improve performance in channel coding. The work was carried out with the financial support of the Ministry of Science and Higher Education of the Russian Federation within the framework of the state assignment "youth laboratory" No. FZGM-2024-0003.

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.

Bose–Chaudhuri–Hocquenghem (BCH) codes are broadly used to correct errors in flash memory systems and digital communications. These codes are cyclic block codes and have their arithmetic fixed over the splitting field of their generator polynomial. There are many solutions proposed using CPUs, hardware, and Graphical Processing Units (GPUs) for the BCH decoders. The performance of these BCH decoders is of ultimate importance for systems involving flash memory. However, it is essential to have a flexible solution to correct multiple bit errors over the different finite fields (GF(2)). In this paper, we propose a pragmatic approach to decode BCH codes over the different finite fields using hardware circuits and GPUs in tandem. We propose to employ hardware design for a modified syndrome generator and GPUs for a key-equation solver and an error corrector. Using the above partition, we have shown the ability to support multiple bit errors across different BCH block codes without compromising on the performance. Furthermore, the proposed method to generate modified syndrome has zero latency for scenarios where there are no errors. When there is an error detected, the GPUs are deployed to correct the errors using the iBM and Chien search algorithm. The results have shown that using the modified syndrome approach, we can support different multiple finite fields with high throughput.

This paper investigates the decoding performance of channel-coded ship-based satellite communications on-the-move (SSCOTM) between ships and satellites. In practical communications, ship antennas deviated from satellites by wind waves suffer rapid channel degradation with serious burst errors and even losing all the data. To address this issue, we first establish a mathematical model to study the influence of wind waves and derive the effective signal-to-noise ratio (SNR) in SSCOTM. Second, we propose a vertical Reed-Solomon (RS) with cyclic redundancy check (CRC) and low-density parity check (VRC-LDPC) code, where the RS code and LDPC code are treated as the inner code and outer code to correct both burst and random errors, respectively. Moreover, both the encoder and the decoder of the proposed VRC-LDPC can be carried out in parallel implementations. Finally, simulation results show that the proposed VRC-LDPC performs much better than the conventional codes of the Consultative Committee for Space Data Systems (CCSDS) standard. Thus, this paper provides an excellent alternative channel code for reliable error-correction systems of SSCOTM.

A low complexity Parallel Interference Cancellation (PIC) technique is proposed to suppress Multi-Access Interference (MAI) and minimize near-far effect for multi-user communication using Direct-Sequence Code Division Multiple Access (DS-CDMA). Interference signal is estimated using a relationship between cyclic correlation of the received signal and user's code of the interferer without requiring any knowledge of the channel condition. The user's codes for the multi-user DS-CDMA communication are constructed by using a set of m-sequences. The cyclic correlation is performed using Fast Walsh-Hadamard Transform (FWHT) which exhibits low computational complexity, i.e., it does not require any multiplication/division operations. In addition to low complexity, the proposed technique does not require complicated channel condition estimation and has no convergence issues. The uncoded Bit Error Rate (BER) performance of the proposed interference cancellation is calculated and compared with the conventional one over three different types of channels: AWGN, slow Rayleigh fading, and multipath channels.

We compare the asymptotic performance of parallel concatenated codes (PCCs) and serial concatenated codes (SCCs) over GF(4). We construct such codes using optimal nonbinary convolutional codes where optimality is in the sense of achieving the largest minimum distance for a fixed number of encoder states. Code rates of the form K/sub 0//(K/sub 0/ + 1) for K/sub 0/ = 1, 8, and 64 are considered. For all of these code rates, we find the minimum distance and its multiplicity for both concatenated code systems. This is accomplished by feeding the encoder with all possible weight-two and weight-three input information patterns and monitoring, at the output of the encoder, the weight of the corresponding codewords and their multiplicity. Our analytical results indicate that the SCC codes outperform their counterpart PCC codes with much lower complexity.

The known construction of cyclic concatenated codes is based on the fact that the inner is a cyclic minimal code, the outer code is cyclic, and the lengths of the inner and outer codes are relatively prime. It is shown that if the outer code is a suitably chosen constacyclic code the overall concatenated code is always cyclic regardless of the length of the outer code. Moreover, it follows that any cyclic code of composite length is a direct sum of cyclic concatenated codes with inner cyclic minimal codes and outer constacyclic codes. This description of cyclic codes of composite length leads to the introduction of the concept of a poor-code length (PCL). All but low-rate codes of this length have a poor minimum distance. A PCL is directly related to the existence of irreducible binomials. In the binary case, the first few PCLs are 9, 25, 27, 45, 49, 75, 81 and 99. Arbitrarily long binary cyclic codes that are better than binary BCH codes of primitive length are constructed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

The emerging visible light communication (VLC) technology, which has the advantages of short-distance communication and indoor lighting, has become a research hotspot of indoor wireless communication technology. Polar codes, as the only forward error correction (FEC) coding technology that has been theoretically proven to achieve Shannon's capabilities, are adopted to reduce the bit error rate (BER) in VLC systems. However, the individual polar codes are still unable to correct burst errors in VLC channels. This paper proposes concatenated polar codes with interleaving technology for VLC systems. The results show that it can effectively correct random errors and burst errors in VLC systems. Compared to the non-systematic polar codes, the systematic polar codes are more suitable as the inner code of the concatenated polar codes. The concatenated polar codes exhibit a lower error floor in VLC systems under burst errors than the individual polar codes. Compared with BCH-polar schemes, Convolutional-polar schemes have better robustness.

In this paper, an equivocation scheme with finite code length is proposed for a wiretap channel. The proposed coding scheme is composed of two constituent codes, an outer code and an inner code, which are used efficiently for various channel conditions. A Hamming code and its cosets are used for an outer code and bit-extension mapping is adopted for an inner code. The average equivocation is discussed for small messages and the probability of causing imperfect secrecy is defined to investigate the performance of outer and inner codes. The results show that usage of inner codes increases the equivocation capability of wiretap channels.