메뉴 건너뛰기




Volumn 33, Issue 1, 1985, Pages 65-73

Echo Cancellation of Voiceband Data Signals Using Recursive Least Squares and Stochastic Gradient Algorithms

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

EID: 0021785016     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1985.1096200     Document Type: Article
Times cited : (22)

References (27)
  • 1
    • 84939334020 scopus 로고    scopus 로고
    • Fast algorithms for speech modeling
    • Inform. Syst. Lab., Stanford Univ., Stanford, CA, Tech. Rep. M308-1, Dec.
    • M. Morf and D. T. Lee, “Fast algorithms for speech modeling,” Inform. Syst. Lab., Stanford Univ., Stanford, CA, Tech. Rep. M308-1, 1, Dec. 1978.
    • Morf, M.1    Lee, D.T.2
  • 2
    • 0019528527 scopus 로고
    • Application of least squares lattice algorithms to adaptive equalization
    • Feb.
    • E. Satorius and J. Pack, “Application of least squares lattice algorithms to adaptive equalization,” IEEE Trans. Commun., vol. COM-29, pp. 136–142, Feb. 1981.
    • (1981) IEEE Trans. Commun. , vol.COM-29 , pp. 136-142
    • Satorius, E.1    Pack, J.2
  • 3
    • 84948610420 scopus 로고
    • Fast least-squares (LS) in the voice echo cancellation application
    • Paris, France, May
    • F. K. Soong and A. M. Peterson, “Fast least-squares (LS) in the voice echo cancellation application,” in Proc. IEEE ICASSP, Paris, France, May 1982.
    • (1982) Proc. IEEE ICASSP
    • Soong, F.K.1    Peterson, A.M.2
  • 4
    • 0021500415 scopus 로고
    • An inband data-driven echo canceler for 4800 bps full-duplex duplex data transmission
    • Sept.
    • J. J. Werner, “An inband data-driven echo canceler for 4800 bps full-duplex duplex data transmission,” IEEE J. Select. Areas Commun., vol. SAC-2, pp. 722–730, Sept. 1084.
    • (1984) IEEE J. Select. Areas Commun. , vol.SAC-2 , pp. 722-730
    • Werner, J.J.1
  • 5
    • 0015601874 scopus 로고
    • On the design of gradient algorithms for digitally implemented adjustment filters
    • Mar.
    • R. D. Gitlin, J. E. Mazo, and M. G. Taylor, “On the design of gradient algorithms for digitally implemented adjustment filters,” IEEE Trans. Circuit Theory, vol. CT-20, pp. 125–136, Mar. 1973.
    • (1973) IEEE Trans. Circuit Theory , vol.CT-20 , pp. 125-136
    • Gitlin, R.D.1    Mazo, J.E.2    Taylor, M.G.3
  • 6
    • 0020789776 scopus 로고
    • On the start-up problem in digital echo cancelers
    • July-Aug. part
    • J. Salz, “On the start-up problem in digital echo cancelers,” Bell Syst. Tech. J., vol. 62, pp. 1353–1364, July-Aug. 1983, part 1.
    • (1983) Bell Syst. Tech. J. , vol.62 , pp. 1353-1364
    • Salz, J.1
  • 7
    • 0018021739 scopus 로고
    • Application of fast Kalman estimation to adaptive equalization
    • Oct.
    • p. D. Falconer and L. Ljung, “Application of fast Kalman estimation to adaptive equalization,” IEEE Trans. Commun., vol. COM-26, pp. 1430–1446, Oct. 1978.
    • (1978) IEEE Trans. Commun. , vol.COM-26 , pp. 1430-1446
    • Falconer, D.D.1    Ljung, L.2
  • 8
    • 0019655873 scopus 로고
    • A comparison of two fast linear predictors
    • Atlanta, GA, Apr.
    • R. S. Medaugh and L. J. Griffiths, “A comparison of two fast linear predictors,” in Proc. IEEE ICASSP, Atlanta, GA, Apr. 1981.
    • (1981) Proc. IEEE ICASSP
    • Medaugh, R.S.1    Griffiths, L.J.2
  • 9
    • 0021567884 scopus 로고
    • Efficient least-squares algorithms for finite memory adaptive filtering
    • Princeton, NJ, Mar.
    • D. Manolakis, F. Ling, and J. G. Proakis, “Efficient least-squares algorithms for finite memory adaptive filtering,” presented at Conf. Inform. Sci. Syst., Princeton, NJ, Mar. 1984.
    • (1984) presented at Conf. Inform. Sci. Syst.
    • Manolakis, D.1    Ling, F.2    Proakis, J.G.3
  • 10
    • 0016059940 scopus 로고
    • Channel equalization using Kalman filter for fast data transmission
    • May
    • D. Godard, “Channel equalization using Kalman filter for fast data transmission,” IBM J. Res. Develop., pp: 267–273, May 1974.
    • (1974) IBM J. Res. Develop , pp. 267-273
    • Godard, D.1
  • 12
    • 84939034863 scopus 로고    scopus 로고
    • unpublished work.
    • C. W. Farrow, unpublished work.
    • Farrow, C.W.1
  • 13
    • 84939023781 scopus 로고    scopus 로고
    • An efficient, high-performance-least-squares, squares, data-driven echo canceller for full-duplex data transmission
    • to be published.
    • J. M. Cioffi and T. Kailath, “An efficient, high-performance-least-squares, squares, data-driven echo canceller for full-duplex data transmission,” IEEE Trans. Commun., to be published.
    • IEEE Trans. Commun.
    • Cioffi, J.M.1    Kailath, T.2
  • 14
    • 0019715627 scopus 로고
    • On the rapid initial convergence of least squares equalizer adjustment algorithms
    • Dec.
    • M. Mueller, “On the rapid initial convergence of least squares equalizer adjustment algorithms,” Bell Syst. Tech. J., vol. 60, pp. 2345–2358, Dec. 1981.
    • (1981) Bell Syst. Tech. J. , vol.60 , pp. 2345-2358
    • Mueller, M.1
  • 15
    • 0020171266 scopus 로고
    • Lattice filters for adaptive processing
    • Aug
    • B. Friedlander, “Lattice filters for adaptive processing,” Proc. IEEE, vol. 70, pp. 829–867, Aug, 1982.
    • (1982) Proc. IEEE , vol.70 , pp. 829-867
    • Friedlander, B.1
  • 16
    • 0020166707 scopus 로고
    • Square-root covariance ladder algorithms
    • Aug.
    • B. Porat, B. Friedlander, and M. Morf, “Square-root covariance ladder algorithms,” IEEE Trans. Automat. Contr., vol. AC-27, pp. 813–829, Aug. 1982.
    • (1982) IEEE Trans. Automat. Contr. , vol.AC-27 , pp. 813-829
    • Porat, B.1    Friedlander, B.2    Morf, M.3
  • 17
    • 0020937914 scopus 로고
    • Recursive fixed-order covariance least-squares algorithms
    • Dec. part
    • M. L. Honig, “Recursive fixed-order covariance least-squares algorithms,” Bell Syst. Tech. J., vol. 62, pp. 2961–2992, Dec. 1983, part 1.
    • (1983) Bell Syst. Tech. J. , vol.62 , pp. 2961-2992
    • Honig, M.L.1
  • 18
    • 84939039841 scopus 로고    scopus 로고
    • Windowing methods and their efficient transversal-filter implementation for the RLS adaptive-filtering al-gorithms
    • submitted for publication.
    • J. M. Cioffi and T. Kailath, “Windowing methods and their efficient transversal-filter implementation for the RLS adaptive-filtering al-gorithms,” IEEE Trans. Acoust., Speech, Signal Processing, submitted for publication.
    • IEEE Trans. Acoust., Speech, Signal Processing
    • Cioffi, J.M.1    Kailath, T.2
  • 20
    • 0021409182 scopus 로고
    • Fast, recursive-least-squares, transversal filters for adaptive filtering
    • Apr.
    • J. M. Cioffi and T. Kailath, “Fast, recursive-least-squares, transversal filters for adaptive filtering,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 304–337, Apr. 1984.
    • (1984) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-32 , pp. 304-337
    • Cioffi, J.M.1    Kailath, T.2
  • 21
    • 0021124682 scopus 로고
    • On the computational organization of fast sequential algorithms
    • San Diego, CA, Mar.
    • D. Manolakis, G. Carayannis, and N. Kalouptsidis, “On the computational organization of fast sequential algorithms,” in Proc. IEEE ICASSP, San Diego, CA, Mar. 1984, pp. 43.7.1-43.7.4.
    • (1984) Proc. IEEE ICASSP , pp. 43.7.1-43.7.4
    • Manolakis, D.1    Carayannis, G.2    Kalouptsidis, N.3
  • 22
    • 0017677325 scopus 로고
    • A continuously-adaptive filter implemented as a lattice structure
    • Hartford, CT, May
    • L. J. Griffiths, “A continuously-adaptive filter implemented as a lattice structure,” in Proc. IEEE ICASSP, Hartford, CT, May 1977, pp. 683–686.
    • (1977) Proc. IEEE ICASSP , pp. 683-686
    • Griffiths, L.J.1
  • 24
    • 0020737493 scopus 로고
    • Convergence models for lattice joint process estimator and least squares algorithms
    • Apr.
    • M. L. Honig, “Convergence models for lattice joint process estimator and least squares algorithms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-31, pp. 415–425, Apr. 1983.
    • (1983) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-31 , pp. 415-425
    • Honig, M.L.1
  • 25
    • 0021405317 scopus 로고
    • Comparison of LS and SG lattice predictor algorithms using two performance criteria
    • Apr.
    • M. L. Honig and D. G. Messerschmitt, “Comparison of LS and SG lattice predictor algorithms using two performance criteria,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 441–445, 445, Apr. 1984.
    • (1984) IEEE Trans. Acoust., Speech, Signal Processing , vol.ASSP-32 , pp. 441-445
    • Honig, M.L.1    Messerschmitt, D.G.2
  • 26
    • 33747665060 scopus 로고    scopus 로고
    • Error propagation properties of recursive least squares adaptation algorithms
    • Dep. Elec. Eng., Lindkoping Univ., Lindkoping, Sweden, Internal Rep. LITH-ISY-I-0620, Sept.
    • S. Ljung and L. Ljung, “Error propagation properties of recursive least squares adaptation algorithms,” Dep. Elec. Eng., Lindkoping Univ., Lindkoping, Sweden, Internal Rep. LITH-ISY-I-0620, Sept. 1983.
    • Ljung, S.1    Ljung, L.2
  • 27
    • 0018480210 scopus 로고
    • Channel equalization using adaptive lattice algorithms
    • June
    • E. H. Satorius and S. T. Alexander, “Channel equalization using adaptive lattice algorithms,” IEEE Trans. Commun., vol. COM-27, pp. 899–905, June 1979.
    • (1979) IEEE Trans. Commun. , vol.COM-27 , pp. 899-905
    • Satorius, E.H.1    Alexander, S.T.2


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