Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 131 for “"Viterbi Algorithm"”.
-
A Hardware Implementation of the Soft Output Viterbi Algorithm for Serially Concatenated Convolutional Codes
… outlines the hardware design of a soft output Viterbi algorithm decoder for use in a serially concatenated convolutional code system. Convolutional codes and their related structures are described, as well as the algorithms used to decode them. A decoder design intended for a field-programmable …
-
Viterbi Decoding for OFDM systems operating in narrow band interference
… then discussed. We also study the conventional Viterbi Algorithm that is used in OFDM wireless systems and the proposed modifications to it in the literature. Our main contribution is a detailed experimental analysis of a modified Viterbi Algorithm that outperforms the conventional one in the …
-
FPGA design and implementation of systolic array-based viterbi decoders
The Viterbi algorithm is known to provide an efficient method for the maximum likelihood decoding of convolutional codes. In this thesis, a design and FPGA implementation of a Viterbi decoder with a constraint length of 9 and code rate of 1/2 is presented. In this design, a novel systolic array …
-
Quantum convolutional stabilizer codes
… process. We develop the quantum analogue of the Viterbi algorithm. The quantum Viterbi algorithm (QVA) is a maximum likehood error estimation algorithm, the complexity of which grows linearly with the number of encoded qubits. A variation of the quantum Viterbi algorithm, the Windowed QVA, is …
-
An adaptive M-algorithm based convolutional decoder
The Viterbi algorithm is one of the most popular convolutional decoders. This algorithm suffers from the high complexity in the decoding of the long constraint length codes. The M-algorithm is a simplified Viterbi algorithm and it is practical for the decoding of the long constraint length codes …
-
A soft decision concatenated coding scheme for mobile packet radio applications
… The inner decoding process uses a soft output Viterbi algorithm which produces reliability information along with its output. This information is used to erase unreliable symbols in the decoded output. An errors-erasures Reed Solomon decoder is then used for the outer code. The block error …
-
Improved error control techniques for data transmission
… Thesis is intended to provide practical decoding algorithms which can be implemented in real systems. Soft-decision maximum-likelihood decoding of Reed-Solomon codes can be obtained by using the Viterbi algorithm over a suitable trellis. Two-stage decoding of Reed-Solomon codes is presented. It is …
-
Characterizing and Accelerating Bioinformatics Workloads on Modern Microarchitectures
… most of its execution time is spent running the Viterbi algorithm. We parallelize and partition the HMMER application to implement it on the Cell Broadband Engine. In order to run the Viterbi algorithm on the 256KB local stores of the Cell BE synergistic processing units (SPEs), we present a …
-
Blind detection in channels with intersymbol interference
… likelihood sequence estimation. We propose a new algorithm: the "decorrelation algorithm," for controlling the blind decision feedback equalizer. We investigate properties such as convergence and probability of error. A new algorithm is also proposed for blind maximum likelihood sequence …
-
Hardware Accelerator for HMM Based Speech Recognition using Approximate Computing Techniques
… model a speech recognition system using the log-Viterbi algorithm approach. Two more hardware designs using various approximate computing techniques and modifications to the log-Viterbi algorithm are also proposed, that are shown to consume lesser area and power. The work also presents the …
-
The application of source-aided turbo decoding to IS-95 CDMA systems
… The model is used to form a MAP version of the Viterbi algorithm for decoding convolutional codes. For the case of a two-state Markov model, the generalization of the Viterbi algorithm involves only a modification of the branch metric; while for N-state Markov models, a technique called trellis …
-
The k-best paths in Hidden Markov Models. Algorithms and Applications to Transmembrane Protein Topology Recognition.
Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to the correct state. These algorithms provide only a single answer and in practice do not produce good results. The most mathematically …
-
Multi-h continuous phase modulation : its properties and analysis
… Simple codes using 4-16 phases, together with a Viterbi Algorithm decoder, allow a 2-4 dB power savings over BPSK with a narrower bandwidth. Four-ary 2-h schemes are found to have the best trade-off between complexity and coding gain. The free distance and decision depth are also determined. …
-
A hardware implementation of a Viterbi decoder for a (3,2/3) TCM code
The report details the design of a dedicated Viterbi decoder chip set for an Ungerboek (3,2/3) Trellis Coded Modulation code. It was the specific intention of the thesis to design a system that could be implemented on standard Field Programmable Gate Arrays (FPGA) yet still be able to cope with …
-
A Bit-serial Viterbi processor
The Viterbi algorithm is used for Forward Error Control (FEC) in systems such as satellite communication. Smaller networks are now utilizing satellite technology, which has created a demand for low cost, moderate speed Viterbi Decoders. Many low cost VLSI Viterbi decoders use bit parallel, …
-
Stochastic models for the estimation of the seismic hazard
… are obtained for forecasting purposes. A new Viterbi algorithm for hidden semi-Markov models is constructed, whose complexity is a linear function of the number of observations and a quadratic function of the number of hidden states, the lowest existing in the literature. Furthermore, an …
-
A PC-Based Simulation for Convolutional Codes Using Viterbi Decoding
… Therefore, a hardware implementation of this algorithm is impossible. The Viterbi algorithm, on the other hand, uses the recurrent properties of convolutional codes to provide an efficient solution to the Maximum-Likelihood decoding problem. A new PC-based simulator for the design and analysis …
-
Full-Surface Data Storage
… data density and noise levels. A multitrack Viterbi algorithm (MVA) performs well; however, the computational complexity limits the achievable data density. Equalization methods are introduced to increase achievable density. Iterative techniques based on greedy optimization are also studied. …
Page 1 of 7