New search algorithm for minimum redundancy linear arrays
Authors:
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 1361-1364 vol.2
Abstract
An algorithm for finding minimum redundancy linear arrays (MRLAs) of longer lengths than previously possible is presented. The results obtained to date by this algorithm, which go beyond previously published results (length 68 arrays) are summarized. Included is a table of the number of MRLAs as a function of array length (up through length 90). In the process of making this table, errors in two references were discovered and corrected. Such information, along with the array patterns themselves, is extremely valuable in developing suboptimal searching techniques for still longer, but sparse, arrays.Keywords
This publication has 8 references indexed in Scilit:
- An algorithm for near-optimal placement of sensor elementsIEEE Transactions on Information Theory, 1990
- Nonuniform linear arrays: Graph-theoretic approach to minimum redundancyProceedings of the IEEE, 1986
- Minimum redundancy linear arrays for a large number of antennasRadio Science, 1980
- Applications of numbered undirected graphsProceedings of the IEEE, 1977
- Notes on the Representation of 1,2, ……, N by differencesJournal of the London Mathematical Society, 1972
- A Note on Restricted Difference BasesJournal of the London Mathematical Society, 1963
- Note on Restricted Difference BasesJournal of the London Mathematical Society, 1957
- On the Representation of 1, 2, …, n by DifferencesJournal of the London Mathematical Society, 1956