Upper bound on the minimum distance of turbo codes
| Autor: | J.B. Huber, M. Breiling |
|---|---|
| Rok vydání: | 2001 |
| Předmět: |
Discrete mathematics
Block code BCJR algorithm Concatenated error correction code Data_CODINGANDINFORMATIONTHEORY Serial concatenated convolutional codes Linear code Combinatorics Computer Science::Hardware Architecture Turbo equalizer Reed–Solomon error correction Turbo code Electrical and Electronic Engineering Computer Science::Information Theory Mathematics |
| Zdroj: | IEEE Transactions on Communications. 49:808-815 |
| ISSN: | 0090-6778 |
| DOI: | 10.1109/26.923804 |
| Popis: | An upper bound on the minimum distance of turbo codes is derived, which depends only on the interleaver length and the component scramblers employed. The derivation of this bound considers exclusively turbo encoder input words of weight 2. The bound does not only hold for a particular interleaver but for all possible interleavers including the best. It is shown that in contrast to general linear binary codes the minimum distance of turbo codes cannot grow stronger than the square root of the block length. This implies that turbo codes are asymptotically bad. A rigorous proof for the bound is provided, which is based on a geometric approach. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|