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

Reducing computational complexity of branch metric calculations in a trellis decoder

Författare:
  • Sudhir Rao Rupanagudi
  • Vinita Rupanagudi
  • Matthias Kamuf
  • Viktor Öwall
Publiceringsår: 2008
Språk: Engelska
Sidor:
Dokumenttyp: Konferensbidrag

Sammanfattning

Trellis decoding is widely used, in this present day of communication and data storage, in a wide variety of applications such as decoding convolution codes, baseband detection for wireless

systems and also to detect recorded data. This is achieved by implementing the Viterbi algorithm. This paper presents various methodologies of reducing the computational complexity

of the branch metric unit in a trellis decoder. Further, a new methodology identified by us, which can be used to simplify the computations further, has been discussed. The adoption of

this method, has been verified in a 0.13μ standard CMOS process, which shows 60% reduction in area as compared to the designs incorporating the existing methodologies.

Nyckelord

  • Electrical Engineering, Electronic Engineering, Information Engineering

Övriga

International Symposium on Wireless Personal Multimedia Communications (WPMC), 2008
Published
  • Digital ASIC-lup-obsolete

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