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

A simple proof of a known blind channel identifiability result

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)
Serpedin, E. ; Dept. of Electr. Eng., Virginia Univ., Charlottesville, VA, USA ; Giannakis, G.B.

An alternative simple proof for a well-known result encountered in blind identification and equalization of communication channels is derived. It is shown that the coprimeness condition of a number of FIR channels is equivalent to the full column rank condition of a certain block Sylvester matrix, whose entries are the channel coefficients. As a corollary, it is also shown that in general, the null space of a block Sylvester matrix is spanned by the set of (generalized) Vandermonde vectors associated with the common zeros present in all the channels

Published in:

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

Date of Publication:

Feb 1999

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.