An algorithm for the pattern computation of triangular lattice phased arrays
Syed Ahmad Saleem Bokhari, N. Balakrishnan, P. Mahapatra · 2005
In this paper, a hexagonal DFT convenient for triangular grid phased array computations is described. Based on the general theory [4], an algorithm for fast computation has, been developed. Further- more, an algorithm for carrying out the permutations of the input sequence "in place" has also been developed. This is of particular importance in dealing with FFTs of large order as it significantly reduces the-auxilary storage required. The algorithm differs from that of O'neil et al, [3] in that the periodicity lattices in both spatial and spatial frequency domains are identical. A main advantage of this algorithm is that it is remarkably simple to code and requires -about the same number of operations as the vector radix algorithm [2].