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

Super-exponential algorithms for 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 $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)
Inouye, Y. ; Dept. of Electron. & Control Syst. Eng., Shimane Univ., Matsue, Japan ; Tanebe, K.

Multichannel blind deconvolution has been receiving increasing attention. Shalvi and Weinstein proposed an attractive approach to single-channel blind deconvolution called the super-exponential methods. The objective of this correspondence is to extend the Shalvi and Weinstein (1993, 1994) approach to the multichannel case and present super-exponential algorithms for multichannel blind deconvolution. We propose three approaches to multichannel blind deconvolution. In the first one, we present a multichannel super-exponential algorithm. In the second one, we present a super-exponential deflation algorithm. In the third one, we present a two-stage super-exponential algorithm

Published in:

Signal Processing, IEEE Transactions on  (Volume:48 ,  Issue: 3 )

Date of Publication:

Mar 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.