On the decoding bit error probability for binary convolutional codes
(2000) 2000 International Symposium on Information Theory p.398-398- Abstract
- An explanation is given for the paradoxical fact that, at low signal-to-noise ratios, the systematic feedback encoder results in fewer decoding bit errors than does a nonsystematic feedforward encoder for the same code. The analysis identifies a new code property, the d-distance weight density of the code. For a given d-distance weight density, the decoding bit error probability depends on the number of taps in the realization of the encoder inverse. Among all encoders for a given convolutional code, the systematic one has the simplest encoder inverse and, hence, gives the smallest bit error probability
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1057092
- author
- Johannesson, Rolf LU ; Massey, James L. LU and Ståhl, Per LU
- organization
- publishing date
- 2000
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- [Host publication title missing]
- pages
- 398 - 398
- conference name
- 2000 International Symposium on Information Theory
- conference location
- Sorrento, Italy
- conference dates
- 2000-06-21 - 2000-06-25
- external identifiers
-
- scopus:0034449221
- ISBN
- 0-7803-5857-0
- DOI
- 10.1109/ISIT.2000.866696
- language
- English
- LU publication?
- yes
- id
- 3efd3f4a-6f57-42e9-ab32-a21746693f3d (old id 1057092)
- date added to LUP
- 2016-04-04 14:00:23
- date last changed
- 2022-01-30 01:18:03
@inproceedings{3efd3f4a-6f57-42e9-ab32-a21746693f3d, abstract = {{An explanation is given for the paradoxical fact that, at low signal-to-noise ratios, the systematic feedback encoder results in fewer decoding bit errors than does a nonsystematic feedforward encoder for the same code. The analysis identifies a new code property, the d-distance weight density of the code. For a given d-distance weight density, the decoding bit error probability depends on the number of taps in the realization of the encoder inverse. Among all encoders for a given convolutional code, the systematic one has the simplest encoder inverse and, hence, gives the smallest bit error probability}}, author = {{Johannesson, Rolf and Massey, James L. and Ståhl, Per}}, booktitle = {{[Host publication title missing]}}, isbn = {{0-7803-5857-0}}, language = {{eng}}, pages = {{398--398}}, title = {{On the decoding bit error probability for binary convolutional codes}}, url = {{https://lup.lub.lu.se/search/files/6257743/1059351.pdf}}, doi = {{10.1109/ISIT.2000.866696}}, year = {{2000}}, }