Abstract
For binary codes, Fossorier et al. (1998), have shown that the soft-output Viterbi algorithm (SOVA) becomes equivalent to the max-log-maximum a posteriori (MAP) algorithm after a modification. In this letter, such modified SOVA is generalized into nonbinary cases. The equivalence between the modified SOVA and the max-log-MAP algorithm is proved more straightforwardly. The modified SOVA requires only add-compare-select operations and is suitable for high-speed parallel implementation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
