Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties
Authors:
- 6 February 2009
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 55 (2) , 867-879
Abstract
Frequency hopping (FH) sequences play a key role in frequency hopping spread spectrum communication systems. In order to evaluate the performance of FH sequences, Lempel and Greenberger (1974) and Peng and Fan (2004) derived lower bounds on their Hamming auto- and cross-correlations. In this paper, we construct families of FH sequences with Hamming correlations meeting those bounds by combinatorial and algebraic techniques. We first construct optimal families consisting of a single FH sequence with maximum Hamming correlation equal to 2 from a combinatorial approach. Then we investigate families consisting of multiple FH sequences. We provide a combinatorial characterization for such families, and present a recursive method to construct them by means of this characterization. We also describe two algebraic constructions for such families of FH sequences, generalizing those of Ding, Moisio, and Yuan (2007). As a consequence, many new optimal families of FH sequences are obtained.Keywords
This publication has 9 references indexed in Scilit:
- Algebraic Constructions of Optimal Frequency-Hopping SequencesIEEE Transactions on Information Theory, 2007
- Further combinatorial constructions for optimal frequency-hopping sequencesJournal of Combinatorial Theory, Series A, 2006
- Comments on “Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences” by D. Peng and P. FanIEEE Transactions on Information Theory, 2005
- Optimal Frequency-Hopping Sequences Via CyclotomyIEEE Transactions on Information Theory, 2005
- Optimal Frequency Hopping Sequences: A Combinatorial ApproachIEEE Transactions on Information Theory, 2004
- Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping SequencesIEEE Transactions on Information Theory, 2004
- Cyclic orthogonal and balanced arraysJournal of Statistical Planning and Inference, 1996
- Frequency-hopping code sequence designs having large linear spanIEEE Transactions on Information Theory, 1988
- Families of sequences with optimal Hamming-correlation propertiesIEEE Transactions on Information Theory, 1974