检索结果-内蒙古大学图书馆

Efficient array pattern synthesis via Principal Angle-Based Sparse Sampling (PABSS)

IEEE Transactions on Antennas and Propagation 2025年

作者： Chen, Liyang Liu, Yanhui School of Electronic Science and Engineering Chengdu611731 China UESTC Yangtze Delta Region Institute Quzhou324000 China

This paper presents the principal angle-based sparse sampling (PABSS) method, developed to enhance the efficiency of array pattern synthesis by streamlining the angular samples. Through the analysis of correlation between array manifold components using principal angles, PABSS identifies and removes highly correlated samples, significantly lowering the computational complexity of synthesis, which is especially beneficial for large-scale arrays. As the sparsification process is based on the intrinsic properties of the array manifold, the sparse samples generated by PABSS can be reused across different synthesis tasks. Comprehensive numerical examples showcase the flexibility and effectiveness of PABSS when integrated with classical synthesis techniques, including beam scanning, beam shaping, and polarization synthesis for linear, planar, and conformal arrays. The results consistently demonstrate that PABSS provides substantial efficiency improvements while maintaining satisfactory synthesis accuracy. © 1963-2012 IEEE.

关键词： array pattern synthesis computational efficiency principal angle analysis sparse sampling

来源：评论

学校读者我要写书评

暂无评论

array pattern synthesis IN THE PRESENCE OF FAULTY ELEMENTS

引用

SIGNAL PROCESSING 1992年第1期29卷 57-65页

作者： ER, MH HUI, SK [a]School of Electrical Electronic Engineering Nanyang Technological University Nanyang Avenue Singapore 2263 [b]Defence Science Organisation 20 Science Park Drive Singapore 0511

This paper presents a simple and effective algorithm to regain sidelobe suppression lost due to element failure with narrowest possible beamwidth. The formulation results in a constrained optimization problem involving a quadratic constraint and a set of linear constraints on the weights. The paper presents an efficient numerical technique to obtain the optimal weights. It also identifies the limiting solution to the proposed constrained optimization problem. Numerical results show that the proposed technique is very useful in optimizing the beampattern in the presence of element failure.

关键词： array pattern synthesis ELEMENT FAILURE

来源：评论

学校读者我要写书评

暂无评论

array pattern synthesis using semidefinite programming and a bisection method

引用

ETRI JOURNAL 2019年第5期41卷 619-625页

作者： Lee, Jong-Ho Choi, Jeongsik Lee, Woong-Hee Song, Jiho Soongsil Univ Sch Elect Engn Seoul South Korea Intel Corp Intel Labs Santa Clara CA USA KTH Royal Inst Technol Dept Commun Syst Stockholm Sweden Univ Ulsan Sch Elect Engn Ulsan South Korea

In this paper, we propose an array pattern synthesis scheme using semidefinite programming (SDP) under array excitation power constraints. When an array pattern synthesis problem is formulated as an SDP problem, it is known that an additional rank-one constraint is generated inevitably and relaxed via semidefinite relaxation. If the solution to the relaxed SDP problem is not of rank one, then conventional SDP-based array pattern synthesis approaches fail to obtain optimal solutions because the additional rank-one constraint is not handled appropriately. To overcome this drawback, we adopted a bisection technique combined with a penalty function method. Numerical applications are presented to demonstrate the validity of the proposed scheme.

关键词： array pattern synthesis bisection method semidefinite programming semidefinite relaxation

来源：评论

学校读者我要写书评

暂无评论

array pattern synthesis with Discrete Phases for Reconfigurable Intelligent Surfaces 25

Array Pattern Synthesis with Discrete Phases for Reconfigura...

引用

25th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Cai, Xiao Cheng, Hei Victor Aarhus Univ Dept Elect & Comp Engn Aarhus Denmark

ISBN: (纸本)9798350393194;9798350393187

Extensive research on Reconfigurable Intelligent Surfaces (RIS) has primarily revolved around optimizing phase coefficients for passive beamforming in specific target directions. This optimization typically presumes prior knowledge of the target direction, a premise that is not valid during initial sensing phases where the target's location is unknown. To enhance direction estimation, a broader beam is required, presenting the array pattern synthesis problem: the need to maximize received power over an entire target area. While this challenge has been addressed with active antennas, RIS systems pose a unique problem due to their inherent continuous or discrete phase constraints. Our study introduces a novel array pattern synthesis method tailored for discrete phase constraints in RIS. We introduce a penalty method that pushes these constraints to the boundary of the convex hull. Then the Minorization-Maximization (MM) method is utilized to reformulate the problem into a convex one. Our numerical results illustrate that our algorithm is capable of generating a wide beam pattern comparable to scenarios with per-power constraints where both the amplitudes and phases are adjustable, evidencing its proficiency in creating wide beams crucial for wireless communication and sensing in the absence of prior knowledge of the target's location.

关键词： Reconfigurable Intelligent Surface array pattern synthesis Discrete phase Minorization-Maximization

来源：评论

学校读者我要写书评

暂无评论

APPLICATION OF CONSTRAINED OPTIMIZATION TECHNIQUES TO array pattern synthesis

引用

SIGNAL PROCESSING 1993年第3期34卷 323-334页

作者： ER, MH SIM, SL KOH, SN [a]Center for Signal Processing School of Electrical Electronic Engineering Nanyang Technological University Nanyang Avenue Singapore 2263 Singapore

The paper presents two design methods for synthesizing antenna array patterns with an adjustable mainlobe width and minimum average sidelobe level. One method involves matching the array response to a desired response over the mainlobe width while minimizing the mean-square value of the array response over the sidelobe regions. The other method involves minimizing the mean-square error between a desired response and the response of the antenna array over a certain mainbeam width subject to a mean-square sidelobe constraint. Numerical techniques based on matrix factorization are proposed to reduce the computational complexity. Subsequently, a set of linear constraints are used to approximate the effect of the quadratic constraint. Numerical results show that the proposed techniques are very effective in the design of antenna pattern having an adjustable mainlobe width and minimum average sidelobe level.

关键词： array pattern synthesis QUADRATIC OPTIMIZATION

来源：评论

学校读者我要写书评

暂无评论

Optimal array pattern synthesis using semidefinite programming

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2003年第5期51卷 1172-1183页

作者： Wang, F Balakrishnan, V Zhou, PY Chen, JJN Yang, R Frank, C Motorola Inc GTSS Adv Radio Technol Arlington Hts IL 60004 USA Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA

We present algorithms for the soluition of two problems in array pattern synthesis. The first is the design of nonuniform arrays with a desired magnitude response. The second is that of robust design, i.e., design in the presence of uncertainties. Constraints such as power limitation can be addressed with both problems. The algorithms that we present are based on semidefinite programming, for which efficient software is readily available. We present examples that illustrate the effectiveness of our approach.

关键词： array pattern synthesis semidefinite programming

来源：评论

学校读者我要写书评

暂无评论

Efficient array pattern synthesis via Polynomial Expansion With Determined Truncation Order

引用

IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS 2024年第12期23卷 4812-4816页

作者： Zhang, Wei Peng, Yang Xiamen Univ Inst Electromagnet & Acoust Xiamen 361005 Fujian Peoples R China Univ Elect Sci & Technol China Yangtze Delta Reg Inst Quzhou Quzhou 610054 Peoples R China

An efficient method based on dimensionality reduction is presented for array pattern synthesis. It describes array excitation distribution by utilizing a truncated Chebyshev polynomial expansion, then the dimension of the synthesis problem is significantly reduced from element number to the polynomial truncation order. Importantly, for an arbitrary planar array with specific shaping requirements, we propose a novel pattern-space projection method to accurately determine the truncation order, thus eliminating the need for inefficient and repeated synthesis attempts as before. Due to the precise and effective dimensionality reduction, pattern synthesis problem is greatly simplified. Then, alternating projection algorithm is applied to efficiently synthesize the polynomial coefficients whose dimension is much less than the array elements. Two examples of synthesizing different shaped patterns for planar arrays are conducted to validate the effectiveness and robustness.

关键词： Chebyshev approximation Polynomials Planar arrays Transmission line matrix methods Vectors Dimensionality reduction Optimization methods Market research Loss measurement Geometry array pattern synthesis Chebyshev polynomials dimensionality reduction pattern-space projection (PSP) truncation order

来源：评论

学校读者我要写书评

暂无评论

A new array pattern synthesis algorithm using the two-step least-squares method

引用

IEEE SIGNAL PROCESSING LETTERS 2005年第3期12卷 250-253页

作者： Shi, Z Feng, ZH Tsing Hua Univ Dept Elect Engn State Key Lab Microwave & Digital Commun Beijing 100084 Peoples R China

This letter presents a new array pattern synthesis algorithm using the two-step least-squares method. The algorithm utilizes the randomness of the desired pattern phase to design an array pattern. Several numerical ex... 详细信息

关键词： array pattern synthesis two-step least-squares method

来源：评论

学校读者我要写书评

暂无评论

Non-uniform array pattern synthesis using reweighted l₁-norm minimization

引用

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2013年第9期67卷 795-798页

作者： Chen, Hui Wan, Qun Univ Elect Sci & Technol China Dept Elect Engn Chengdu 611731 Peoples R China

This paper presents a new array pattern synthesis algorithm by reweighted l(1)-norm minimization and convex optimization. A virtual uniform array with much smaller element spacing and a weight matrix are created first;then, we obtain a weight vector by solving a weighted l(1)-norm minimization convex problem, and update the weight matrix by the weight vector. Some entries of the weight vector are so small and thus negligible without significantly changing the array pattern performance. Based on this notion, the pruned weight vector becomes a sparse weight vector, and a non-uniform array is formed according to the nonzero valued positions of the sparse weight vector. Determining the weight vector, updating the weight matrix and creating a non-uniform array are repeated until the final array synthesis performance is satisfactory. After optimizing the array geometric construction, we obtain the optimal weight vector of the non-uniform array by using convex optimization. One numerical example is presented to show the high efficiency of achieving the desired radiation pattern with the minimum number of antenna elements. (C) 2013 Elsevier GmbH. All rights reserved.

关键词： array pattern synthesis Non-uniform array Reweighted l(1)-norm minimization Sparse weight vector Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Multi-dimension to one-dimension transformation approach for multi-dimensional antenna array pattern synthesis

引用

JOURNAL OF ELECTROMAGNETIC WAVES AND APPLICATIONS 2019年第10期33卷 1307-1317页

作者： Chen, Jie Yin, Yingzeng Xian Aeronaut Univ Sch Elect Engn 259 Xian West Second Ring Rd Xian 710077 Shaanxi Peoples R China Xidian Univ Sch Elect Engn Natl Key Lab Antenna & Microwave Technol Xian Shaanxi Peoples R China

A new multi-dimension to one-dimension transformation (MTOT) approach is presented to synthesize multi-dimensional antenna array pattern. In the new approach the multi-dimensional antenna array pattern synthesis issue is mathematically transformed into a one-dimensional (1D) pattern synthesis issue by taking advantage of the general characteristics of the pattern function, which makes all existing linear array pattern synthesis and beamforming methods applicable to addressing relevant multi-dimensional array pattern synthesis issues. The new method provides a general way for multi-dimensional array pattern synthesis. Simulations of the new approach are conducted to show its effectiveness. The simulation results show that the new method can well accomplish the pattern synthesis mission for different multi-dimensional array configurations.

关键词： array pattern synthesis beamforming multi-dimensional antenna array null beam steering vector

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：