Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Design of Irregular Repeat Accumulate Codes with Joint Degree Distributions Kenta KASAI Shinya MIYAMOTO Tomoharu SHIBUYA Kohichi SAKANIWA Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E89-A No.11 pp.3351-3354 Publication Date: 2006/11/01 Online ISSN: 1745-1337 DOI: 10.1093/ietfec/e89-a.11.3351 Print ISSN: 0916-8508 Type of Manuscript: LETTER Category: Coding Theory Keyword: irregular repeat accumulate codes, joint degree distribution, iterative decoding, density evolution, belief propagation, Full Text: PDF(121.3KB)>>
Summary: Irregular Repeat-Accumulate (IRA) codes, introduced by Jin et al., have a linear-time encoding algorithm and their decoding performance is comparable to that of irregular low-density parity-check (LDPC) codes. Meanwhile the authors have introduced detailedly represented irregular LDPC code ensembles specified with joint degree distributions between variable nodes and check nodes. In this paper, by using density evolution method [7],[8], we optimize IRA codes specified with joint degree distributions. Resulting codes have higher thresholds than Jin's IRA codes. | ||||||||||
| ||||||||||
