Title :
Blind identification and deconvolution of linear systems driven by binary random sequences
Author_Institution :
Dept. of Math., Maryland Univ., College Park, MD, USA
fDate :
1/1/1992 12:00:00 AM
Abstract :
The problem of blind identification and deconvolution of linear systems with independent binary inputs is addressed. To solve the problem, a linear system is applied to the observed data and adjusted so as to produce binary outputs. It is proved that the system coincides with the inverse of the unknown system (with scale and shift ambiguities), whether it is minimum or nonminimum phase. These results are derived for nonstationary independent binary inputs of infinite or finite length. Based on these results, an identification method is proposed for parametric linear systems. It is shown that under some mild conditions, a consistent estimator of the parameter can be obtained by minimizing a binariness criterion for the output data. Unlike many other blind identification and deconvolution methods, this criterion handles nonstationary signals and does not utilize any moment information of the inputs. Three numerical examples are presented to demonstrate the effectiveness of the proposed method
Keywords :
binary sequences; information theory; linear systems; parameter estimation; signal processing; binariness criterion; binary random sequences; blind identification; deconvolution; linear systems; nonstationary independent binary inputs; nonstationary signals; parameter estimation; parametric linear systems; signal processing; Binary sequences; Data communication; Deconvolution; Helium; Linear systems; Mathematics; Nonlinear filters; Parameter estimation; Random sequences; Signal processing;
Journal_Title :
Information Theory, IEEE Transactions on