Title :
Generalized Signal Richness Preservation Problem and Vandermonde-Form Preserving Matrices
Author :
Su, Borching ; Vaidyanathan, P.P.
Author_Institution :
California Inst. of Technol., Pasadena, CA
fDate :
5/1/2007 12:00:00 AM
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
Keywords :
digital communication; matrix algebra; signal processing; Vandermonde-form preserving matrices; digital communications; generalized signal richness preservation problem; Digital communication; Guidelines; Signal processing; Sufficient conditions; Transmitters; Vectors; Blind identification; greatest common divisor; matrix theory; signal richness;
Journal_Title :
Signal Processing, IEEE Transactions on
DOI :
10.1109/TSP.2007.892712
