返回
Binary input reconstruction for linear systems: A performance analysis
DOI:10.1016/j.nahs.2012.07.007.png)
摘要
En 中文
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. (c) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Linear systems
Binary input reconstruction
Online decoding
Markov processes
Iterated random functions
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
N
IF:
4.1
论文数:
1.4K
被引数:
3.1K
机构
暂无机构信息

