Scalable TSC-optimal overloading of binary signature sets

被引:0
作者
Ganapathy, Harish [1 ]
Grover, Rohan [1 ]
Pados, Dimitris A. [1 ]
机构
[1] SUNY Buffalo, Dept Elect Engn, Buffalo, NY 14260 USA
来源
GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE | 2006年
关键词
Binary sequences; code division multi-access; codes; signature design; total squared correlation; Welch bound;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Recent advances in the area of binary sequences for code-division multiplexing provide us with minimum total-squared-correlation (TSC) optimal signature sets for (almost) all signature lengths L and set sizes K. The sets are scalable as long as K <= L (underloaded systems) and non-scalable-in general require signature re-design/re-assignment as users enter or exit-when K > L (overloaded systems). In this paper, we derive new lower bounds on the conditional TSC of overloaded binary signature sets built on fixed full-load TSC-optimal sets. Overloading is allowed to be as high as 100%. Scalable designs that achieve the new bounds are then developed. To evaluate the performance of the proposed designs, we compare the TSC of our constructions to the unconditionally minimum achievable TSC values.
引用
收藏
页数:6
相关论文
共 13 条