Name
Abstract | ||
|---|---|---|
In this paper, a new implementation of the Viterbi decoder is proposed. The Modified State-Mapping VD algorithm combines the TB algorithm with the RE algorithm. By updating the starting point of the state for each memory bank, and by using Trace Back and Trace Forward information, LIFO (Last Input First Output) operation can be eliminated, which reduces the latency of the TB algorithm and decreases the resource usage of the RE algorithm. When the memory unit is 3, the resource usage is 13184 bits and the latency is 54 clocks. The latency of the proposed algorithm is 25% smaller than the MIZE algorithm and 50% smaller than the k-pointer even TB algorithm. In addition, resource usage is 50% smaller than the RE algorithm. The resource usage is a little larger than that of the MIZE algorithm for the small value of k, but it becomes smaller after k is larger than 16. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1093/ietcom/e89-b.4.1413 | IEICE TRANSACTIONS ON COMMUNICATIONS |
Keywords | Field | DocType |
Viterbi decoder, register exchange, trace back, latency, resource usage | Memory bank,Register exchange,Computer science,Latency (engineering),Parallel computing,FIFO and LIFO accounting,Viterbi decoder,Storage management,Latency (engineering),Iterative Viterbi decoding | Journal |
Volume | Issue | ISSN |
E89B | 4 | 0916-8516 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sang-Ho Seo | 1 | 3 | 2.54 |
| Haewook Choi | 2 | 28 | 7.23 |
| Sin-Chong Park | 3 | 80 | 22.58 |