A Low Complexity 2D Pattern Synthesis Algorithm for Cylindrical Array
Author(s) -
Chao Liu,
Zhizhong Ding,
Xiaoping Liu
Publication year - 2013
Publication title -
international journal of antennas and propagation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.282
H-Index - 37
eISSN - 1687-5877
pISSN - 1687-5869
DOI - 10.1155/2013/352843
Subject(s) - beamforming , circular buffer , kronecker product , cylinder , algorithm , kronecker delta , array data structure , computational complexity theory , product (mathematics) , mathematics , computer science , physics , geometry , telecommunications , quantum mechanics , programming language
This paper proposes a 2D pattern synthesis algorithm for cylindrical array. According to the geometric characteristic of cylinder, we can regard a cylindrical array as an equivalent linear array whose elements are identical circular subarrays. Therefore, the beam pattern can be obtained by the product of the array factor of linear array and beam pattern of circular subarray. Then, the 2D beamforming can be realized by two 1D beamforming processes. We can prove that the complex excitation vector of a cylindrical array is the Kronecker product of linear array’s weight vector and circular array’s weight vector. By this algorithm of decomposition and reconstruction, the computational complexity of 2D beamforming could be significantly reduced. Finally, simulation results further illustrate the validity of the proposed method
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom