论文信息 - Algebraic Constructions of Optimal Frequency-Hopping Sequences

Algebraic Constructions of Optimal Frequency-Hopping Sequences

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.

Cunsheng Ding | Jin Yuan | Marko J. Moisio

[1] Abraham Lempel,et al. Families of sequences with optimal Hamming-correlation properties , 1974, IEEE Trans. Inf. Theory.

[2] Mohammad Umar Siddiqi,et al. Optimal Large Linear Complexity Frequency Hopping Patterns Derived from Polynomial Residue Class Rings , 1998, IEEE Trans. Inf. Theory.

[3] Ying Miao,et al. Optimal frequency hopping sequences: a combinatorial approach , 2004, IEEE Transactions on Information Theory.

[4] P. Vijay Kumar,et al. Frequency-hopping code sequence designs having large linear span , 1988, IEEE Trans. Inf. Theory.

[5] Bradley W. Brock. A new construction of circulant GH(p2;Zp) , 1993, Discret. Math..

[6] Cunsheng Ding,et al. Highly nonlinear mappings , 2004, J. Complex..

[7] Charles J. Colbourn,et al. Optimal frequency-hopping sequences via cyclotomy , 2005, IEEE Transactions on Information Theory.

[8] Warwick de Launey. CirculantGH(p2; Zp) exist for all primesp , 1992, Graphs Comb..

[9] Robert A. Scholtz,et al. The Spread Spectrum Concept , 1977, IEEE Trans. Commun..

[10] Daiyuan Peng,et al. Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences , 2004, IEEE Trans. Inf. Theory.

[11] Gennian Ge,et al. Further combinatorial constructions for optimal frequency-hopping sequences , 2006, J. Comb. Theory, Ser. A.