The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

A simplified computational kernel for trellis-based decoding

På svenska

Author

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.

Publishing year

2004

Language

English

Pages

156-158

Publication/Series

IEEE Communications Letters

Volume

8

Issue

3

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • very large-scale
  • Viterbi decoding
  • integration (VLSI)
  • logMAP
  • branch metric
  • add-compare-select (ACS)

Status

Published

Project

  • Digital ASIC: Flexible Coding and Decoding for Wireless Personal Area Networks

Research group

  • Elektronikkonstruktion
  • Informations- och kommunikationsteori

ISBN/ISSN/Other

  • ISSN: 1089-7798