For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Subspace Blind Identification Algorithm with Reduced Computational Complexity--Colored Noise Case--
Nari TANABE Toshihiro FURUKAWA Kohichi SAKANIWA Shigeo TSUJII
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/07/01
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Digital Signal Processing
principal component analysis, subspace method, colored observation noise, noise variance, channel order, computational complexity,
Full Text: PDF(264.6KB)>>
We have proposed in  a practical blind channel identification algorithm for the white observation noise. In this paper, we examine the effectiveness of the algorithm given in  for the colored observation noise. The proposed algorithm utilizes Gram-Schmidt orthogonalization procedure and estimates (1) the channel order, (2) the noise variance and then (3) the channel impulse response with less computational complexity compared to the conventional algorithms using eigenvalue decomposition. It can be shown through numerical examples that the algorithm proposed in  is quite effective in the colored noise case.