Tales of Tailbiting Codes
(2002)- Abstract
- Tailbiting codes are error correcting codes and can be used in digital transmission systems. They are obtained by terminating convolutional codes into block codes. This thesis consists of an introduction to convolutional and tailbiting codes, and the Papers A--G that include the main results. In Paper A, the error correcting capability of tailbiting codes is described via the active distances for convolutional codes. This leads to a new upper bound on the block error probability of tailbiting codes. A lower bound on the minimum distance as a function of the length of a tailbiting code is given. It can be applied when designing concatenated coding schemes.
An efficient algorithm that computes coefficients of the distance... (More) - Tailbiting codes are error correcting codes and can be used in digital transmission systems. They are obtained by terminating convolutional codes into block codes. This thesis consists of an introduction to convolutional and tailbiting codes, and the Papers A--G that include the main results. In Paper A, the error correcting capability of tailbiting codes is described via the active distances for convolutional codes. This leads to a new upper bound on the block error probability of tailbiting codes. A lower bound on the minimum distance as a function of the length of a tailbiting code is given. It can be applied when designing concatenated coding schemes.
An efficient algorithm that computes coefficients of the distance spectrum of a convolutional code or a tailbiting code is presented in Paper B. It was used in code searches resulting in tables of convolutional and tailbiting codes that are superior to the best previously known codes. Furthermore, two new maximum-likelihood decoding algorithms for tailbiting codes are presented.
Tailbiting codes are in general generated by convolutional encoders with large active distance-slopes. In Paper C, bounds on the active distance-slope are presented. Moreover, the active distance-slope is used as a search criterion to find tailbiting codes that are better than previously known codes. In Paper D, the active distances are used to analyze the error correcting capability of convolutional codes when the encoder starting and ending states are unknown to the decoder. This description provides insight into suboptimal decoding algorithms for tailbiting codes.
It is demonstrated in Paper E that the quasi-cyclic behavior of tailbiting codes can be exploited to decrease their error probabilities when decoded suboptimally. Moreover, it is shown that a large active distance-slope has a positive effect on the performance of suboptimal tailbiting decoders.
Woven convolutional codes (WCC) are concatenated codes with many interesting properties. In Paper F, encoder and distance properties of WCCs with tailbiting component codes are investigated. Finally, in Paper G, error exponents are derived for these WCCs. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/464841
- author
- Handlery, Marc LU
- supervisor
- opponent
-
- Prof Wolf, Jack K., University of California, San Diego
- organization
- publishing date
- 2002
- type
- Thesis
- publication status
- published
- subject
- keywords
- maximum-likelihood decoding algorithm, minimum distance, active distance, woven convolutional code, tailbiting termination method, convolutional code, tailbiting code, Informatics, systems theory, Informatik, systemteori
- pages
- 201 pages
- publisher
- Department of Information Technology, Lund Univeristy
- defense location
- E:1406, E-huset, LTH
- defense date
- 2002-09-18 10:15:00
- ISBN
- 91-7167-026-2
- language
- English
- LU publication?
- yes
- additional info
- Article: I. E. Bocharova, M. Handlery, R. Johannesson, and B. D. Kudryashov, ``Tailbiting codes obtained via convolutional codes with large active distance-slopes'', IEEE Transaction on Information Theory, Sept. 2002. Article: Paper D: Article: M. Handlery, R. Johannesson, and V. V. Zyablov, ``A Distance approach to window decoding'', Problems of Information Transmission, vol. 38/3, 2002. Article: Paper E: Article: M. Handlery, R. Johannesson, and V. V. Zyablov, ``Boosting the error performance of suboptimal tailbiting decoders'', submitted to IEEE Transaction on Communications, revised, May 2002. Article: Paper F: Article: M. Handlery, R. Johannesson, and V. V. Zyablov, ``Encoder and distance properties of woven convolutional codes with one tailbiting component code'', Problems of Information Transmission, vol. 38/1, 2002. Article: Paper G: Article: M. Handlery, R. Johannesson, and V. V. Zyablov, ``On error exponents for woven convolutional codes with one tailbiting component code'',submitted to IEEE Transaction on Information Theory, Feb. 2002.
- id
- 1b1a6228-77ef-4bc0-8121-44745fdda3bb (old id 464841)
- date added to LUP
- 2016-04-04 11:41:43
- date last changed
- 2018-11-21 21:06:34
@phdthesis{1b1a6228-77ef-4bc0-8121-44745fdda3bb,
abstract = {{Tailbiting codes are error correcting codes and can be used in digital transmission systems. They are obtained by terminating convolutional codes into block codes. This thesis consists of an introduction to convolutional and tailbiting codes, and the Papers A--G that include the main results. In Paper A, the error correcting capability of tailbiting codes is described via the active distances for convolutional codes. This leads to a new upper bound on the block error probability of tailbiting codes. A lower bound on the minimum distance as a function of the length of a tailbiting code is given. It can be applied when designing concatenated coding schemes.<br/><br>
<br/><br>
An efficient algorithm that computes coefficients of the distance spectrum of a convolutional code or a tailbiting code is presented in Paper B. It was used in code searches resulting in tables of convolutional and tailbiting codes that are superior to the best previously known codes. Furthermore, two new maximum-likelihood decoding algorithms for tailbiting codes are presented.<br/><br>
<br/><br>
Tailbiting codes are in general generated by convolutional encoders with large active distance-slopes. In Paper C, bounds on the active distance-slope are presented. Moreover, the active distance-slope is used as a search criterion to find tailbiting codes that are better than previously known codes. In Paper D, the active distances are used to analyze the error correcting capability of convolutional codes when the encoder starting and ending states are unknown to the decoder. This description provides insight into suboptimal decoding algorithms for tailbiting codes.<br/><br>
<br/><br>
It is demonstrated in Paper E that the quasi-cyclic behavior of tailbiting codes can be exploited to decrease their error probabilities when decoded suboptimally. Moreover, it is shown that a large active distance-slope has a positive effect on the performance of suboptimal tailbiting decoders.<br/><br>
<br/><br>
Woven convolutional codes (WCC) are concatenated codes with many interesting properties. In Paper F, encoder and distance properties of WCCs with tailbiting component codes are investigated. Finally, in Paper G, error exponents are derived for these WCCs.}},
author = {{Handlery, Marc}},
isbn = {{91-7167-026-2}},
keywords = {{maximum-likelihood decoding algorithm; minimum distance; active distance; woven convolutional code; tailbiting termination method; convolutional code; tailbiting code; Informatics; systems theory; Informatik; systemteori}},
language = {{eng}},
publisher = {{Department of Information Technology, Lund Univeristy}},
school = {{Lund University}},
title = {{Tales of Tailbiting Codes}},
year = {{2002}},
}