1998
DOI: 10.1109/49.661112
|View full text |Cite
|
Sign up to set email alerts
|

A conceptual framework for understanding turbo codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
34
0

Year Published

1998
1998
2014
2014

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 49 publications
(36 citation statements)
references
References 19 publications
2
34
0
Order By: Relevance
“…It should be kept in mind that, as far as capacity-achieving codes are concerned, the minimum Euclidean distance has little relevance: it is the whole distance spectrum that counts [414]. This is classically demonstrated by the features of turbo codes [359], which exhibit a relatively poor minimum distance and yet approach capacity rather remarkably.…”
Section: Designing Fading Codes: the Impact Of Hamming Distancementioning
confidence: 99%
“…It should be kept in mind that, as far as capacity-achieving codes are concerned, the minimum Euclidean distance has little relevance: it is the whole distance spectrum that counts [414]. This is classically demonstrated by the features of turbo codes [359], which exhibit a relatively poor minimum distance and yet approach capacity rather remarkably.…”
Section: Designing Fading Codes: the Impact Of Hamming Distancementioning
confidence: 99%
“…Interleaving introduces the random component necessary for good coding schemes, as stated by the principles of information theory [33]. Although a lot of research has been carried out regarding design of good interleavers.…”
Section: Collision-free Interleaver Designmentioning
confidence: 99%
“…SPCPC has the same basic features of turbo codes: interleaving, iteration and soft-output decoding [2]. Rankin presented a soft input, soft output-based decoding algorithm for SPCPC [3].…”
Section: Introductionmentioning
confidence: 99%