By Topic

A generic convolutional code Viterbi decoder generator

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yan Zhong ; ALTA Group of Cadence Design Syst. Inc., Sunnyvale, CA, USA ; Lin Yang ; M. Rafie

This paper presents a unified branch metric calculation method and a unified path-metric update scheduling algorithm to realize the Viterbi decoding process for decoding rate=1/2 convolutional codes. By using punctuation, the proposed algorithm can be extended to decode convolutional codes of any rate. With consideration of the tradeoffs between performance and hardware cost, one can also select different architectures toward different design objectives by specifying the number of processors being used, which results a fully-parallel, fully-serial, or a parallel-serial mixed architecture

Published in:

ASIC, 1996., 2nd International Conference on

Date of Conference:

21-24 Oct 1996