Campus Units
Electrical and Computer Engineering
Document Type
Article
Publication Version
Submitted Manuscript
Publication Date
2-2009
Journal or Book Title
IEEE Transactions on Communications
Volume
59
Issue
2
First Page
365
Last Page
375
DOI
10.1109/TCOMM.2009.02.060233
Abstract
We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing over a wide range of rates and are suitable for usage in incremental redundancy hybrid-automatic repeat request (ARQ) systems. In addition, these codes are linear-time encodable with simple shift-register circuits. For a block length of 1200 bits the codes outperform optimized irregular LDPC codes and extended irregular repeat-accumulate (eIRA) codes for all puncturing rates 0.6~0.9 (base code performance is almost the same) and are particularly good at high puncturing rates where good puncturing performance has been previously difficult to achieve.
Rights
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Copyright Owner
IEEE
Copyright Date
2009
Language
en
File Format
application/pdf
Recommended Citation
Kim, Jaehong; Ramamoorthy, Aditya; and McLaughlin, Steven W., "The Design of Efficiently-Encodable Rate-Compatible LDPC Codes" (2009). Electrical and Computer Engineering Publications. 122.
https://lib.dr.iastate.edu/ece_pubs/122
Included in
Controls and Control Theory Commons, Signal Processing Commons, Systems and Communications Commons
Comments
This is a manuscript of an article from IEEE Transactions on Communications 59 (2009): 365, doi: 10.1109/TCOMM.2009.02.060233. Posted with permission.