The "art of trellis decoding" is computationally hard-for large fields

Author(s):  
K. Jain ◽  
I. Mandoiu ◽  
V.V. Vazirani
Keyword(s):  
2008 ◽  
Vol 18 (5) ◽  
pp. 557-568 ◽  
Author(s):  
Arun Avudainayagam ◽  
John M. Shea ◽  
Dapeng Wu

1997 ◽  
Vol 144 (2) ◽  
pp. 65 ◽  
Author(s):  
G. Markarian ◽  
B. Honary ◽  
P. Benachour
Keyword(s):  

Author(s):  
Mário Pereira Véstias

Trellis decoding is used to recover encoded information that was corrupted during transmission over a noisy channel. The Viterbi algorithm is the most well known trellis-based maximum likelihood decoding algorithm. The Viterbi algorithm is executed by a Viterbi decoder. Different hardware solutions may be considered to implement a Viterbi decoder with different design requirements in terms of area, performance, power consumption, among others. The most appropriate solution depends on the metric requirements of the application as well as on the target technology. Properties of the Viterbi algorithm are used to simplify and improve the architecture of the Viterbi decoder. In particular, statistical properties of the Viterbi algorithm are used to design parallel Viterbi decoders with very high data decoding rates. The article focuses on the implementation of a Viterbi decoder in hardware, including optimizations to improve the area and performance.


Sign in / Sign up

Export Citation Format

Share Document