Unit-memory Hamming turbo codes

Abstract

Several parallel concatenated coding schemes (turbo codes) based on multimemory (MM) convolutional codes (more specifically, a (2,1,4,7) code) were proposed to achieve near Shannon-limit error correction performance with reasonable decoding complexity. On the other hand, in many cases of interest, unit-memory (UM) codes have been demonstrated to have larger free distances than the MM codes with the same rate and the same number of memory elements. New turbo codes based on the (8, 4, 3, 8) UM Hamming code are developed and shown to possess better performance potential in some senses. The standard turbo decoding algorithms, however, do not appear to achieve this potential.

Files

Additional details