Design of improved quasi-cyclic protograph-based Raptor-like LDPC codes for short block-lengths

Ranganathan, Sudarsan V. S.; Wesel, Richard D.

doi:10.1109/isit.2017.8006720

Cited by 8 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4, we foresee that the obtained upper bounds may be used to design specific PTV-SC-LDPC codes with small period having good free distance and error correction performance. A similar approach was used to obtain good QC-LDPC block codes in [30], [31], where the maximization of the upper bound on the ensemble free distance is used as a design criterion. Owing to the connection between QC-LDPC and SC-LDPC codes, such a design method could be easily extended.…”

Section: Discussionmentioning

confidence: 99%

Bounds on the Free Distance of Periodically Time-Varying SC-LDPC Codes

Battaglioni,

Baldi,

Chiaraluce

2024

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Time-invariant spatially coupled low-density paritycheck (TI-SC-LDPC) codes can be obtained by unwrapping quasi-cyclic (QC) LDPC codes. This results in a free distance that is lower bounded by the minimum distance of the underlying QC-LDPC codes. By introducing some variability in the syndrome former matrix, time-varying (TV) SC-LDPC codes are obtained, which trade an improved error correction performance for an increased decoding memory requirement and decoding complexity. A family of codes able to combine the advantages of TI-SC-LDPC codes with those of TV-SC-LDPC codes is that of periodically time-varying (PTV) SC-LDPC codes, based on a finite and periodic variation of the syndrome former matrix. In this paper we focus on such codes, and derive new upper bounds on the free distance of PTV-SC-LDPC code ensembles as well as on specific codes. By using these bounds, we show that PTV-SC-LDPC codes can achieve important improvements in the free distance over TI-SC-LDPC codes even using a very small period of variability, which corresponds to a minimal increase in memory and complexity. We also validate the new upper bounds through numerical experiments and assess the error correction performance of the corresponding codes through Monte Carlo simulations.

show abstract

Section: Discussionmentioning

confidence: 99%

Bounds on the Free Distance of Periodically Time-Varying SC-LDPC Codes

Battaglioni,

Baldi,

Chiaraluce

2024

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…The optimal design of the P-LDPC code can further improve the system performance [11]. In this case, different structures based on the protograph of the P-LDPC code are derived, including the protographbased quasi-cyclic [12], the protograph-based spatially coupled [13], and the protographbased raptor-like (PBRL) [14]. All the aforementioned structures are demonstrated with good coding performance results.…”

Section: Introductionmentioning

confidence: 99%

Protograph Designing of P-LDPC Codes via M3 Method

Song

Miao

Wang

2023

Entropy

View full text Add to dashboard Cite

Recently, a mesh model-based merging (M3) method and four basic graph models were proposed to construct the double protograph low-density parity-check (P-LDPC) code pair of the joint source channel coding (JSCC). Designing the protograph (mother code) of the P-LDPC code with both a good waterfall region and lower error floor is a challenge, and few works have existed until now. In this paper, the single P-LDPC code is improved to further verify the availability of the M3 method, and its structure is different from the channel code in the JSCC. This construction technique yields a family of new channel codes with lower power consumption and higher reliability. The structured design and better performance demonstrate that the proposed code is hardware-friendly.

show abstract

“…For spread-spectrum coding systems, in 2020, Rahman et al [11] applied coding techniques to an ultrawideband spread-spectrum system and compared the performance of the spread-spectrum system using Turbo [12][13][14], low-density parity check (LDPC) [15,16] and Polar codes [17][18][19]. The direct sequence spread spectrum (DSSS) with a bit error rate (BER) of 10 −4 and a bandwidth of 1.2 GHz provided a spread-spectrum gain of about 21 dB.…”

Section: Introductionmentioning

confidence: 99%

Short-Block-Length Low-Density Parity-Check Codes-Based Underwater Acoustic Spread-Spectrum Communication System

Zhao,

Sun

2023

Electronics

View full text Add to dashboard Cite

Low-density parity-check (LDPC) codes are commonly used in communication systems to improve the system performance, but LDPC codes takes too long for decoding, making communication inefficient and unsuitable for short-frame data transmission methods. In underwater acoustic channels, spread-spectrum communication becomes an effective way to realize long-distance communication. This paper combines short-block LDPC codes with a direct sequence spread spectrum and soft spread spectrum in underwater acoustic communication, addressing the problem of the inapplicability of conventional LDPC codes. The applicability of the proposed method in this paper is verified through simulation tests and pool experiments. The results indicate that the proposed communication system achieves lower bit error rates compared to the classical coding methods used in underwater acoustic spread-spectrum communication systems under the same channel conditions.

show abstract

Design of improved quasi-cyclic protograph-based Raptor-like LDPC codes for short block-lengths

Cited by 8 publications

References 12 publications

Bounds on the Free Distance of Periodically Time-Varying SC-LDPC Codes

Bounds on the Free Distance of Periodically Time-Varying SC-LDPC Codes

Protograph Designing of P-LDPC Codes via M3 Method

Short-Block-Length Low-Density Parity-Check Codes-Based Underwater Acoustic Spread-Spectrum Communication System

Contact Info

Product

Resources

About