Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)
DOI: 10.1109/itcom.1999.781426
| View full text |Cite
Sign up to set email alerts

Abstract: We discuss a s y m b o l b y symbol APP decoding algorithm that only uses forward recursions. Originally, this algorithm was described for o p t i m u m soft-output detection for channels w i t h IS1 and is called t h e o p t i m u m soft-output algorithm (OSA) [l]. We have proven the convergence of the OSA and show t h a t it is a generalization of the Viterbi algorithm.

Help me understand this report

This publication either has no citations yet, or we are still processing them

Set email alert for when this publication receives citations?

See others like this or search for similar articles