Synthesis of maximally sparse conformal circular arc array with a required beam pattern by unitary matrix pencil method

IF 2.9 3区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC Digital Signal Processing Pub Date : 2024-09-16 DOI:10.1016/j.dsp.2024.104771
Bin Kong , Yongjun Li , Pengfei Zhao , Pin Wen , Foxiang Liu
{"title":"Synthesis of maximally sparse conformal circular arc array with a required beam pattern by unitary matrix pencil method","authors":"Bin Kong ,&nbsp;Yongjun Li ,&nbsp;Pengfei Zhao ,&nbsp;Pin Wen ,&nbsp;Foxiang Liu","doi":"10.1016/j.dsp.2024.104771","DOIUrl":null,"url":null,"abstract":"<div><p>This paper extends the unitary matrix pencil (UMP) method to synthesize maximally sparse conformal circular-arc array with a required beam pattern. Due to the nonlinearity between the circular-arc array pattern and its element pattern, Fourier transform preprocessing for the required beam pattern is introduced to achieve a mathematical expression, i.e., sum of a series of undamped complex exponentials, which is related to array element positions and their excitations. Then, the UMP method is used to determine the reduced number of elements and their position distributions. Moreover, the complex excitations of array elements are reconstructed by obtaining the least-square solution of an over-determined equation. A set of examples for synthesizing sparse conformal circular-arc arrays with different desired patterns and E-type patch element including the mutual coupling are conducted. Results show that the proposed UMP method can achieve a considerably lower pattern reconstruction error with a reduced number of elements than results in the literature, which demonstrates its effectiveness and robustness.</p></div>","PeriodicalId":51011,"journal":{"name":"Digital Signal Processing","volume":"156 ","pages":"Article 104771"},"PeriodicalIF":2.9000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Signal Processing","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1051200424003968","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

This paper extends the unitary matrix pencil (UMP) method to synthesize maximally sparse conformal circular-arc array with a required beam pattern. Due to the nonlinearity between the circular-arc array pattern and its element pattern, Fourier transform preprocessing for the required beam pattern is introduced to achieve a mathematical expression, i.e., sum of a series of undamped complex exponentials, which is related to array element positions and their excitations. Then, the UMP method is used to determine the reduced number of elements and their position distributions. Moreover, the complex excitations of array elements are reconstructed by obtaining the least-square solution of an over-determined equation. A set of examples for synthesizing sparse conformal circular-arc arrays with different desired patterns and E-type patch element including the mutual coupling are conducted. Results show that the proposed UMP method can achieve a considerably lower pattern reconstruction error with a reduced number of elements than results in the literature, which demonstrates its effectiveness and robustness.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用单元矩阵铅笔法合成具有所需波束模式的最大稀疏共形圆弧阵列
本文扩展了单元矩阵铅笔(UMP)方法,以合成具有所需波束图案的最大稀疏共形圆弧阵列。由于圆弧阵列图案与阵元图案之间的非线性,本文引入了对所需波束图案的傅立叶变换预处理,以获得与阵元位置及其激励相关的数学表达式,即一系列无阻尼复指数之和。然后,使用 UMP 方法确定减少的元素数量及其位置分布。此外,阵列元素的复激励是通过获取超定方程的最小二乘法解来重建的。通过一组实例合成了具有不同所需图案的稀疏共形圆弧阵列和包括相互耦合在内的 E 型贴片元件。结果表明,与文献结果相比,所提出的 UMP 方法可以在减少元素数量的情况下实现更低的图案重建误差,这证明了它的有效性和鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Digital Signal Processing
Digital Signal Processing 工程技术-工程:电子与电气
CiteScore
5.30
自引率
17.20%
发文量
435
审稿时长
66 days
期刊介绍: Digital Signal Processing: A Review Journal is one of the oldest and most established journals in the field of signal processing yet it aims to be the most innovative. The Journal invites top quality research articles at the frontiers of research in all aspects of signal processing. Our objective is to provide a platform for the publication of ground-breaking research in signal processing with both academic and industrial appeal. The journal has a special emphasis on statistical signal processing methodology such as Bayesian signal processing, and encourages articles on emerging applications of signal processing such as: • big data• machine learning• internet of things• information security• systems biology and computational biology,• financial time series analysis,• autonomous vehicles,• quantum computing,• neuromorphic engineering,• human-computer interaction and intelligent user interfaces,• environmental signal processing,• geophysical signal processing including seismic signal processing,• chemioinformatics and bioinformatics,• audio, visual and performance arts,• disaster management and prevention,• renewable energy,
期刊最新文献
Integrating wavelet transformation for end-to-end direct signal classification ALFusion: Adaptive fusion for infrared and visible images under complex lighting conditions Zero-feedback open-loop distributed transmit beamforming Adaptive polarimetric persymmetric detection for distributed subspace targets in lognormal texture clutter Synthetic Augmented L-shaped Array design and 2D Cramér-Rao bound analysis based on Vertical-Horizontal Moving Scheme
×
引用
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