Bit-Interleaved Coded Modulation
Foundations and Trends in Communications and Information Theory
Construction of repeat accumulate codes with superimposed structured interleavers
MUSP'09 Proceedings of the 9th WSEAS international conference on Multimedia systems & signal processing
New code construction method and high-speed VLSI codec architecture for repeat-accumulate codes
WSEAS TRANSACTIONS on COMMUNICATIONS
Design and analysis of E2RC codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
IEEE Transactions on Signal Processing
Coherent continuous-phase frequency-shift keying: parameter optimization and code design
IEEE Transactions on Wireless Communications
Demultiplexer design for multi-edge type LDPC coded modulation
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Jointly decoded raptor codes: analysis and design for the BIAWGN channel
EURASIP Journal on Wireless Communications and Networking
Bandwidth-efficient modulation codes based on nonbinary irregular repeat-accumulate codes
IEEE Transactions on Information Theory
Global design methods for raptor codes using binary and higher-order modulations
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
A linear encoding approach to index assignment in lossy source-channel coding
IEEE Transactions on Information Theory
Design of Efficiently Encodable Rate-Compatible LDPC Codes Using Vandermonde Extension Matrices
Wireless Personal Communications: An International Journal
| Hi-index | 754.96 |
We optimize the random-like ensemble of irregular repeat-accumulate (IRA) codes for binary-input symmetric channels in the large block-length limit. Our optimization technique is based on approximating the evolution of the densities (DE) of the messages exchanged by the belief-propagation (BP) message-passing decoder by a one-dimensional dynamical system. In this way, the code ensemble optimization can be solved by linear programming. We propose four such DE approximation methods, and compare the performance of the obtained code ensembles over the binary-symmetric channel (BSC) and the binary-antipodal input additive white Gaussian noise channel (BIAWGNC). Our results clearly identify the best among the proposed methods and show that the IRA codes obtained by these methods are competitive with respect to the best known irregular low-density parity-check (LDPC) codes. In view of this and the very simple encoding structure of IRA codes, they emerge as attractive design choices.