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

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