Results 191 to 200 of about 6,525 (216)
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), 2012This 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
Parallel Viterbi algorithm for a VLIW DSP
2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100), 2002The Viterbi decoder algorithm for a very high data-rate satellite receiver is computationally very intensive. Dedicated commercially available chips are used for high rate convolutional decoders. With the advent of high speed DSPs, these computationally intensive algorithms can be mapped on programmable DSPs running test of the receiver algorithm. This
Shoab Ahmad Khan +2 more
openaire +1 more source
General in-place scheduling for the Viterbi algorithm
[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing, 1991It is shown how to find in-place schedules for all kinds of trellises, including periodic and aperiodic in-place schedules. It is also shown how to verify the existence of aperiodic and periodic in-place schedules. With this in-place scheduling, one can improve data locality and thus reduce interprocessor communication bandwidths.
Horng-Dar Lin, C. Bernard Shung
openaire +1 more source
A burst-error-correcting Viterbi algorithm
IEEE Transactions on Communications, 1990A 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), 1999Summary 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
Inverting the Viterbi algorithm
Proceedings of the 25th international conference on Machine learning - ICML '08, 2008Probabilistic grammatical formalisms such as hidden Markov models (HMMs) and stochastic context-free grammars (SCFGs) have been extensively studied and widely applied in a number of fields. Here, we introduce a new algorithmic problem on HMMs and SCFGs that arises naturally from protein and RNA design, and which has not been previously studied.
Michael Schnall-Levin +2 more
openaire +1 more source
Union Bounds on Viterbi Algorithm Performance
AT&T Technical Journal, 1985In 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
A High-throughput Parallel Viterbi Algorithm via Bitslicing
ACM Transactions on Parallel Computing, 2021Saleh Khalaj Monfared +2 more
exaly
An incremental viterbi algorithm
Sixth International Conference on Machine Learning and Applications (ICMLA 2007), 2007openaire +1 more source
An efficient viterbi algorithm on DBNs
8th European Conference on Speech Communication and Technology (Eurospeech 2003), 2003Wei Hu 0002 +3 more
openaire +1 more source