Finite-alphabet information and multivariate blind deconvolution and identification of linear systems

Authors:
Ta-Hsin Li
Affiliations:
Dept. of Math. Sci., IBM T.J.Watson Res. Center, Yorktown Heights, NY, USA
Venue:
IEEE Transactions on Information Theory
Year:
2003

Citing 0
Cited 5

Efficient blind estimation and equalization of non-minimum phase communication channels via the use of a zero forcing equalizer

Signal Processing
Blind Recover Conditions for Images with Side Information

IEICE - Transactions on Information and Systems
Theoretical analysis on the finite-support approximation for the mixing-phase FIR systems

Signal Processing
Blind separation of instantaneous mixtures of dependent sources

ICA'07 Proceedings of the 7th international conference on Independent component analysis and signal separation
Δ-Entropy: Definition, properties and applications in system identification with quantized data

Information Sciences: an International Journal

Quantified Score

Hi-index	754.84

Visualization

Abstract

This article addresses the problem of estimating a multivariate linear system from its output when the input is an unobservable sequence of random vectors with finite-alphabet distribution. By explicitly utilizing the finite-alphabet property, an estimation method is proposed under the traditional inverse filtering paradigm as a generalization of a univariate method that has been studied previously. Identifiability of multivariate systems by the proposed method is proved mathematically under very mild conditions that can be satisfied even if the input is nonstationary and has both cross-channel and serial statistical dependencies. Statistical super-efficiency in estimating both parametric and nonparametric systems is also established for an alphabet-based cost function.