- Title
- A family of irregular LDPC codes with low encoding complexity
- Creator
- Johnson, Sarah J.; Weller, Steven R.
- Relation
- IEEE Communications Letters Vol. 7, Issue 2, p. 79-81
- Publisher Link
- http://dx.doi.org/10.1109/LCOMM.2002.808375
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Resource Type
- journal article
- Date
- 2003
- Description
- We consider irregular quasi-cyclic low-density parity-check (LDPC) codes derived from difference families. The resulting codes can be encoded with low complexity and perform well when iteratively decoded with the sum-product algorithm.
- Subject
- difference families; iterative decoding; low encoding complexity; quasi-cyclic low-density parity-check codes; sum-product algorithm; sum-product decoding; computational complexity; cyclic codes; parity check codes
- Identifier
- uon:1838
- Identifier
- http://hdl.handle.net/1959.13/27612
- Identifier
- ISSN:1089-7798
- Rights
- Copyright © 2003 IEEE. Reprinted from IEEE Communications Letters, Vol. 7, Issue 2, p. 79-81. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Newcastle's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- Full Text
- Reviewed
- Hits: 1147
- Visitors: 2567
- Downloads: 715
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT01 | Publisher version (open access) | 279 KB | Adobe Acrobat PDF | View Details Download |