메뉴 건너뛰기




Volumn 58, Issue 12, 2010, Pages 3923-3930

Beampattern synthesis for linear and planar arrays with antenna selection by convex optimization

Author keywords

Array signal processing; directive antennas; linear arrays; mutual coupling; planar arrays; robustness

Indexed keywords

ARRAY SIGNAL PROCESSING; LINEAR ARRAYS; MUTUAL COUPLING; PLANAR ARRAYS; ROBUSTNESS;

EID: 78649997420     PISSN: 0018926X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAP.2010.2078446     Document Type: Article
Times cited : (238)

References (23)
  • 1
    • 0033315286 scopus 로고    scopus 로고
    • Robust adaptive beamforming in sensor arrays
    • Jul
    • A. B. Gershman, "Robust adaptive beamforming in sensor arrays," AEU Int. J. Electron. and Commun., vol. 53, pp. 305-314, Jul. 1999.
    • (1999) AEU Int. J. Electron. and Commun. , vol.53 , pp. 305-314
    • Gershman, A.B.1
  • 2
    • 0037304809 scopus 로고    scopus 로고
    • Robust adaptive beamforming using worst-case performance optimization: A solution to the signal mismatch problem
    • Feb
    • S. A. Vorobyov, A. B. Gershman, and Z. Q. Luo, "Robust adaptive beamforming using worst-case performance optimization: A solution to the signal mismatch problem," IEEE Trans. Signal Process., vol. 51, pp. 313-324, Feb. 2003.
    • (2003) IEEE Trans. Signal Process. , vol.51 , pp. 313-324
    • Vorobyov, S.A.1    Gershman, A.B.2    Luo, Z.Q.3
  • 3
    • 0038036818 scopus 로고    scopus 로고
    • On robust Capon beamforming and diagonal loading
    • Jul
    • J. Li, P. Stoica, and Z. Wang, "On robust Capon beamforming and diagonal loading," IEEE Trans. Signal Process., vol. 51, pp. 1702-1715, Jul. 2003.
    • (2003) IEEE Trans. Signal Process. , vol.51 , pp. 1702-1715
    • Li, J.1    Stoica, P.2    Wang, Z.3
  • 4
    • 68049111685 scopus 로고    scopus 로고
    • A robust adaptive beamforming framework with beampattern shaping constraints
    • Jul
    • S. E. Nai, W. Ser, Z. L. Yu, and S. Rahardja, "A robust adaptive beamforming framework with beampattern shaping constraints," IEEE Trans. Antennas Propag., vol. 57, pp. 2198-2203, Jul. 2009.
    • (2009) IEEE Trans. Antennas Propag. , vol.57 , pp. 2198-2203
    • Nai, S.E.1    Ser, W.2    Yu, Z.L.3    Rahardja, S.4
  • 5
    • 0002453910 scopus 로고    scopus 로고
    • FIR filter design via spectral factorization and convex optimization
    • B. N. Datta, Ed. Boston, MA: Birkhauser
    • S.-P. Wu, S. P. Boyd, and L. Vandenberghe, "FIR filter design via spectral factorization and convex optimization," in Appl. Computational Contr., Signal and Commun., B. N. Datta, Ed. Boston, MA: Birkhauser, 1997, vol. 1, pp. 215-245.
    • (1997) Appl. Computational Contr., Signal and Commun. , vol.1 , pp. 215-245
    • Wu, S.-P.1    Boyd, S.P.2    Vandenberghe, L.3
  • 6
    • 34250797384 scopus 로고    scopus 로고
    • Low-dimensional SDP formulation for large antenna array syn thesis
    • Jun
    • H. G. Hoang, H. D. Tuan, and B.-N. Vo, "Low-dimensional SDP formulation for large antenna array synthesis," IEEE Trans. Antennas Propag., vol. 55, pp. 1716-1725, Jun. 2007.
    • (2007) IEEE Trans. Antennas Propag. , vol.55 , pp. 1716-1725
    • Hoang, H.G.1    Tuan, H.D.2    Vo, B.-N.3
  • 7
    • 78650035795 scopus 로고    scopus 로고
    • Beampattern synthesis with linear matrix inequalities using minimum array sensors
    • S. E. Nai, W. Ser, Z. L. Yu, and S. Rahardja, "Beampattern synthesis with linear matrix inequalities using minimum array sensors," Progr. Electromagn. Res. M, vol. 9, pp. 165-176, 2009.
    • (2009) Progr. Electromagn. Res. M , vol.9 , pp. 165-176
    • Nai, S.E.1    Ser, W.2    Yu, Z.L.3    Rahardja, S.4
  • 8
    • 84937650610 scopus 로고
    • A current distribution for broadside arrays which optimizes the relationship between beam width and side-lobe level
    • Jun
    • 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, Jun. 1946.
    • (1946) Proc. IRE , vol.34 , pp. 335-348
    • Dolph, C.L.1
  • 9
    • 0000583972 scopus 로고
    • Optimum scannable planar arrays with an invariant sidelobe level
    • Nov
    • F.-I. Tseng and D. K. Cheng, "Optimum scannable planar arrays with an invariant sidelobe level," Proc. IEEE, vol. 56, pp. 1771-1778, Nov. 1968.
    • (1968) Proc. IEEE , vol.56 , pp. 1771-1778
    • Tseng, F.-I.1    Cheng, D.K.2
  • 10
    • 0000837225 scopus 로고
    • Extensions of the Tseng-Cheng pattern synthesis technique
    • Y. U. Kim and R. S. Elliott, "Extensions of the Tseng-Cheng pattern synthesis technique," J. Electromagn.Waves Appl., vol. 2, pp. 255-268, 1988.
    • (1988) J. Electromagn.Waves Appl. , vol.2 , pp. 255-268
    • Kim, Y.U.1    Elliott, R.S.2
  • 11
    • 0001547612 scopus 로고
    • The theoretical precision with which an arbitrary radiation pattern may be obtained from a source of finite size
    • Sep
    • P. M. Woodward and J. D. Lawson, "The theoretical precision with which an arbitrary radiation pattern may be obtained from a source of finite size," J. Inst. Electr. Eng., vol. 95, pp. 363-370, Sep. 1948.
    • (1948) J. Inst. Electr. Eng. , vol.95 , pp. 363-370
    • Woodward, P.M.1    Lawson, J.D.2
  • 12
    • 0032688360 scopus 로고    scopus 로고
    • Pattern synthesis for arbitrary arrays using an adaptive array method
    • May
    • P. Y. Zhou and M. A. Ingram, "Pattern synthesis for arbitrary arrays using an adaptive array method," IEEE Trans. Antennas Propag., vol. 47, pp. 862-869, May 1999.
    • (1999) IEEE Trans. Antennas Propag. , vol.47 , pp. 862-869
    • Zhou, P.Y.1    Ingram, M.A.2
  • 13
    • 14644393613 scopus 로고    scopus 로고
    • A new array pattern synthesis algorithm using the two-step least-squares method
    • Mar
    • Z. Shi and Z. Feng, "A new array pattern synthesis algorithm using the two-step least-squares method," IEEE Signal Process. Lett., vol. 12, pp. 250-253, Mar. 2005.
    • (2005) IEEE Signal Process. Lett. , vol.12 , pp. 250-253
    • Shi, Z.1    Feng, Z.2
  • 16
    • 0033296299 scopus 로고    scopus 로고
    • Using SeDuMi1.02, aMATLAB toolbox for optimization over symmetric cones
    • J. F. Sturm, "Using SeDuMi1.02, aMATLAB toolbox for optimization over symmetric cones," Optimization Methods Softw., vol. 11-12, pp. 625-653, 1999.
    • (1999) Optimization Methods Softw. , vol.11-12 , pp. 625-653
    • Sturm, J.F.1
  • 18
    • 51249181779 scopus 로고
    • A new polynomial time algorithm for linear programming
    • N. Karmarkar, "A new polynomial time algorithm for linear programming," Combinatorica, vol. 4, pp. 373-395, 1984.
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmarkar, N.1
  • 19
    • 33645712308 scopus 로고    scopus 로고
    • Just relax: Convex programming methods for identifying sparse signals in noise
    • Mar
    • J. A. Tropp, "Just relax: Convex programming methods for identifying sparse signals in noise," IEEE Trans. Inf. Theory, vol. 52, pp. 1030-1051, Mar. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , pp. 1030-1051
    • Tropp, J.A.1
  • 21
    • 33847366224 scopus 로고    scopus 로고
    • Portfolio optimization with linear and fixed transaction costs
    • Jul
    • M. S. Lobo, M. Fazel, and S. P. Boyd, "Portfolio optimization with linear and fixed transaction costs," Ann. Oper. Res., vol. 152, pp. 341-365, Jul. 2007.
    • (2007) Ann. Oper. Res. , vol.152 , pp. 341-365
    • Lobo, M.S.1    Fazel, M.2    Boyd, S.P.3
  • 22
    • 0013500047 scopus 로고
    • Linear arrays with arbitrarily distributed elements
    • Mar
    • H. Unz, "Linear arrays with arbitrarily distributed elements," IRE Trans. Antennas Propag., vol. 8, pp. 222-223, Mar. 1960.
    • (1960) IRE Trans. Antennas Propag. , vol.8 , pp. 222-223
    • Unz, H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.