New Antenna Array Beamforming Techniques Based on Hybrid Convolution/Genetic Algorithm for 5G and Beyond Communications

Side lobe level reduction(SLL)of antenna arrays significantly enhances the signal-to-interference ratio and improves the quality of service(QOS)in recent and future wireless communication systems starting from 5G up to 7G.Furthermore,it improves the array gain and directivity,increasing the detection range and angular resolution of radar systems.This study proposes two highly efficient SLL reduction techniques.These techniques are based on the hybridization between either the single convolution or the double convolution algorithms and the genetic algorithm(GA)to develop the Conv/GA andDConv/GA,respectively.The convolution process determines the element’s excitations while the GA optimizes the element spacing.For M elements linear antenna array(LAA),the convolution of the excitation coefficients vector by itself provides a new vector of excitations of length N=(2M−1).This new vector is divided into three different sets of excitations including the odd excitations,even excitations,and middle excitations of lengths M,M−1,andM,respectively.When the same element spacing as the original LAA is used,it is noticed that the odd and even excitations provide a much lower SLL than that of the LAA but with amuch wider half-power beamwidth(HPBW).While the middle excitations give the same HPBWas the original LAA with a relatively higher SLL.Tomitigate the increased HPBWof the odd and even excitations,the element spacing is optimized using the GA.Thereby,the synthesized arrays have the same HPBW as the original LAA with a two-fold reduction in the SLL.Furthermore,for extreme SLL reduction,the DConv/GA is introduced.In this technique,the same procedure of the aforementioned Conv/GA technique is performed on the resultant even and odd excitation vectors.It provides a relatively wider HPBWthan the original LAA with about quad-fold reduction in the SLL.

Toward real-time digital pulse process algorithms for CsI(Tl)detector array at external target facility in HIRFL-CSR

A fully digital data acquisition system based on a field-programmable gate array(FPGA) was developed for a CsI(Tl) array at the external target facility(ETF) in the Heavy Ion Research Facility in Lanzhou(HIRFL). To process the CsI(Tl) signals generated by γ-rays and light-charged ions, a scheme for digital pulse processing algorithms is proposed. Every step in the algorithms was benchmarked using standard γ and α sources. The scheme, which included a moving average filter, baseline restoration, leading-edge discrimination, moving window deconvolution, and digital charge comparison, was subsequently implemented on the FPGA. A good energy resolution of 5.7% for 1.33-MeV γ-rays and excellent α-γ identification using the digital charge comparison method were achieved, which satisfies CsI(Tl) array performance requirements.

Effective approach for conformal subarray design based on maximum entropy of planar mappings

In this paper,an effective algorithm for optimizing the subarray of conformal arrays is proposed.The method first divides theconformal array into several first-level subarrays.It uses the X algorithm to solve the feasible solution of first-level subarray tiling and employs the particle swarm algorithm to optimize the conformal array subarray tiling scheme with the maximum entropy of the planar mapping as the fitness function.Subsequently,convex optimization is applied to optimize the subarray amplitude phase.Data results verify that the method can effectively find the optimal conformal array tiling scheme.

BAR:a branch-alternation-resorting algorithm for locality exploration in graph processing

Unstructured and irregular graph data causes strong randomness and poor locality of data accesses in graph processing.This paper optimizes the depth-branch-resorting algorithm(DBR),and proposes a branch-alternation-resorting algorithm(BAR).In order to make the algorithm run in parallel and improve the efficiency of algorithm operation,the BAR algorithm is mapped onto the reconfigurable array processor(APR-16)to achieve vertex reordering,effectively improving the locality of graph data.This paper validates the BAR algorithm on the GraphBIG framework,by utilizing the reordered dataset with BAR on breadth-first search(BFS),single source shortest paht(SSSP)and betweenness centrality(BC)algorithms for traversal.The results show that compared with DBR and Corder algorithms,BAR can reduce execution time by up to 33.00%,and 51.00%seperatively.In terms of data movement,the BAR algorithm has a maximum reduction of 39.00%compared with the DBR algorithm and 29.66%compared with Corder algorithm.In terms of computational complexity,the BAR algorithm has a maximum reduction of 32.56%compared with DBR algorithm and53.05%compared with Corder algorithm.

Low side lobe pattern synthesis using projection method with genetic algorithm for truncated cone conformal phased arrays

A hybrid method for synthesizing antenna＇s three dimensional （3D） pattern is proposed to obtain the low sidelobe feature of truncated cone conformal phased arrays. In this method, the elements of truncated cone conformal phased arrays are projected to the tangent plane in one generatrix of the truncated cone. Then two dimensional （2D） Chebyshev amplitude distribution optimization is respectively used in two mutual vertical directions of the tangent plane. According to the location of the elements, the excitation current amplitude distribution of each element on the conformal structure is derived reversely, then the excitation current amplitude is further optimized by using the genetic algorithm （GA）. A truncated cone problem with 8x8 elements on it, and a 3D pattern desired side lobe level （SLL） up to 35 dB, is studied. By using the hybrid method, the optimal goal is accomplished with acceptable CPU time, which indicates that this hybrid method for the low sidelobe synthesis is feasible.

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.

Research on the Signal Reconstruction of the Phased Array Structural Health Monitoring Based Using the Basis Pursuit Algorithm

The signal processing problem has become increasingly complex and demand high acquisition system,this paper proposes a new method to reconstruct the structure phased array structural health monitoring signal.The method is derived from the compressive sensing theory and the signal is reconstructed by using the basis pursuit algorithm to process the ultrasonic phased array signals.According to the principles of the compressive sensing and signal processing method,non-sparse ultrasonic signals are converted to sparse signals by using sparse transform.The sparse coefficients are obtained by sparse decomposition of the original signal,and then the observation matrix is constructed according to the corresponding sparse coefficients.Finally,the original signal is reconstructed by using basis pursuit algorithm,and error analysis is carried on.Experimental research analysis shows that the signal reconstruction method can reduce the signal complexity and required the space efficiently.

Worst-case tolerance analysis on array antenna based on chaos-genetic algorithm

This paper studies the effect of amplitude-phase errors on the antenna performance. Via builting on a worst-case error tolerance model, a simple and practical worst error tolerance analysis based on the chaos-genetic algorithm （CGA） is proposed. The proposed method utilizes chaos to optimize initial population for the genetic algorithm （GA） and introduces chaotic disturbance into the genetic mutation, thereby improving the ability of the GA to search for the global optimum. Numerical simulations demonstrate that the accuracy and stability of the worst-case analysis of the proposed approach are superior to the GA. And the proposed algorithm can be used easily for the error tolerant design of antenna arrays.

Computationally Efficient 2DDOA Estimation for Uniform Planar Arrays:RDROOTMUSIC Algorithm

The problem of two-dimensional direction of arrival(2D-DOA)estimation for uniform planar arrays(UPAs)is investigated by employing the reduced-dimensional(RD)polynomial root finding technique and 2D multiple signal classification(2D-MUSIC)algorithm.Specifically,based on the relationship between the noise subspace and steering vectors,we first construct 2D root polynomial for 2D-DOA estimates and then prove that the 2D polynomial function has infinitely many solutions.In particular,we propose a computationally efficient algorithm,termed RD-ROOT-MUSIC algorithm,to obtain the true solutions corresponding to targets by RD technique,where the 2D root-finding problem is substituted by two one-dimensional(1D)root-finding operations.Finally,accurate 2DDOA estimates can be obtained by a sample pairing approach.In addition,numerical simulation results are given to corroborate the advantages of the proposed algorithm.

Array Antenna Pattern Synthesis Based on Selective Levy Flight Culture Wolf Pack Algorithm

Due to the shortcomings such as the premature convergence and the bad local optimal searching capability in traditional intelligence methods for pattern synthesis,a new type of wolf pack algorithm named Levy⁃Cultural Wolf Pack Algorithm(LCWPA)was designed on the basis of the Cultural Wolf Pack Algorithm(CWPA),which obeys the selective Levy flight.Because of the good overall management ability provided by the cultural algorithm in optimization process and the characteristics of excellent population diversity brought by Levy flight,the search efficiency of the new algorithm was greatly improved.When the algorithm was applied in the pattern synthesis of array antenna,the simulation results showed its high performance with multi⁃null and low side⁃lobe restrictions.In addition,the algorithm was superior to the Quantum Particle Swarm Optimization(QPSO),Particle Swarm Optimization(PSO),and Genetic Algorithm(GA)in optimization accuracy and operation speed,and is of very good generalization.

Estimation of Mutual Coupling Coefficient of the Array by Simulated Annealing Algorithm

We propose a method for estimating the mutual coupling coefficient among antennas in this paper which is based on the principle of signal subspace and the simulated annealing （SA） algorithm. The computer simulation has been conducted to illustrate the＇ excellent performance of this method and to demonstrate that it is statistically efficient. The benefit of this new method is that calibration signals and unknown signals can be received simultaneously, during the course of calibration.

Optimal Design of Thermal Dissipation for the Array Power LED by using the RSM with Genetic Algorithm

In accordance with the enhancement for luminous efficiency improving, LED (Light Emitting Diode) has been gradually developed by combining the characteristics of small volume, impact resistance, good reliability, long life, low power consumption with multiple purposes for energy saving and environmental protection. Therefore, the array LED has been widely applied in human livings nowadays. This study applies the finite element analysis software ANSYS to analyze the thermal behavior of the array power LED work lamp which is modeled by four same-size LED with MCPCB (Metal Core Print Circuit Board) mounted on a base heat-sink. The Flotran heat flow analysis is applied to obtain the natural convection of air coefficient, while the convection value can be confirmed by the iterative method since it is set as the boundary condition for ANSYS thermal analysis to obtain the temperature distribution, accordingly the chip junction temperature and the base heat-sink temperature were followed through experiments in order to check if the simulation results meet the design requirements and coincide with the power LED product design specification. Prior to the optimal design process for chip junction temperature, the most significant parameters were first chosen by the fractional factorial design. The regressive models were respectively setup by the dual response surface method (RSM) and the mixed response surface method. Furthermore, the genetic algorithm combined with response surface method was applied to acquire the optimal design parameters, and the results were obtained from both methods, which are reviewed for comparison. Afterwards, the mixed response surface method is adopted to investigate the effects of interactions among various factors on chip junction temperature. In conclusion, it is found that the thermal conductivity of MCPCB and the height of base heat-sink are the two major significant factors. In addition, the interactive effects between chip size and thermal conductivity of chip adhesion layer are acknowledged as the most significant interaction influenced on the chip junction temperature.

RECURSIVE ALGORITHM FOR ADAPTIVE ARRAYS AND SYSTOLIC ARRAY IMPLEMENTATION

In this paper, a new recursive algorithm of adaptive array weight vectors and its systolic array implementing structure is proposed, which is based on the QR decomposition algorithms and the idea of algorithmic engineering. The algorithm can realize fully parallel and pipeline processing.

A Highly Efficient Algorithm for Phased-Array mmWave Massive MIMO Beamforming

With the rapid development of the mobile internet and the internet of things(IoT),the fifth generation(5G)mobile communication system is seeing explosive growth in data traffic.In addition,low-frequency spectrum resources are becoming increasingly scarce and there is now an urgent need to switch to higher frequency bands.Millimeter wave(mmWave)technology has several outstanding features—it is one of the most well-known 5G technologies and has the capacity to fulfil many of the requirements of future wireless networks.Importantly,it has an abundant resource spectrum,which can significantly increase the communication rate of a mobile communication system.As such,it is now considered a key technology for future mobile communications.MmWave communication technology also has a more open network architecture;it can deliver varied services and be applied in many scenarios.By contrast,traditional,all-digital precoding systems have the drawbacks of high computational complexity and higher power consumption.This paper examines the implementation of a new hybrid precoding system that significantly reduces both calculational complexity and energy consumption.The primary idea is to generate several sub-channels with equal gain by dividing the channel by the geometric mean decomposition(GMD).In this process,the objective function of the spectral efficiency is derived,then the basic tracking principle and least square(LS)techniques are deployed to design the proposed hybrid precoding.Simulation results show that the proposed algorithm significantly improves system performance and reduces computational complexity by more than 45%compared to traditional algorithms.

A three-dimensional matching localization algorithm based on helix triangular pyramid array

On the eve of the occurrence of geological hazards,part of the rock and soil body begins to burst,rub,and fracture,generating infrasound signals propagating outward.3D advanced positioning of the landslide has remained unsolved,which is important for disaster prevention.Through the Fourier transform and Hankel transform of the wave equation in cylindrical coordinates,this work established a three-dimensional axisymmetric sound field model based on normal waves,and designed a 4-element helix triangular pyramid array with vertical and horizontal sampling capabilities.Based on this,the three-dimensional matching localization algorithm of infrasound for geological hazards is proposed.Applying the algorithm to the infrasound signal localization of rock and soil layers,it was found that the helix triangular pyramid array can achieve accurate estimation of depth and distance with a smaller number of array elements than the traditional array,and may overcome the azimuth symmetry ambiguity.This study shows the application prospects of this method for predicting geohazards position several hours in advance.

Hybrid alternate projection algorithm and its application for practical conformal array pattern synthesis

Based on the fabricated 12-element cavity-backed microstrip sector cylinder array,a novel hybrid alternate projection algorithm（HAPA）,which combines analytical method with numerical techniques effectively,is proposed for synthesizing the pattern of practical conformal array.The algorithm applies the variable direction aperture projection method with mutual coupling correction techniques to provide the good initial excitations of elements to the enhanced alternate projection algorithm（EAPA）.In order to do further optimization,which improves the convergent speed of the algorithm significantly.Finally,the HAPA has been applied to the fabricated sector cylinder array with mutual coupling considered.The results of synthesized patterns,such as low sidelobe with null points formed pattern,beam scanning with low sidelobe pattern and the shaped beam pattern are presented.It demonstrates the validity of HAPA in practical conformal array synthesis.

The radial self-positioning algorithm of intelligent ultrasonic probe array in oil/gas pipeline

The working principle of the pipeline intelligent pig and the structure of ultrasonic probe array used to detect defects in oil/gas pipeline are introduced. The effects of the array＇ s radial position in pipe on defect resolution are analyzed. The causes leading to radial positioning error are investigated. An algo- rithm for the radial self-positioning is presented. The experimental results show that the radial self-positioning algorithm can eliminate the array＇ s space position error effectively and improve the defect resolution.

Distributed genetic algorithm for optimal planar arrays of aperture synthesis telescope

Sparse arrays of telescopes have a limited (u, v)-plane coverage. In this paper, an optimization method for designing planar arrays of an aperture synthesis telescope is proposed that is based on distributed genetic algorithm. This distributed genetic algorithm is implemented on a network of workstations using community communication model. Such an aperture synthesis system performs with imperfection of (u, v) components caused by deviations and(or) some missing baselines. With the maximum (u, v)-plane coverage of this rotation-optimized array, the image of the source reconstructed by inverse Fourier transform is satisfactory.

BEAM BROADENING SYNTHESIS FOR SAR ANTENNA ARRAY BASED ON PROJECTION MATRIX ALGORITHM

A new beam broadening synthesis technique for Synthetic Aperture Radar(SAR) antenna array, namely Projection Matrix Algorithm(PMA) is presented. The theory of PMA is introduced firstly, and then the iterative renewed manner is improved to resolve the unbalance problem under amplitude and phase control. In order to validate the algorithm correct and effective, an actual engineering application example is investigated. The beam synthesis results of 1.0~4.5 times broadening under the phase only control and the amplitude and phase control using improved PMA are given. The results show that the beam directivity, the beam broadening, and the side-lobe level requirements were met. It is demonstrated that the improved PMA was effective and feasible for SAR application.

NEW LSCM BLIND MULTIUSER DETECTION ALGORITHM FOR ANTENNA ARRAY CDMA SYSTEM

Two blind multiuser detection algorithms for antenna array in Code Division Multiple Access （CDMA） system which apply the linearly constrained condition to the Least Squares Constant Modulus Algorithln （LSCMA） are proposed in this paper. One is the Linearly Constrained LSCMA （LC-LSCMA）, the other is the Preprocessing LC-LSCMA （PLC-LSCMA）. The two algorithms are compared with the conventional LSCMA. The results show that the two algorithms proposed in this paper are superior to the conventional LSCMA and the best one is PLC-LSCMA.