Diagonal Low-Density Parity-Check Code for Simplified Routing in Decoder Conference Paper uri icon

abstract

  • We propose a novel Low-Density Parity-Check (LDPC) decoder design methodology by introducing a special code named Diagonal-LDPC (DLDPC) code. An LPDC code, defined by a parity check matrix H, can be represented by a bipartite graph. To address the complex routing problem in the LDPC decoder implementation, a partitioned bipartite-graph code is proposed and generalized to a DLDPC code having constraint of positioning 1's near the diagonal area. This structured code simplifies the routing problem [1] [2] [3] and enables cell-based highly regular fully-parallel decoder design without compromising the code performance. © 2005 IEEE.

author list (cited authors)

  • Kim, E., & Choi, G. S.

citation count

  • 6

publication date

  • January 2005

publisher