Name
Abstract | ||
|---|---|---|
This article presents a tutorial overview of the class of concatenated convolutional codes with interleavers, also known as turbo-like codes. They are powerful codes, formed by a number of encoders connected through interleavers, endowed by a decoding algorithm that splits the decoding burden into separate decoding of each individual code. Refinement of successive estimates of the information sequence is obtained by iterating the procedure of passing from one decoder to the other likelihood information decorrelated by the interleaver action. The key issues of code analysis and design are covered at the level of broad comprehension, without paying attention to analytical details. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/MCOM.2003.1222725 | IEEE Communications Magazine |
Keywords | Field | DocType |
turbo-like code,decoding burden,code analysis,separate decoding,concatenated convolutional code,information sequence,decoding algorithm,individual code,powerful code,likelihood information,convolutional code,turbo codes,concatenated codes,decorrelation,convolutional codes | Concatenated error correction code,Convolutional code,Sequential decoding,Computer science,Serial concatenated convolutional codes,Turbo code,Block code,Algorithm,Theoretical computer science,Linear code,List decoding,Distributed computing | Journal |
Volume | Issue | ISSN |
41 | 8 | 0163-6804 |
Citations | PageRank | References |
29 | 1.44 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Benedetto | 1 | 883 | 167.24 |
| Guido Montorsi | 2 | 1032 | 179.05 |
| D. Divsalar | 3 | 1628 | 499.31 |