Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

On error exponents for woven convolutional codes with one tailbiting component code

Handlery, Marc LU ; Johannesson, Rolf LU and Zyablov, VV (2004) In IEEE Transactions on Information Theory 50(8). p.1809-1811
Abstract
An error exponent for woven convolutional codes (WCC) with one tailbiting component code is derived. This error exponent is compared with that of the original WCC. It is shown that for WCC with outer warp, a better error exponent is obtained if the inner code is terminated with the tailbiting method. Furthermore, it is shown that the decoding error probability decreases exponentially with the square of the memory of the constituent convolutional encoders, while the decoding complexity grows exponentially only with the memory.
Please use this url to cite or link to this publication:
author
; and
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
woven, tailbiting code, convolutional code, error exponent, convolutional code (WCC)
in
IEEE Transactions on Information Theory
volume
50
issue
8
pages
1809 - 1811
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • wos:000222904200022
  • scopus:4043168545
ISSN
0018-9448
DOI
10.1109/TIT.2004.831857
language
English
LU publication?
yes
id
6d47ebdb-b56b-462e-aafc-58da673a3b63 (old id 272464)
date added to LUP
2016-04-01 16:22:40
date last changed
2022-01-28 19:17:44
@article{6d47ebdb-b56b-462e-aafc-58da673a3b63,
  abstract     = {{An error exponent for woven convolutional codes (WCC) with one tailbiting component code is derived. This error exponent is compared with that of the original WCC. It is shown that for WCC with outer warp, a better error exponent is obtained if the inner code is terminated with the tailbiting method. Furthermore, it is shown that the decoding error probability decreases exponentially with the square of the memory of the constituent convolutional encoders, while the decoding complexity grows exponentially only with the memory.}},
  author       = {{Handlery, Marc and Johannesson, Rolf and Zyablov, VV}},
  issn         = {{0018-9448}},
  keywords     = {{woven; tailbiting code; convolutional code; error exponent; convolutional code (WCC)}},
  language     = {{eng}},
  number       = {{8}},
  pages        = {{1809--1811}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  series       = {{IEEE Transactions on Information Theory}},
  title        = {{On error exponents for woven convolutional codes with one tailbiting component code}},
  url          = {{http://dx.doi.org/10.1109/TIT.2004.831857}},
  doi          = {{10.1109/TIT.2004.831857}},
  volume       = {{50}},
  year         = {{2004}},
}