Systematic feed-forward convolutional encoders are better than other encoders with an M-algorithm decoder
(1998) In IEEE Transactions on Information Theory 44. p.831-838- Abstract
- Consider nonbacktracking convolutional decoders that keep a fixed number of trellis survivors. It is shown that the error performance of these depends on the early part of the distance profile and on the number of survivors kept, and not on the free distance or the details of the code generators. Particularly, the encoder may be feedforward systematic without loss. Furthermore, this kind of encoder solves the correct path loss problem in reduced-search decoders. Other kinds do not. Therefore, with almost any other decoding method than the Viterbi algorithm, systematic feed-forward encoders should be used. The conclusions in this correspondence run counter to much accepted wisdom about convolutional codes
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1056643
- author
- Osthoff, Harro ; Anderson, John B LU ; Johannesson, Rolf LU and Lin, Chin-foo
- organization
- publishing date
- 1998
- type
- Contribution to journal
- publication status
- published
- subject
- in
- IEEE Transactions on Information Theory
- volume
- 44
- pages
- 831 - 838
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- scopus:0032025839
- ISSN
- 0018-9448
- DOI
- 10.1109/18.661531
- language
- English
- LU publication?
- yes
- id
- 825b27ec-f9dd-4889-a4d8-4d515ff77991 (old id 1056643)
- date added to LUP
- 2016-04-04 09:32:49
- date last changed
- 2022-01-29 18:21:47
@article{825b27ec-f9dd-4889-a4d8-4d515ff77991, abstract = {{Consider nonbacktracking convolutional decoders that keep a fixed number of trellis survivors. It is shown that the error performance of these depends on the early part of the distance profile and on the number of survivors kept, and not on the free distance or the details of the code generators. Particularly, the encoder may be feedforward systematic without loss. Furthermore, this kind of encoder solves the correct path loss problem in reduced-search decoders. Other kinds do not. Therefore, with almost any other decoding method than the Viterbi algorithm, systematic feed-forward encoders should be used. The conclusions in this correspondence run counter to much accepted wisdom about convolutional codes}}, author = {{Osthoff, Harro and Anderson, John B and Johannesson, Rolf and Lin, Chin-foo}}, issn = {{0018-9448}}, language = {{eng}}, pages = {{831--838}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, series = {{IEEE Transactions on Information Theory}}, title = {{Systematic feed-forward convolutional encoders are better than other encoders with an M-algorithm decoder}}, url = {{https://lup.lub.lu.se/search/files/5353247/1058667.pdf}}, doi = {{10.1109/18.661531}}, volume = {{44}}, year = {{1998}}, }