Optimal Frequency-Hopping Sequences With New Parameters

被引:68
作者
Chung, Jin-Ho [1 ]
Yang, Kyeongcheol [1 ]
机构
[1] Pohang Univ Sci & Technol POSTECH, Dept Elect & Elect Engn, Pohang 790784, Kyungbuk, South Korea
关键词
Frequency-hopping multiple-access (FHMA); frequency-hopping sequences; Hamming autocorrelation; Lempel-Greenberger bound; power-residue sequences; HOP SIGNALS; CONSTRUCTIONS; SETS;
D O I
10.1109/TIT.2010.2040888
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A frequency-hopping sequence (FHS) of length and frequency set size M is called a (v, M, lambda)-FHS if its maximum out-of-phase Hamming autocorrelation is lambda. Three new classes of optimal FHSs with respect to the Lempel-Greenberger bound are presented in this paper. First, new optimal (p, M, f)-FHSs are constructed when p = Mf + 1 is an odd prime such that f is even and p 3 mod 4. And then, a construction for optimal (kp, p, k)-FHSs is given for any odd prime p and a positive integer k < p such that k = 2, 4, p(1), p(1) (p(1) + 2), 2(m) - 1, or p(1)(m) - 1, where p(1) and p(1) + 2 are odd primes. Finally, several new optimal FHSs with maximum out-of-phase Hamming autocorrelation 1 or 2 are also presented. In particular, the existence of optimal (v, N, 1)-FHSs is proven for any integer N >= 3 and any integer v with N + 1 <= v <= 2N - 1, as well as the existence of optimal (2N + 1,N,2)-FHSs is shown for any integer N >= 3. These classes of optimal FHSs have new parameters which are not covered in the literature.
引用
收藏
页码:1685 / 1693
页数:9
相关论文
共 25 条
[1]  
[Anonymous], 2005, SIGNAL DESIGN GOOD C, DOI DOI 10.1017/CBO9780511546907
[2]  
*BLUET SIG, SPEC BLUET SYST COR
[3]   Combinatorial characterizations of one-coincidence frequency-hopping sequences [J].
Cao, Zhenfu ;
Ge, Gennian ;
Miao, Ying .
DESIGNS CODES AND CRYPTOGRAPHY, 2006, 41 (02) :177-184
[4]   Optimal frequency-hopping sequences via cyclotomy [J].
Chu, WS ;
Colbourn, CJ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) :1139-1141
[5]   New Classes of Optimal Frequency-Hopping Sequences by Interleaving Techniques [J].
Chung, Jin-Ho ;
Han, Yun Kyoung ;
Yang, Kyeongcheol .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (12) :5783-5791
[6]   Sets of optimal frequency-hopping sequences [J].
Ding, Cunsheng ;
Yin, Jianxing .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (08) :3741-3745
[7]   Algebraic constructions of optimal frequency-hopping sequences [J].
Ding, Cunsheng ;
Moisio, Marko J. ;
Yuan, Jin .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (07) :2606-2610
[8]   Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions [J].
Ding, Cunsheng ;
Fuji-Hara, Ryoh ;
Fujiwara, Yuichiro ;
Jimbo, Masakazu ;
Mishima, Miwako .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3297-3304
[9]   New family of hopping sequences for time/frequency-hopping CDMA systems [J].
Fan, PZ ;
Lee, MH ;
Peng, DY .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2005, 4 (06) :2836-2842
[10]   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