|
BEACON eSpace at Jet Propulsion Laboratory >
JPL Technical Report Server >
JPL TRS 1992+ >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2014/38833
|
| Title: | Maximum likelihood decoding analysis of Accumulate-Repeat-Accumulate Codes |
| Authors: | Abbasfar, Aliazam
Divsalar, Dariush
Yao, Kung |
| Keywords: | weight distribution
upper bounds
asymptotic thresholds
low density parity codes (LDPC) |
| Issue Date: | 29-Nov-2004 |
| Publisher: | Pasadena, CA : Jet Propulsion Laboratory, National Aeronautics and Space Administration, 2004. |
| Citation: | IEEE Global Telecommunications Conference, Dallas, Texas, November 29-December 3, 2004. |
| Abstract: | Repeat-Accumulate (RA) codes are the simplest turbo-like codes that achieve good performance. However, they cannot compete with Turbo codes or low-density parity check codes (LDPC) as far as performance is concerned. The Accumulate Repeat Accumulate (ARA) codes, as a subclass of LDPC codes, are obtained by adding a pre-coder in front of RA codes with puncturing where an accumulator is chosen as a precoder. These codes not only are very simple, but also achieve excellent performance with iterative decoding. In this paper, the performance of these codes with (ML) decoding are analyzed and compared to random codes by very tight bounds. The weight distribution of some simple ARA codes is obtained, and through existing tightest bounds we have shown the ML SNR threshold of ARA codes approaches very closely to the performance of random codes. We have shown that the use of precoder improves the SNR threshold but interleaving gain remains unchanged with respect to RA code with puncturing. |
| URI: | http://hdl.handle.net/2014/38833 |
| Appears in Collections: | JPL TRS 1992+
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
