A Minimax Robust Decoding Algorithm
-
Altmetric Citations
Wei, Lei; Li, Zheng Feng; James, Matthew; Petersen, Ian R
Description
In this correspondence 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 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...[Show more]
dc.contributor.author | Wei, Lei | |
---|---|---|
dc.contributor.author | Li, Zheng Feng | |
dc.contributor.author | James, Matthew | |
dc.contributor.author | Petersen, Ian R | |
dc.date.accessioned | 2015-12-13T23:19:52Z | |
dc.date.available | 2015-12-13T23:19:52Z | |
dc.identifier.issn | 0018-9448 | |
dc.identifier.uri | http://hdl.handle.net/1885/90457 | |
dc.description.abstract | In this correspondence 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 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 pdf's. We show that the optimal robust scheme is difficult to derive; therefore, alternative, practically feasible, robust decoding schemes are presented and implemented on VA decoder and two-way APP decoder. 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. | |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE Inc) | |
dc.source | IEEE Transactions on Information Theory | |
dc.subject | Keywords: Decoding algorithm; Impulsive noise; Sum product algorithm; Turbo decoding; Viterbi algorithm; Algorithms; Communication channels (information theory); Optimization; Probability density function; Signal processing; Spurious signal noise; Decoding BCJR algorithm; Impulsive noise; Min-sum algorithm; Minimax; Robust signal processing; Sum-product algorithm; Turbo decoding; Two-way app algorithm; Uncertain channel; Viterbi algorithm | |
dc.title | A Minimax Robust Decoding Algorithm | |
dc.type | Journal article | |
local.description.notes | Imported from ARIES | |
local.description.refereed | Yes | |
local.identifier.citationvolume | 46 | |
dc.date.issued | 2000 | |
local.identifier.absfor | 010203 - Calculus of Variations, Systems Theory and Control Theory | |
local.identifier.ariespublication | MigratedxPub20821 | |
local.type.status | Published Version | |
local.contributor.affiliation | Wei, Lei, College of Engineering and Computer Science, ANU | |
local.contributor.affiliation | Li, Zheng Feng, College of Engineering and Computer Science, ANU | |
local.contributor.affiliation | James, Matthew, College of Engineering and Computer Science, ANU | |
local.contributor.affiliation | Petersen, Ian R, University of New South Wales | |
local.bibliographicCitation.issue | No. 3 | |
local.bibliographicCitation.startpage | 1158 | |
local.bibliographicCitation.lastpage | 1167 | |
local.identifier.doi | 10.1109/18.841200 | |
dc.date.updated | 2015-12-12T09:01:12Z | |
local.identifier.scopusID | 2-s2.0-0034188628 | |
Collections | ANU Research Publications |
Download
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator