Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

On the decoding bit error probability for binary convolutional codes

Författare:
Publiceringsår: 2000
Språk: Engelska
Sidor: 398-398
Publikation/Tidskrift/Serie: [Host publication title missing]
Dokumenttyp: Konferensbidrag

Sammanfattning

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

Nyckelord

  • Electrical Engineering, Electronic Engineering, Information Engineering

Övriga

2000 International Symposium on Information Theory
Published
  • ISBN: 0-7803-5857-0

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu.se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen