Optimal frequency hopping sequences: a combinatorial approach

Frequency hopping multiple access (FHMA) spread-spectrum communication systems employing multiple frequency-shift keying (MFSK) as data modulation technique are investigated from a combinatorial approach. A correspondence between optimal frequency hopping (FH) sequences and partition-type difference packings is first established. By virtue of this correspondence, FHMA systems with a single optimal FH sequence each are constructed from various combinatorial structures such as affine geometries, cyclic designs, and difference families. Combinatorial recursive constructions are also presented. Many new infinite series of optimal FH sequences are thus obtained. These new FH sequences are also useful in ultra wideband (UWB) communication systems.

[1]  E. Netto.  Zur Theorie der Tripelsysteme , 1893 .

[2]  Richard M. Wilson,et al.  Cyclotomy and difference families in elementary abelian groups , 1972 .

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

[4]  Robert C. Dixon,et al.  Spread‐spectrum systems , 1976 .

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

[6]  M. Colbourn,et al.  On Cyclic Steiner 2-Designs , 1980 .

[7]  R. Mersereau,et al.  Multiple Access Frequency Hopping Patterns with Low Ambiguity , 1981, IEEE Transactions on Aerospace and Electronic Systems.

[8]  C. Colbourn,et al.  Recursive constructions for cyclic block designs , 1984 .

[9]  Hanfried Lenz,et al.  Design theory , 1985 .

[10]  B. T. Rumov.  Resolvable designs of finite geometry and related designs , 1987 .

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

[12]  I. Anderson.  Combinatorial Designs: Construction Methods , 1990 .

[13]  John J. Komo,et al.  Maximal Length Sequences for Frequency Hopping , 1990, IEEE J. Sel. Areas Commun..

[14]  Robert A. Scholtz,et al.  Multiple access with time-hopping impulse modulation , 1993, Proceedings of MILCOM '93 - IEEE Military Communications Conference.

[15]  C. Tuckett.  The Existence of Q , 1994 .

[16]  J. Ainscough,et al.  The verification of scheduling algorithms , 1994 .

[17]  M. Buratti.  On simple radical difference families , 1995 .

[18]  M. Buratti.  Improving two theorems of bose on difference families , 1995 .

[19]  C. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[20]  Pingzhi Fan,et al.  SEQUENCE DESIGN FOR COMMUNICATIONS APPLICATIONS , 1996 .

[21]  Miwako Mishima,et al.  Cyclic resolvability of cyclic Steiner 2-designs , 1997 .

[22]  Axthonv G. Oettinger,et al.  IEEE Transactions on Information Theory , 1998 .

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

[24]  Jr. Hall.  Combinatorial theory (2nd ed.) , 1998 .

[25]  Ying Miao,et al.  A Construction for Resolvable Designs and Its Generalizations , 1998, Graphs Comb..

[26]  C. Ding,et al.  Stream Ciphers and Number Theory , 1998 .

[27]  M. Buratti.  Recursive constructions for difference matrices and relative difference families , 1998 .

[28]  L. Zhu,et al.  Existence of (q,6,1) Difference Families withq a Prime Power , 1998, Des. Codes Cryptogr..

[29]  Clement W. H. Lam,et al.  On Cyclically Resolvable Cyclic Steiner 2-Designs , 1999, J. Comb. Theory, Ser. A.

[30]  K. Chen,et al.  Existence of (q, k, 1) difference families with q a prime power and k = 4, 5 , 1999 .

[31]  Clement W. H. Lam,et al.  Difference Families , 2001, Des. Codes Cryptogr..

[32]  Y. Miao,et al.  Constructions for rotational near resolvable block designs , 2001 .

[33]  R. Craigen,et al.  Hadamard Matrices and Hadamard Designs , 2006 .