Abstract
In quasi-synchronous frequency-hopping multiple access (QS-FHMA) systems, low-hit-zone (LHZ) frequency-hopping sequence (FHS) sets have been well-applied to reduce mutual interference (MI). In this paper, we propose three constructions of LHZ FHS sets with new parameters via interleaving techniques. The obtained sequences can be verified that they are optimal with respect to the Peng–Fan–Lee bound.
1. Introduction
Frequency-hopping multiple-access (FHMA) is widely used in modern communication systems such as military radar communication systems, Bluetooth communication systems, and more [1,2,3]. Simultaneous transmission of data by multiple users on the same frequency leads to mutual interference (MI), which should be minimized to improve the quality and reliability of the communication. In addition to this, there exists a strong association between the Hamming correlation (HC) of the frequency hopping sequence (FHS) set and the level of the MI. Therefore, it is reasonable to prioritize the construction of FHS sets with a low HC for the significance of the HC in evaluating the performance of frequency hopping sequences (FHSs).
The value of the MI will be maintained at a low level at the zone around the origin between various users, and the low-hit-zone (LHZ) FHS sets will be employed in quasi-synchronous (QS) FHMA systems. Thus, the construction of the optimal LHZ FHS set with respect to the Peng–Fan–Lee bound is preferable to the construction of the optimal FHS set with respect to the Peng–Fan bound [4] in some respects.
Numerous optimal LHZ FHS sets have been found that satisfy the Peng–Fan–Lee bound [5]. Ma and Sun [6] constructed the first class of optimal LHZ FHS sets with respect to the Peng–Fan–Lee bound in 2010. Using the Cartesian, Chung et al. [7] provided a few constructions of the optimal LHZ FHS sets in 2013. By using the interleaving technique, Niu et al. [8,9] obtained various constructions of optimal LHZ FHS sets in 2012 and 2014. Cai et al. [10,11] obtained classes of optimal LHZ FHS sets with optimal partial HC properties in 2014 and 2015. Han et al. [12] and Wang et al. [13] constructed LHZ FHS sets with different parameters in 2016. Using the Cartesian, Zhou et al. [14,15] introduced some constructions of LHZ FHS sets in 2017. Ling et al. [16] obtained a class of optimal LHZ FHS sets in the next year. Niu et al. [17,18] constructed a new class of optimal LHZ FHS sets with large family sizes in 2019. In the same year, the construction by Han et al. [19] of a class of LHZ FHS sets with the optimal partial HC. Niu et al. [20,21] constructed classes of optimal FHS sets in 2020. In 2022, Zhou et al. [22] constructed four classes of LHZ FHS sets with optimal partial HC properties.
In this paper, we propose three constructions of LHZ FHS sets with new parameters by interleaving technique and the LHZ FHS sets are optimal with respect to the Peng–Fan–Lee bound. We make the following arrangement for the remaining portion of this paper. We introduced some notations and the bounds on the FHS set in Section 2. We described how the LHZ FHS set is constructed by using an interleaving technique in Section 3. Finally, we made a few concluding remarks in Section 4.
2. Preliminaries
Let be a set with c available frequency slots. A sequence is called a FHS of length L over F for all , . For any two FHSs , of length L over F, their Hamming correlation function of sequences X and Y at delay time is defined by
where the subscript of the above equation needs to be modulo L, and if , and 0 otherwise.
For a sequence X, the Hamming autocorrelation of X can be defined as
For any given FHS set , the maximum Hamming autocorrelation (MHAC) , the maximum Hamming crosscorrelation (MHCC) and the maximum Hamming correlation (MHC) of are, respectively, defined as
In 2004, Peng and Fan proposed a lower bound for an FHS set as follows.
Lemma 1
(Peng-Fan bound [4]). Let be a set, then we have
where denotes a set of N FHSs of length L with size c, with the MHC .
If each parameter of the FHS set substituted into the above equation satisfies the equal sign case, the is said to be the optimal FHS set.
For any FHS set , if , , the LHZ of is defined as
In 2006, Peng, Fan and Lee proposed a lower bound for the LHZ FHS set as follows.
Lemma 2
(Peng–Fan–Lee bound [5]). Let be the LHZ FHS set. Then, for any positive integer Z, , we have
where denotes a set of N FHSs of length L with size c, with the MHC and the LHZ .
If each parameter of the LHZ FHS set substituted into the above equation satisfies the equal sign case, the is said to be the optimal LHZ FHS set.
3. Interleaving Technique of FHSs
Let be a FHS, and be a shift sequence of length T over a frequency slot set of size p, i.e., , . A matrix of can be obtained through the sequences A and E in the following way.
Reading each element of the matrix by row, we have a sequence of length . Let B be called the interleaved sequence and E is called a shift sequence. The interleaved sequence B can be written as
where I is the interleaving operator and L is the shift operator.
Let be another shift sequence over a frequency slot set of size p and . Considering the shift factor, we can obtain , where . By the matrix representation, could be written as
Obviously, is just another interleaved sequence. Namely, we have
Then, the obtained HC function of the interleaved sequence B and V at delay time can be expressed as the summation of the inner product between the (1) and (2). Then, we have
For any , let
where needs to be modulo p. Then, the HC function of B and V can be rewritten as
Lemma 3.
According to the above notation, for the sequences B and V, corresponding to the shift sequences E and U, we have
where
Besides, we introduce a class of construction methods by an interleaving technique as follows.
- Step 1:
- Select an FHS set ,
- Step 2:
- For a given T, and , generate a set of shift sequences,
- Step 3:
- Construct the FHS set , where . Then for any ,
By the above construction, we can deduce the LHZ and MHC of this LHZ FHS set as follows.
Theorem 1.
The sequence set generated by the interleaving technique is a LHZ FHS set, where
Proof of Theorem 1.
For any two FHSs , ∈, which correspond to the shift sequences and ∈, then the MHC of in the LHZ can be verified as follows.
Case 1: . Then we have = . From Lemma 3, the MHAC of the sequences is , when . The case does not need to be concerned when the .
Case 2: .
- (1)
- If and = , according to the displacement characteristics, the MHCC of the sequences is for any and .
- (2)
- If , or , , the MHCC of the sequences is , for
From the above cases, for any , , the MHC of is given by , where
□
4. Optimal FHS Set with LHZ
In this section, the optimal LHZ FHS set with the new parameters is constructed based on different shift sequences through the interleaving technique [23,24].
Construction 1.
Step 1: Select an optimal FHS set that satisfies the Peng–Fan bound, .
- Step 2: Let be three positive integers, is an integer, , and . The shift sequence . We have
- Step 3: Construct the LHZ FHS set , , where for each
Theorem 2.
The LHZ FHS set constructed by Construction 1 is an optimal LHZ FHS set if T satisfies . By permuting the sequences within a set of shift sequences, the resulting set of sequences is also an optimal LHZ FHS set.
Proof of Theorem 2.
The shift sequence set is represented by a matrix,
The can be written as the following two cases.
Case 1:
We can obtain the relationship between the parameters of the rows and columns in the shift matrix from the above equation.
If any parameter meets the condition , then . But the maximum value of is . Therefore, the shift sequence are not identical to each other.
It can be learned from (5) that when and , the value
Therefore, from the Theorem 2, the LHZ of is . The same analysis as above for (4), the LHZ of is .
Concurrently, if the columns of the shift matrix are transformed, different representations of the shift matrix can be obtained. The following shift matrix is one of such representations.
where . Based on the above proof, it can be shown that each element in a shift matrix is distinct and shift matrices do not collide with each other in rows and columns. Therefore, we have the LHZ of is .
Moreover, we have
According to Lemma 2, the MHC of FHS set is
For , the MHC of is the value that satisfies the equal sign of the Peng–Fan–Lee bound. In a word, the LHZ FHS set is said to be the optimal. □
Example 1.
Select an optimal (16, 3, 7, 2) FHS set , where
One can obtain the shift sequences , such that . It follows that
Construct the LHZ FHS set by the Construction 1, where
As shown in Figure 1, the MHC of set is 8 when the . It can be verified that for , thus is an optimal (64, 9, 7, 3, 8) LHZ FHS set.
Figure 1.
MHC of in Example 1.
Construction 2.
Step 1: Select an optimal FHS set with respect to the Peng–Fan bound.
Step 2: Select two integers and a positive integer w, . Then, generate a shift sequence as follows,
Step 3: Construct a new set of FHS ,
Theorem 3.
The LHZ FHS set constructed by Construction 2 is an optimal LHZ FHS set if the parameters meet the following conditions. If , T satisfies then is an optimal LHZ FHS set. If and T satisfies then is an optimal LHZ FHS set.
Proof of Theorem 3.
We have
From the parameters of the shift sequence set in Construction 2, we have
Therefore, if and , the minimum value of is . Then,
If and , the minimum value of is . Then,
Furthermore, we have
According to Lemma 2, the MHC of FHS is
Case 1: when ,
For
the MHC of is the value that satisfies the equal sign of the Peng–Fan–Lee bound.
Case 2: when ,
For
the MHC of is the value that satisfies the equal sign of the Peng–Fan–Lee bound.
Therefore, the LHZ FHS set is said to be the optimal. □
Example 2.
Select an optimal (16, 3, 7, 2) FHS set , where
We set the parameters . Then, the shift sequence is .
Construct the LHZ FHS set where
As shown in Figure 2, the MHC of set is 10 when the . It can be verified that , then is an optimal (80, 3, 7, 8, 10) LHZ FHS set.
Figure 2.
MHC of in Example 2.
Example 3.
Select an optimal (16, 7, 3, 2) FHS set , such that
We set the parameters , the shift sequence is .
Construct the LHZ FHS set where
As shown in Figure 3, the MHC of set is 8 when the time delay . It can be verified that , then is an optimal (64, 3, 7, 8, 8) LHZ FHS set.
Figure 3.
MHC of in Example 3.
Construction 3.
Step 1: Select an optimal FHS set that satisfies the Peng–Fan bound, .
- Step 2: Let T, u, k be three positive integers. w, are two integers, , and . The shift sequence is . We have
- Step 3: Construct LHZ FHS set , , where for each
Theorem 4.
The LHZ FHS set constructed by Construction 3 is an optimal LHZ FHS set if parameter meets , and .
Proof of Theorem 4.
The shift sequence set is represented by a matrix,
At this time, the delay time is , then
Besides, we have
According to Lemma 2, the MHC of LHZ FHS set is
For
the MHC of is the value that satisfies the equal sign of Peng-Fan-Lee bound. All in all, the LHZ FHS set is said to be the optimal. □
Example 4.
Select an optimal (16, 3, 7, 2) FHS set , where
We set the parameters , the shift sequences , . It follows that
We construct the LHZ FHS set where
As shown in Figure 4, the MHC of set is 6 when the . It can be verified that , then is an optimal (48, 6, 7, 4, 6) LHZ FHS set.
Figure 4.
MHC of in Example 4.
5. Conclusions
In this paper, we propose three new methods for the construction of the optimal LHZ FHS set and prove some sufficient conditions that they need to satisfy. As a comparison, we list the parameters of the existing optimal LHZ FHS sets and the optimal LHZ FHS sets constructed in this paper in Table 1. As a result, our constructed sequences are more flexible and can be used to eliminate MI in QS FHMA systems. Future work can explore the application of FHSs in more scenarios, such as image processing, data encryption, mobile communication, security and privacy. Overall, exploring the application of FHSs in various scenarios can lead to new innovations and improvements in different areas of wireless communication.
Table 1.
Comparison of parameters for LHZ FHS sets with optimal Hamming correlation.
Author Contributions
Conceptualization, X.T.; data curation, X.T.; formal analysis, X.T.; funding acquisition, H.H.; investigation, X.T.; methodology, H.H., X.N. and X.L.; project administration, H.H.; resources, X.T.; software, X.T.; supervision, H.H.; validation, X.T.; visualization, X.T.; writing—original draft, X.T.; writing—review and editing, H.H., X.N. and X.L. All authors have read and agreed to the published the final version of the manuscript.
Funding
This research was funded by the National Natural Science Foundation of China (Grant No. 61701331), Sichuan Science and Technology Plan Project (Grant No. 2021YFG0012), and Science and Technology Major Project of Tibetan Autonomous Region of China (Grant No. XZ202201ZD0006G02).
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
Abbreviations
The following abbreviations are used in this manuscript:
| FHS | frequency-hopping sequence |
| HC | Hamming correlation |
| LHZ | low-hit-zone |
| MHAC | maximum Hamming autocorrelation |
| MHC | maximum Hamming correlation |
| MHCC | maximum Hamming crosscorrelation |
| MI | mutual interference |
| QS-FHMA | quasi-synchronous frequency-hopping multiple access |
References
- Golomb, S.W.; Gong, G. Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar; Cambridge University Press: New York, NY, USA, 2005. [Google Scholar]
- Fan, P.; Darnell, M. Sequence Design for Communications Applications; Research Studies Press: London, UK, 1996; pp. 271–350. [Google Scholar]
- Li, Z.; Chang, Y.; Jin, L.J. A novel family of frequency hopping sequences for multi-hop Bluetooth networks. IEEE Trans. Consum. Electron. 2003, 49, 1084–1089. [Google Scholar]
- Peng, D.; Fan, P. Lower bounds on the Hamming auto- and cross correlations of frequency-hopping sequences. IEEE Trans. Inf. Theory 2004, 50, 2149–2154. [Google Scholar] [CrossRef]
- Peng, D.; Fan, P.; Lee, M.H. Lower bounds on the periodic Hamming correlations of frequency hopping sequences with low hit zone. Sci. China Ser. F Inf. Sci. 2006, 49, 208–218. [Google Scholar] [CrossRef] [Scilit]
- Ma, W.; Sun, S. New designs of frequency hopping sequences with low hit zone. Des. Codes Cryptogr. 2011, 60, 145–153. [Google Scholar] [CrossRef] [Scilit]
- Chung, J.H.; Han, Y.; Yang, K. New Classes of Optimal Frequency-Hopping Sequences by Interleaving Techniques. IEEE Trans. Inf. Theory 2009, 55, 5783–5791. [Google Scholar] [CrossRef] [Scilit]
- Niu, X.; Peng, D.; Zhou, Z. Frequency/time hopping sequence sets with optimal partial Hamming correlation properties. Sci. China Ser. F Inf. Sci. 2012, 55, 2207–2215. [Google Scholar] [CrossRef] [Scilit]
- Niu, X.; Peng, D.; Zhou, Z. New Classes of Optimal Low Hit Zone Frequency Hopping Sequences with New Parameters. IEICE Trans. Fundam. 2014, 95, 1835–1842. [Google Scholar] [CrossRef] [Scilit]
- Cai, H.; Yang, Y.; Zhou, Z.; Tang, X. Strictly Optimal Frequency-Hopping Sequence Sets With Optimal Family Sizes. IEEE Trans. Inf. Theory 2016, 62, 1087–1093. [Google Scholar]
- Cai, H.; Zhou, Z.C.; Yang, Y.; Tang, X.H. A New Construction of Frequency-Hopping Sequences With Optimal Partial Hamming Correlation. IEEE Trans. Inf. Theory 2014, 60, 5782–5790. [Google Scholar]
- Han, H.; Peng, D.; Parampalli, U. New sets of optimal low-hit-zone frequency-hopping sequences based on m-sequences. Cryptogr. Commun. 2017, 9, 511–522. [Google Scholar] [CrossRef] [Scilit]
- Wang, C.; Peng, D.; Zhou, L. New Constructions of Optimal Frequency-Hopping Sequence Sets with Low-Hit-Zone. Int. J. Found. Comput. Sci. 2016, 27, 53–66. [Google Scholar] [CrossRef] [Scilit]
- Zhou, L.; Peng, D.; Liang, H.; Wang, C.Y.; Ma, Z. Constructions of optimal low-hit-zone frequency hopping sequence sets. Des. Codes Cryptogr.. 2017, 85, 219–232. [Google Scholar] [CrossRef] [Scilit]
- Zhou, L.; Peng, D.; Liang, H.; Wang, C.; Han, H. Generalized methods to construct low-hit-zone frequency-hopping sequence sets and optimal constructions. Cryptogr. Commun. 2017, 9, 707–728. [Google Scholar] [CrossRef] [Scilit]
- Ling, L.; Niu, X.; Zeng, B.; Liu, X. New classes of optimal low hit zone frequency hopping sequence set with large family size. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 2018, 101, 2213–2216. [Google Scholar] [CrossRef] [Scilit]
- Niu, X.; Han, L.; Liu, X. New Extension Interleaved Constructions of Optimal Frequency Hopping Sequence Sets With Low Hit Zone. IEEE Access 2019, 7, 73870–73879. [Google Scholar] [CrossRef] [Scilit]
- Niu, X.; Xing, C. New Extension Constructions of Optimal Frequency-Hopping Sequence Sets. IEEE Trans. Inf. Theory 2019, 56, 5846–5855. [Google Scholar] [CrossRef] [Scilit]
- Han, H.; Zhou, L.; Liu, X. New Construction for Low Hit Zone Frequency Hopping Sequence Sets with Optimal Partial Hamming Correlation. In Proceedings of the 2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA), Dongguan, China, 20–24 October 2019; pp. 1–5. [Google Scholar]
- Niu, X.; Xing, C.; Yuan, C. Asymptotic Gilbert–Varshamov Bound on Frequency Hopping Sequences. IEEE Trans. Inf. Theory 2020, 66, 1213–1218. [Google Scholar] [CrossRef] [Scilit]
- Niu, X.; Xing, C.; Liu, Y.; Zhou, L. A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields. IEEE Trans. Inf. Theory 2020, 66, 5310–5315. [Google Scholar] [CrossRef] [Scilit]
- Zhou, L.; Liu, X.; Han, H.; Wang, C. Classes of optimal low-hit-zone frequency-hopping sequence sets with new parameters. Cryptogr. Commun. 2022, 14, 291–306. [Google Scholar] [CrossRef] [Scilit]
- Gong, G. Theory and applications of q-ary interleaved sequences. IEEE Trans. Inf. Theory 1995, 41, 400–411. [Google Scholar] [CrossRef]
- Gong, G. New designs for signal sets with low cross correlation, balance property, and large linear span: GF(p) case. IEEE Trans. Inf. Theory 2002, 48, 2847–2867. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).



