Iterative sova decoding over symmetric alpha stable channels

Soft-output viterbi algorithm (sova) is one type of recovery memory-less markov chain and is used widely to decode convolutional codes. fundamentally,conventional sova is designed on the basis of maximum a-posteriori probability (map) under additive white gaussian noise (awgn) interference. therefore,the use of conventional gaussian-based sova performs inefficiently and generates high ber (bit error rate) in the presence of symmetric alpha stable noise sαs. the poor performance of the gaussian-based sova can be attributed to the mathematical quadratic cost function of the receiving mechanism. the quadratic cost function at the receiving end is statistically vulnerable and inefficient to guard sova component decoder against the entries of the outliers which are superimposed on the transmitted signal from hostile sαs channel. the author studies and improves the performance of conventional sova with the introduction of bayesian cauchy metric calculation. substantial performance improvement was observed from mento carlo simulation for sova running on the platform of parallel turbo codes. © school of engineering,taylor's university.