Cart (Loading....) | Create Account
Close category search window
 

Natural gradient approach to multichannel blind deconvolution

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 $31
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

3 Author(s)
Liqing, Zhang ; Department of Control Engineering, South China University of Technology, Guangzhou 510641, P. R. China ; Yongqing, Liu ; Yongqing, Li

In this paper we study the geometrical structures of FIR filters and their application to multichannel blind deconvolution. First we introduce a Lie group structure and a Riemannian structure on the manifolds of the FIR filters. Then we derive the natural gradients on the manifolds using the isometry of the Riemannian metric. Using the natural gradient, we present a novel learning algorithm for blind deconvolution based on the minimization of mutual information. Some properties of the learning algorithm, such as equivariance and stability are also studied. Finally, the simulations are given to illustrate the effectiveness and validity of the proposed algorithm.

Published in:

Systems Engineering and Electronics, Journal of  (Volume:11 ,  Issue: 1 )

Date of Publication:

March 2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.