메뉴 건너뛰기




Volumn 17, Issue 5, 1998, Pages 377-385

Address Generation for Memories Containing Multiple Arrays

Author keywords

Arrays, compilers (silicon); Digital arithmetic; High level synthesis; Memory management; Number theoretic transforms

Indexed keywords

APPLICATION SPECIFIC INTEGRATED CIRCUITS; ARRAYS; DIGITAL ARITHMETIC; ELECTRIC NETWORK SYNTHESIS; MATHEMATICAL TRANSFORMATIONS; STORAGE ALLOCATION (COMPUTER);

EID: 0032068881     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.703919     Document Type: Article
Times cited : (13)

References (15)
  • 1
    • 33747493446 scopus 로고    scopus 로고
    • Altéra Corp., San Jose, CA
    • Altéra Flex Logic Handbook, Altéra Corp., San Jose, CA, 1996.
    • (1996) Altéra Flex Logic Handbook
  • 4
    • 0027091637 scopus 로고
    • Address generation for array access base on modulus m counters
    • Amsterdam, The Netherlands
    • D. Grant and P. B. Denyer, "Address generation for array access base on modulus m counters," in Proc. Eur. Design Test Conf. (EDAC) Amsterdam, The Netherlands, 1991, pp. 118-122.
    • (1991) Proc. Eur. Design Test Conf. (EDAC) , pp. 118-122
    • Grant, D.1    Denyer, P.B.2
  • 5
    • 0024888769 scopus 로고
    • Synthesis of address generators
    • San Jose, CA, Nov.
    • D. Grant, P. B. Denyer, and I. Finlay, "Synthesis of address generators, in Proc. ICCAD, San Jose, CA, Nov. 1989, pp. 116-119.
    • (1989) Proc. ICCAD , pp. 116-119
    • Grant, D.1    Denyer, P.B.2    Finlay, I.3
  • 7
    • 33747492020 scopus 로고
    • Definition and solution of the memor packing problem
    • San Jose, CA, Nov.
    • D. Karchmer and J. Rose, "Definition and solution of the memor packing problem," in Proc. ICCAD, San Jose, CA, Nov. 1994, pp 53-58.
    • (1994) Proc. ICCAD , pp. 53-58
    • Karchmer, D.1    Rose, J.2
  • 8
    • 26444479778 scopus 로고
    • Optimization b simulated annealing
    • S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, "Optimization b simulated annealing," Science, vol. 220, pp. 671-680, 1983.
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt Jr., C.D.2    Vecchi, M.P.3
  • 9
    • 0026907993 scopus 로고
    • A spanning tree carry lookahea adder
    • Aug.
    • T. Lynch and E. E. Swartzlander Jr., "A spanning tree carry lookahea adder," IEEE Trans. Comput., vol. 41, pp. 931-939, Aug. 1992.
    • (1992) IEEE Trans. Comput. , vol.41 , pp. 931-939
    • Lynch, T.1    Swartzlander Jr., E.E.2
  • 11
    • 0031099182 scopus 로고    scopus 로고
    • Synthesis of applications-specific memory designs
    • Mar
    • H. Schmit and D. E. Thomas, "Synthesis of applications-specific memory designs," IEEE Trans. VLSI Syst., vol. 5, no. 1, pp. 101-111, Mar 1997.
    • (1997) IEEE Trans. VLSI Syst. , vol.5 , Issue.1 , pp. 101-111
    • Schmit, H.1    Thomas, D.E.2
  • 13
    • 18444414531 scopus 로고
    • An evaluation of several two-summand binary adders
    • June
    • J. Sklansky, "An evaluation of several two-summand binary adders, IRE Trans. Electron. Comput., vol. EC-9, no. 2, pp. 213-226, June 1960.
    • (1960) IRE Trans. Electron. Comput. , vol.EC-9 , Issue.2 , pp. 213-226
    • Sklansky, J.1
  • 14
    • 21544432908 scopus 로고
    • On the time required for binary addition
    • S. Winograd, "On the time required for binary addition," J. Assoc Comput. Mach., vol. 12, pp. 277-285, 1965.
    • (1965) J. Assoc Comput. Mach. , vol.12 , pp. 277-285
    • Winograd, S.1
  • 15
    • 85040657895 scopus 로고
    • A new algorithm for floorplan design
    • Las Vegas, NV
    • D. F. Wong and C. L. Liu, "A new algorithm for floorplan design," i Proc. DAC, Las Vegas, NV, 1986, pp. 101-106.
    • (1986) Proc. DAC , pp. 101-106
    • Wong, D.F.1    Liu, C.L.2


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