A rate-k/n heuristic soft-output Viterbi algorithm (SOVA) that is postdetector-compatible

TitleA rate-k/n heuristic soft-output Viterbi algorithm (SOVA) that is postdetector-compatible
Publication TypeJournal Article
Year of Publication1998
AuthorsKwan, D., and S. Kallel
JournalIEEE Transactions on Communications
Volume46
Pagination621–626
ISSN0090-6778
Abstract

A soft-output Viterbi algorithm (SOVA) that can be used on trellis-coded modulation (TCM), rate-kin convolutional codes, and intersymbol interference (ISI) channels is proposed. The algorithm utilizes the postdetector architecture proposed by Berrou et nl, [6] to achieve low computational complexity. By starting with Battail's [4] generalized revision algorithm and rereferencing the "relative values" to the surviving path to each state, substantial simplifications are made possible. By comparing the revision operations dictated by the simplified revision equation for a rate-1/n convolutional code to the operations mandated by the rate-1/n postdetector algorithm presented by Berrou ef al,, it is possible to deduce the additional modifications necessary to produce a rate-k/n postdetector algorithm. Computer simulations suggest that the derived rate-k/n algorithm produces reasonably good a posteriori input probability estimates for rate-k/n convolutional codes and trellis codes. The algorithm may also be used for soft-output Viterbi equalization (SOVE) provided that the channel impairments are not too severe.

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia