By Topic

A cumulant matrix subspace algorithm for blind single FIR channel identification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhi Ding ; Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA ; Jing Liang

Blind identification of discrete-time single-user FIR channels with nonminimum phase is studied here. Exploiting higher order cumulants of output signals of unknown channels, a new closed-form solution to the FIR channel impulse response is derived. The algorithm is simple and fast. It relies only on nullspace decomposition of some cumulant matrices. This method neither involves the difficult task of iterative global minimization of nonunimodal cost functions, nor does it require overparametrization, which poses consistency difficulties. It can be used either as the final channel estimate or as a good initial point in nonlinear cumulant matching techniques. The application of this identification method is broad and not limited to the use of any fixed-order cumulants. Its application in identifying data communication systems shows great potential and promise

Published in:

Signal Processing, IEEE Transactions on  (Volume:49 ,  Issue: 2 )