Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Survivor path processing in Viterbi decoders using register exchange and traceforward

Kamuf, Matthias LU ; Öwall, Viktor LU and Anderson, John B LU (2007) In IEEE Transactions on Circuits and Systems II: Express Briefs 54(6). p.537-541
Abstract
This paper proposes a new class of hybrid VLSI

architectures for survivor path processing to be used in Viterbi decoders. The architecture combines the benefits of register exchange and trace-forward algorithms, that is, low memory requirement and latency versus implementation efficiency. Based on a structural comparison, it becomes evident that the architecture

can be efficiently applied to codes with a larger number

of states where usually trace-back-based architectures, which increase latency, are dominant.
Please use this url to cite or link to this publication:
author
; and
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
(TB), traceback, survivor path, convolutional codes, register exchange (RE), traceforward (TF), Viterbi decoder, VLSI
in
IEEE Transactions on Circuits and Systems II: Express Briefs
volume
54
issue
6
pages
537 - 541
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • wos:000247445900015
  • scopus:34347369524
ISSN
1549-7747
DOI
10.1109/TCSII.2007.891753
project
Digital ASIC: Flexible Coding and Decoding for Wireless Personal Area Networks
language
English
LU publication?
yes
id
0ba709a1-58c2-4fd0-95e2-ea1bfb675451 (old id 648096)
date added to LUP
2016-04-01 11:48:57
date last changed
2022-01-26 18:41:15
@article{0ba709a1-58c2-4fd0-95e2-ea1bfb675451,
  abstract     = {{This paper proposes a new class of hybrid VLSI<br/><br>
architectures for survivor path processing to be used in Viterbi decoders. The architecture combines the benefits of register exchange and trace-forward algorithms, that is, low memory requirement and latency versus implementation efficiency. Based on a structural comparison, it becomes evident that the architecture<br/><br>
can be efficiently applied to codes with a larger number<br/><br>
of states where usually trace-back-based architectures, which increase latency, are dominant.}},
  author       = {{Kamuf, Matthias and Öwall, Viktor and Anderson, John B}},
  issn         = {{1549-7747}},
  keywords     = {{(TB); traceback; survivor path; convolutional codes; register exchange (RE); traceforward (TF); Viterbi decoder; VLSI}},
  language     = {{eng}},
  number       = {{6}},
  pages        = {{537--541}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  series       = {{IEEE Transactions on Circuits and Systems II: Express Briefs}},
  title        = {{Survivor path processing in Viterbi decoders using register exchange and traceforward}},
  url          = {{https://lup.lub.lu.se/search/files/2654231/1580338.pdf}},
  doi          = {{10.1109/TCSII.2007.891753}},
  volume       = {{54}},
  year         = {{2007}},
}