By Topic

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

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:

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