Binary input reconstruction for linear systems: a performance analysis

Abstract Recovering the digital input of a time-discrete linear system from its (noisy) output is a significant challenge in the fields of data transmission, deconvolution, channel equalization, and inverse modeling. A variety of algorithms have been developed for this purpose in the last decades, addressed to different models and performance/complexity requirements. In this paper, we implement a straightforward algorithm to reconstruct the binary input of a one-dimensional linear system with known probabilistic properties. Although suboptimal, this algorithm presents two main advantages: it works online (given the current output measurement, it decodes the current input bit) and has very low complexity. Moreover, we can theoretically analyze its performance: using results on convergence of probability measures, Markov processes, and Iterated Random Functions we evaluate its long-time behavior in terms of mean square error.

[1]  C. Cobelli,et al.  A stochastic deconvolution method to reconstruct insulin secretion rate after a glucose stimulus , 1996, IEEE Transactions on Biomedical Engineering.

[2]  Graham W Pulford.  Developments in non-linear equalization , 1992 .

[3]  Vijay K. Arya,et al.  Deconvolution of Seismic Data - An Overview , 1978 .

[4]  M. Iosifescu,et al.  ITERATED FUNCTION SYSTEMS. A CRITICAL SURVEY , 2009 .

[5]  Deconvolution of Seismic Data - An Overview , 1978, IEEE Transactions on Geoscience Electronics.

[6]  Wayne E. Stark,et al.  Asymptotic performance of M-ary orthogonal signals in worst case partial-band interference and Rayleigh fading , 1988, IEEE Trans. Commun..

[7]  Graham C. Goodwin,et al.  Multistep Detector for Linear ISI-Channels Incorporating Degrees of Belief in Past Estimates , 2007, IEEE Transactions on Communications.

[8]  David Steinsaltz,et al.  Locally Contractive Iterated Function Systems , 1999 .

[9]  Persi Diaconis,et al.  Iterated Random Functions , 1999, SIAM Rev..

[10]  Sophie Fosson,et al.  A decoding approach to fault tolerant control of linear systems with quantised disturbance input , 2010, Int. J. Control.

[11]  Alexandra Duel-Hallen,et al.  Delayed decision-feedback sequence estimation , 1989, IEEE Trans. Commun..

[12]  Jim Freeman.  Probability Metrics and the Stability of Stochastic Models , 1991 .

[13]  Fionn Murtagh,et al.  Deconvolution in Astronomy: A Review , 2002 .

[14]  Örjan Stenflo.  Ergodic theorems for Markov chains represented by iterated function systems , 2001 .

[15]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[16]  A Tikhonov,et al.  Solution of Incorrectly Formulated Problems and the Regularization Method , 1963 .

[17]  Rodney A. Kennedy,et al.  Block decision feedback equalization , 1992, IEEE Trans. Commun..

[18]  Luciano Pandolfi,et al.  A Singular Perturbation Approach to a Recursive Deconvolution Problem , 2001, SIAM J. Control. Optim..

[19]  R. Tweedie,et al.  Locally contracting iterated functions and stability of Markov chains , 2001, Journal of Applied Probability.

[20]  Sophie Fosson,et al.  Deconvolution of linear systems with quantized input: a coding theoretic viewpoint , 2010, arXiv.org.

[21]  P. Billingsley,et al.  Convergence of Probability Measures , 1970, The Mathematical Gazette.

[22]  Anno Accademico,et al.  Deconvolution of Quantized-Input Linear Systems: An Information-Theoretic Approach , 2011 .

[23]  A. N. Tikhonov,et al.  Solutions of ill-posed problems , 1977 .

[24]  Shahid U. H. Qureshi,et al.  Reduced-state sequence estimation with set partitioning and decision feedback , 1988, IEEE Trans. Commun..

[25]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.