Antenna array pattern synthesis via convex optimization

IEEE Transactions on Signal Processing

Volumn 45, Issue 3, 1997, Pages 526-532

  Lebret, Hervé ^a,b   Boyd, Stephen ^a,b  

^a ENSTA PARISTECH   (France)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; ELECTRIC FIELDS; GEOMETRY; LINEAR PROGRAMMING; NUMERICAL METHODS; OPTIMIZATION;

ANTENNA ARRAY PATTERN SYNTHESIS; CONVEX OPTIMIZATION; INTERIOR POINT METHODS;

ANTENNA ARRAYS;

EID: 0031101492     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/78.558465     Document Type: Article

References (21)

1. S. A. Schelkunoff, "A mathematical theory of linear arrays," Bell Syst. Tech. J.. vol. 22, no. 1, pp. 80-107, Jan. 1943.
2. C. L. Dolph, "A current distribution for broadside arrays which optimizes the relationship between beam width and side-lobe level", Proc. IRE. vol. 34, pp. 335-348, June 1946.
3. O. M. Bucci, D. D'Elia, G. Mazzarella, and G. Panatiello, "Antenna pattern synthesis: A new general approach," Proc. IEEE, vol. 82, pp. 358-371, Mar. 1994.
4. L. Vandenberghe and S. Boyd, "Semidefinite programming," SIAM Rev., vol. 38, pp. 49-95, Mar. 1996.
5. N. Karmarkar, "A new polynomial-time algorithm for linear programming", Combinatorica, vol. 4, no. 4, pp. 373-395, 1984.
6. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, vol. 15 of Studies in Applied Mathematics. Philadelphia, PA: SIAM, June 1994.
7. U. Kirsch, Structural Optimization. Berlin: Springer-Verlag, 1993.
8. A. W. Potchinkov and R. M. Reemtsen, "FIR filter design in the complex domain by a semi-infinite programming technique. II. Examples," AEU, Archiv Elektronik Uebertragungstechnik: Electron. Commun., vol. 48, no. 4, pp. 200-209, July 1994.
9. C. Byrne, "Iterative image reconstruction algorithms based on crossentropy minimization," IEEE Trans. Image Processing, vol. 2, pp. 96-103, Jan. 1993.
10. P. Sancheti and S. Sapatnekar, "Interconnect design using convex optimization," in Proc. IEEE Custom Integrated Circuits Conf., 1994, pp. 549-552.
11. S. S. Sapatnekar, "A convex programming approach to problems in VLSI design," Ph.D. dissertation, Coordinated Sci. Lab., Univ. of Illinois, Urbana-Campaign, Aug. 1992.
12. C. C. Gonzaga, "Path-following methods for linear programming," SIAM Rev., vol. 34, no. 2, pp. 167-224, June 1992.
13. Yu. Nesterov and A. Nemirovsky, Interior-Point Polynomial Methods in Convex Programming, vol. 13 of Studies in Applied Mathematics. Philadelphia, PA: SIAM, 1994.
14. S. Boyd, L. Vandenberghe, and M. Grant, "Efficient convex optimization for engineering design," in Proc. IFAC Symp. Robust Contr. Des., Sept. 1994, pp. 14-23.
15. L. S. Lasdon, J. Plummer, B. Buehler, and A. D. Warren, "Optimal design of efficient acoustic antenna arrays," Math. Programming, vol. 39, no. 2, pp. 131-155, 1987.
16. I. Webster, R. J. Evans, and A. Cantoni, "Robust perturbation algorithms for adaptive antenna arrays," IEEE Trans. Antennas Propagat., vol. 38, pp. 195-201, Feb. 1990.
17. A. Cantoni, X. G. Lin, and K. L. Teo, "A new approach to the optimization of robust antenna array processors," IEEE Trans. Antennas Propagat., vol. 41, pp. 403-411, Apr. 1993.
18. H. Lebret, "Synthèse de diagrammes de réseaux d'antennes par optimization convexe," Ph.D. dissertation, Université de Rennes I, Rennes, France, Nov. 1994.
19. O. L. Frost, III, "An algorithm for linearly constrained adaptive array processing," Proc. IEEE, vol. 60, pp. 926-935, Aug. 1972.
20. H. Lebret, "Synthèse de diagrammes de réseaux d'antennes par optimization convexe," in Quinzième Colloque GRETSI traitement signal images, 1995, vol. 1, pp. 241-244.
21. N. Khraishi, "A specification language approach to solving convex antenna weight design problems," Ph.D. dissertation, Stanford Univ., Stanford, CA, 1991.