DocumentCode
2523896
Title
Suboptimal Viterbi decoding metrics for channels with pulse jamming
Author
Baum, Carl W. ; Raghavan, Arvind R.
Author_Institution
Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA
Volume
3
fYear
1996
fDate
21-24 Oct 1996
Firstpage
1032
Abstract
The tradeoff between complexity and performance of decoding metrics for use with Viterbi decoding has been studied for a channel with Gaussian pulse jamming. It is shown that a metric with three-bit quantization provides a good combination of robust performance and low complexity. In addition, a new variable rate coding scheme which utilizes soft information from the quantizer is described. The performance of this scheme is compared with that of a scheme which attempts to count corrected errors. It is shown that an improvement in performance may be obtained without significant increase in complexity by using this new scheme
Keywords
Gaussian noise; Viterbi decoding; jamming; quantisation (signal); telecommunication channels; variable rate codes; Gaussian pulse jamming; corrected errors; low complexity; pulse jamming; robust performance; soft information; suboptimal Viterbi decoding metrics; three-bit quantization; variable rate coding; AWGN; Additive white noise; Algorithm design and analysis; Background noise; Convolutional codes; Euclidean distance; Gaussian noise; Jamming; Maximum likelihood decoding; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Military Communications Conference, 1996. MILCOM '96, Conference Proceedings, IEEE
Conference_Location
McLean, VA
Print_ISBN
0-7803-3682-8
Type
conf
DOI
10.1109/MILCOM.1996.571438
Filename
571438
Link To Document