In this paper, several periodic Hamming correlation lower bounds for frequency hopping sequences with low hit zone, with respect to the size p of the frequency slot set, the sequence length L, the family size M, low h...In this paper, several periodic Hamming correlation lower bounds for frequency hopping sequences with low hit zone, with respect to the size p of the frequency slot set, the sequence length L, the family size M, low hit zone LH （ or no hit zone NH ）, the maximum periodic Hamming autocorrelation sidelobe Ha and the maximum periodic Hamming crosscorrelation He, are established. It is shown that the new bounds include the known LempeI-Greenberger bounds, T.S. Seay bounds and Peng-Fan bounds for the conventional frequency hopping sequences as special cases.展开更多
The chaotic frequency hopping (FH) communication systems have been presented so far. The chaotic sequences possesses good randomness and sensitive dependence on initial conditions, which is quite advantageous to run t...The chaotic frequency hopping (FH) communication systems have been presented so far. The chaotic sequences possesses good randomness and sensitive dependence on initial conditions, which is quite advantageous to run the FH codes in code-division multiple access (CDMA) systems. But the finite precision of computation and the fact of the low-dimensional chaos predicted easily cause difficulty in chaotic application. In this paper, some disadvantages associated with the conventional FH codes and the chaotic code scrambled by m-sequences are reviewed briefly. In order to overcome these drawbacks to some extents, a new higher performance FH code called cipher quasi-chaotic (CQC) code is proposed, which is generated by combining the clock-controlled stream cipher technique and chaotic dynamics. Performance analysis applying in FH communication systems of this kind of code is given. The privacy of the CQC sequence is also analyzed.展开更多
By using d-form function, a new construction of frequency hopping sequence with optimal Hamming correlation is presented in this article, which generalizes the results presented by Ding （2007）. Furthermore, a new cl...By using d-form function, a new construction of frequency hopping sequence with optimal Hamming correlation is presented in this article, which generalizes the results presented by Ding （2007）. Furthermore, a new class of non-power function style d-form function is proposed and an upper bound of the Hamming autocorrelation of the corresponding sequence is also derived.展开更多
基金This work was supported by the National Natural Science Foundation of China （Grant No. 60572142） the NSFC/RFBR Joint Research Scheme, the NSFC/K0SEF Joint Research Scheme, and IITA, South Korea.
文摘In this paper, several periodic Hamming correlation lower bounds for frequency hopping sequences with low hit zone, with respect to the size p of the frequency slot set, the sequence length L, the family size M, low hit zone LH （ or no hit zone NH ）, the maximum periodic Hamming autocorrelation sidelobe Ha and the maximum periodic Hamming crosscorrelation He, are established. It is shown that the new bounds include the known LempeI-Greenberger bounds, T.S. Seay bounds and Peng-Fan bounds for the conventional frequency hopping sequences as special cases.
基金This project was supported by the National High Technology Research and Development Program of China (2002AA144110)the National Natural Science Foundation of China (60272082) the Postdoctoral Science Foundation of China(2003033304).
文摘The chaotic frequency hopping (FH) communication systems have been presented so far. The chaotic sequences possesses good randomness and sensitive dependence on initial conditions, which is quite advantageous to run the FH codes in code-division multiple access (CDMA) systems. But the finite precision of computation and the fact of the low-dimensional chaos predicted easily cause difficulty in chaotic application. In this paper, some disadvantages associated with the conventional FH codes and the chaotic code scrambled by m-sequences are reviewed briefly. In order to overcome these drawbacks to some extents, a new higher performance FH code called cipher quasi-chaotic (CQC) code is proposed, which is generated by combining the clock-controlled stream cipher technique and chaotic dynamics. Performance analysis applying in FH communication systems of this kind of code is given. The privacy of the CQC sequence is also analyzed.
基金supported by the Key Project of Fujian Provincial Universities-Information Technology Research Based on Mathematics,Natural Science Foundation of Fujian Province (2010J01319)the Excellent Young Teacher Developing Program of Fujian Normal University (2008100211)
文摘By using d-form function, a new construction of frequency hopping sequence with optimal Hamming correlation is presented in this article, which generalizes the results presented by Ding （2007）. Furthermore, a new class of non-power function style d-form function is proposed and an upper bound of the Hamming autocorrelation of the corresponding sequence is also derived.
