Results 141 to 150 of about 3,574 (177)

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

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   +1 more source

Viterbi algorithm motives in turbo decoding

IEEE Information Theory Workshop, 2005., 2005
This work addresses the problem of decoding turbo convolutional codes. In particular, it is concerned with the question of how maximum likelihood sequence estimation (MLSE), in the shape of the Viterbi algorithm (VA), can be utilized in the framework of turbo decoding. It is shown that the conventional VA, which is a soft-input hard-output decoder, can
Michael Kerner, Ofer Amrani
openaire   +1 more source

Evaluating the Exact Performance of the Viterbi Algorithm

2010 IEEE Wireless Communication and Networking Conference, 2010
A Hidden Markov Modeling technique is used to evaluate the exact performance of the Viterbi algorithm for estimating states of a finite state system. This technique is applied to exact calculation of the bit error probability of the Viterbi decoder of a convolutional code in channels with independent errors and in channels with memory.
William Turin, Rittwik Jana
openaire   +1 more source

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   +1 more source

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   +1 more source

Viterbi algorithm for detecting DDoS attacks

2015 IEEE 40th Conference on Local Computer Networks (LCN), 2015
Distributed denial of service attacks aim at making a given computational resource unavailable to users. A substantial portion of commercial Intrusion Detection Systems operates only with detection techniques based on rules for the recognition of pre-established behavioral patterns (called signatures) that can be used to identify these types of attacks.
Wilson Bongiovanni, Adilson Eduardo Guelfi, Elvis Pontes, Anderson Aparecido Alves da Silva, Fen Zhou 0001, Sergio Takeo Kofuji   +5 more
openaire   +1 more source

A hardware efficient parallel Viterbi algorithm

International Conference on Acoustics, Speech, and Signal Processing, 2002
A hardware efficient block processing scheme is proposed for concurrent implementation of the Viterbi algorithm. The throughput increase is proportional to the increase in hardware complexity at the expense of latency. Advantages of the algorithm over other parallel schemes are that the reduction of the information rate due to bit stuffing at the ...
Peter J. Black, Teresa H.-Y. Meng
openaire   +1 more source

General in-place scheduling for the Viterbi algorithm

[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing, 1991
It 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

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   +1 more source