Published 2006 | Version public
Book Section - Chapter

Vandermonde-form Preserving Matrices And The Generalized Signal Richness Preservation Problem

Abstract

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

© 2006 IEEE. Issue Date: Oct. 29 2006-Nov. 1 2006. Date of Current Version: 07 May 2007. Work supported in parts by the NSF grant CCF-0428326 and the Moore Fellowship of the California Institute of Technology.

Additional details

Identifiers

Eprint ID
24573
Resolver ID
CaltechAUTHORS:20110727-144256045

Funding

NSF
CCF-0428326
Caltech Moore Fellowship

Dates

Created
2011-07-27
Created from EPrint's datestamp field
Updated
2021-11-09
Created from EPrint's last_modified field

Caltech Custom Metadata

Series Name
Conference Record of the Asilomar Conference on Signals, Systems and Computers
Other Numbering System Name
INSPEC Accession Number
Other Numbering System Identifier
10288390