Lattice algorithms applied to the blind deconvolution problem

Der Shan Luo; Andrew E. Yagle

Lattice algorithms applied to the blind deconvolution problem

Research output: Contribution to journal › Conference article › peer-review

Abstract

The blind deconvolution problem is to reconstruct a sequence {r_k} from noisy observations y_k = S_k * r_k + n_k where {r_k} and {S_k} are both unknown. It is assumed that {S_k} is deterministic and minimum phase, {r_k} is a realization of a white process, and {n_k} is white Gaussian noise. The novelty of the approach is the use of lattice-based algorithms for all parts of the problem. First, the Burg method is used to estimate the magnitude of S_s (f) = F {s_k}. Second, the Schur algorithm is used to compute the spectral factor of |S_s (f)|, yielding {s_k}. Finally, the Levinson algorithm is used to solve the Toeplitz equations for the estimate of {r_k}. Results of numerical simulations are presented.

Original language	English (US)
Pages (from-to)	2341-2344
Number of pages	4
Journal	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume	4
State	Published - 1989
Externally published	Yes
Event	1989 International Conference on Acoustics, Speech, and Signal Processing - Glasgow, Scotland Duration: May 23 1989 → May 26 1989

ASJC Scopus subject areas

Software
Signal Processing
Electrical and Electronic Engineering

Cite this

@article{42e8bd3b657346738795cf96ffb8f458,

title = "Lattice algorithms applied to the blind deconvolution problem",

abstract = "The blind deconvolution problem is to reconstruct a sequence {rk} from noisy observations yk = Sk * rk + nk where {rk} and {Sk} are both unknown. It is assumed that {Sk} is deterministic and minimum phase, {rk} is a realization of a white process, and {nk} is white Gaussian noise. The novelty of the approach is the use of lattice-based algorithms for all parts of the problem. First, the Burg method is used to estimate the magnitude of Ss (f) = F {sk}. Second, the Schur algorithm is used to compute the spectral factor of |Ss (f)|, yielding {sk}. Finally, the Levinson algorithm is used to solve the Toeplitz equations for the estimate of {rk}. Results of numerical simulations are presented.",

author = "Luo, {Der Shan} and Yagle, {Andrew E.}",

year = "1989",

language = "English (US)",

volume = "4",

pages = "2341--2344",

journal = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

issn = "0736-7791",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Lattice algorithms applied to the blind deconvolution problem

AU - Luo, Der Shan

AU - Yagle, Andrew E.

PY - 1989

Y1 - 1989

N2 - The blind deconvolution problem is to reconstruct a sequence {rk} from noisy observations yk = Sk * rk + nk where {rk} and {Sk} are both unknown. It is assumed that {Sk} is deterministic and minimum phase, {rk} is a realization of a white process, and {nk} is white Gaussian noise. The novelty of the approach is the use of lattice-based algorithms for all parts of the problem. First, the Burg method is used to estimate the magnitude of Ss (f) = F {sk}. Second, the Schur algorithm is used to compute the spectral factor of |Ss (f)|, yielding {sk}. Finally, the Levinson algorithm is used to solve the Toeplitz equations for the estimate of {rk}. Results of numerical simulations are presented.

AB - The blind deconvolution problem is to reconstruct a sequence {rk} from noisy observations yk = Sk * rk + nk where {rk} and {Sk} are both unknown. It is assumed that {Sk} is deterministic and minimum phase, {rk} is a realization of a white process, and {nk} is white Gaussian noise. The novelty of the approach is the use of lattice-based algorithms for all parts of the problem. First, the Burg method is used to estimate the magnitude of Ss (f) = F {sk}. Second, the Schur algorithm is used to compute the spectral factor of |Ss (f)|, yielding {sk}. Finally, the Levinson algorithm is used to solve the Toeplitz equations for the estimate of {rk}. Results of numerical simulations are presented.

UR - http://www.scopus.com/inward/record.url?scp=0024925214&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024925214&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0024925214

SN - 0736-7791

VL - 4

SP - 2341

EP - 2344

JO - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

JF - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

T2 - 1989 International Conference on Acoustics, Speech, and Signal Processing

Y2 - 23 May 1989 through 26 May 1989

ER -

Lattice algorithms applied to the blind deconvolution problem

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this