메뉴 건너뛰기




Volumn 38, Issue 11, 1990, Pages 1897-1901

Optimum Step Size of Sign Algorithm for Nonstationary Adaptive Filtering

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION--APPLICATIONS; MATHEMATICAL TECHNIQUES--ALGORITHMS;

EID: 0025517148     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/29.103091     Document Type: Article
Times cited : (24)

References (16)
  • 3
    • 84941607163 scopus 로고
    • Selection of a finite precision algorithm for echo cancellation
    • Sept.
    • M. Bonnet and O. Macchi, “Selection of a finite precision algorithm for echo cancellation,” Ann. des Telecommun. (in French), Sept. 1983.
    • (1983) Ann. des Telecommun. (in French)
    • Bonnet, M.1    Macchi, O.2
  • 4
    • 0022883668 scopus 로고
    • Dual sign algorithm for adaptive filtering
    • Dec.
    • C. P. Kwong, “Dual sign algorithm for adaptive filtering,” IEEE Trans. Commun., vol. COM-34, pp. 1272-1275, Dec. 1986.
    • (1986) IEEE Trans. Commun. , vol.COM-34 , pp. 1272-1275
    • Kwong, C.P.1
  • 5
    • 84945713173 scopus 로고
    • Comparison of the convergence of two algorithms for adaptive FIR digital filters
    • June
    • T. A. C. M. Claasen and W. F. G. Mecklenbrauker, “Comparison of the convergence of two algorithms for adaptive FIR digital filters,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-29, no. 3, pp. 670-678, June 1981.
    • (1981) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-29 , Issue.3 , pp. 670-678
    • Claasen, T.A.C.M.1    Mecklenbrauker, W.F.G.2
  • 6
    • 0021392034 scopus 로고
    • Adaptive filtering with binary reinforcement
    • Mar.
    • A. Gersho, “Adaptive filtering with binary reinforcement,” IEEE Trans. Inform. Theory, vol. IT-30, no. 2, pp. 191-199, Mar. 1984.
    • (1984) IEEE Trans. Inform. Theory , vol.IT-30 , Issue.2 , pp. 191-199
    • Gersho, A.1
  • 7
    • 0022215851 scopus 로고
    • Comments on ‘comparison of convergence of two algorithms for adaptive FIR digital filters,’
    • Dec.
    • N. J. Bershad, “Comments on ‘comparison of convergence of two algorithms for adaptive FIR digital filters,’” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, no. 6, pp. 1604-1606, Dec. 1985.
    • (1985) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-33 , Issue.6 , pp. 1604-1606
    • Bershad, N.J.1
  • 8
    • 0023013378 scopus 로고
    • Advances in adaptive filtering
    • E. Biglieri and G. Prati, Eds. Amsterdam, The Netherlands: North-Holland
    • O. Macchi, “Advances in adaptive filtering,” in Digital Communications, E. Biglieri and G. Prati, Eds. Amsterdam, The Netherlands: North-Holland, 1986, pp. 41-57.
    • (1986) Digital Communications , pp. 41-57
    • Macchi, O.1
  • 9
    • 0023327005 scopus 로고
    • Improved convergence analysis of stochastic gradient adaptive filters using the sign algorithm
    • Apr.
    • V. J. Mathews and S. H. Cho, “Improved convergence analysis of stochastic gradient adaptive filters using the sign algorithm,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, no. 4, pp. 450-454, Apr. 1987.
    • (1987) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-35 , Issue.4 , pp. 450-454
    • Mathews, V.J.1    Cho, S.H.2
  • 10
    • 0021392920 scopus 로고
    • Some considerations on the design of adaptive digital filters equipped with the sign algorithm
    • Mar.
    • N. A. M. Verhoeckx and T. A. C. M. Claasen, “Some considerations on the design of adaptive digital filters equipped with the sign algorithm,” IEEE Trans. Commun., vol. COM-32, no. 3, pp. 258-266, Mar. 1984.
    • (1984) IEEE Trans. Commun. , vol.COM-32 , Issue.3 , pp. 258-266
    • Verhoeckx, N.A.M.1    Claasen, T.A.C.M.2
  • 11
    • 0024091266 scopus 로고
    • Almost sure convergence of a decreasing gain sign algorithm for adaptive filtering
    • Oct.
    • E. Eweda, “Almost sure convergence of a decreasing gain sign algorithm for adaptive filtering,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-36, no. 10, pp. 1669-1671, Oct. 1988.
    • (1988) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-36 , Issue.10 , pp. 1669-1671
    • Eweda, E.1
  • 12
    • 0024769918 scopus 로고
    • A tight upper bound of the average absolute error in a constant step size sign algorithm
    • Nov.
    • E. Eweda, “A tight upper bound of the average absolute error in a constant step size sign algorithm,” IEEE Trans. Acoust., Speech, Signal Processing, Nov. 1989.
    • (1989) IEEE Trans. Acoust., Speech, Signal Processing
    • Eweda, E.1
  • 13
    • 0016987049 scopus 로고
    • Stationary and nonstationary learning characteristics of the LMS adaptive filter
    • Aug.
    • B. Widrow, J. M. McCool, M. G. Larimore, and C. R. Johnson, Jr., “Stationary and nonstationary learning characteristics of the LMS adaptive filter,” Proc. IEEE, vol. 64, pp. 1151-1162, Aug. 1976.
    • (1976) Proc. IEEE , vol.64 , pp. 1151-1162
    • Widrow, B.1    McCool, J.M.2    Larimore, M.G.3    Johnson, C.R.4
  • 14
    • 0021391647 scopus 로고
    • On the statistical efficiency of the LMS algorithm with nonstationary inputs
    • Mar.
    • B. Widrow and E. Walach, “On the statistical efficiency of the LMS algorithm with nonstationary inputs,” IEEE Trans. Inform. Theory, vol. IT-30, no. 2, pp. 211-221, Mar. 1986.
    • (1986) IEEE Trans. Inform. Theory , vol.IT-30 , Issue.2 , pp. 211-221
    • Widrow, B.1    Walach, E.2
  • 15
    • 0022682870 scopus 로고
    • Optimization in adaptive identification for time-varying filters
    • Mar.
    • O. Macchi, “Optimization in adaptive identification for time-varying filters,” IEEE Trans. Automat. Contr., vol. AC-31, no. 3, pp. 283-287, Mar. 1986.
    • (1986) IEEE Trans. Automat. Contr. , vol.AC-31 , Issue.3 , pp. 283-287
    • Macchi, O.1


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