Optimized Architectural Design of Viterbi Decoder
Huanzhang Lu
Abstract
Huanzhang Lu
Abstract
When Viterbi algorithm is implemented in FPGA, the occupation of hardware resource and the speed of decoder are two conflictive aspects. And it can be resolved by arranging ACS unit and path metric RAM reasonably. In the case of (2,1,6) code and based on radix-4 algorithm, a new dynamic management of path metric memory is introduced, which can deduce the decoder's complexity effectively and improve the speed of Viterbi decoder relatively.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
When Viterbi algorithm is implemented in FPGA, the occupation of hardware resource and the speed of decoder are two conflictive aspects. And it can be resolved by arranging ACS unit and path metric RAM reasonably. In the case of (2,1,6) code and based on radix-4 algorithm, a new dynamic management of path metric memory is introduced, which can deduce the decoder's complexity effectively and improve the speed of Viterbi decoder relatively.
Key concepts: Soft-decision decoder, Viterbi decoder, Viterbi algorithm, Computer science, Soft output Viterbi algorithm, Path (computing), Field-programmable gate array, Decoding methods