Study of construction of Golomb Costas arrays with ideal autocorrelation properties based on extension field

IF 1.5 4区 计算机科学 Q3 ENGINEERING, ELECTRICAL & ELECTRONIC IET Communications Pub Date : 2024-07-06 DOI:10.1049/cmu2.12803
Jianguo Yao, Ziwei Liu, Xiaoming Wang
{"title":"Study of construction of Golomb Costas arrays with ideal autocorrelation properties based on extension field","authors":"Jianguo Yao,&nbsp;Ziwei Liu,&nbsp;Xiaoming Wang","doi":"10.1049/cmu2.12803","DOIUrl":null,"url":null,"abstract":"<p>This paper proposes a specific algebraic structure and demonstrates its nature as an extension field, enabling the construction of Golomb Costas (GC) arrays. It provides detailed instructions and examples for constructing GC arrays using this extension field, along with a corresponding flowchart. Additionally, the paper conducts a thorough analysis, incorporating calculations and comparisons, to evaluate the autocorrelation of a GC array derived from the extension field compared to that of a diagonal frequency hopping array. The analysis reveals the superior autocorrelation properties of GC arrays based on the extension field. Furthermore, the paper establishes a mathematical model for the signal coded by the frequency hopping array and subsequently simulates and compares the ambiguity function of the signal coded by a GC array with that of a signal coded by a diagonal frequency hopping array. This comparison underscores the thumbtack ambiguity function of frequency hopping signal coded by a GC array. Moreover, the paper thoroughly investigates the relationship between the correlation function of GC arrays and the roots of an algebraic equation in a finite field, and strictly proves the ideal autocorrelation properties of Golomb Costas arrays.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.5000,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12803","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Communications","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/cmu2.12803","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes a specific algebraic structure and demonstrates its nature as an extension field, enabling the construction of Golomb Costas (GC) arrays. It provides detailed instructions and examples for constructing GC arrays using this extension field, along with a corresponding flowchart. Additionally, the paper conducts a thorough analysis, incorporating calculations and comparisons, to evaluate the autocorrelation of a GC array derived from the extension field compared to that of a diagonal frequency hopping array. The analysis reveals the superior autocorrelation properties of GC arrays based on the extension field. Furthermore, the paper establishes a mathematical model for the signal coded by the frequency hopping array and subsequently simulates and compares the ambiguity function of the signal coded by a GC array with that of a signal coded by a diagonal frequency hopping array. This comparison underscores the thumbtack ambiguity function of frequency hopping signal coded by a GC array. Moreover, the paper thoroughly investigates the relationship between the correlation function of GC arrays and the roots of an algebraic equation in a finite field, and strictly proves the ideal autocorrelation properties of Golomb Costas arrays.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于扩展场的具有理想自相关特性的戈隆-科斯塔斯阵列构造研究
本文提出了一种特定的代数结构,并证明了它作为扩展域的性质,从而能够构建戈隆-科斯塔斯(GC)数组。本文提供了使用该扩展域构建 GC 阵列的详细说明和示例,以及相应的流程图。此外,论文还结合计算和比较进行了全面分析,以评估由扩展场导出的 GC 阵列与对角跳频阵列相比的自相关性。分析表明,基于扩展场的 GC 阵列具有更优越的自相关特性。此外,论文还建立了跳频阵列编码信号的数学模型,随后模拟并比较了 GC 阵列编码信号与对角跳频阵列编码信号的模糊函数。这种比较强调了用 GC 阵列编码的跳频信号的拇指槌模糊函数。此外,论文还深入研究了 GC 阵列的相关函数与有限场中代数方程根之间的关系,并严格证明了戈隆-科斯塔斯阵列的理想自相关特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IET Communications
IET Communications 工程技术-工程:电子与电气
CiteScore
4.30
自引率
6.20%
发文量
220
审稿时长
5.9 months
期刊介绍: IET Communications covers the fundamental and generic research for a better understanding of communication technologies to harness the signals for better performing communication systems using various wired and/or wireless media. This Journal is particularly interested in research papers reporting novel solutions to the dominating problems of noise, interference, timing and errors for reduction systems deficiencies such as wasting scarce resources such as spectra, energy and bandwidth. Topics include, but are not limited to: Coding and Communication Theory; Modulation and Signal Design; Wired, Wireless and Optical Communication; Communication System Special Issues. Current Call for Papers: Cognitive and AI-enabled Wireless and Mobile - https://digital-library.theiet.org/files/IET_COM_CFP_CAWM.pdf UAV-Enabled Mobile Edge Computing - https://digital-library.theiet.org/files/IET_COM_CFP_UAV.pdf
期刊最新文献
A deep learning-based approach for pseudo-satellite positioning Analysis of interference effect in VL-NOMA network considering signal power parameters performance A high-precision timing and frequency synchronization algorithm for multi-h CPM signals Dual-user joint sensing and communications with time-divisioned bi-static radar A heuristic approach to energy efficient user association in ultra-dense HetNets using intermittent scheduling strategies
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1