#### DMCA

## Block-LDPC: A practical LDPC coding system design approach (2005)

Venue: | IEEE Trans. Circuits Syst |

Citations: | 34 - 1 self |

### Citations

1761 | Factor graphs and the sum-product algorithm,”
- Kschischang, Frey, et al.
- 2001
(Show Context)
Citation Context ...ented by a bipartite graph, between check (or constraint) nodes in one set and variable (or message) nodes in the other set. An LDPC code can be decoded by the message-passing decoding algorithm [4], =-=[5]-=- that directly matches the code bipartite graph as illustrated in Fig. 1: After variable nodes are initialized with the channel messages, the decoding messages are iteratively computed by all the vari... |

1341 | Low-Density Parity-Check Codes.
- Gallager
- 1963
(Show Context)
Citation Context ...VB) standard and are being seriously considered in various real-life applications such as magnetic storage, 10 Gb Ethernet, and high-throughput wireless local area network (LAN). Invented by Gallager =-=[1]-=- in 1962, LDPC codes have been largely neglected by the scientific community for several decades until the remarkable success of Turbo codes that invoked the re-discovery of LDPC codes, pioneered by M... |

738 | Good error-correcting codes based on very sparse matrices,
- MacKay
- 1999
(Show Context)
Citation Context ...epresented by a bipartite graph, between check (or constraint) nodes in one set and variable (or message) nodes in the other set. An LDPC code can be decoded by the message-passing decoding algorithm =-=[4]-=-, [5] that directly matches the code bipartite graph as illustrated in Fig. 1: After variable nodes are initialized with the channel messages, the decoding messages are iteratively computed by all the... |

494 | Near Shannon limit performance of low density parity check codes,”
- MacKay, Neal
- 1996
(Show Context)
Citation Context ...codes have been largely neglected by the scientific community for several decades until the remarkable success of Turbo codes that invoked the re-discovery of LDPC codes, pioneered by MacKay and Neal =-=[2]-=- and Wiberg [3]. The past few years experienced significant improvement in LDPC code construction and performance analysis. For the practical LDPC coding system implementations, it has been well recog... |

354 | Codes and decoding on general graphs
- Wiberg
- 1996
(Show Context)
Citation Context ... largely neglected by the scientific community for several decades until the remarkable success of Turbo codes that invoked the re-discovery of LDPC codes, pioneered by MacKay and Neal [2] and Wiberg =-=[3]-=-. The past few years experienced significant improvement in LDPC code construction and performance analysis. For the practical LDPC coding system implementations, it has been well recognized that the ... |

184 | Efficient encoding of low-density paritycheck codes,”
- Richardson, Urbanke
- 2001
(Show Context)
Citation Context ...ity check matrix. The denseness of the generator matrix and typically large code length make this straightforward method impractical due to very high implementation complexity. Richardson and Urbanke =-=[14]-=- demonstrated that, if the parity check matrix is approximate lower (or upper) triangular, the encoding complexity can be largely reduced by performing the encoding directly based on the sparse parity... |

130 |
A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoder”,
- Blanksby, Howland
- 2002
(Show Context)
Citation Context ...ware unit in time-division multiplexed mode. Fully parallel decoder can achieve very high decoding throughput, e.g., a 1 Gbps decoder for 1024-bit, rate 1/2 LDPC code has been physically demonstrated =-=[6]-=-. However, due to the typically large code length (at least few thousand bits) and widespread code bipartite graph connectivity, fully parallel decoder suffers from prohibitive implementation complexi... |

126 | Low-density parity-check (LDPC) codes constructed from protograph
- Thorpe
- 2003
(Show Context)
Citation Context ...er implementation, which is the basic principle underlying all the recent work on LDPC decoder design. Interestingly but not surprisingly, nearly all the recently proposed LDPC decoder design schemes =-=[7]-=-–[13] employ the essentially same joint design approach: The LDPC code parity check matrix is a block structured matrix that can be partitioned into an array of square block matrices, where each block... |

55 |
Construction of irregular LDPC codes with low error floors,” in
- Tian, Jones, et al.
- 2003
(Show Context)
Citation Context ...e should put more effort to prevent small cycles from passing low-degree variable nodes. To this end, we introduce a concept, the degree of a cycle, which is similar to the concept of ACE proposed in =-=[18]-=-. Definition 2.1: We define the degree of a cycle to be the sum of degrees of all variable nodes found along the path of a cycle. It is intuitive that the error-correcting performance can be improved ... |

31 |
Design of capacity-approaching low-density parity-check codes
- Richardson, Shokrollahi, et al.
- 2001
(Show Context)
Citation Context ...te that the code length is typically determined by the specific applications). The appropriate node degree distributions are obtained by a well-known standard design technique, i.e, density evolution =-=[19]-=-. To avoid too many small cycles, we explicitly set a constraint on the girth2 of the code bipartite graph during the code construction in a similar way as the bit-filling approach [20]. Moreover, we ... |

25 | and S.Olcer, “Low-density parityCheck Codes for Digital Subscriber Lines
- Eleftheriou
- 2002
(Show Context)
Citation Context ...ign unconsidered, and 2) most prior work did not address how to further optimize the code error-correcting performance under the corresponding implementation-oriented constraints. The authors of [8], =-=[16]-=-, [17] considered both encoder and decoder design for regular LDPC codes that are typically worse than irregular ones in terms of error-correcting performance. Hocevar [10], [15] developed encoder/dec... |

23 |
LDPC Code Construction with Flexible Hardware Implementation
- Hocevar
- 2003
(Show Context)
Citation Context ...raints. The authors of [8], [16], [17] considered both encoder and decoder design for regular LDPC codes that are typically worse than irregular ones in terms of error-correcting performance. Hocevar =-=[10]-=-, [15] developed encoder/decoder design solution for irregular LDPC codes, but the specific code construction largely relies on hand-craft code template in lack of systematic construction approach. Mo... |

19 | Architecture-Aware Low-Density Parity-Check Codes - Mansour, Shanbhag - 2003 |

18 |
Joint (3,k)-regular LDPC code and decoder/encoder design
- Zhang, Parhi
- 2004
(Show Context)
Citation Context ... the encoding complexity can be largely reduced by performing the encoding directly based on the sparse parity check matrix. Most recently proposed low-complexity encoder hardware design schemes [15]–=-=[17]-=- essentially follow this idea. The above summarized state-of-the-art LDPC encoder/decoder design practice shows that the essence of joint design is to apply certain implementation-oriented constraints... |

16 | Extended bit-filling and LDPC code design
- Campello, Modha
- 2004
(Show Context)
Citation Context ...sity evolution [19]. To avoid too many small cycles, we explicitly set a constraint on the girth2 of the code bipartite graph during the code construction in a similar way as the bit-filling approach =-=[20]-=-. Moreover, we note that the variable nodes with higher degree tend to converge more quickly than those with lower degree during the message-passing iterative decoding. This suggests that, with finite... |

13 |
Decoding Architecture for Array-code-based LDPC Codes
- Olcer
(Show Context)
Citation Context ...r design unconsidered, and 2) most prior work did not address how to further optimize the code error-correcting performance under the corresponding implementation-oriented constraints. The authors of =-=[8]-=-, [16], [17] considered both encoder and decoder design for regular LDPC codes that are typically worse than irregular ones in terms of error-correcting performance. Hocevar [10], [15] developed encod... |

12 |
Structured Low-Density Parity-Check Codes
- Moura, Lu, et al.
(Show Context)
Citation Context ...mplementation, which is the basic principle underlying all the recent work on LDPC decoder design. Interestingly but not surprisingly, nearly all the recently proposed LDPC decoder design schemes [7]–=-=[13]-=- employ the essentially same joint design approach: The LDPC code parity check matrix is a block structured matrix that can be partitioned into an array of square block matrices, where each block matr... |

10 | Design of VLSI implementation-oriented LDPC codes
- Zhong, Zhang
- 2003
(Show Context)
Citation Context ...tially parallel decoder architecture is relatively straightforward from the Block-LDPC code construction and the decoder architecture presented in this paper basically follows the one we presented in =-=[11]-=-. The remainder of this paper is organized as follows. Section II discusses the Block-LDPC code construction. In Section III, we present the efficient encoding strategy and its corresponding encoder a... |

10 |
Design of LDPC graphs for hardware implementation
- Thorpe
(Show Context)
Citation Context ... obtain a group of Block-LDPC codes. Step 3) From the codes obtained in Step 2), we select the code for real application based on a metric called cycle effect metric, which is also known as loopiness =-=[21]-=-. The cycle effect is defined as: where is the number of cycles with the length of and is a value chosen for the sum to converge. The code with smaller value of cycle effect tends to have less small c... |

3 |
Optimization of LDPC finite precision belief propagation decoding with discrete density evolution
- Declercq, Verdier
- 2003
(Show Context)
Citation Context ...nce degradation compared with LDPC 5We note that recent results suggest that uniform quantization with too small value of q may lead to error floor in the decoding. Interested readers are referred to =-=[23]-=-. ZHONG AND ZHANG: BLOCK-LDPC 775 codes constructed without any implementation-oriented constraints. Leveraging the implementation-oriented constraints, we developed a pipelined partially parallel Blo... |

2 |
Efficient encoding for a family of quasi-cyclic LDPC codes
- Hocevar
- 2003
(Show Context)
Citation Context ...ular, the encoding complexity can be largely reduced by performing the encoding directly based on the sparse parity check matrix. Most recently proposed low-complexity encoder hardware design schemes =-=[15]-=-–[17] essentially follow this idea. The above summarized state-of-the-art LDPC encoder/decoder design practice shows that the essence of joint design is to apply certain implementation-oriented constr... |