Published 1995 | Version public
Book Section - Chapter Open

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.

Additional Information

© Copyright 1995 IEEE. Reprinted with permission.

Files

CHEisit95b.pdf

Files (124.9 kB)

Name Size Download all
md5:6e0f6fee88542f033ff94a5636433d53
124.9 kB Preview Download

Additional details

Identifiers

Eprint ID
7357
Resolver ID
CaltechAUTHORS:CHEisit95b

Dates

Created
2007-02-05
Created from EPrint's datestamp field
Updated
2021-11-08
Created from EPrint's last_modified field