A simplified computational kernel for trellis-based decoding

Summary, in English

A simplified branch metric and add-compare-select (ACS) unit is presented for use in trellis-based decoding architectures. The simplification is based on a complementary property of best feedforward and some systematic feedback encoders. As a result, one adder is saved in every other ACS unit. Furthermore, only half the branch metrics have to be calculated. It is shown that this simplification becomes especially beneficial for rate 1/2 convolutional codes. Consequently, area and power consumption will be reduced in a hardware implementation.

• Författare: Matthias Kamuf; John B Anderson; Viktor Öwall
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• Publiceringsår: 2004
• Språk: Engelska
• Sidor: 156-158
• Publikation/Tidskrift/Serie: IEEE Communications Letters
• Volym: 8
• Issue: 3
• Fulltext: - 103 kB; Download statistics
• Länkar: http://dx.doi.org/10.1109/LCOMM.2004.825743
• Dokumenttyp: Artikel i tidskrift
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Nyckelord: very large-scale; Viterbi decoding; integration (VLSI); logMAP; branch metric; add-compare-select (ACS)
• Status: Published
• Projekt: Digital ASIC: Flexible Coding and Decoding for Wireless Personal Area Networks
• Forskningsgrupp: Elektronikkonstruktion; Informations- och kommunikationsteori
• ISBN/ISSN/Övrigt: ISSN: 1089-7798