IEEE International Conference on Communications, 2003. ICC '03.
DOI: 10.1109/icc.2003.1204466
|View full text |Cite
|
Sign up to set email alerts
|

LDPC code construction with flexible hardware implementation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
28
0

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 69 publications
(28 citation statements)
references
References 6 publications
0
28
0
Order By: Relevance
“…Zhang and Parhi [4] and Mansour and Shanbhag [5], [6] demonstrated that the decoder can be simplified for regular codes based on algebraically constructed Ramanujan graphs. Hocevar [7] showed a flexible hardware implementation of a code based on permutation matrices. This paper studies LDPC codes and proposes a code construction that produces codes with properties favoring hardware implementation along with good BER performance with low error floors.…”
Section: Introductionmentioning
confidence: 99%
“…Zhang and Parhi [4] and Mansour and Shanbhag [5], [6] demonstrated that the decoder can be simplified for regular codes based on algebraically constructed Ramanujan graphs. Hocevar [7] showed a flexible hardware implementation of a code based on permutation matrices. This paper studies LDPC codes and proposes a code construction that produces codes with properties favoring hardware implementation along with good BER performance with low error floors.…”
Section: Introductionmentioning
confidence: 99%
“…Although many architectures have been reported for flexible high speed LDPC decoders [6], [7], [8], [9], there has been much less work on flexible LDPC encoders. A flexible architecture that uses recursion to calculate parity bits was proposed in [10].…”
Section: Introductionmentioning
confidence: 99%
“…1 with g as small as possible; (2) It is a block structured matrix. These two constraints ensure the effective encoder and decoder hardware implementations.…”
Section: Implementation-aware Irregular Code Constructionmentioning
confidence: 99%
“…Since each non-zero block matrix is a right cyclic shift of an identity matrix, the access address for each memory block can be simply generated by a binary counter. We note that this design strategy shares the same basic idea with the state of the art decoder design [1][2][3].…”
Section: Ldpc Decoder Designmentioning
confidence: 99%
See 1 more Smart Citation