Synthesis of Unequally Spaced Linear Antenna Arrays With Minimum Element Spacing Constraint by Alternating Convex Optimization

You, Pengcheng; Liu, Qing; Chen, Shu‐Lin; Xu, Kai‐Da; Li, Weiwen

doi:10.1109/lawp.2017.2764069

Cited by 42 publications

(27 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In these two papers, the array aperture formed by 22 elements in the literature was only 9.66 wavelengths, so the average spacing of array elements is 0.439 wavelengths, which increases the risk of mutual coupling among array elements and the complexity of the system. A flat-top beam pattern is also synthesized in [18]. ese papers validated the effectiveness of convex optimization algorithm in side lobe suppression and beamforming.…”

Section: Introductionmentioning

confidence: 92%

“…e convex problem solved iteratively was transformed into a standard second-order cone programming (SOCP) for calculation, which achieved simultaneous optimization of element position and excitation, thus suppressing the grating lobes and obtaining the desired beam [17]. You et al also used alternating convex optimization to optimize the position of antenna elements and suppress the side lobe level in [18]. In these two papers, the array aperture formed by 22 elements in the literature was only 9.66 wavelengths, so the average spacing of array elements is 0.439 wavelengths, which increases the risk of mutual coupling among array elements and the complexity of the system.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Research on Side Lobe Suppression of Time-Modulated Sparse Linear Array Based on Particle Swarm Optimization

Liang

Sun

et al. 2019

International Journal of Antennas and Propagation

View full text Add to dashboard Cite

An efficient pattern synthesis approach is proposed for the synthesis of a time-modulated sparse linear array (TMSLA) in this paper. Due to the introduction of time modulation, the low/ultralow side lobe level can be obtained with a low amplitude dynamic range ratio. Besides, it helps reduce the difficulty of antenna feeding system effectively. Based on particle swarm optimization (PSO) and convex (CVX) optimization, this paper proposes a hybrid optimization method to suppress the grating lobes of the sparse arrays, peak side lobe level (PSLL), and peak sideband level (PSBL). Firstly, the paper utilizes the CVX optimization as a local optimization algorithm to optimize the elements' switch-on duration time, which reduces the side lobe of the array. Secondly, with the PSBL as the objective function, the paper adopts the PSO as a global optimization algorithm to optimize the elements' positions and switch-on time instant, which helps reduce the loss of sideband power caused by time modulation. With respect to the time modulation model, variable aperture sizes (VAS) and more flexible pulse-shifting (PS) schemes are used in this paper. Owing to the introduction of time modulation and CVX optimization, the proposed method is much more feasible and efficient than conventional approaches. Furthermore, it has better array pattern synthesis performance. Numerical examples of the TMSLA and comparisons with the reference are presented to demonstrate the effectiveness of the proposed method.

show abstract

Section: Introductionmentioning

confidence: 92%

Section: Introductionmentioning

confidence: 99%

Research on Side Lobe Suppression of Time-Modulated Sparse Linear Array Based on Particle Swarm Optimization

Liang

Sun

et al. 2019

International Journal of Antennas and Propagation

View full text Add to dashboard Cite

show abstract

“…Obviously, the optimization model is convex for the optimization variable A 0 under a fixed W and is also convex for the optimization variable W under a fixed A 0 . So, the optimization model in (9) can be called the biconvex optimization model [26] for the optimization variables A 0 , W. Inspired by the method in [27], alternating convex optimization (ACO) can be applied to solve the optimization model in (9). at is to solve a sequence of alternating weighted l 1 − norm optimization problems:…”

Section: Problem Solutionmentioning

confidence: 99%

Research on Multibeam Pattern Synthesis of Time Modulated Array Based on Convex Optimization

Dong

Tan

et al. 2021

International Journal of Antennas and Propagation

View full text Add to dashboard Cite

An efficient multibeam pattern synthesis method for time modulated array (TMA) is proposed in this paper. The aim of this method is to generate a beam pattern on the specified sideband of TMA. The pattern synthesis problem is divided into two stages. In the first stage, the sequential convex optimization method is used to suppress the sidelobe of the center frequency and reduce the amplitude dynamic range ratios (DRR). In the second stage, the iterative convex optimization method is used to realize the multibeam pattern synthesis in the sideband. Owing to the introduction of convex optimization, the proposed method could be more efficient than approaches using a global optimization algorithm. The proposed method is capable of realizing pattern synthesis under different DRR constraints and different beam radiation directions. Numerical examples of two beams and four beams patterns of 1000-element time modulated linear array verify the effectiveness of the proposed method.

show abstract

“…Recently, an alternating convex optimization (ACO) method is firstly proposed in [31] to synthesize singlebeam sparse linear arrays with minimum interspacing control. In this method, a set of alternating weighted 1 -norm optimizations are performed and the element excitation vector and weighting vector are alternately chosen as the optimization variables.…”

Section: Introductionmentioning

confidence: 99%

Synthesizing Unequally Spaced Pattern-Reconfigurable Linear Arrays With Minimum Interspacing Control

Yang

Liu

et al. 2019

IEEE Access

Self Cite

View full text Add to dashboard Cite

Previously, the alternating convex optimization (ACO) was used to reduce the number of elements in the single-pattern linear array. This work extends the ACO method to synthesize the unequally spaced sparse linear arrays with reconfigurable multiple patterns. In this extended ACO, the minimum interspacing constraint can be easily incorporated in the sparse array synthesis by performing a set of constrained alternating convex optimizations. Three examples for synthesizing sparse linear array with different multiplepattern requirements are conducted to validate the effectiveness, robustness, and advantages of the proposed method. The synthesis results show that the proposed method can effectively reduce the number of elements in the reconfigurable multiple-pattern linear arrays with good control of the sidelobe levels and minimum interspacing. The comparisons with other methods are also given in the examples.INDEX TERMS Unequally spaced linear array, alternating convex optimization, pattern-reconfigurable array, minimum interspacing control.

show abstract

Synthesis of Unequally Spaced Linear Antenna Arrays With Minimum Element Spacing Constraint by Alternating Convex Optimization

Cited by 42 publications

References 24 publications

Research on Side Lobe Suppression of Time-Modulated Sparse Linear Array Based on Particle Swarm Optimization

Research on Side Lobe Suppression of Time-Modulated Sparse Linear Array Based on Particle Swarm Optimization

Research on Multibeam Pattern Synthesis of Time Modulated Array Based on Convex Optimization

Synthesizing Unequally Spaced Pattern-Reconfigurable Linear Arrays With Minimum Interspacing Control

Contact Info

Product

Resources

About