메뉴 건너뛰기




Volumn 2, Issue , 2001, Pages 297-300

Design of FIR filters with discrete coefficients: A semidefinite programming relaxation approach

Author keywords

[No Author keywords available]

Indexed keywords

FIR DIGITAL FILTERS; NEAR-OPTIMAL PERFORMANCE; POLYNOMIAL-TIME; POWER-OF-TWO; SEMI-DEFINITE PROGRAMMING; SEMI-DEFINITE PROGRAMMING RELAXATIONS;

EID: 0035019234     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCAS.2001.921066     Document Type: Conference Paper
Times cited : (25)

References (20)
  • 1
    • 0015474130 scopus 로고
    • Computer-aided design of digital filters with finite wordlength
    • Dec.
    • M. Suk and S. K. Mitra, "Computer-aided design of digital filters with finite wordlength", IEEE Trans. Audio Electroacoust., vol. 20, pp. 356-366, Dec. 1972.
    • (1972) IEEE Trans. Audio Electroacoust. , vol.20 , pp. 356-366
    • Suk, M.1    Mitra, S.K.2
  • 2
    • 0020763686 scopus 로고
    • FIR filter design over a discrete power-of-two coefficient space
    • June
    • Y. C. Lim and S. R. Parker, "FIR filter design over a discrete power-of-two coefficient space", IEEE Trans. ASSP. vol. 31, pp. 588-591, June 1983.
    • (1983) IEEE Trans. ASSP , vol.31 , pp. 588-591
    • Lim, Y.C.1    Parker, S.R.2
  • 3
    • 0023328883 scopus 로고
    • Efficient design of 2-D multiplierless FIR filters by transformation
    • April
    • S. C. Pei and S. B. Jaw, "Efficient design of 2-D multiplierless FIR filters by transformation", IEEE Trans. CAS, vol. 34, pp. 436-438, April 1987.
    • (1987) IEEE Trans. CAS , vol.34 , pp. 436-438
    • Pei, S.C.1    Jaw, S.B.2
  • 4
    • 0022027165 scopus 로고
    • Efficient and multiplierless design of fir filters with very sharp cutoff via maximally flat building blocks
    • P. P. Vaidyanathan, "Efficient and multiplierless design of FIR filters with very sharp cutoff via maximally flat building blocks", IEEE Trans. CAS, vol. 32, pp. 236-244, March 1985. (Pubitemid 15453151)
    • (1985) IEEE Transactions on Circuits and Systems , vol.CAS-32 , Issue.3 , pp. 236-244
    • Vaidyanathan, P.P.1
  • 5
    • 0024479280 scopus 로고
    • Finite precision design of optimal linear phase 2-D FIR digital filters
    • Jan.
    • P. Siohan and A. Benslimane, "Finite precision design of optimal linear phase 2-D FIR digital filters", IEEE Trans. CAS, vol. 36, pp. 11-22, Jan. 1989.
    • (1989) IEEE Trans. CAS , vol.36 , pp. 11-22
    • Siohan, P.1    Benslimane, A.2
  • 6
    • 0025592978 scopus 로고
    • Design of discrete-coefficient-value linear phase FIR filters with optimum normalized peak ripple magnitude
    • Dec.
    • Y. C. Lim, "Design of discrete-coefficient-value linear phase FIR filters with optimum normalized peak ripple magnitude", IEEE Trans. CAS, vol. 37, pp. 1480-1486, Dec. 1990.
    • (1990) IEEE Trans. CAS , vol.37 , pp. 1480-1486
    • Lim, Y.C.1
  • 7
    • 0031618168 scopus 로고    scopus 로고
    • Signed power-oftwo (SPT) term allocation scheme for the design of digital filters
    • CA., June
    • Y. C. Lim, R. Yang, D. Li, and J. Song, "Signed power-oftwo (SPT) term allocation scheme for the design of digital filters", Proc. ISCAS, Monterey, CA., June 1998.
    • (1998) Proc. ISCAS, Monterey
    • Lim, Y.C.1    Yang, R.2    Li, D.3    Song, J.4
  • 8
    • 0033697567 scopus 로고    scopus 로고
    • An Algorithm for the design of multiplierless approximately linear-phase lattice wave digital filters
    • Geneva, June
    • J. T. Yli-Kaakinen and T. A. Saramaki, "An Algorithm for the design of multiplierless approximately linear-phase lattice wave digital filters", Proc. ISCAS'2000, vol. II, pp. 77-80, Geneva, June 2000.
    • (2000) Proc. ISCAS'2000 , vol.2 , pp. 77-80
    • Yli-Kaakinen, J.T.1    Saramaki, T.A.2
  • 9
    • 0033684558 scopus 로고    scopus 로고
    • A successive reoptimization approach for the design of discrete coefficient perfect reconstruction lattice filter bank
    • Geneva, June
    • Y. C. Lim and Y. J. Yu, A successive reoptimization approach for the design of discrete coefficient perfect reconstruction lattice filter bank", Proc. ISCAS'2000. vol. 2, pp. 69-72, Geneva, June 2000.
    • (2000) Proc. ISCAS'2000 , vol.2 , pp. 69-72
    • Lim, Y.C.1    Yu, Y.J.2
  • 12
    • 0030392240 scopus 로고    scopus 로고
    • FIR filter design via semidefinite programming and spectral factorization
    • Kobe, Japan, Dec
    • S.-P. Wu, S. Boyd, and L. Vandenberghe, "FIR filter design via semidefinite programming and spectral factorization", Proc. 35th Conf. Decision and Control, pp. 271-276, Kobe, Japan, Dec. 1996.
    • (1996) Proc. 35th Conf. Decision and Control , pp. 271-276
    • Wu, S.-P.1    Boyd, S.2    Vandenberghe, L.3
  • 13
    • 0038747612 scopus 로고    scopus 로고
    • Design of digital filters and filter banks by optimization: A state of the art review
    • Tampere, Finland, Sept
    • W.-S. Lu and A. Antoniou, "Design of digital filters and filter banks by optimization: A state of the art review", Proc. EUSIPCO, Tampere, Finland, Sept. 2000.
    • (2000) Proc. EUSIPCO
    • Lu, W.-S.1    Antoniou, A.2
  • 16
    • 0003169116 scopus 로고
    • Interior point methods in semidefinite programming with applications to combinatorial optimization
    • F. Alizadeh. "Interior point methods in semidefinite programming with applications to combinatorial optimization", SIAMJ. Optimization, vol. 5, pp. 13-51. 1995.
    • (1995) SIAMJ. Optimization , vol.5 , pp. 13-51
    • Alizadeh, F.1
  • 17
    • 0030106462 scopus 로고    scopus 로고
    • Semidefinite programming
    • L. Vandenberghe and S. Boyd, "Semidefinite programming". SIAM Review, vol. 38, pp. 49-95, March 1996. (Pubitemid 126610912)
    • (1996) SIAM Review , vol.38 , Issue.1 , pp. 49-95
    • Vandenberghe, L.1    Boyd, S.2
  • 18
    • 0004943866 scopus 로고    scopus 로고
    • Sept, Download link
    • J. F. Sturm, SeDuMi Version 1.03, Sept. 1999. (Download link: http://www2.unimaas.nirsturm/software/sedumi.html).
    • (1999) SeDuMi Version 1.03
    • Sturm, J.F.1
  • 19
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfiability problem using semidefinite programming
    • M. Geomans and D. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problem using semidefinite programming", J. ACM, vol. 42, pp. 1115-1145, 1995.
    • (1995) J. ACM , vol.42 , pp. 1115-1145
    • Geomans, M.1    Williamson, D.2
  • 20
    • 0003395487 scopus 로고    scopus 로고
    • H. Wolkowica, R. Saigal. and L. Vandenberghe ed., Kluwer Academic
    • Handbook on Semidefinite Programming, H. Wolkowica, R. Saigal. and L. Vandenberghe ed., Kluwer Academic, 2000.
    • (2000) Handbook on Semidefinite Programming


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