메뉴 건너뛰기




Volumn 25, Issue 10, 2006, Pages 2012-2021

Optimizing polynomial expressions by algebraic factorization and common subexpression elimination

Author keywords

Circuit complexity; Common subexpression elimination (CSE); High level synthesis; Polynomials

Indexed keywords

ALGEBRAIC FACTORIZATION; CIRCUIT COMPLEXITY; COMMON SUBEXPRESSION ELIMINATION (CSE); HIGH-LEVEL SYNTHESIS;

EID: 33748299422     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2006.875712     Document Type: Article
Times cited : (38)

References (30)
  • 5
    • 0023995653 scopus 로고
    • CATHEDRAL-II - A computer-aided synthesis system for digital signal processing VLSI systems
    • Apr.
    • H. De Man, J. Rabaey, J. Vanhoof, G. Goossens, P. Six, and L. Claesen, "CATHEDRAL-II - A computer-aided synthesis system for digital signal processing VLSI systems," Comput.-Aided Eng. J., vol. 5, no. 2, pp. 55-66, Apr. 1988.
    • (1988) Comput.-aided Eng. J. , vol.5 , Issue.2 , pp. 55-66
    • De Man, H.1    Rabaey, J.2    Vanhoof, J.3    Goossens, G.4    Six, P.5    Claesen, L.6
  • 6
    • 0034854261 scopus 로고    scopus 로고
    • Using symbolic algebra in algorithmic level DSP synthesis
    • A. Peymandoust and D. Micheli, "Using symbolic algebra in algorithmic level DSP synthesis," in Proc. Design Automation Conf., 2001, pp. 277-282.
    • (2001) Proc. Design Automation Conf. , pp. 277-282
    • Peymandoust, A.1    Micheli, D.2
  • 7
    • 0003340059 scopus 로고
    • The art of computer programming
    • Reading, MA: Addison-Wesley
    • D. E. Knuth, 'The art of computer programming," in Seminumerical Algorithms, 2nd ed, vol. 2. Reading, MA: Addison-Wesley, 1981.
    • (1981) Seminumerical Algorithms, 2nd Ed , vol.2
    • Knuth, D.E.1
  • 12
    • 0026187058 scopus 로고
    • Adaptive polynomial filters
    • Jul.
    • V. J. Mathews, "Adaptive polynomial filters," IEEE Signal Process. Mag., vol. 8, no. 3, pp. 10-26, Jul. 1991.
    • (1991) IEEE Signal Process. Mag. , vol.8 , Issue.3 , pp. 10-26
    • Mathews, V.J.1
  • 14
    • 0002846615 scopus 로고
    • The decomposition and factorization of boolean expressions
    • May
    • R. K. Brayton and C. T. McMullen, "The decomposition and factorization of boolean expressions," in Proc. Int. Symp. Circuits Systems, May 1982, pp. 49-54.
    • (1982) Proc. Int. Symp. Circuits Systems , pp. 49-54
    • Brayton, R.K.1    McMullen, C.T.2
  • 16
    • 0026883868 scopus 로고
    • The testability-preserving concurrent decomposition and factorization of boolean expressions
    • Jun.
    • J. Rajski and J. Vasudevamurthy, 'The testability-preserving concurrent decomposition and factorization of boolean expressions," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 11, no. 6, pp. 778-793, Jun. 1992.
    • (1992) IEEE Trans. Comput.-aided Des. Integr. Circuits Syst. , vol.11 , Issue.6 , pp. 778-793
    • Rajski, J.1    Vasudevamurthy, J.2
  • 17
    • 0016973779 scopus 로고
    • Optimal code generation for expression frees
    • Jul.
    • A. V. Aho and S. C. Johnson, "Optimal code generation for expression frees," J. ACM, vol. 23, no. 3, pp. 488-501, Jul. 1976.
    • (1976) J. ACM , vol.23 , Issue.3 , pp. 488-501
    • Aho, A.V.1    Johnson, S.C.2
  • 18
    • 84976692936 scopus 로고
    • Code generation for expressions with common subexpressions
    • Jan.
    • A. V. Aho, S. C. Johnson, and J. D. Ullman, "Code generation for expressions with common subexpressions," ACM, vol. 24, no. 1, pp. 146-160, Jan. 1977.
    • (1977) ACM , vol.24 , Issue.1 , pp. 146-160
    • Aho, A.V.1    Johnson, S.C.2    Ullman, J.D.3
  • 19
    • 0014855855 scopus 로고
    • The generation of optimal code for arithmetic expressions
    • Oct.
    • R. Sethi and J. D. Ullman, "The generation of optimal code for arithmetic expressions," Commun. ACM, vol. 17, no. 4, pp. 715-728, Oct. 1970.
    • (1970) Commun. ACM , vol.17 , Issue.4 , pp. 715-728
    • Sethi, R.1    Ullman, J.D.2
  • 20
    • 16244409454 scopus 로고
    • Generation of optimal code for expressions via factorization
    • Jun.
    • M. A. Breuer, "Generation of optimal code for expressions via factorization," Commun. ACM, vol. 12, no. 6, pp. 333-340, Jun. 1969.
    • (1969) Commun. ACM , vol.12 , Issue.6 , pp. 333-340
    • Breuer, M.A.1
  • 21
    • 33748304045 scopus 로고    scopus 로고
    • [Online]
    • GNU C Library, [Online]. Available: http://www.gnu.org/software/libc
    • GNU C Library
  • 23
    • 0031342514 scopus 로고    scopus 로고
    • Energy minimization using multiple supply voltages
    • Dec.
    • J.-M. Chang and M. Pedram, "Energy minimization using multiple supply voltages," IEEE Trans. Very Large Scale Integr. Syst., vol. 5, no. 4, pp. 436-443, Dec. 1997.
    • (1997) IEEE Trans. Very Large Scale Integr. Syst. , vol.5 , Issue.4 , pp. 436-443
    • Chang, J.-M.1    Pedram, M.2
  • 26
    • 0032295394 scopus 로고    scopus 로고
    • High-level address optimization and synthesis techniques for data-transferintensive applications
    • Dec.
    • M. A. Miranda, F. V. M. Catthoor, M. Janssen, and H. J. De Man, "High-level address optimization and synthesis techniques for data-transferintensive applications," IEEE Trans. Very Large Scale Integr. Syst., vol. 6, no. 4, pp. 677-686, Dec. 1998.
    • (1998) IEEE Trans. Very Large Scale Integr. Syst. , vol.6 , Issue.4 , pp. 677-686
    • Miranda, M.A.1    Catthoor, F.V.M.2    Janssen, M.3    De Man, H.J.4
  • 27
    • 16244375083 scopus 로고    scopus 로고
    • [Online]
    • ARM7TDMI Tech Reference Manual. (2003). [Online]. Available: http://www.arm.com/documentation/ARMProcessor_Cores/index.html
    • (2003) ARM7TDMI Tech Reference Manual
  • 30
    • 0034841273 scopus 로고    scopus 로고
    • Jouletrack-a Web based tool for software energy profiling
    • A. Sinha and A. P. Chandrakasan, "Jouletrack-A web based tool for software energy profiling," in Proc. Design Automation Conf., 2001, pp. 220-225.
    • (2001) Proc. Design Automation Conf. , pp. 220-225
    • Sinha, A.1    Chandrakasan, A.P.2


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