CONSTRUCTION OF SHORT-LENGTH HIGH-RATES LDPC CODES USING DIFFERENCE FAMILIES
| Main Authors: | Deny Hamdani, Ery Safrianti |
|---|---|
| Format: | Article application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
Directorate of Research and Community Engagement, Universitas Indonesia
, 2010
|
| Online Access: |
http://journal.ui.ac.id/index.php/technology/article/view/438 |
Daftar Isi:
- Low-density parity-check (LDPC) code is linear-block error-correcting code defined by sparse parity-check matrix. It isdecoded using the massage-passing algorithm, and in many cases, capable of outperforming turbo code. This paperpresents a class of low-density parity-check (LDPC) codes showing good performance with low encoding complexity.The code is constructed using difference families from combinatorial design. The resulting code, which is designed tohave short code length and high code rate, can be encoded with low complexity due to its quasi-cyclic structure, andperforms well when it is iteratively decoded with the sum-product algorithm. These properties of LDPC code are quitesuitable for applications in future wireless local area network.Keywords: low-density parity-check codes, quasi-cyclic codes, difference families, combinatorial design, iterativedecoding, wireless local area network