Algebraic constructions of optimal frequency-hopping sequences

被引：114
作者：
Ding, Cunsheng
Moisio, Marko J.
Yuan, Jin
机构：
[1] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong, Peoples R China
[2] Univ Vaasa, Dept Math Stat, FIN-65101 Vaasa, Finland
[3] Macquarie Univ, Dept Comp, N Ryde, NSW 2109, Australia
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2007年 / 53卷 / 07期
关键词：
frequency-hopping spread spectrum; norm function; perfect non-linear function;
D O I：
10.1109/TIT.2007.899545
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Frequency-hopping (FH) spread spectrum and direct-sequence spread spectrum are two main spread-coding technologies. Frequency-hopping sequences are needed in FH code-division multiple-access (CDMA) systems. In this correspondence, three classes of optimal frequency-hopping sequences are constructed with algebraic methods. The three classes are based on perfect nonlinear functions, power functions, and norm functions, respectively. Both individual optimal frequency-hopping sequences and optimal families of frequency-hopping sequences are presented.
引用
收藏
页码：2606 / 2610
页数：5
相关论文
共 12 条
[1]   A NEW CONSTRUCTION OF CIRCULANT GH(P(2) Z(P)) [J].
BROCK, BW .
DISCRETE MATHEMATICS, 1993, 112 (1-3) :249-252
[2]   Highly nonlinear mappings [J].
Carlet, C ;
Ding, CS .
JOURNAL OF COMPLEXITY, 2004, 20 (2-3) :205-244
[3]   Optimal frequency-hopping sequences via cyclotomy [J].
Chu, WS ;
Colbourn, CJ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) :1139-1141
[4]   CIRCULANT GH(P2-ZP) EXIST FOR ALL PRIMES P [J].
DELAUNEY, W .
GRAPHS AND COMBINATORICS, 1992, 8 (04) :317-321
[5]   Optimal frequency hopping sequences: A combinatorial approach [J].
Fuji-Hara, R ;
Miao, Y ;
Mishima, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) :2408-2420
[6]   Further combinatorial constructions for optimal frequency-hopping sequences [J].
Ge, Gennian ;
Fuji-Hara, Ryoh ;
Miao, Ying .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2006, 113 (08) :1699-1718
[7]   FREQUENCY-HOPPING CODE SEQUENCE DESIGNS HAVING LARGE LINEAR SPAN [J].
KUMAR, PV .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (01) :146-151
[8]   FAMILIES OF SEQUENCES WITH OPTIMAL HAMMING CORRELATION PROPERTIES [J].
LEMPEL, A ;
GREENBER.H .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (01) :90-94
[9]  
Lidl R., 1997, Finite Fields, V20
[10]   Lower bounds on the hamming auto- and cross correlations of frequency-hopping sequences [J].
Peng, DY ;
Fan, PZ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (09) :2149-2154
12