Sparse Planar Retrodirective Antenna Array Using Improved Adaptive Genetic Algorithm

An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods： one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach. This algorithm has been validated to be superior to the simple genetic algorithm （SGA） by a complicated binary testing function. Then the proposed algorithm is applied to optimizing the planar retrodirective array to reduce the cost of the hardware. The fitness function is discussed in the optimization example. After optimization, the sparse planar retrodirective antenna array keeps excellent retrodirectivity, while the array architecture has been simplified by 34%. The optimized antenna array can replace uniform full array effectively. Results show that this work will gain more engineering benefits in practice.

DOA estimation of coexisted noncoherent and coherent signals via sparse representation of cleaned array covariance matrix

A new direction finding method is presented to deal with coexisted noncoherent and co- herent signals without smoothing operation. First the direction-of-arrival （DOA） estimation task is herein reformulated as a sparse reconstruction problem of the cleaned array covariance matrix, which is processed to eliminate the affection of the noise. Then by using the block of matrices, the information of DOAs which we pursuit are implied in the sparse coefficient matrix. Finally, the sparse reconstruction problem is solved by the improved M-FOCUSS method, which is applied to the situation of block of matrices. This method outperforms its data domain counterpart in terms of noise suppression, and has a better performance in DOA estimation than the customary spatial smoothing technique. Simulation results verify the efficacy of the proposed method.

Performance Analysis of Sparse Array based Massive MIMO via Joint Convex Optimization

Massive multiple-input multiple-output(MIMO)technology enables higher data rate transmission in the future mobile communications.However,exploiting a large number of antenna elements at base station(BS)makes effective implementation of massive MIMO challenging,due to the size and weight limits of the masssive MIMO that are located on each BS.Therefore,in order to miniaturize the massive MIMO,it is crucial to reduce the number of antenna elements via effective methods such as sparse array synthesis.In this paper,a multiple-pattern synthesis is considered towards convex optimization(CO).The joint convex optimization(JCO)based synthesis is proposed to construct a codebook for beamforming.Then,a criterion containing multiple constraints is developed,in which the sparse array is required to fullfill all constraints.Finally,extensive evaluations are performed under realistic simulation settings.The results show that with the same number of antenna elements,sparse array using the proposed JCO-based synthesis outperforms not only the uniform array,but also the sparse array with the existing CO-based synthesis method.Furthermore,with a half of the number of antenna elements that on the uniform array,the performance of the JCO-based sparse array approaches to that of the uniform array.

Joint 2D-DOA and polarization estimation for sparse nonuniform rectangular array composed of spatially spread electromagnetic vector sensor

In this paper,a sparse nonuniform rectangular array based on spatially spread electromagnetic vector sensor(SNRASSEMVS)is introduced,and a method for estimating 2D-direction of arrival(DOA)and polarization is devised.Firstly,according to the special structure of the sparse nonuniform rectangular array(SNRA),a set of accurate but ambiguous direction-cosine estimates can be obtained.Then the steering vector of spatially spread electromagnetic vector sensor(SSEMVS)can be extracted from the array manifold to obtain the coarse but unambiguous direction-cosine estimates.Finally,the disambiguation approach can be used to get the final accurate estimates of 2DDOA and polarization.Compared with some existing methods,the SNRA configuration extends the spatial aperture and refines the parameters estimation accuracy without adding any redundant antennas,as well as reduces the mutual coupling effect.Moreover,the proposed algorithm resolves multiple sources without the priori knowledge of signal information,suffers no ambiguity in the estimation of the Poynting vector,and pairs the x-axis direction cosine with the y-axis direction cosine automatically.Simulation results are given to verify the effectiveness and superiority of the proposed algorithm.

DOWNWARD LOOKING SPARSE LINEAR ARRAY 3D SAR IMAGING ALGORITHM BASED ON BACK-PROJECTION AND CONVEX OPTIMIZATION

Downward Looking Sparse Linear Array Three Dimensional SAR(DLSLA 3D SAR) is an important form of 3D SAR imaging, which has a widespread application field. Since its practical equivalent phase centers are usually distributed sparsely and nonuniformly, traditional 3D SAR algorithms suffer from low resolution and high sidelobes in cross-track dimension. To deal with this problem, this paper introduces a method based on back-projection and convex optimization to achieve 3D high accuracy imaging reconstruction. Compared with traditional SAR algorithms, the proposed method sufficiently utilizes the sparsity of the 3D SAR imaging scene and can achieve lower sidelobes and higher resolution in cross-track dimension. In the simulated experiments, the reconstructed results of both simple and complex imaging scene verify that the proposed method outperforms 3D back-projection algorithm and shows satisfying cross-track dimensional resolution and good robustness to noise.

2D DOA Estimation of Coherent Signals with a Separated Linear Acoustic Vector-Sensor Array

In this paper, a two-dimensional(2D) DOA estimation algorithm of coherent signals with a separated linear acoustic vector-sensor(AVS) array consisting of two sparse AVS arrays is proposed. Firstly,the partitioned spatial smoothing(PSS) technique is used to construct a block covariance matrix, so as to decorrelate the coherency of signals. Then a signal subspace can be obtained by singular value decomposition(SVD) of the covariance matrix. Using the signal subspace, two extended signal subspaces are constructed to compensate aperture loss caused by PSS.The elevation angles can be estimated by estimation of signal parameter via rotational invariance techniques(ESPRIT) algorithm. At last, the estimated elevation angles can be used to estimate automatically paired azimuth angles. Compared with some other ESPRIT algorithms, the proposed algorithm shows higher estimation accuracy, which can be proved through the simulation results.

Interference synthesis of cross beams from sparse array

Based on principle of power synthesis of sparse array, mathematical model of spatial power combining is established. Relation between cross angle of beams and synthesis efficiency on aimed point from two antenna nodes is derived. Furthermore, the setting principle of sampling interval is analyzed for simulation experiment. Energy distributions of the useful points under different cross angles were simulated. Simulation shows that if distance between the antenna nodes and aimed point are equal, and frequency, polarization and an- tenna type are the same, synthesis efficiency relies on the cross angles of beams, shape and density on the useful points accumulation area also rely on the cross angles of beams.

PERFORMANCE ANALYSIS OF PULSE COMPRESSION USING PHASE-CODED SIGNALS FOR SPARSE-ARRAY SYNTHETIC IMPULSE AND APERTURE RADAR

Sparse-array Synthetic Impulse and Aperture Radar (SIAR) can isotropically radiate by employing multiple frequencies (synthetic pulse) and multiple antennas (synthetic antenna). According to Ambiguity Function(AF), its range resolution depends only on bandwidth of transmitted signals, however, the distance grating lobes emerge when increasing the time-bandwidth product of transmitted signals. The performance of pulse compression is analyzed with the transmitted signals modulated by phase-coded sequences. It is seen that greater ratio of pulse compression and suppression of range sidelobe in SIAR can be obtained, and its effective range and range resolution is increased as well.

Sparse array of sub-surface aided blockage-free multi-user mmWave communication systems

Recently,Reconfigurable Intelligent Surfaces(RISs)have drawn intensive attention in the realization of the smart radio environment.However,existing works mainly consider the RIS as a whole uniform plane,which may be unrealistic to be installed on the facade of buildings when the RIS is extremely large.In contrast,this paper investigates a practical Sparse Array of Sub-surface(SAoS)deployment of the RIS for uplink multi-user millimeter Wave(mmWave)communication systems,in which the Mobile Stations(MSs)are distributed in the blind coverage area due to the blockage.In order to exploit the benefits of the sparse deployment,the correlation of the effective channel is firstly investigated.Then the approximation and lower bounds of the ergodic spectral efficiency are derived under frequency and spatial multiplexing scenarios,respectively.Based on the autocorrelation of the effective channel,we obtain an optimal reflect coefficient design as well as the deployment guidelines of RIS tiles.Moreover,the RIS tile scheduling algorithms are also proposed.Numerical results show that the ergodic spectral efficiency approximation matches well with the Monte Carlo result under frequency multiplexing scenarios,and the lower bound is tight under spatial multiplexing scenarios only when the effective channel is strongly correlated.On the basis of the RIS tile scheduling algorithm and the reflect coefficient design,the system performance can be significantly improved under frequency multiplexing scenarios.On the other hand,by deploying more sparse RIS tiles,we can increase the multiplexing gain under spatial multiplexing scenarios.

Sparse three-dimensional imaging for forward-looking array SAR using spatial continuity

For forward-looking array synthetic aperture radar(FASAR),the scattering intensity of ground scatterers fluctuates greatly since there are kinds of vegetations and topography on the surface of the ground,and thus the signal-to-noise ratio(SNR)of its echo signals corresponding to different vegetations and topography also varies obviously.Owing to the reason known to all,the performance of the sparse reconstruction of compressed sensing(CS)becomes worse in the case of lower SNR,and the quality of the sparse three-dimensional imaging for FASAR would be affected significantly in the practical application.In this paper,the spatial continuity of the ground scatterers is introduced to the sparse recovery algorithm of CS in the threedimensional imaging for FASAR,in which the weighted least square method of the cubic interpolation is used to filter out the bad and isolated scatterer.The simulation results show that the proposed method can realize the sparse three-dimensional imaging of FASAR more effectively in the case of low SNR.

DESIGN OF SPARSE ARRAY FOR MAD IMAGING BASED ON MAXIMIZING INFORMATION CAPACITY

In past years,growing efforts have been made to the rapid interpretation of magnetic field data acquired by a sparse synthetic or real magnetic sensor array.An appealing requirement on such sparse array arranged within a specified survey region is that to make the number of sensor elements as small as possible,meanwhile without deteriorating imaging quality.For this end,we propose a novel methodology of arranging sensors in an optimal manner,exploring the concept of information capacity developed originally in the communication society.The proposed scheme reduces mathematically the design of a sparse sensor array into solving a combinatorial optimization problem,which can be resolved efficiently using widely adopted Simultaneous Perturbation and Statistical Algorithm(SPSA).Three sets of numerical examples of designing optimal sensor array are provided to demonstrate the performance of proposed methodology.

DIRECTION-OF-ARRIVAL ESTIMATION IN THE PRESENCE OF MUTUAL COUPLING BASED ON JOINT SPARSE RECOVERY

A novel Direction-Of-Arrival (DOA) estimation method is proposed in the presence of mutual coupling using the joint sparse recovery. In the proposed method, the eigenvector corresponding to the maximum eigenvalue of covariance matrix of array measurement is viewed as the signal to be represented. By exploiting the geometrical property in steering vectors and the symmetric Toeplitz structure of Mutual Coupling Matrix (MCM), the redundant dictionaries containing the DOA information are constructed. Consequently, the optimization model based on joint sparse recovery is built and then is solved through Second Order Cone Program (SOCP) and Interior Point Method (IPM). The DOA estimates are gotten according to the positions of nonzeros elements. At last, computer simulations demonstrate the excellent performance of the proposed method.

DOA estimation via sparse recovering from the smoothed covariance vector

A direction of arrival（DOA） estimation algorithm is proposed using the concept of sparse representation. In particular, a new sparse signal representation model called the smoothed covariance vector（SCV） is established, which is constructed using the lower left diagonals of the covariance matrix. DOA estimation is then achieved from the SCV by sparse recovering, where two distinguished error limit estimation methods of the constrained optimization are proposed to make the algorithms more robust. The algorithm shows robust performance on DOA estimation in a uniform array, especially for coherent signals. Furthermore, it significantly reduces the computational load compared with those algorithms based on multiple measurement vectors（MMVs）. Simulation results validate the effectiveness and efficiency of the proposed algorithm.

Modular Extremely Large-Scale Array Communication:Near-Field Modelling and Performance Analysis

This paper investigates the wireless communication with a novel architecture of antenna arrays,termed modular extremely large-scale array(XLarray),where array elements of an extremely large number/size are regularly mounted on a shared platform with both horizontally and vertically interlaced modules.Each module consists of a moderate/flexible number of array elements with the inter-element distance typically in the order of the signal wavelength,while different modules are separated by the relatively large inter-module distance for convenience of practical deployment.By accurately modelling the signal amplitudes and phases,as well as projected apertures across all modular elements,we analyse the near-field signal-to-noise ratio(SNR)performance for modular XL-array communications.Based on the non-uniform spherical wave(NUSW)modelling,the closed-form SNR expression is derived in terms of key system parameters,such as the overall modular array size,distances of adjacent modules along all dimensions,and the user's three-dimensional(3D)location.In addition,with the number of modules in different dimensions increasing infinitely,the asymptotic SNR scaling laws are revealed.Furthermore,we show that our proposed near-field modelling and performance analysis include the results for existing array architectures/modelling as special cases,e.g.,the collocated XL-array architecture,the uniform plane wave(UPW)based far-field modelling,and the modular extremely large-scale uniform linear array(XL-ULA)of onedimension.Extensive simulation results are presented to validate our findings.

Two-Dimensional Direction Finding via Sequential Sparse Representations

The problem of two-dimensional direction finding is approached by using a multi-layer Lshaped array. The proposed method is based on two sequential sparse representations,fulfilling respectively the estimation of elevation angles,and azimuth angles. For the estimation of elevation angles,the weighted sub-array smoothing technique for perfect data decorrelation is used to produce a covariance vector suitable for exact sparse representation,related only to the elevation angles. The estimates of elevation angles are then obtained by sparse restoration associated with this elevation angle dependent covariance vector. The estimates of elevation angles are further incorporated with weighted sub-array smoothing to yield a second covariance vector for precise sparse representation related to both elevation angles,and azimuth angles. The estimates of azimuth angles,automatically paired with the estimates of elevation angles,are finally obtained by sparse restoration associated with this latter elevation-azimuth angle related covariance vector. Simulation results are included to illustrate the performance of the proposed method.

Sparse antenna array design methodologies:A review

Designing a sparse array with reduced transmit/receive modules(TRMs)is vital for some applications where the antenna system’s size,weight,allowed operating space,and cost are limited.Sparse arrays exhibit distinct architectures,roughly classified into three categories:Thinned arrays,nonuniformly spaced arrays,and clustered arrays.While numerous advanced synthesis methods have been presented for the three types of sparse arrays in recent years,a comprehensive review of the latest development in sparse array synthesis is lacking.This work aims to fill this gap by thoroughly summarizing these techniques.The study includes synthesis examples to facilitate a comparative analysis of different techniques in terms of both accuracy and efficiency.Thus,this review is intended to assist researchers and engineers in related fields,offering a clear understanding of the development and distinctions among sparse array synthesis techniques.

Triad-displaced ULAs configuration for non-circular sources with larger continuous virtual aperture and enhanced degrees of freedom

Non-uniform linear array(NULA)configurations are well renowned due to their structural ability for providing increased degrees of freedom(DOF)and wider array aperture than uniform linear arrays(ULAs).These characteristics play a significant role in improving the direction-of-arrival(DOA)estimation accuracy.However,most of the existing NULA geometries are primarily applicable to circular sources(CSs),while they limitedly improve the DOF and continuous virtual aperture for noncircular sources(NCSs).Toward this purpose,we present a triaddisplaced ULAs(Tdis-ULAs)configuration for NCS.The TdisULAs structure generally consists of three ULAs,which are appropriately placed.The proposed antenna array approach fully exploits the non-circular characteristics of the sources.Given the same number of elements,the Tdis-ULAs design achieves more DOF and larger hole-free co-array aperture than its sparse array competitors.Advantageously,the number of uniform DOF,optimal distribution of elements among the ULAs,and precise element positions are uniquely determined by the closed-form expressions.Moreover,the proposed array also produces a filled resulting co-array.Numerical simulations are conducted to show the performance advantages of the proposed Tdis-ULAs configuration over its counterpart designs.

Multiple Emitters Localization by UAV with Nested Linear Array:System Scheme and 2D-DOA Estimation Algorithm

Unmanned Aerial Vehicle(UAV)equipped with uniform linear array has been applied to multiple emitters localization.Meanwhile,nested linear array enables to enhance localization resolution and achieve under-determined Direction of Arrival(DOA)estimation.In this paper,we propose a new system structure for emitters localization that combines the UAV with nested linear array,which is capable of significantly increasing the positioning accuracy of interested targets.Specifically,a localization scheme is designed to obtain the paired two-dimensional DOA(2D-DOA,i.e.azimuth and elevation angles)estimates of emitters by nested linear array with UAV.Furthermore,we propose an improved DOA estimation algorithm for emitters localization that utilizes Discrete Fourier Transform(DFT)method to obtain coarse DOA estimates,subsequently,achieve the fine DOA estimates by sparse representation.The proposed algorithm has lower computational complexity because the coarse DOA estimates enable to shrink the range of over-complete dictionary of sparse representation.In addition,compared to traditional uniform linear array,improved 2D-DOA estimation performance of emitters can be obtained with a nested linear array.Extensive simulation results testify the effectiveness of the proposed method.

Dwell Scheduling Algorithm for Digital Array Radar

Aiming at the problem of resource allocation for digital array radar（ DAR）,a dwell scheduling algorithm is proposed in this paper. Firstly,the integrated priority of different radar tasks is designed,which ensures that the imaging tasks are scheduled without affecting the search and tracking tasks; Then,the optimal scheduling model of radar resource is established according to the constraints of pulse interleaving; Finally,a heuristic algorithm is used to solve the problem and a sparse-aperture cognitive ISAR imaging method is used to achieve partial precision tracking target imaging. Simulation results demonstrate that the proposed algorithm can both improve the performance of the radar system,and generate satisfactory imaging results.

Angle estimation in bistatic MIMO radar using improved reduced dimension Capon algorithm

This paper discusses the problem of direction of departure （DOD） and direction of arrival （DOA） estimation for a bistatic multiple input multiple output （MIMO） radar, and proposes an improved reduced-dimension Capon algorithm therein. Compared with the reduced-dimension Capon algorithm which requires pair matching between the two-dimensional angle estimation, the pro- posed algorithm can obtain automatically paired DOD and DOA estimation without debasing the performance of angle estimation in bistatic MIMO radar. Furthermore, the proposed algorithm has a lower complexity than the reduced-dimension Capon algorithm, and it is suitable for non-uniform linear arrays. The complexity of the proposed algorithm is analyzed and the Cramer-Rao bound （CRB） is also derived. Simulation results verify the usefulness of the proposed algorithm.