Efficient convolutional coding and decoding algorithms are most crucial to successful operation of wireless communication systems in order to achieve high quality of service by reducing the overall bit error rate performance. A widely applied and well evaluated scheme for error correction purposes is well known as Viterbi algorithm [7]. Although the Viterbi algorithm has very good error correct...

This paper presents several techniques for the VLSI implementation of the MAP algorithm. In general, knowledge about the implementation of the Viterbi algorithm can be applied to the MAP algorithm. Bounds are derived for the dynamic range of the state metrics which enable the designer to optimize the word length. The computational kernel of the algorithm is the Add-MAX* operation, which is the ...

is understood to have N hidden Markov states labelled by i (1 ≤ i ≤ N), and M possible observables for each state, labelled by a (1 ≤ a ≤ M). The state transition probabilies are pij = p(qt+1 = j | qt = i), 1 ≤ i, j ≤ N (where qt is the hidden state at time t), the emission probability for the observable a from state i is ei(a) = p(Ot = a | qt = i) (where Ot is the observation at time t), and t...

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-deterministic computational throughput and...

today, there arevarious statistical models for the discrete simulation of the rainfall occurrence/non-occurrence with more emphasizing on long-term climatic statistics. nevertheless, the accuracy of such models or predictions should be improved in short timescale. in the present paper, it is assumed that the rainfall occurrence/non-occurrence sequences follow a two-layer hidden markov model (hm...

AbstmctImplementation of the Viterbi decoding algorithm has attracted a great deal of interest in many applications, but the excessive hardwarehime consumptions caused by the dynamic and backtracking decoding procedures make it difficult to design efficient VLSI circuits for practical applications. A new transform algorithm for maximum likelihood decoding is derived from trellis coding and Vite...

In this paper we develop a new general Viterbi algorithm for multitarget tracking. A standard Multiple Hypothesis Tracking (MHT) formulation, based on Maximum A Posterior (MAP) estimation, is considered for optimally associating measurement data over time to form estimates of the multiple tracks. For estimating K tracks, a trellis diagram of the measurements is used to depict all track set hypo...

Convolution codes are one of the FEC codes that are used in every digital communication system. Convolution coding can be applied to block of data and also to a continuous input stream. Convolutional encoder can be viewed as a finite state machine.Viterbi algorithm is employed in wireless communications to decode the convolution codes. Such decoders are complex and dissipate large amount of pow...