Binary input reconstruction for linear systems: a performance analysis

From MaRDI portal
Publication:360647

DOI10.1016/J.NAHS.2012.07.007zbMATH Open1270.93071arXiv2012.01339OpenAlexW1984644467MaRDI QIDQ360647FDOQ360647

Sophie M. Fosson

Publication date: 27 August 2013

Published in: Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2012.01339




Recommendations









This page was built for publication: Binary input reconstruction for linear systems: a performance analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360647)