ISIT 2003, IEEE International Symposium on Information Theory, June 29-July 4, 2003, Yokohama, Japan
We optimize the low-complexity random-like ensemble of irregular repeat accumulate (IRA) codes for binary-input symmetric channels in the large blocklength limit. IRA codes Jin, H et al. (2000) are special subclasses of both irregular LDPCs and irregular turbo codes. We present numerical results for the BIAWGNC and formulate the density evolution (DE) Richardson, TJ et al. (2001) for IRA codes. We study the stability condition of the fixed-point corresponding to zero BER.
Type:
Conférence
City:
Yokohama
Date:
2003-06-29
Department:
Systèmes de Communication
Eurecom Ref:
1215
Copyright:
© 2003 IEEE. 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 to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:
