Blind deconvolution of SISO systems with binary source based on recursive channel shortening

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We treat the problem of Blind Deconvolution of Single Input - Single Output (SISO) systems with real or complex binary sources. We explicate the basic mathematical idea by focusing on the noiseless case. Our approach leads to a recursive channel shortening algorithm based on simple data gouping. The channel shortening process eventually results in an instantaneous binary system with trivial solution. The method is both deterministic and very fast. It does not involve any iterative optimization or stochastic approximation procedure. It does however, require sufficiently large datasets in order to meet the source richness condition. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Diamantaras, K. I., & Papadimitriou, T. (2004). Blind deconvolution of SISO systems with binary source based on recursive channel shortening. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3195, 548–553. https://doi.org/10.1007/978-3-540-30110-3_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free