A distance approach to window decoding

Summary, in English

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.

• Författare: Marc Handlery; Rolf Johannesson; Viktor V. Zyablov
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• Publiceringsår: 2002
• Språk: Engelska
• Sidor: 169-181
• Publikation/Tidskrift/Serie: Problems of Information Transmission
• Volym: 38
• Issue: 3
• Länkar: http://dx.doi.org/10.1023/A:1020387017352
• Dokumenttyp: Artikel i tidskrift
• Förlag: Springer
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Status: Published
• ISBN/ISSN/Övrigt: ISSN: 0032-9460