An algorithm for the pattern computation of triangular lattice phased arrays
S.A. Bokhari,Narayanaswamy Balakrishnan,P.R. Mahapatra +2 more
- 15 Jun 1987
- Vol. 25, pp 137-140
TL;DR: A hexagonal DFT convenient for triangular grid phased array computations is described and an algorithm for fast computation has been developed that is remarkably simple to code and requires about the same number of operations as the vector radix algorithm.
read more
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].
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Affine transformation for synthesis of low sidelobe patterns in planar array antennas with a triangular element grid using the IFT method
TL;DR: In this article, a combination of the IFT method with an affine transformation is used to synthesize low sidelobe tapers for array antennas featuring a triangular grid, where the peak sidelobe levels of the obtained tapers are invariant with frequency and scan angle.
6
Patent
Method for determining amplitudes and phases of the different channels in an electromagnetic signal transmission network, such as a telecommunication satellite antenna
Jacques Sombrin
- 04 Jun 1999
TL;DR: In this paper, a method for determining amplitudes and phases of the different channels in an electromagnetic signal transmission network whereof the sources are arranged in a triangular lattice is described. But this method is not suitable for the case where the source is located in a fixed position.
1
Patent
Procede pour la determination des amplitudes et phases des differentes voies d'un reseau d'emission de signaux electromagnetiques, tel qu'une antenne de satellite de telecommunication
Jacques Sombrin
- 10 Dec 1999
TL;DR: In this article, a procedure for determination des amplitudes and phases des differentes voies d'un reseau d'emission of signaux electromagnetiques is described.
References
Fast algorithms for the multidimensional discrete Fourier transform
TL;DR: It is shown that such an algorithm is equivalent in computational complexity to the evaluation of a rectangular discrete Fourier transform, and a Chinese remainder theorem is derived for integer lattices.
72
Efficient computation of the far field of parabolic reflectors by pseudo-sampling algorithm
TL;DR: A new comb-type fast Fourier transform (FFT) algorithm is used in a computer program and both precision and computational time are analyzed, demonstrating the excellent performance of the method.
17
The processing of hexagonally sampled two-dimensional signals
Russell M. Mersereau
- 01 Jun 1979
TL;DR: Methods for the processing of two- dimensional signals which have been sampled as two-dimensional hexagonal arrays are presented and some comparisons between the two methods for representing planar data will also be presented.