Binary input reconstruction for linear systems: a performance analysis
From MaRDI portal
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.
Recommendations
- State reconstruction for linear time-invariant systems with binary-valued output observations
- Partial unknown input reconstruction for linear systems
- On one algorithm of input action reconstruction for linear systems
- On dynamic reconstruction of input in the second-order linear systems
- Reconstruction of scalar input signals for discrete linear nonstationary systems
- Strong Left Inversion of Linear Systems and Input Reconstruction
- scientific article; zbMATH DE number 1837593
- scientific article; zbMATH DE number 1833716
- Identification Input Design for Consistent Parameter Estimation of Linear Systems With Binary-Valued Output Observations
- Linear systems analysis and decoding of convolutional codes
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)