Parallel Viterbi decoding methods for uncontrollable and controllable sources

The parallel Viterbi decoding is discussed for two different cases: uncontrollable sources and controllable sources. For general, uncontrollable Markov processes, a previously known parallel method is extended to a hierarchical parallel decoding approach, which achieves a lower latency. For controll...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 41; no. 1; pp. 62 - 69
Main Authors: Lin, H.-D., Messerschmitt, D.G.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.01.1993
Institute of Electrical and Electronics Engineers
Subjects:
Applied sciences
Coding, codes
Convolutional codes
Degradation
Delay
Exact sciences and technology
Information, signal and communications theory
Markov processes
Maximum likelihood decoding
Maximum likelihood estimation
Signal and communications theory
Signal processing
Telecommunication control
Telecommunications and information theory
Throughput
Viterbi algorithm
Markov process
Parallel processing
Coding
Algorithm
Viterbi decoding
ISSN:0090-6778
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The parallel Viterbi decoding is discussed for two different cases: uncontrollable sources and controllable sources. For general, uncontrollable Markov processes, a previously known parallel method is extended to a hierarchical parallel decoding approach, which achieves a lower latency. For controllable Markov sources in telecommunications applications, new parallel decoding methods are obtained by controlling the source processes in appropriate ways. The focus is on the parallel decoding methods for controllable sources because these methods have zero processing overhead. Because the methods modify the coding process, they bring positive changes to framing and negative changes to latency and code performance. However, one can adjust the parameters of the methods to make the degradation negligible. Because of their low overhead, the methods are most attractive for high-speed decoders for convolutional and trellis codes, and they are also applicable to other sequential algorithms for suboptimal decoding and estimation of complex Markov sources.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0090-6778
DOI:10.1109/26.212366