Published May 1, 2007
| public
Journal Article
Open
Generalized Signal Richness Preservation Problem and Vandermonde-Form Preserving Matrices
- Creators
- Su, Borching
-
Vaidyanathan, P. P.
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
© 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.Files
SUBieeetsp07.pdf
Files
(576.3 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:d033c5045e160e43f5c31b0f0b5e9de7
|
576.3 kB | Preview Download |
Additional details
- Eprint ID
- 8515
- Resolver ID
- CaltechAUTHORS:SUBieeetsp07
- Created
-
2007-08-17Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field