메뉴 건너뛰기




Volumn , Issue , 2013, Pages 779-786

Approximate logic synthesis under general error magnitude and frequency constraints

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE LOGIC; BOOLEAN RELATIONS; DEVIATION MEASURES; FREQUENCY CONSTRAINT; FREQUENCY OF ERROR; MINIMIZATION PROBLEMS; MULTIPLIER BLOCKS; SYNTHESIS PROBLEMS;

EID: 84893368533     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2013.6691202     Document Type: Conference Paper
Times cited : (74)

References (23)
  • 2
    • 4444283876 scopus 로고    scopus 로고
    • A recursive paradigm to solve boolean relations
    • D. Baneres, J. Cortadella, and M. Kishinevsky. A recursive paradigm to solve boolean relations. In DAC, 2004.
    • (2004) DAC
    • Baneres, D.1    Cortadella, J.2    Kishinevsky, M.3
  • 3
    • 84893393446 scopus 로고
    • An exact minimizer for boolean relations
    • R. Brayton and F. Somenzi. An exact minimizer for boolean relations. In ICCAD, 1989.
    • (1989) ICCAD
    • Brayton, R.1    Somenzi, F.2
  • 4
    • 77951217013 scopus 로고    scopus 로고
    • A probabilistic boolean logic for energy efficient circuit and system design
    • L. Chakrapani and K. Palem. A probabilistic boolean logic for energy efficient circuit and system design. In ASP-DAC, 2010.
    • (2010) ASP-DAC
    • Chakrapani, L.1    Palem, K.2
  • 5
    • 80052659613 scopus 로고    scopus 로고
    • Dynamic effort scaling: Managing the quality-efficiency tradeoff
    • V. Chippa, A. Raghunathan, K. Roy, and S. Chakradhar. Dynamic effort scaling: Managing the quality-efficiency tradeoff. DAC, 2011.
    • (2011) DAC
    • Chippa, V.1    Raghunathan, A.2    Roy, K.3    Chakradhar, S.4
  • 6
    • 0025487044 scopus 로고
    • Heuristic minimization of boolean relations using testing techniques
    • A. Ghosh, S. Devadas, and A. Newton. Heuristic minimization of boolean relations using testing techniques. In ICCD, 1990.
    • (1990) ICCD
    • Ghosh, A.1    Devadas, S.2    Newton, A.3
  • 8
    • 79957542209 scopus 로고    scopus 로고
    • Controlled timing-error acceptance for low energy idct design
    • K. He, A. Gerstlauer, and M. Orshansky. Controlled timing-error acceptance for low energy idct design. In DATE, 2011.
    • (2011) DATE
    • He, K.1    Gerstlauer, A.2    Orshansky, M.3
  • 10
    • 0026981218 scopus 로고
    • A new algorithm for the binate covering problem and its application to the minimization of boolean relations
    • S.-W. Jeong and F. Somenzi. A new algorithm for the binate covering problem and its application to the minimization of boolean relations. In ICCAD, 1992.
    • (1992) ICCAD
    • Jeong, S.-W.1    Somenzi, F.2
  • 12
    • 0025546496 scopus 로고    scopus 로고
    • Minimization of symbolic relations
    • B. Lin and F. Somenzi. Minimization of symbolic relations. In ICCAD90.
    • ICCAD90
    • Lin, B.1    Somenzi, F.2
  • 14
    • 1842425446 scopus 로고    scopus 로고
    • Speeding up processing with approximation circuits
    • S.-L. Lu. Speeding up processing with approximation circuits. Computer, 2004.
    • (2004) Computer
    • Lu, S.-L.1
  • 15
    • 0027277648 scopus 로고
    • Espressosignature: A new exact minimizer for logic functions
    • P. McGeer, J. Sanghavi, R. Brayton, and A. Vincentelli. Espressosignature: A new exact minimizer for logic functions. In DAC, 1993.
    • (1993) DAC
    • McGeer, P.1    Sanghavi, J.2    Brayton, R.3    Vincentelli, A.4
  • 16
    • 85087998585 scopus 로고    scopus 로고
    • Modeling and synthesis of quality-energy optimal approximate adders
    • J. Miao, K. He, A. Gerstlauer, and M. Orshansky. Modeling and synthesis of quality-energy optimal approximate adders. In ICCAD12.
    • ICCAD12
    • Miao, J.1    He, K.2    Gerstlauer, A.3    Orshansky, M.4
  • 19
    • 77953116665 scopus 로고    scopus 로고
    • Approximate logic synthesis for error tolerant applications
    • D. Shin and S. K. Gupta. Approximate logic synthesis for error tolerant applications. In DATE, 2010.
    • (2010) DATE
    • Shin, D.1    Gupta, S.K.2
  • 21
    • 0027678251 scopus 로고
    • Heuristic minimization of multiplevalued relations
    • Y. Watanabe and R. Brayton. Heuristic minimization of multiplevalued relations. TCAD, 1993.
    • (1993) TCAD
    • Watanabe, Y.1    Brayton, R.2
  • 22
    • 0000194406 scopus 로고    scopus 로고
    • A low-power dct core using adaptive bitwidth and arithmetic activity exploiting signal correlations and quantization
    • T. Xanthopoulos and A. Chandrakasan. A low-power dct core using adaptive bitwidth and arithmetic activity exploiting signal correlations and quantization. J. Solid-State Circuits, 2000.
    • (2000) J. Solid-state Circuits
    • Xanthopoulos, T.1    Chandrakasan, A.2
  • 23
    • 77955174229 scopus 로고    scopus 로고
    • Design of low-power high-speed truncation-error-tolerant adder and its application in digital signal processing
    • N. Zhu, W. L. Goh, W. Zhang, K. S. Yeo, and Z. H. Kong. Design of low-power high-speed truncation-error-tolerant adder and its application in digital signal processing. TVLSI, 2010.
    • (2010) TVLSI
    • Zhu, N.1    Goh, W.L.2    Zhang, W.3    Yeo, K.S.4    Kong, Z.H.5


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