Low‐complexity algorithms for generating frequency hopping sequences with good aperiodic hamming correlation property-Reference-Cited by-同舟云学术

Low‐complexity algorithms for generating frequency hopping sequences with good aperiodic hamming correlation property

Published:2024-09 Issue:17 Volume:60 Page:
ISSN:0013-5194
Container-title:Electronics Letters
language:en
Short-container-title:Electronics Letters

Author:

Yang Shifu¹^ORCID,Xu Zhe¹,Jiang Kaichuang¹,Liu Xing²^ORCID

Affiliation:

1. No 2. Department Shanghai Radio Equipment Research Institute Shanghai China

2. College of Electrical Engineering Sichuan University Chengdu China

Abstract

AbstractIn this letter, novel methods for quickly generating frequency hopping (FH) sequences with good out‐of‐phase peak aperiodic Hamming auto‐correlation (PAHAC) property are proposed. Compared with brute‐force search algorithm, the proposed algorithms have an obvious advantage on their time complexity. Results show that the algorithms can generate FH sequences with optimal/quasi‐optimal PAHAC performance in all tested cases.

Publisher

Institution of Engineering and Technology (IET)

Reference15 articles.

1. Vasudevan K.:Near capacity signaling over fading channels using coherent turbo coded ofdm and massive mimo. arXiv abs/1711.10104 (2017).https://api.semanticscholar.org/CorpusID:710107

2. Optimal Quasi-Orthogonal FH Sequences With Adaptive Array Receiver for Massive Connectivity in Asynchronous Multi-Cluster Networks

3. Strong No-Hit-Zone Sequences for Improved Quasi-Orthogonal FHMA Systems: Sequence Design and Performance Analysis

4. A New Method to Construct Strictly Optimal Frequency Hopping Sequences With New Parameters

5. New Bound on Partial Hamming Correlation of Low-Hit-Zone Frequency Hopping Sequences and Optimal Constructions