Investigation of near Shannon limit coding schemes [microform] / S.C. Kwatra, J. Kim, and Fan Mo.
"Turbo codes can deliver performance that is very close to the Shannon limit. This report investigates algorithms for convolutional turbo codes and block turbo codes. Both coding schemes can achieve performance near Shannon limit. The performance of the schemes is obtained using computer simula...
Saved in:
| Online Access: |
Click here to view full text online |
|---|---|
| Main Author: | |
| Corporate Author: | |
| Other Authors: | , |
| Format: | Government Document Microfilm Book |
| Language: | English |
| Published: |
[Cleveland, Ohio] : [Springfield, Va.] :
National Aeronautics and Space Administration, Glenn Research Center ; [National Technical Information Service, distributor],
[1999]
|
| Series: | NASA contractor report ;
NASA CR-209402. |
| Subjects: |
| Summary: | "Turbo codes can deliver performance that is very close to the Shannon limit. This report investigates algorithms for convolutional turbo codes and block turbo codes. Both coding schemes can achieve performance near Shannon limit. The performance of the schemes is obtained using computer simulations. There are three sections in this report. First section is the introduction. The fundamental knowledge about coding, block coding and convolutional coding is discussed. In the second section, the basic concepts of convolutional turbo codes are introduced and the performance of turbo codes, especially high rate turbo codes, is provided from the simulation results. After introducing all the parameters that help turbo codes achieve such a good performance, it is concluded that output weight distribution should be the main consideration in designing turbo codes. Based on the output weight distribution, the performance bounds for turbo codes are given. Then, the relationships between the output weight distribution and the factors like generator polynomial, interleaver and puncturing pattern are examined. The criterion for the best selection of system components is provided. The puncturing pattern algorithm is discussed in detail. Different puncturing patterns are compared for each high rate. For most of the high rate codes, the puncturing pattern does not show any significant effect on the code performance if pseudo - random interleaver is used in the system. For some special rate codes with poor performance, an alternative puncturing algorithm is designed which restores their performance close to the Shannon limit. Finally, in section three, for iterative decoding of block codes, the method of building trellis for block codes, the structure of the iterative decoding system and the calculation of extrinsic values are discussed."--NASA Technical Reports Server web site. Coding; Modulation; Communications. |
|---|---|
| Physical Description: | 1 volume. Available in microfiche and via the Internet. |
| Additional Physical Form available Note: | Available in microfiche and via the Internet. |