Advanced

A distance measure tailored to tailbiting codes

Höst, Stefan LU ; Johannesson, Rolf LU and Zyablov, Viktor V. (2002) In Problems of Information Transmission 38(4). p.280-295
Abstract
The error-correcting capability of tailbiting codes generated by convolutional encoders is described. In order to obtain a description beyond what the minimum distance d min of the tailbiting code implies, the active tailbiting segment distance is introduced. The description of correctable error patterns via active distances leads to an upper bound on the decoding block error probability of tailbiting codes. The necessary length of a tailbiting code so that its minimum distance is equal to the free distance d free of the convolutional code encoded by the same encoder is easily obtained from the active tailbiting segment distance. This is useful when designing and analyzing concatenated convolutional codes with component codes that are... (More)
The error-correcting capability of tailbiting codes generated by convolutional encoders is described. In order to obtain a description beyond what the minimum distance d min of the tailbiting code implies, the active tailbiting segment distance is introduced. The description of correctable error patterns via active distances leads to an upper bound on the decoding block error probability of tailbiting codes. The necessary length of a tailbiting code so that its minimum distance is equal to the free distance d free of the convolutional code encoded by the same encoder is easily obtained from the active tailbiting segment distance. This is useful when designing and analyzing concatenated convolutional codes with component codes that are terminated using the tailbiting method. Lower bounds on the active tailbiting segment distance and an upper bound on the ratio between the tailbiting length and memory of the convolutional generator matrix such that d min equals d free are derived. Furthermore, affine lower bounds on the active tailbiting segment distance suggest that good tailbiting codes are generated by convolutional encoders with large active-distance slopes. (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
4
pages
280 - 295
publisher
Springer
external identifiers
  • scopus:0036991635
ISSN
0032-9460
DOI
10.1023/A:1022097828917
language
English
LU publication?
yes
id
9789af59-10b5-4766-bdd9-b14cdee7a6b6 (old id 628522)
date added to LUP
2007-11-26 13:30:03
date last changed
2017-10-01 04:51:05
@article{9789af59-10b5-4766-bdd9-b14cdee7a6b6,
  abstract     = {The error-correcting capability of tailbiting codes generated by convolutional encoders is described. In order to obtain a description beyond what the minimum distance d min of the tailbiting code implies, the active tailbiting segment distance is introduced. The description of correctable error patterns via active distances leads to an upper bound on the decoding block error probability of tailbiting codes. The necessary length of a tailbiting code so that its minimum distance is equal to the free distance d free of the convolutional code encoded by the same encoder is easily obtained from the active tailbiting segment distance. This is useful when designing and analyzing concatenated convolutional codes with component codes that are terminated using the tailbiting method. Lower bounds on the active tailbiting segment distance and an upper bound on the ratio between the tailbiting length and memory of the convolutional generator matrix such that d min equals d free are derived. Furthermore, affine lower bounds on the active tailbiting segment distance suggest that good tailbiting codes are generated by convolutional encoders with large active-distance slopes.},
  author       = {Höst, Stefan and Johannesson, Rolf and Zyablov, Viktor V.},
  issn         = {0032-9460},
  language     = {eng},
  number       = {4},
  pages        = {280--295},
  publisher    = {Springer},
  series       = {Problems of Information Transmission},
  title        = {A distance measure tailored to tailbiting codes},
  url          = {http://dx.doi.org/10.1023/A:1022097828917},
  volume       = {38},
  year         = {2002},
}