LDPC codes based on serially concatenated multiple parity-check codes

Baldi, Marco; Cancellieri, Giovanni; Carassai, A.; Chiaraluce, Franco

doi:10.1109/lcomm.2009.081766

Cited by 26 publications

(30 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, to ensure that there is negligible performance loss, we proved that the PEG codes and our codes had similar lower bound on girth. This was confirmed by providing examples of the proposed codes and comparing their performance with that of the multiple serially concatenated multiple paritycheck (M-SC-MPC) code, which is a class of LDPC codes of efficient encoding [10].…”

Section: Introductionmentioning

confidence: 67%

“…The encoder of each component MPC code can be implemented as r i SPC encoders as shown in Figure 1 [10]. The matrix cells of the ith encoder are filled in column-wise order from top left to bottom right.…”

Section: M-sc-mpc Codesmentioning

confidence: 99%

“…Condition (B) guarantees that the r i parity-check equations in submatrix H i can be used to generate r i parity bits simultaneously [10,13,14] while condition (C) is a necessary condition for condition (B). Observing these three conditions, the Tanner graph of the parity-check matrix H can be constructed with the proposed FPEG algorithm.…”

Section: Fpeg Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

Improved progressive edge-growth algorithm for fast encodable LDPC codes

Jiang

Lee

2012

J Wireless Com Network

View full text Add to dashboard Cite

The progressive edge-growth (PEG) algorithm is known to construct low-density parity-check (LDPC) codes at finite code lengths with large girths by establishing edges between symbol and check nodes in an edge-by-edge manner. The linear-encoding PEG (LPEG) algorithm, a simple variation of the PEG algorithm, can be applied to generate linear time encodable LDPC codes whose m parity bits p 1 , p 2 , ..., p m are computed recursively in m steps. In this article, we propose modifications of the LPEG algorithm to construct LDPC codes whose number of encoding steps is independent of the code length. The maximum degree of the symbol nodes in the It has also been proved that the PEG codes and the codes proposed in this article have similar lower bound on girth. Simulation results showed that the proposed codes perform very well over the AWGN channel with an iterative decoding.

show abstract

Section: Introductionmentioning

confidence: 67%

Section: M-sc-mpc Codesmentioning

confidence: 99%

Section: Fpeg Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Improved progressive edge-growth algorithm for fast encodable LDPC codes

Jiang

Lee

2012

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…Another powerful, though simple, class of structured LDPC codes is represented by multiple serially concatenated multiple parity-check (M-SC-MPC) codes [24]. These codes exploit the serial concatenation of very simple components, similarly to what is proposed in [25], where single parity-check component codes are used.…”

Section: Serially Concatenated Codesmentioning

confidence: 99%

“…The black diagonals denote symbols 1, while the other symbols are 0. The structured nature of M-SC-MPC codes makes their encoding very easy [24], and also, the implementation of LDPC decoders may benefit by the form of their parity-check matrix.…”

Section: Serially Concatenated Codesmentioning

confidence: 99%

Security gap analysis of some LDPC coded transmission schemes over the flat and fast fading Gaussian wire-tap channels

Baldi

Maturo

Ricciutelli

et al. 2015

J Wireless Com Network

View full text Add to dashboard Cite

It is known that the error rate can be used as a measure of reliability and security over the wire-tap channel when practical, finite length codes are used for transmission, and the security gap is an error rate based metric able to jointly treat these two aspects. In this paper, we consider several low-density parity-check (LDPC) coded transmissions, which represent the state of the art for transmissions over the wire-tap channel and we assess and compare their security gap performance. We consider two kinds of wire-tap channels: the flat and the fast fading wire-tap channels with additive white Gaussian noise. As a reference, we use the progressive edge growth (PEG) algorithm for the design of unstructured LDPC codes and compare its performance with that of four approaches for designing structured LDPC codes. We analyze both systematic and non-systematic transmissions and show that some structured code design techniques are able to achieve comparable or even better performance than the PEG algorithm over the considered channels, while taking advantage of their simpler encoding and decoding procedures.

show abstract

Binomial Product Generator LDPC Block Codes

Cancellieri

2014

Polynomial Theory of Error Correcting Codes

View full text Add to dashboard Cite

LDPC codes based on serially concatenated multiple parity-check codes

Cited by 26 publications

References 8 publications

Improved progressive edge-growth algorithm for fast encodable LDPC codes

Improved progressive edge-growth algorithm for fast encodable LDPC codes

Security gap analysis of some LDPC coded transmission schemes over the flat and fast fading Gaussian wire-tap channels

Binomial Product Generator LDPC Block Codes

Contact Info

Product

Resources

About