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

A simplified computational kernel for trellis-based decoding

Författare:
Publiceringsår: 2004
Språk: Engelska
Sidor: 156-158
Publikation/Tidskrift/Serie: IEEE Communications Letters
Volym: 8
Nummer: 3
Dokumenttyp: Artikel i tidskrift
Förlag: IEEE--Institute of Electrical and Electronics Engineers Inc.

Sammanfattning

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.

Nyckelord

  • Electrical Engineering, Electronic Engineering, Information Engineering
  • very large-scale
  • Viterbi decoding
  • integration (VLSI)
  • logMAP
  • branch metric
  • add-compare-select (ACS)

Övriga

Published
  • Digital ASIC: Flexible Coding and Decoding for Wireless Personal Area Networks
  • Elektronikkonstruktion-lup-obsolete
  • Informations- och kommunikationsteori-lup-obsolete
  • ISSN: 1089-7798

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