1995
DOI: 10.1214/aos/1176324542
|View full text |Cite
|
Sign up to set email alerts
|

Blind Deconvolution of Linear Systems with Multilevel Nonstationary Inputs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0
1

Year Published

1995
1995
2011
2011

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 25 publications
(21 citation statements)
references
References 15 publications
0
20
0
1
Order By: Relevance
“…There are deconvolution problems in signal processsing when the probability distribution of the signal process {s(t)} is discrete with finitely many points of support such as in the finite alphabet transmission. These deconvolution problems were treated in [17,12]. The finite tone image deconvolution or debluriing problems were treated in [18] where the distribution of the pixels is two-tone (or finite-tone) without the stationarity assumption.…”
Section: If the Output Process {X(t)} Is Observed With An Independentmentioning
confidence: 99%
“…There are deconvolution problems in signal processsing when the probability distribution of the signal process {s(t)} is discrete with finitely many points of support such as in the finite alphabet transmission. These deconvolution problems were treated in [17,12]. The finite tone image deconvolution or debluriing problems were treated in [18] where the distribution of the pixels is two-tone (or finite-tone) without the stationarity assumption.…”
Section: If the Output Process {X(t)} Is Observed With An Independentmentioning
confidence: 99%
“…Indeed, using a finite alphabet of cardinality d, one can force the equalizer output to belong to the desired alphabet using a combination of moments of order up to 2d. In fact, a possible way to force the equalizer output to belong to the desired constellation is to null the cost function [4], [5], [6] …”
Section: Problem Formulationmentioning
confidence: 99%
“…If signal z n (n is the iteration number) can be represented as the output of an input signal x n acted upon by an operator (or machine) y n , then the problem of solving for x n and y n knowing z n (the convolution of the two) is called ''blind deconvolution'' (LI, 1995;CREPE et al, 1999). Normally the solution to this problem is non-unique and the number of solutions is infinite.…”
Section: Theorymentioning
confidence: 99%