메뉴 건너뛰기




Volumn 39, Issue 6, 1990, Pages 725-740

Redundant and On-Line CORDIC: Application to Matrix Triangularization and SVD

Author keywords

Angle computations; carry save representation; CORDIC; Givens rotation; matrix triangularization; on line arithmetic; redundant number systems; signed digit representation; singular value decomposition (SVD)

Indexed keywords

MATHEMATICAL TECHNIQUES--MATRIX ALGEBRA;

EID: 0025444846     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.53594     Document Type: Article
Times cited : (121)

References (25)
  • 1
    • 0019928904 scopus 로고
    • Highly concurrent computing structures for matrix arithmetic and signal processing
    • Jan.
    • H. M. Ahmed, J. M. Delosme, and M. Morf, “Highly concurrent computing structures for matrix arithmetic and signal processing,” IEEE Comput. Mag., vol. 15, no. 1, pp. 65–82, Jan. 1982.
    • (1982) IEEE Comput. Mag. , vol.15 , Issue.1 , pp. 65-82
    • Ahmed, H.M.1    Delosme, J.M.2    Morf, M.3
  • 2
    • 0005237607 scopus 로고
    • Signal processing algorithms and architectures
    • Ph.D. dissertation, Dep. Elec. Eng., Stanford Univ.
    • H. M. Ahmed, “Signal processing algorithms and architectures,” Ph.D. dissertation, Dep. Elec. Eng., Stanford Univ., 1982.
    • (1982)
    • Ahmed, H.M.1
  • 3
    • 0002795190 scopus 로고
    • Introduction to the role of redundancy in computer arithmetic
    • June
    • D. E. Atkins, “Introduction to the role of redundancy in computer arithmetic,” IEEE Comput. Mag., pp. 74–75, June 1975.
    • (1975) IEEE Comput. Mag. , pp. 74-75
    • Atkins, D.E.1
  • 4
    • 84937078021 scopus 로고
    • Signed-digit number representations for fast parallel arithmetic
    • Sept.
    • A. Avizienis, “Signed-digit number representations for fast parallel arithmetic,” IEEE Trans. Electron. Comput., vol. EC-10, pp. 389–400, Sept. 1961.
    • (1961) IEEE Trans. Electron. Comput. , vol.EC-10 , pp. 389-400
    • Avizienis, A.1
  • 5
    • 0021822541 scopus 로고
    • Computation of the singular value decomposition using mesh-connected processors
    • R. P. Brent, F. T. Luk, and C. F. Van Loan, “Computation of the singular value decomposition using mesh-connected processors,” J. VLSI Comput. Syst., vol. 1, no. 3, pp. 242–270, 1985.
    • (1985) J. VLSI Comput. Syst. , vol.1 , Issue.3 , pp. 242-270
    • Brent, R.P.1    Luk, F.T.2    Van Loan, C.F.3
  • 6
    • 0002115256 scopus 로고
    • The solution of singular-value and symmetric eigenvalue problems on multiprocessor arrays
    • R. P. Brent and F. T. Luk, “The solution of singular-value and symmetric eigenvalue problems on multiprocessor arrays,” SIAM J. Sci. Statist. Comput., vol. 6, pp. 69–84, 1985.
    • (1985) SIAM J. Sci. Statist. Comput. , vol.6 , pp. 69-84
    • Brent, R.P.1    Luk, F.T.2
  • 8
  • 11
    • 0021643298 scopus 로고
    • On-line arithmetic: An overview
    • Aug.
    • M. D. Ercegovac, “On-line arithmetic: An overview,” in Proc. SPIE Real-Time Signal Processing, 495 (VII), Aug. 1984, pp. 86–93.
    • (1984) Proc. SPIE Real-Time Signal Processing , vol.495 , Issue.VII , pp. 86-93
    • Ercegovac, M.D.1
  • 13
    • 84941492362 scopus 로고
    • On-line schemes for computing rotation factors for SVD
    • Aug.
    • —, “On-line schemes for computing rotation factors for SVD,” Proc. SPIE, 826, Aug. 1987.
    • (1987) Proc. SPIE, 826
  • 14
    • 0023385902 scopus 로고
    • On-the-fly conversion of redundant into conventional representations
    • July
    • —, “On-the-fly conversion of redundant into conventional representations,” IEEE Trans. Comput., vol. C-36, pp. 895–897, July 1987.
    • (1987) IEEE Trans. Comput. , vol.C-36 , pp. 895-897
  • 15
    • 0000847769 scopus 로고
    • Least squares computations by Givens transformations without square roots
    • W. M. Gentleman, “Least squares computations by Givens transformations without square roots,” J. Institute Math. Appl., vol. 2, pp. 329–336, 1973.
    • (1973) J. Institute Math. Appl. , vol.2 , pp. 329-336
    • Gentleman, W.M.1
  • 18
    • 0023330461 scopus 로고
    • Digit-pipelined arithmetic as illustrated by the paste-up system: A tutorial
    • Apr.
    • M. J. Irwin and R. M. Owens, “Digit-pipelined arithmetic as illustrated by the paste-up system: A tutorial,” IEEE Comput. Mag., pp. 61–73, Apr. 1987.
    • (1987) IEEE Comput. Mag. , pp. 61-73
    • Irwin, M.J.1    Owens, R.M.2
  • 19
    • 0023170517 scopus 로고
    • Design of high-speed MOS multiplier and divider using redundant representation
    • S. Kuninobu et al., “Design of high-speed MOS multiplier and divider using redundant representation,” in Proc. 8th Symp. Comput. Arithmetic, 1987, pp. 80–86.
    • (1987) Proc. 8th Symp. Comput. Arithmetic , pp. 80-86
    • Kuninobu, S.1
  • 21
    • 0344433257 scopus 로고
    • Minimal square rooting
    • G. Metze, “Minimal square rooting,” IEEE Trans. Electron. Comput., vol. EC-14, no. 2, pp. 181–185, 1965.
    • (1965) IEEE Trans. Electron. Comput. , vol.EC-14 , Issue.2 , pp. 181-185
    • Metze, G.1
  • 22
    • 0010863630 scopus 로고
    • A new class of digital division methods
    • Sept.
    • J. E. Robertson, “A new class of digital division methods,” IEEE Trans. Electron. Comput., vol. EC-7, pp. 218–222, Sept. 1958.
    • (1958) IEEE Trans. Electron. Comput. , vol.EC-7 , pp. 218-222
    • Robertson, J.E.1
  • 23
    • 84976682491 scopus 로고
    • On stable parallel linear solvers
    • A. Sameh and D. J. Kuck, “On stable parallel linear solvers,” J. ACM, vol. 25, no. 1, pp. 81–91, 1978.
    • (1978) J. ACM , vol.25 , Issue.1 , pp. 81-91
    • Sameh, A.1    Kuck, D.J.2
  • 24
    • 84919346176 scopus 로고
    • The CORDIC trigonometric computing technique
    • Sept.
    • J. Voider, “The CORDIC trigonometric computing technique,” IRE Trans. Electron. Comput., vol. EC-8, no. 3, pp. 330–334, Sept. 1959.
    • (1959) IRE Trans. Electron. Comput. , vol.EC-8 , Issue.3 , pp. 330-334
    • Voider, J.1
  • 25


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