Simple construction of multiple interleavers for concatenated zigzag codes
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Quasi-systematic doped LT codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Accumulate codes based on 1+D convolutional outer codes
IEEE Transactions on Communications
Improved low complexity hybrid turbo codes and their performance analysis
IEEE Transactions on Communications
Simple capacity-achieving ensembles of rateless erasure-correcting codes
IEEE Transactions on Communications
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
| Hi-index | 754.84 |
This paper introduces a family of error-correcting codes called zigzag codes. A zigzag code is described by a highly structured zigzag graph. Due to the structural properties of the graph, very low-complexity soft-in/soft-out decoding rules can be implemented. We present a decoding rule, based on the Max-Log-APP (MLA) formulation, which requires a total of only 20 addition-equivalent operations per information bit, per iteration. Simulation of a rate-1/2 concatenated zigzag code with four constituent encoders with interleaver length 65 536, yields a bit error rate (BER) of 10-5 at 0.9 dB and 1.3 dB away from the Shannon limit by optimal (APP) and low-cost suboptimal (MLA) decoders, respectively. A union bound analysis of the bit error probability of the zigzag code is presented. It is shown that the union bounds for these codes can be generated very efficiently. It is also illustrated that, for a fixed interleaver size, the concatenated code has increased code potential as the number of constituent encoders increases. Finally, the analysis shows that zigzag codes with four or more constituent encoders have lower error floors than comparable turbo codes with two constituent encoders