Woven convolutional codes II: Decoding aspects
Författare
Summary, in English
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.
Publiceringsår
2004
Språk
Engelska
Sidor
2522-2529
Publikation/Tidskrift/Serie
IEEE Transactions on Information Theory
Volym
50
Issue
10
Dokumenttyp
Artikel i tidskrift
Förlag
IEEE - Institute of Electrical and Electronics Engineers Inc.
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Nyckelord
- free
- concatenated convolutional codes
- convolutional interleaving
- distance
- iterative decoding
- woven convolutional codes
Status
Published
ISBN/ISSN/Övrigt
- ISSN: 0018-9448