Du är här

A distance approach to window decoding

Författare:
Publiceringsår: 2002
Språk: Engelska
Sidor: 169-181
Publikation/Tidskrift/Serie: Problems of Information Transmission
Volym: 38
Nummer: 3
Dokumenttyp: Artikel

Sammanfattning

In convolutional coding, code sequences have infinite length; thus, a maximum-likelihood decoder implies an infinite delay. Due to memory and delay constraints in practical coding schemes, convolutional codes often are either terminated or decoded by a window decoder. When a window decoder is used, the convolutional code sequence is not terminated; instead, the window decoder estimates information digits after receiving a finite number of noise-corrupted code symbols, thereby keeping the decoding delay short. An exact characterization of the error-correcting capability of window decoded convolutional codes is given by using active distances of convolutional codes.

Disputation

Nyckelord

  • Technology and Engineering

Övriga

Published
Yes
  • ISSN: 0032-9460

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

 

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