Results 151 to 160 of about 3,574 (177)
Some of the next articles are maybe not open access.

A flexible processor for FFT and Viterbi algorithms

2012 International Symposium on Communications and Information Technologies (ISCIT), 2012
This paper proposes a flexible architecture for the FFT and Viterbi algorithms based on the Common Operator (CO) technique. The FFT and Viterbi structural similarities are investigated to build a common architecture for both algorithms where area is traded against throughput. FPGA implementation and experimental results are discussed in this paper.
Naoues, Malek   +4 more
openaire   +2 more sources

A burst-error-correcting Viterbi algorithm

IEEE Transactions on Communications, 1990
A dual-mode burst-error-correcting algorithm that combines maximum-likelihood decoding with a burst detection scheme is presented. The decoder nominally operates as a Viterbi decoder and switches to time diversity error recovery whenever an uncorrectable error pattern is identified.
Christian Schlegel, Mark A. Herro
openaire   +1 more source

Modified Viterbi algorithm for predictive TCQ

Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096), 1999
Summary form only given. A hybrid trellis-tree search algorithm, the H-PTCQ, which has the same storage requirement as PTCQ and, is presented. We assume 2 survivor paths are kept at each state. It is straightforward to extend the algorithm to the cases where n/spl ges/2. Simulation is conducted over 20-second speech samples using DPCM, PTCQ and H-PTCQ.
Tingfang Ji, Wayne E. Stark
openaire   +1 more source

Iterative Viterbi Algorithm: Implementation Issues

IEEE Transactions on Wireless Communications, 2004
We address several issues for implementing the iterative Viterbi decoder. We show that 3-bit branch metric quantization, 7- or 8-bit state metric precision, and a survivor length of five times the constraint length yields little degradation for the iterative Viterbi algorithm (IVA).
openaire   +2 more sources

Union Bounds on Viterbi Algorithm Performance

AT&T Technical Journal, 1985
In the present paper we use transform methods (characteristic function techniques) and contour integrals to derive a closed-form expression for the performance union bound of a general discrete-time system. We show that previously published results may be derived as particular cases of the general formulation developed in this paper.
openaire   +1 more source

An incremental viterbi algorithm

Sixth International Conference on Machine Learning and Applications (ICMLA 2007), 2007
openaire   +1 more source

An efficient viterbi algorithm on DBNs

8th European Conference on Speech Communication and Technology (Eurospeech 2003), 2003
Wei Hu 0002   +3 more
openaire   +1 more source

A High-throughput Parallel Viterbi Algorithm via Bitslicing

ACM Transactions on Parallel Computing, 2021
Saleh Khalaj Monfared   +2 more
exaly  

Viterbi and Viterbi Algorithm based Phase Recovery for Probabilistically Shaped Signals

Journal of Lightwave Technology, 2021
Qiulin Zhang, Chester Shu
exaly  

The Viterbi algorithm

IEE Seminar on Target Tracking: Algorithms and Applications, 2006
openaire   +1 more source

Home - About - Disclaimer - Privacy