메뉴 건너뛰기




Volumn C-22, Issue 5, 1973, Pages 459-463

Some New Results on Average Worst Case Carry

Author keywords

Asynchronism; high speed addition; one's complement; two's complement; worst case carry bound

Indexed keywords

COMPUTER METATHEORY; COMPUTERS - ADDERS;

EID: 0015622069     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1973.223748     Document Type: Article
Times cited : (21)

References (6)
  • 1
    • 0002766589 scopus 로고
    • Preliminary discussion of the logical design of an electronic computing instrument
    • Inst. Advanced Study, Princeton, N. J., June, This report is reproduced and much more readily available in the following two publications
    • A. W. Burks, H. H. Goldstine, and J. von Neumann, “Preliminary discussion of the logical design of an electronic computing instrument,” Inst. Advanced Study, Princeton, N. J., June 1946. This report is reproduced and much more readily available in the following two publications.
    • (1946)
    • Burks, A.W.1    Goldstine, H.H.2    von Neumann, J.3
  • 4
    • 84942212081 scopus 로고
    • New York: Academic
    • F. L. Alt, Ed., Advances in Computers, vol. 6. New York: Academic, 1965, p. 149.
    • (1965) Advances in Computers , vol.6 , pp. 149
    • Alt, F.L.1
  • 6
    • 0008443471 scopus 로고
    • The determination of carry propagation length for binary addition
    • Mar.
    • G. W. Reitwiesner, “The determination of carry propagation length for binary addition,” IRE Trans. Electron. Comput., vol. EC-9, pp. 35–38, Mar. 1960.
    • (1960) IRE Trans. Electron. Comput. , vol.EC-9 , pp. 35-38
    • Reitwiesner, G.W.1


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