Su, Borching and Vaidyanathan, P. P. (2007) Generalized Signal Richness Preservation Problem and Vandermonde-Form Preserving Matrices. IEEE Transactions on Signal Processing, 55 (5, Par). pp. 2239-2250. ISSN 1053-587X http://resolver.caltech.edu/CaltechAUTHORS:SUBieeetsp07
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:SUBieeetsp07
In this paper, a theoretical problem arising in digital communications, namely the generalized signal richness preservation problem, is addressed and studied. In order to solve the problem, a special class of square matrices, namely the "Vandermonde-form preserving" (VFP) matrices, is introduced and found to be highly relevant to the problem. Several properties of VFP matrices are studied in detail. The necessary and sufficient conditions of the problem have been found, and a systematic proof is also presented.
|Additional Information:||© Copyright 2007 IEEE. Reprinted with permission. Manuscript received April 4, 2006; revised July 3, 2006. [Posted online: 2007-04-23] This work was supported in part by the National Science Foundation under Grant CCF-0428326, in part by the Office of Naval Research under Grant N00014-06-1-0011, and in part by the Moore Fellowship of the California Institute of Technology. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Kostas Berberidis. The authors would like to appreciate anonymous reviewers who provided useful comments that improved the quality of this paper.|
|Subject Keywords:||Blind identification, greatest common divisor, matrix theory, signal richness|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||17 Aug 2007|
|Last Modified:||26 Dec 2012 09:39|
Repository Staff Only: item control page