We present two memory-, process- and power-efficient algorithmic transformations for the Viterbi Algorithm (VA).
Convolutional encoding, together with Viterbi. Decoding, improves performance on noisy channels. Many satellite, PCS, DSL and wireline modem standards.
Low complexity channel coding and asymptotics of viterbi encoded trellis coded quantization · Reduced complexity decoding algorithms for low-density parity check ...
A Low-Complexity, Reduced-Power Viterbi AlgorithmP.K. Singh and S. Jayasimha Signion Systems Ltd.20, Rockdale Compound, SomajigudaHyderabad 500 082, ...
People also ask
What is the complexity of Viterbi algorithm?
The score of the best alignment between S and H is given by C[L] + tr(C, T). The algorithm has time complexity O(L × Q).
What is the Vertibi algorithm?
The Viterbi algorithm is a dynamic programming algorithm for obtaining the maximum a posteriori probability estimate of the most likely sequence of hidden states—called the Viterbi path—that results in a sequence of observed events.
What are the advantages of Viterbi algorithm?
It has advantages like satisfactory bit error performance, low cost, fixed decoding time. The viterbi algorithm proposed in 1967 is the most extensively decoding algorithm for Convolutional codes. It is powerful method for forward error correction.
Is the Viterbi algorithm still used?
Today, besides voice recognition, machine translation, Pinyin to Chinese character conversion, and Chinese word segmentation, the Viterbi Algorithm is used in various language spelling corrections, gene sequencing, and communication decoding.
Jan 1, 1999 · This paper discusses a number of coding techniques for future satellite communication; they include Reed-Solomon error decoding for message ...
The proposed algorithm achieves a performance close to the Viterbi algorithm, but with less complexity. The performance of the proposed algorithm is ...
Missing: Power | Show results with:Power
Ranpara and D. S. Ha, “A low-power Viterbi decoder design for wireless commu- nications applications,” IEEE Intl. Conf. Proceedings ASIC/SOC, pp. 377 – 381 ...
Abstract: By using viterbi decoder the power can be reduced according to number of stages used in each block. The efficient way to reduce data corruption in ...
By exploiting the inherent branch symmetry, the branch metric computation of the Viterbi decoder can be reduced significantly without any performance loss.
1 ABSTRACT. This paper investigates the low power imple- mentation issues of the soft-output Viterbi algo- rithm (SOVA), a building block for turbo codes.