Abstract
The average Hamming correlation is an important performance indicator of the frequency hopping sequences. In this paper, the theoretical bound on the average Hamming correlation for frequency hopping sequences is established. Besides, a new family of frequency hopping sequences is proposed and investigated. The construction of new frequency hopping sequences is based upon the theory of power residues, and the new frequency hopping sequences are called the power residue frequency hopping sequences. It is shown that new frequency hopping sequences are optimal with respect to both average Hamming correlation family and the optimal maximum Hamming correlation.
This work was supported by the National Science Foundation of China (NSFC, 60572142), and the Foundation for the Author of National Excellent Doctoral Dissertation of PR China (FANEDD) under Grants 200341, and the Application Fundamental Research Project of Sichuan Province (2006J13-112).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fan, P.Z., Darnell, M.: Sequence Design for Communications Applications. Research Studies Press, John Wiley & Sons Ltd., London (1996)
Win, M.Z., Scholtz, R.A.: Ultra-Wide Bandwidth time-hopping spread-spectrum impulse radio for wireless multiple-access communications. IEEE Trans. Commun. 58(4), 679–691 (2002)
Peng, D.Y., Peng, T., Fan, P.Z.: Generalized Class of Cubic Frequency-Hopping Sequences with Large Family Size. IEE Proceedings on Communications 152(6), 897–902 (2005)
Lempel, A., Greenberger, H.: Families sequence with optimal hamming correlation properties. IEEE Trans. Inform. Theory IT-20, 90–94 (1974)
Peng, D.Y., Fan, P.Z.: Lower bounds on the Hamming auto- and cross- correlations of frequency-hopping sequences. IEEE Trans. Inform. Theory 50(9), 2149–2154 (2004)
Titlebaum, E.L.: Time-frequency hop signals part I: coding based upon the theory of linear congruences. IEEE Trans. Aerosp. Electron. Syst. 17(4), 490–493 (1981)
Iacobucci, M.S., Benedetto, M.G.D.: Multiple access design for impulse radio communication systems. In: IEEE International Conference on Communications, April 2002, pp. 817–820 (2002)
Titlebaum, E.L.: Time-frequency hop signals part II: coding based upon quadratic congruences. IEEE Trans. Aerosp. Electron. Syst. 17(4), 494–499 (1981)
Bellegarda, J.R., Titlebaum, E.L.: Time-frequency hop codes based upon extended quadratic congruences. IEEE Trans. Aerosp. Electron. Syst. 24(6), 726–742 (1988)
Maric, S.V.: Frequency hop multiple access codes based upon the theory of cubic congruences. IEEE Trans. Aerosp. Electron. Syst. 26(6), 1035–1039 (1990)
Jovancevic, A.V., Titlebaum, E.L.: A new receiving technique for frequency hopping CDMA systems: analysis and application. In: IEEE 47th Vehicular Technology Conference, May 1997, vol. 3, pp. 2187–2190 (1997)
Fan, P.Z., Lee, M.H., Peng, D.Y.: New Family of Hopping Sequences for Time/Frequency Hopping CDMA Systems. IEEE Trans. on Wireless Communications 4(6), 2836–2842 (2005)
Sarwate, D.V.: Reed-Solomon codes and the design of sequences for spread-spectrum multiple-access communications. In: Wicker, S.B., Bhargava, V.K. (eds.) Reed-Solomon Codes and Their Applications, IEEE Press, Piscataway (1994)
Niven, I.S., Zuckerman, H.: An Introduction to the Theory of Numbers. John Wiley Sons, Chichester (1980)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peng, D., Peng, T., Tang, X., Niu, X. (2008). A Class of Optimal Frequency Hopping Sequences Based upon the Theory of Power Residues. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds) Sequences and Their Applications - SETA 2008. SETA 2008. Lecture Notes in Computer Science, vol 5203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85912-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-85912-3_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85911-6
Online ISBN: 978-3-540-85912-3
eBook Packages: Computer ScienceComputer Science (R0)