메뉴 건너뛰기




Volumn 4, Issue , 1994, Pages IV485-IV488

A new efficient subspace tracking algorithm based on singular value decomposition

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; SIGNAL PROCESSING; SYSTOLIC ARRAYS; TRACKING (POSITION);

EID: 33747823803     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICASSP.1994.389774     Document Type: Conference Paper
Times cited : (10)

References (7)
  • 1
    • 0026824966 scopus 로고
    • Noniterative subspace tracking
    • R. D. DeGroat, "Noniterative subspace tracking", IEEE Trans. Signal Processing, vol. 40, pp. 571-577, 1992.
    • (1992) IEEE Trans. Signal Processing , vol.40 , pp. 571-577
    • DeGroat, R.D.1
  • 2
    • 33747814123 scopus 로고
    • Subspace tracking based on the projection approach and the recursive least squares method
    • Minneapolis, Apr
    • B. Yang, "Subspace tracking based on the projection approach and the recursive least squares method", in Proc. IEEE ICASSP, Minneapolis, Apr. 1993.
    • (1993) Proc. IEEE ICASSP
    • Yang, B.1
  • 5
    • 0026882267 scopus 로고
    • An updating algorithm for subspace tracking
    • G. W. Stewart, "An updating algorithm for subspace tracking", in IEEE Trans. Signal Processing, vol. 40, pp. 1535-1541, 1992.
    • (1992) IEEE Trans. Signal Processing , vol.40 , pp. 1535-1541
    • Stewart, G.W.1
  • 6
    • 33747840933 scopus 로고
    • An adaptive algotithm of linear computational complexity for both rank and sub-space tracking
    • Adelaide, Apr
    • B. Yang and F. Gersemsky "An adaptive algotithm of linear computational complexity for both rank and sub-space tracking", to appear in Proc. IEEE ICASSP, Adelaide, Apr. 1994.
    • (1994) Proc. IEEE ICASSP
    • Yang, B.1    Gersemsky, F.2


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