On the karystinos-pados bounds and optimal binary DS-CDMA signature ensembles

被引：47

作者：

Ipatov, VP ^{[1
]}

机构：

[1] Univ Turku, Dept Informat Technol, Turku 20520, Finland

来源：

IEEE COMMUNICATIONS LETTERS | 2004年 / 8卷 / 02期

关键词：

code-division-multiple-access (CDMA) signatures; Karystinos-Pados bounds; Welch bound;

D O I：

10.1109/LCOMM.2004.823428

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

Tightness of the Karystinos-Pados bounds was originally proved with four exceptions. In this letter, we modify the algorithm of constructing signatures removing three of these exceptions. For the fourth one the tighter bound are derived.

引用

页码：81 / 83

页数：3

共 7 条

[1]

Baumert L. D., 1971, CYCLIC DIFFERENCE SE

[2] Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets [J].

Ding, CS ;

Golin, M ;

Klove, T .

DESIGNS CODES AND CRYPTOGRAPHY, 2003, 30 (01) :73-84

[3] New bounds on the total squared correlation and optimum design of DS-CDMA binary signature sets [J].

Karystinos, GN ;

Pados, DA .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (01) :48-51

[4]

MASSEY JL, 1993, SEQUENCES, V2

[5] OPTIMUM SEQUENCE MULTISETS FOR SYNCHRONOUS CODE-DIVISION MULTIPLE-ACCESS CHANNELS [J].

RUPF, M ;

MASSEY, JL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (04) :1261-1266

[6]

SARWATE DV, 1999, P SEQ THEIR APPL SET

[7] LOWER BOUNDS ON MAXIMUM CROSS-CORRELATION OF SIGNALS [J].

WELCH, LR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (03) :397-399

← 1 →