메뉴 건너뛰기




Volumn , Issue , 2009, Pages 931-936

Polynomial datapath optimization using partitioning and compensation heuristics

Author keywords

High level synthesis; Modular HED; Polynomial datapath

Indexed keywords

COMPUTER GRAPHICS; DIGITAL SIGNAL PROCESSING; HEURISTIC METHODS; HIGH LEVEL SYNTHESIS; LOGIC SYNTHESIS; MULTIVARIABLE SYSTEMS; OPTIMIZATION;

EID: 70350716603     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1629911.1630151     Document Type: Conference Paper
Times cited : (18)

References (11)
  • 1
    • 70350720066 scopus 로고    scopus 로고
    • Modular-HED: A Canonical Decision Diagram for Modular Equivalence Verification of Polynomial Functions
    • B. Alizadeh and M. Fujita, "Modular-HED: A Canonical Decision Diagram for Modular Equivalence Verification of Polynomial Functions", in the fifth Workshop on Constraints in Formal Verification (CFV), pp. 22-40, 2008.
    • (2008) fifth Workshop on Constraints in Formal Verification (CFV) , pp. 22-40
    • Alizadeh, B.1    Fujita, M.2
  • 2
    • 0041392188 scopus 로고    scopus 로고
    • Application of Symbolic Computer Algebra in High-Level Data-Flow Synthesis
    • A. Peymandoust and G. DeMicheli, "Application of Symbolic Computer Algebra in High-Level Data-Flow Synthesis", IEEE Trans. CAD, vol. 22, pp. 1154-11656, 2003.
    • (2003) IEEE Trans. CAD , vol.22 , pp. 1154-11656
    • Peymandoust, A.1    DeMicheli, G.2
  • 4
    • 50249167819 scopus 로고    scopus 로고
    • Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors, in
    • S. Gopalakrishnan, P. Kalla, Brandon Meredith, and F. Enescu, "Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors", in ICCAD, pp. 143-148, 2007.
    • (2007) ICCAD , pp. 143-148
    • Gopalakrishnan, S.1    Kalla, P.2    Meredith, B.3    Enescu, F.4
  • 5
    • 16244395161 scopus 로고    scopus 로고
    • Factoring and Eliminating Common Subexpressions in Polynomial Expressions
    • A. Hosangadi, F. Fallah, R. Kastner, "Factoring and Eliminating Common Subexpressions in Polynomial Expressions", in ICCAD, pp. 169-174, 2004.
    • (2004) ICCAD , pp. 169-174
    • Hosangadi, A.1    Fallah, F.2    Kastner, R.3
  • 7
    • 40849130160 scopus 로고    scopus 로고
    • Approximate Factorization of Multivariate Polynomials Using Singular Value Decomposition
    • E. Kaltofen, J. P. May, Z. Yang, L. Zhi, "Approximate Factorization of Multivariate Polynomials Using Singular Value Decomposition", Journal of Symbolic Computation, pp. 359-376, 2008.
    • (2008) Journal of Symbolic Computation , pp. 359-376
    • Kaltofen, E.1    May, J.P.2    Yang, Z.3    Zhi, L.4
  • 11
    • 33748299422 scopus 로고    scopus 로고
    • Optimizing polynomial expressions by algebraic factorization and common subexpression elimination
    • Oct
    • A. Hosangadi, F. Fallah, and R. Kastner, "Optimizing polynomial expressions by algebraic factorization and common subexpression elimination", IEEE Trans. CAD, vol. 25, pp. 2012-2022, Oct 2006.
    • (2006) IEEE Trans. CAD , vol.25 , pp. 2012-2022
    • Hosangadi, A.1    Fallah, F.2    Kastner, R.3


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