An algorithm for the pattern computation of triangular lattice phased arrays

Bokhari, SA and Balakrishnan, N and Mahapatra, PR (1987) An algorithm for the pattern computation of triangular lattice phased arrays. In: Antennas and Propagation Society International Symposium, 1987, June, Vol.25,137-140.

Preview

PDF An_algorithm.pdf Download (203kB)

Abstract

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].

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	©1987 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Mechanical Sciences > Aerospace Engineering(Formerly Aeronautical Engineering)
Date Deposited:	25 Aug 2008
Last Modified:	19 Sep 2010 04:12
URI:	http://eprints.iisc.ac.in/id/eprint/403

Actions (login required)

View Item