Optimal Frequency Hopping Sequences: A Combinatorial Approach

Fuji-Hara, Ryoh; Miao, Ying; Mishima, Miwako

doi:10.1109/tit.2004.834783

Cited by 114 publications

(85 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several optimal FHS sets were constructed from algebraic or combinatorial structures [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27].…”

Section: Construction Of Frequency-hopping Sequences Of Length Nnmentioning

confidence: 99%

New Families of Optimal Frequency-Hopping Sequences of Composite Lengths

Chung

Gong

Yang

2014

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Frequency-hopping sequences (FHSs) are employed to mitigate the interferences caused by the hits of frequencies in frequency-hopping spread spectrum systems. In this paper, we present two new constructions for FHS sets. We first give a new construction for FHS sets of length nN for two positive integers n and N with gcd(n, N ) = 1. We then present another construction for FHS sets of length (q − 1)N , where q is a prime power satisfying gcd(q − 1, N ) = 1. By these two constructions, we obtain infinitely many new optimal FHS sets with respect to the Peng-Fan bound as well as new optimal FHSs with respect to the Lempel-Greenberger bound, which have length nN or n(q − 1)N . As a result, a great deal of flexibility may be provided in the choice of FHS sets for a given frequency-hopping spread spectrum system.

show abstract

“…Several optimal FHS sets were constructed from algebraic or combinatorial structures [8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27].…”

Section: Construction Of Frequency-hopping Sequences Of Length Nnmentioning

confidence: 99%

New Families of Optimal Frequency-Hopping Sequences of Composite Lengths

Chung

Gong

Yang

2014

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…FH sequences are used to specify which frequency will be used for transmission at any given time. Fuji-Hara et al [2] investigated frequency-hopping multiple access (FHMA) systems with a single optimal FH sequence using a combinatorial approach. They established the correspondence between frequency-hopping sequences and PCDPs.…”

Section: A Pcdps and Frequency-hopping Sequencesmentioning

confidence: 99%

“…In evaluating the goodness of FH sequence design, the Hamming correlation function is used as an important measure. Fuji-Hara et al [2] introduced a new class of combinatorial designs and showed that they are equivalent to FH sequences optimal with respect to Hamming correlation. We call these combinatorial designs partitioned cyclic difference packings (PCDPs) in this paper.…”

Section: Introductionmentioning

confidence: 99%

“…The notion of PCDP is first introduced by Fuji-Hara et al [2] in their investigation of frequency-hopping sequences, where it is referred to as "a partition type difference packing".…”

Section: Introductionmentioning

confidence: 99%

“…For more detailed information on PCDPs and known results, the reader is referred to [2], [4] and the references therein. In this paper, we make further investigation into optimal PCDPs.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization

Chee

Ling

Yin³

2010

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, based on almost difference sets and cyclic difference matrices, are given. These produce new infinite families of optimal PCDPs (and hence optimal frequency-hopping sequences and optimal comma-free codes). The existence problem for optimal PCDPs in Z3m, with m base blocks of size three, is also solved for all m ≡ 8, 16 (mod 24).

show abstract

Introduction to UWB Signals and Systems

Molisch

2006

Ultra‐Wideband

View full text Add to dashboard Cite

Optimal Frequency Hopping Sequences: A Combinatorial Approach

Cited by 114 publications

References 24 publications

New Families of Optimal Frequency-Hopping Sequences of Composite Lengths

New Families of Optimal Frequency-Hopping Sequences of Composite Lengths

Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization

Introduction to UWB Signals and Systems

Contact Info

Product

Resources

About