This paper presents a pipelined Adaptive Viterbi algorithm of rate 1⁄2 convolutional coding with a constraint length K = 3 which is designed in a reconfigurable hardware to take full advantage of algorithm parallelism, specialization and the throughput rate. In present work, the hardware implementation of the pipelined Adaptive Viterbi algorithm is performed using FPGA processor (Spartan-3AN st...

The Viterbi algorithm is a well-established technique for channel and source decoding in high performance digital communication systems. Implementations of the Viterbi algorithm on three types of locally connected processor arrays are described. This restriction is motivated by the fact that both the cost and performance metrics of VLSI favor architectures in which on-chip interprocessor commun...

Convolution encoding with Viterbi decoding is a powerful method for forward error correction. It has been widely deployed in many wireless communication systems to improve the limited capacity of the communication channels. Viterbi algorithm, is the most extensively employed decoding algorithm for convolutional codes. In this paper, we present ARM based implementation of Viterbi decoder that us...

This paper focuses on Simulation and Design of Parameterized Convolutional Encoder and Viterbi Decoder Using Coding rate, Trellis length as parameter. In wireless communication high coding rate transmission is reliable but takes more time to decode comparing low coding rate. Long Trellis Length causes the Viterbi algorithm to take more time but reliable compare with short Trellis length. These ...

The problem of finding the most probable derivation for probabilistic context-free grammar is expensive. Viterbi algorithm has been adopted to one-counter that a sub-class stochastic solve this issue. However, absence implementation adapted attracts our attention. We experimentally validate and present part it monitor performance, in research.

Background: Hidden Markov models (HMM) are powerful machine learning tools successfully applied to problems of computational Molecular Biology. In a predictive task, the HMM is endowed with a decoding algorithm in order to assign the most probable state path, and in turn the class labeling, to an unknown sequence. The Viterbi and the posterior decoding algorithms are the most common. The former...

High data rate communication between airborne vehicles and ground stations over the bandwidth constrained Aeronautical Telemetry channel is attributed to the development of bandwidth efficient Advanced Range Telemetry (ARTM) waveforms. This communication takes place over a multipath channel consisting of two components a line of sight and one or more ground reflected paths which result in frequ...

In this paper a new approach to traceback processing in Viterbi decoders is presented. The approach reduces memory requirements as compared to previous approaches by using di erent speeds during acquisition of the best trellis path and the subsequent decoding of a block of data. This dual timescale approach allows in-place updating of the stored information and nicely matches the constraints of...

Sentence word segmentation and Part-OfSpeech (POS) tagging are common preprocessing tasks for many Natural Language Processing (NLP) applications. This paper presents a practical application for POS tagging and segmentation disambiguation using an extension of the one-pass Viterbi algorithm called Viterbi-N. We introduce the internals of the developed system, which is based on lattices and a st...