Generation and characterization of orthogonal FH sequences for the cognitive network

• Published in: Science China. Information sciences 2015-02, Vol.58 (2), p.136-146
• Main Authors: Guan, Lei, Li, Zan, Si, JiangBo, Huang, YangChao
• Format: Article
• Language: English
• Subjects: Accessibility; Complexity; Computer Science; Computer simulation; Delay; Frequency hopping; Information Systems and Communication Service; Interference; Networks; Packet transmission; Research Paper; Sequences; 传输延迟; 动态频率; 外部干扰; 正交; 特征; 网络模型; 计算复杂性; 跳频序列
• ISSN: 1674-733X; 1869-1919
• DOI: 10.1007/s11432-014-5231-4

The existing orthogonal frequency hopping（FH） sequence cannot support the high throughput and high spectrum efficient cognitive FH（CFH） network due to its small family size, high computational complexity and short period. To overcome these disadvantages, this paper investigates the generation of the orthogonal FH sequence and analyzes its multiple accessibility performance based on the CFH frequency division multipleaccess（FDMA） network model. By the random mapping and cyclical shift replacement（CSR） scheme, a large family size of orthogonal FH sequence with dynamic frequency slot number is generated. In this case, the external interference could be eliminated by avoiding the interfered frequencies, and blocking mutual interference incurred for the packet by the orthogonal frequencies. Moreover, the theoretical relationships of the throughput and transmission delay with respect to the user number and the packet arrival rate are given, which shows that our proposed orthogonal FH sequence could support high throughput and short packet transmission delay in CFH-FDMA network. The simulation results validate our theoretical analysis of the CFH-FDMA network performance, and show that our proposed sequence outperforms the widely used no hit zone FH sequences in terms of uniformity, randomness, Hamming correlation, complexity and sensitivity, etc.