Minimum decoding trellis lengths for tail-biting convolutional codes

Authors
Sung, WJ
Citation
Wj. Sung, Minimum decoding trellis lengths for tail-biting convolutional codes, ELECTR LETT, 36(7), 2000, pp. 643-645
Citations number
6
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
ELECTRONICS LETTERS
ISSN journal
00135194 → ACNP
Volume
36
Issue
7
Year of publication
2000
Pages
643 - 645
Database
ISI
SICI code
0013-5194(20000330)36:7<643:MDTLFT>2.0.ZU;2-T
Abstract
Circular decoding is a simple decoding algorithm for tail-biting convolutio nal codes that essentially achieves maximum-likelihood decoding performance . An investigation into the minimum required length of the decoding trellis for circular decoding is presented for optimum free-distance codes of rate s 1/2, 1/3 and 1/4.