Results 171 to 180 of about 2,303,958 (204)

List Viterbi algorithms for continuous transmission

IEEE Transactions on Communications, 2001
Summary: The conventional list Viterbi algorithm (LVA) produces a list of the \(L\) best output sequences over a certain block length in decoding a terminated convolutional code. We show in this paper that the LVA with a sufficiently long list is an optimum maximum-likelihood decoder for the concatenated pair of a convolutional code and a cyclic ...
Brian Chen 0002, Carl-Erik W. Sundberg
openaire   +2 more sources

On bootstrap iterative Viterbi algorithm

1999 IEEE International Conference on Communications (Cat. No. 99CH36311), 2003
A bootstrap iterative Viterbi algorithm (BIVA) is proposed based on a bootstrap structure. Two different modifications are then considered for both very short size blocks (say 100-250 bits) and the medium size blocks (1000-3000 bits). It shows that the iterative decoding can be achieved by using the conventional Viterbi algorithm, which does not ...
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

List Viterbi decoding algorithms with applications

IEEE Transactions on Communications, 1994
A list Viterbi decoding algorithm (LVA) produces a rank ordered list of the L globally best candidates after a trellis search. The authors present two such algorithms, (i) a parallel LVA that simultaneously produces the L best candidates and (ii) a serial LVA that iteratively produces the k/sup th/ best candidate based on knowledge of the previously ...
Nambi Seshadri, Carl-Erik W. Sundberg
openaire   +1 more source

Inverting the Viterbi algorithm

Proceedings of the 25th international conference on Machine learning - ICML '08, 2008
Probabilistic 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, Leonid Chindelevitch, Bonnie Berger   +2 more
openaire   +2 more sources

A Common Operator for FFT and Viterbi Algorithms

2010 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, 2010
In the Software Radio context, the parametrization is becoming an important topic especially when it comes to multi-standard designs. This paper capitalizes on the Common Operator technique to present a new common structure for the FFT and Viterbi algorithms.
Malek Naoues, Laurent Alaus, Dominique Noguet   +2 more
openaire   +1 more source

MIMO Detector Based on Viterbi Algorithm

2007 IEEE Workshop on Signal Processing Systems, 2007
Suboptimal detectors of multiple-input multiple-output (MIMO) have been studied because the implementation of the optimum detector, the maximum-likelihood (ML) detector, has so far been considered infeasible for high-rate system. Sphere decoder (SD) using depth-first tree searching and K-best algorithm are used for near optimum detector. SD has the non-
Jin Lee, Sin-Chong Park
openaire   +1 more source

Systolic array processing of the Viterbi algorithm

IEEE Transactions on Information Theory, 1989
Summary: New results on efficient forms of decoding convolutional codes based on the Viterbi algorithm by using systolic arrays are presented. Various properties of convolutional codes are also discussed. A technique called strongly connected trellis decoding is introduced to increase the efficient utilization of all the systolic array processors ...
Chi-Yung Chang, Kung Yao
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), 2002
The 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, Malik M. Saqib, Sherjil Ahmed   +2 more
openaire   +2 more sources

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   +2 more sources