Cheng, Jung-Fu and McEliece, Robert J. (1995) Unit-memory Hamming turbo codes. In: IEEE International Symposium on Information Theory (ISIT '95), Whistler, British Columbia, 17-22 September 1995. IEEE , Piscataway, NJ, p. 33. ISBN 0-7803-2453-6. https://resolver.caltech.edu/CaltechAUTHORS:CHEisit95b
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 124kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:CHEisit95b
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.
| Item Type: | Book Section | ||||||
|---|---|---|---|---|---|---|---|
| Related URLs: |
| ||||||
| Additional Information: | © Copyright 1995 IEEE. Reprinted with permission. | ||||||
| DOI: | 10.1109/ISIT.1995.531135 | ||||||
| Record Number: | CaltechAUTHORS:CHEisit95b | ||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:CHEisit95b | ||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||
| ID Code: | 7357 | ||||||
| Collection: | CaltechAUTHORS | ||||||
| Deposited By: | Archive Administrator | ||||||
| Deposited On: | 05 Feb 2007 | ||||||
| Last Modified: | 08 Nov 2021 20:42 |
Repository Staff Only: item control page
