Advanced

Encoder and distance properties of woven convolutional codes with one tailbiting component code

Handlery, Marc LU ; Johannesson, Rolf LU and Zyablov, Viktor V. (2002) In Problems of Information Transmission 38(1). p.41-49
Abstract
Woven convolutional codes with one tailbiting component code are studied and their generator matrices are given. It is shown that, if the constituent encoders are identical, a woven convolutional encoder with an outer convolutional warp and one inner tailbiting encoder (WIT) generates the same code as a woven convolutional encoder with one outer tailbiting encoder and an inner convolutional warp (WOT). However, for rate R tb < 1 tailbiting encoders, the WOT cannot be an encoder realization with a minimum number of delay elements. Lower bounds on the free distance and active distances of woven convolutional codes with a tailbiting component code are given. These bounds are equal to those for woven codes consisting exclusively of... (More)
Woven convolutional codes with one tailbiting component code are studied and their generator matrices are given. It is shown that, if the constituent encoders are identical, a woven convolutional encoder with an outer convolutional warp and one inner tailbiting encoder (WIT) generates the same code as a woven convolutional encoder with one outer tailbiting encoder and an inner convolutional warp (WOT). However, for rate R tb < 1 tailbiting encoders, the WOT cannot be an encoder realization with a minimum number of delay elements. Lower bounds on the free distance and active distances of woven convolutional codes with a tailbiting component code are given. These bounds are equal to those for woven codes consisting exclusively of unterminated convolutional codes. However, for woven convolutional codes with one tailbiting component code, the conditions for the bounds to hold are less strict. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
Problems of Information Transmission
volume
38
issue
1
pages
41 - 49
publisher
Springer
external identifiers
  • scopus:0036034217
ISSN
0032-9460
DOI
10.1023/A:1020042222802
language
English
LU publication?
yes
id
f2282cf5-53cb-4a5d-9c1f-a2be2ff3a249 (old id 628526)
date added to LUP
2007-11-26 13:50:34
date last changed
2017-01-01 07:20:23
@article{f2282cf5-53cb-4a5d-9c1f-a2be2ff3a249,
  abstract     = {Woven convolutional codes with one tailbiting component code are studied and their generator matrices are given. It is shown that, if the constituent encoders are identical, a woven convolutional encoder with an outer convolutional warp and one inner tailbiting encoder (WIT) generates the same code as a woven convolutional encoder with one outer tailbiting encoder and an inner convolutional warp (WOT). However, for rate R tb &lt; 1 tailbiting encoders, the WOT cannot be an encoder realization with a minimum number of delay elements. Lower bounds on the free distance and active distances of woven convolutional codes with a tailbiting component code are given. These bounds are equal to those for woven codes consisting exclusively of unterminated convolutional codes. However, for woven convolutional codes with one tailbiting component code, the conditions for the bounds to hold are less strict.},
  author       = {Handlery, Marc and Johannesson, Rolf and Zyablov, Viktor V.},
  issn         = {0032-9460},
  language     = {eng},
  number       = {1},
  pages        = {41--49},
  publisher    = {Springer},
  series       = {Problems of Information Transmission},
  title        = {Encoder and distance properties of woven convolutional codes with one tailbiting component code},
  url          = {http://dx.doi.org/10.1023/A:1020042222802},
  volume       = {38},
  year         = {2002},
}