基于頻率分組的CHESS系統(tǒng)G函數(shù)算法研究
The G Function Algorithm for CHESS System Based on Frequency Grouping
-
摘要: 該文在現(xiàn)有研究結(jié)果的基礎(chǔ)上，針對CHESS系統(tǒng)提出了一種新的G函數(shù)算法，該算法將總頻率集中的頻點(diǎn)隨機(jī)分為m=2BPH 個(gè)子頻率集，根據(jù)待發(fā)送的信息以及信息碼與子頻率集的對應(yīng)關(guān)系得出下一跳的頻點(diǎn)，由檢驗(yàn)結(jié)果看出該方法在以往的基礎(chǔ)上提高了系統(tǒng)的一維均勻性、二維連續(xù)性及隨機(jī)性，取得了較好的效果。
-
關(guān)鍵詞:
- 短波跳頻;CHESS系統(tǒng);G函數(shù);頻率分組
Abstract: On the basis of existing references, this paper proposes a new G function algorithm for the HF high speed FH CHESS radio system. In the algorithm, the frequencies are grouped into m=2BPH subsets. The next hopping frequency is chosen according to the coding series and the corresponding relationship between the codes and the frequency subsets. The performance test results show that the algorithm has more superiority in 1-dimensional uniformity, 2-dimensional continuity and randomness of the hopping series compared with previous G function algorithm. -
計(jì)量
- 文章訪問數(shù): 2107
- HTML全文瀏覽量: 116
- PDF下載量: 681
- 被引次數(shù): 0
下載:
