By Topic

A minimax robust decoding algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Lei Wei ; Dept. of Eng., Australian Nat. Univ., Canberra, ACT, Australia ; Zheng Li ; James, M.R. ; Petersen, I.R.

We study the decoding problem in an uncertain noise environment. If the receiver knows the noise probability density function (PDF) at each time slot or its a priori probability, the standard Viterbi (1967) algorithm (VA) or the a posteriori probability (APP) algorithm can achieve optimal performance. However, if the actual noise distribution differs from the noise model used to design the receiver, there can be significant performance degradation due to the model mismatch. The minimax concept is used to minimize the worst possible error performance over a family of possible channel noise PDFs. We show that the optimal robust scheme is difficult to derive; therefore, alternative, practically feasible, robust decoding schemes are presented and implemented on a VA decoder and two-way APP decoder. The performance analysis and numerical results show our robust decoders have a performance advantage over standard decoders in uncertain noise channels, with no or little computational overhead. Our robust decoding approach can also explain why for turbo decoding overestimating the noise variance gives better results than underestimating it

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 3 )