Woven convolutional codes II: Decoding aspects

Research output: Contribution to journalArticle

Standard

Woven convolutional codes II: Decoding aspects. / Jordan, R; Höst, Stefan; Johannesson, Rolf; Bossert, M; Zyablov, VV.

In: IEEE Transactions on Information Theory, Vol. 50, No. 10, 2004, p. 2522-2529.

Research output: Contribution to journalArticle

Harvard

APA

CBE

MLA

Vancouver

Author

Jordan, R ; Höst, Stefan ; Johannesson, Rolf ; Bossert, M ; Zyablov, VV. / Woven convolutional codes II: Decoding aspects. In: IEEE Transactions on Information Theory. 2004 ; Vol. 50, No. 10. pp. 2522-2529.

RIS

TY - JOUR

T1 - Woven convolutional codes II: Decoding aspects

AU - Jordan, R

AU - Höst, Stefan

AU - Johannesson, Rolf

AU - Bossert, M

AU - Zyablov, VV

PY - 2004

Y1 - 2004

N2 - An iterative decoding scheme for woven convolutional codes is presented. It operates in a window sliding over the received sequence. This exploits the nature of convolutional codewords as infinite sequences and reflects the concept of considering convolutional encoding and decoding as a continuous process. The decoder is analyzed in terms of decoding delay and decoding complexity. Its basic building block is a symbol-by-symbol a posteriori probability (APP) decoder for convolutional codes, which is a windowed variant of the well-known Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm. Additional interleaving for the woven constructions is introduced by employing convolutional scramblers. It is shown that row-wise random interleaving preserves the lower bound on the free distance of the original woven constructions. Based on the properties of the interleavers, new lower bounds on the free distance of woven constructions with both outer warp and inner warp are derived. Simulation results for woven convolutional codes with and without additional interleaving are presented.

AB - An iterative decoding scheme for woven convolutional codes is presented. It operates in a window sliding over the received sequence. This exploits the nature of convolutional codewords as infinite sequences and reflects the concept of considering convolutional encoding and decoding as a continuous process. The decoder is analyzed in terms of decoding delay and decoding complexity. Its basic building block is a symbol-by-symbol a posteriori probability (APP) decoder for convolutional codes, which is a windowed variant of the well-known Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm. Additional interleaving for the woven constructions is introduced by employing convolutional scramblers. It is shown that row-wise random interleaving preserves the lower bound on the free distance of the original woven constructions. Based on the properties of the interleavers, new lower bounds on the free distance of woven constructions with both outer warp and inner warp are derived. Simulation results for woven convolutional codes with and without additional interleaving are presented.

KW - free

KW - concatenated convolutional codes

KW - convolutional interleaving

KW - distance

KW - iterative decoding

KW - woven convolutional codes

U2 - 10.1109/TIT.2004.834790

DO - 10.1109/TIT.2004.834790

M3 - Article

VL - 50

SP - 2522

EP - 2529

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 10

ER -