On the decoding bit error probability for binary convolutional codes

Summary, in English

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: Rolf Johannesson; James L. Massey; Per Ståhl
• Department/s: Department of Electrical and Information Technology
• Publishing year: 2000
• Language: English
• Pages: 398-398
• Publication/Series: [Host publication title missing]
• Full text: - 134 kB; Download statistics
• Links: http://dx.doi.org/10.1109/ISIT.2000.866696
• Document type: Conference paper
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Conference name: 2000 International Symposium on Information Theory
• Conference date: 2000-06-21 - 2000-06-25
• Conference place: Sorrento, Italy
• Status: Published
• ISBN/ISSN/Other: ISBN: 0-7803-5857-0