Grassmannian Signatures for CDMA Systems
- 12 April 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1553-1557 vol.3
- https://doi.org/10.1109/glocom.2003.1258498
Abstract
Codebooks constructed from Welch bound equality (WBE) sequences have been show to be optimal in terms of sum capacity in synchronous CDMA systems. Unfortunately, these codebooks are a function of the number of active signatures and need to be reassigned as the number of active users changes to maintain optimality. To mitigate the problems caused by the loss of the Welch bound equality property, in this paper we propose a special subclass of WBE sequences for which the interference power experienced by each user depends only on the number of active users and the dimensions of the code. In deference to the relationship with Grassmannian line packing, we refer to this as a Grassmannian signature set. We study the interference properties of this set, comment on the sequence design problem, and illustrate improvements over arbitrary WBE sequence sets via simulation.Keywords
This publication has 19 references indexed in Scilit:
- On the design of optimal spreading sequences for CDMA systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- No need for signaling: investigation of capacity and quality of service for multi-code CDMA systems using the WBE++ approachPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Grassmannian frames with applications to coding and communicationApplied and Computational Harmonic Analysis, 2003
- Iterative construction of optimum signature sequence sets in synchronous CDMA systemsIEEE Transactions on Information Theory, 2001
- Meeting the Welch Bound with EqualityPublished by Springer Nature ,1999
- Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receiversIEEE Transactions on Information Theory, 1999
- A Group-Theoretic Framework for the Construction of Packings in Grassmannian SpacesJournal of Algebraic Combinatorics, 1999
- Packing Lines, Planes, etc.: Packings in Grassmannian SpacesExperimental Mathematics, 1996
- Welch’s Bound and Sequence Sets for Code-Division Multiple-Access SystemsPublished by Springer Nature ,1993
- The Closest Packing of Spherical Caps in n DimensionsProceedings of the Glasgow Mathematical Association, 1955