Abstract
In applications of dynamic programming, a certain number of alternatives (paths) are explored and, as more and more information is gathered, some paths may merge. In Viterbi decoding, the number of new paths created is equal to the number of paths discarded. In this paper we present an architecture that can be used to store and update the paths dynamically. It consists of a mapping of the trellis of the Viterbi decoding into a 2D array of simple cells. We show how the path storage can be efficiently implemented in VLSI.
| Original language | English |
|---|---|
| Pages (from-to) | 11-19 |
| Number of pages | 9 |
| Journal | International Journal of Electronics |
| Volume | 72 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1992 |
Bibliographical note
Funding Information:The author acknowledges the support of King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia.
ASJC Scopus subject areas
- Electrical and Electronic Engineering
