A New Approach of Blind Channel Identification in Frequency Domain

Authors:
Chen Caiyun;Li Ronghua
Affiliations:
School of Electronic & Information Engineering, South China University of Technology, Guangzhou 510641, Guangdong, China;School of Electronic & Information Engineering, South China University of Technology, Guangzhou 510641, Guangdong, China
Venue:
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III
Year:
2007

Citing 8
Cited 0

A Note on Stone's Conjecture of Blind Signal Separation

Neural Computation
QR factorization based blind channel identification withsecond-order statistics

IEEE Transactions on Signal Processing
Subspace methods for the blind identification of multichannel FIRfilters

IEEE Transactions on Signal Processing
Blind channel equalization with colored sources based onsecond-order statistics: a linear prediction approach

IEEE Transactions on Signal Processing
Underdetermined blind source separation based on sparse representation

IEEE Transactions on Signal Processing
Probability estimation for recoverability analysis of blind source separation based on sparse representation

IEEE Transactions on Information Theory
Blind channel identification based on second-order statistics: a frequency-domain approach

IEEE Transactions on Information Theory
Blind estimation of channel parameters and source components for EEG signals: a sparse factorization approach

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper develops a new blind channel identification method in frequency domain. Oversampled signal has the property of spectral redundancy in frequency domain which is corresponding to the cyclostationarity property in time domain. This method exploits the cyclostationarity of oversampled signals to identify possibly non-minimum phase FIR channels. Unlike many existing methods, this method doesn't need EVD or SVD of correlation matrix. Several polynomials are constructed and zeros of channels are identified through seeking for common zeros of those polynomials. It is in the similar spirit of Tong's frequency approach, but this new algorithm is much simpler and computationally more efficient. A sufficient and necessary condition for channel identification is also provided in this paper. This condition is quite similar to Tong's time domain theory but it is derived from a novel point of view.