This paper proposes a new blind sequence estimation method for single-input single-output (SISO) systems utilizing an optimal trellis search, which is performed by a channel-independent Viterbi algorithm (CIVA). In contrast to the traditional Viterbi algorithm that requires accurate channel estimation, CIVA does not require channel coefficients. Instead, the metrics are calculated from a bank o...

We propose a novel carrier phase estimator based on two-stage Viterbi-Viterbi and QPSK partitioning for 16-QAM. Simulation shows that the proposed algorithm is highly tolerant to laser linewidth with a reduced cycle slip probability. OCIS codes: (060.2330) Fiber Optics Communications; (060.1660) Coherent Communications

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...

In this paper, we outline an efficient system for detection of dim small targets that consists of three main parts: clutter rejection, track-before-detect (TBD), and detection subsystems. Detection and tracking of dim targets requires accumulation of sensor signal in time in order to resolve the target. There exist a number of powerful methods for detecting small low observable targets with sta...

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...