On the Design of Maximally Sparse Beamforming Arrays

IEEE Transactions on Antennas and Propagation

Volumn 39, Issue 8, 1991, Pages 1178-1187

  Jeffs, Brian D ^b  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b BRIGHAM YOUNG UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANTENNAS - COMPUTER AIDED DESIGN; MATHEMATICAL TECHNIQUES - ALGORITHMS; OPTIMIZATION;

BEAMFORMING ARRAYS; COMPUTER ALGORITHMS; SPARSE ARRAYS;

ANTENNAS;

EID: 0026202605     PISSN: 0018926X     EISSN: 15582221     Source Type: Journal    
DOI: 10.1109/8.97353     Document Type: Article

References (32)

1. D. King, R. Packard, and R. Thomas, “Unequally-spaced, broadband antenna arrays,” IRE Trans. Antennas Propagat., vol. AP-8, pp. 380–384, 1960.
2. A. Maffett, “Array factors with nonuniform spacing arrays,” IRE Trans. Antennas Propagat., vol. AP-10, pp. 131–136, 1962.
3. N. Balakrishnan, P. Murthy, and S. Ramakrishna, “Synthesis of antenna arrays with spatial and excitation constraints,” IEEE Trans. Antennas Propagat., vol. AP-29, pp. 690–696, 1979.
4. H. Unz, “Linear arrays with arbitrarily distributed elements,” IRE Trans. Antennas Propagat., vol. AP-8, pp. 222–223, 1960.
5. A. Ishimaru and Y. S. Chen, “Thining and broadbanding antenna arrays by unequal spacings,” IEEE Trans. Antenna Propagat., vol. AP-13, pp. 34–42, 1965.
6. Y. Lo and S. Lee, “A study of space-tapered arrays,” IEEE Trans. Antennas Propagat., vol. AP-14, pp. 22–30, 1966.
7. Y. Lo, “A mathematical theory of antenna arrays with randomly spaced elements,” IEEE Trans. Antennas Propagat., vol. AP-12, pp. 257–268, 1964.
8. Y. Kim and D. Jaggard, “The fractal random array,” Proc. IEEE, vol. 74, pp. 1278–1280, 1986.
9. M. Skolnik, G. Nemhauser, and J. Sherman, “Dynamic programming applied to unequally spaced elements,” IEEE Trans. Antennas Propagat., vol. AP-12, pp. 35–43, 1964.
10. F. Bratkovie, “Computer determination of spaces for broadband nonuniform arrays,” IEEE Trans. Antennas Propagat., vol. AP-21, pp. 211–213, 1973.
11. R. Redlich, “Iterative least squares synthesis on nonuniformly spaced linear arrays,” IEEE Trans. Antennas Propagat., vol. AP-21, pp. 106–108, 1973.
12. N. Mitrou, “Results on nonrecursive digital filters with nonequidistant taps,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-31, pp. 1621–1624, 1985.
13. G. Kishi, K. Sakaniwa, and T. Uyematsu, “A design method for transversal filters with nonuniform tap spacings based on the mean square error criterion,” in Proc. 5th Int. Symp. Network Theory, Sept. 1984, pp. 363–368.
14. P. Jarski, T. Saramaki, S. Mitra, and U. Neuvo, “On properties and design of nonuniformly spaced linear arrays,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-36, pp. 372–380, 1988.
15. B. D. Van Veen and K. M. Buckley, “Beamforming: A versatile approach to spatial filtering,” IEEE Acoust., Speech, Signal Processing, Magazine, Apr. 1988.
16. B. D. Steinbert, “The peak sidelobe of the phased array having randomly located elements,” IEEE Trans. Antennas Propagat., vol. AP-20, pp. 127–136, 1972.
17. T. W. Parks and C. S. Burrus, Digital Filter Design. New York: Wiley-Interscience, 1987.
18. L. Scales, Introduction to Non-Linear Optimization. New York: Springer-Verlag, 1985.
19. D. Luenberger, Linear and Nonlinear Programming, 2nd ed. Reading, MA: Addison-Wesley, 1984.
20. A. Pietsch, “Approximation spaces,” J. Approx. Theory, vol. 32, pp. 115–134, 1981.
21. W. Gray, “Variable norm deconvolution,” Ph. D. dissertation, Stanford Univ., Stanford, CA, 1979.
22. I. Barrodale and F. Roberts, “Application of mathematical programming to lp approximation,” in Nonlinear Programming, J. Rosen et al., Eds. New York: Academic, 1970.
23. T. Pham and R. deFigueiredo, “Maximum likelihood estimation of a class of non-Gaussian densities with application to lp deconvolution,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 37, pp. 73–82, 1989.
24. J. Falk and K. Hoffman, “Concave minimization via collapsing polytopes,” Oper. Res., vol. 34, pp. 919–929, 1986.
25. P. Zwart, “Global maximization of a convex function with linear inequality constraints,” Oper. Res., vol. 22, pp. 602–609, 1974.
26. N. Thoai and H. Tuy, “Convergent algorithms for minimizing a concave function,” Math. Oper. Res., vol. 5, pp. 556–566, 1980.
27. B. Jeffs, “Maximally sparse constrained optimization for signal processing applications,” Ph. D. dissertation, Univ. Southern California, Los Angeles, CA, Jan. 1989.
28. A. Schrijver, Theory of Linear and Integer Programming. New York, Wiley, 1986.
29. H. Kruse, “Degeneracy graphs and the neighborhood problem,” lecture notes in Econ. Math. Systems, vol. 260, Springer-Verlag 1986.
30. C. Dolph, “A current distribution for broadside arrays which optimizes the relationship between beamwidth and sidelobe lever,” Proc IRE, vol. 34, pp. 335–348, 1946.
31. R. Leahy, B. Jeffs, and Z. Wu, “A DSP algorithm for minimum order solutions,” in Proc. 21st Asilomar Conf. Signals Syst. Comp., Nov. 1987.
32. J. Mendel, Optimal Seismic Deconvolution. New York: Academic, 1983.