On the decoding bit error probability for binary convolutional codes

Rolf Johannesson, James L. Massey, Per Ståhl

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

164 Downloads (Pure)

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
Original languageEnglish
Title of host publication[Host publication title missing]
Pages398
DOIs
Publication statusPublished - 2000
Event2000 International Symposium on Information Theory - Sorrento, Italy
Duration: 2000 Jun 212000 Jun 25

Conference

Conference2000 International Symposium on Information Theory
Country/TerritoryItaly
CitySorrento
Period2000/06/212000/06/25

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Fingerprint

Dive into the research topics of 'On the decoding bit error probability for binary convolutional codes'. Together they form a unique fingerprint.

Cite this