Diagonal low-density parity-check code for simplified routing in decoder

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 implemen...

Full description

Saved in:
Bibliographic Details
Main Authors: Kim, E., Choi, G.S.
Format: Conference Proceeding
Language:English
Subjects:
Bandwidth
Bipartite graph
Bit error rate
Channel coding
Decoding
Design methodology
Hardware
Parity check codes
Routing
Signal to noise ratio
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 [Y. Kou et al, 2001] [R.M. Tanner et al, 2001] [H. Zhang et al, 2003] and enables cell-based highly regular fully-parallel decoder design without compromising the code performance.
ISSN:2162-3562
2162-3570
DOI:10.1109/SIPS.2005.1579966