Radix-2k Viterbi decoding with transpose path metric processor
Resource
Circuits and Systems, 1994. APCCAS '94., 1994 IEEE Asia-Pacific Conference on
Journal
IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings
Pages
194 - 199
Date Issued
1994-12
Date
1994-12
Author(s)
DOI
N/A
Abstract
In this paper, we present a radix-2k Viterbi decoding with Transpose Path Metric (TPM) processor. The TPM processor can provide a permutation function for state rearrangement with simple local interconnection. For interconnection realization, the routing complexity is less than that of the delay-commutator reported previously. In addition, a higher memory length Viterbi processor can be constructed with lower radix-2k modules. With features of modulation and cell regularity, the radix-2k Viterbi decoding with TPM processor is very suitable for VLSI implementation.
Other Subjects
Algorithms; Computational complexity; Graph theory; Iterative methods; Trellis codes; VLSI circuits; Add compare select; Transpose path metric processor; Trellis diagram; Viterbi decoding; Decoding
Publisher
Proceedings of the 1994 IEEE Asia-Pacific Conference on Circuits and Systems
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
00514548.pdf
Size
553.09 KB
Format
Adobe PDF
Checksum
(MD5):7387c7d45d558fc9b2413627cca04aea