Abstract
AbstractDeconvolution consists in recovering the unknown input of a system given noisy measurements of the output. If the input is quantized, the problem can be faced via Information and Decoding techniques, which provide the suitable tools to work in hybrid contexts, namely when discrete signals are transmitted through analog communication systems. Derived from BCJR, a low-complexity, recursive decoding algorithm has been developed by Fagnani and Fosson (2009) and is here applied to tackle deconvolution of one-dimensional linear systems with binary input. The aim of the paper is to provide a rigorous mathematical analysis of the performance of such algorithm, in terms of a mean square error and for long time transmissions. This task is accomplished by means of Iterated Random Functions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
