Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Speeding Up Processing with Approximation Circuits

Published: 01 March 2004 Publication History
  • Get Citation Alerts
  • Abstract

    Current microprocessors employ a global timing reference to synchronize data transfer. A synchronous system must know the maximum time needed to compute a function, but a circuit usually finishes computation earlier than the worst-case delay. The system nevertheless waits for the maximum time bound to guarantee a correct result.As a first step in achieving variable pipeline delays based on data values, approximation circuits can increase clock frequency by reducing the number of cycles a function requires. Instead of implementing the complete logic function, a simplified circuit mimics it using rough calculations to predict results. The results are correct most of the time, and simulations show improvements in overall performance in spite of the overhead needed to recover from mistakes.

    References

    [1]
    J.E. Smith and G.S. Sohi, "The Microarchitecture of Superscalar Processors," Proc. IEEE, vol. 83, no. 12, 1995, pp. 1609-1624.
    [2]
    S. Palacharla, et al., "Complexity-Effective Superscalar Processors," Proc. 24th ACM/IEEE Int'l Symp. Computer Architecture, IEEE Press, 1997, pp. 206-218.
    [3]
    P.G. Emma and E.S. Davidson, "Characterization of Branch and Data Dependencies in Programs for Evaluating Pipeline Performance," IEEE Trans. Computers, vol. 36, no. 7, 1987, pp. 859-876.
    [4]
    M.H. Lipasti and J.P. Shen, "Exceeding the Dataflow Limit via Value Prediction," Proc. 29th IEEE/ACM Int'l Symp. Microarchitecture, IEEE Press, 1996, pp. 226 -237.
    [5]
    D.C. Burger and T.M. Austin, "The SimpleScalar Tool Set, v. 2.0," tech. report 1342, Computer Science Dept., Univ. of Wisconsin, Madison, 1997.
    [6]
    T. Liu and S-L. Lu, "Performance Improvement with Circuit-Level Speculation," Proc. 33rd ACM/IEEE Int'l Symp. Microarchitecture, IEEE Press, 2000, pp. 348-355.
    [7]
    S. Komori, et al., "An Elastic Pipeline Mechanism by Self-Timed Circuits," IEEE J. Solid-State Circuits, vol. 23, no. 1, 1988, pp. 111-117.
    [8]
    I.E. Sutherland, "Micropipelines," Comm. ACM, vol. 32, no. 6, 1989, pp. 720-738.

    Cited By

    View all
    • (2023)Synthesis of Approximate Parallel-Prefix AddersIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2023.328763131:11(1686-1699)Online publication date: 1-Nov-2023
    • (2021)Approximate adder with output correction for error tolerant applications and Gaussian distributed inputs2016 IEEE International Symposium on Circuits and Systems (ISCAS)10.1109/ISCAS.2016.7538961(1970-1973)Online publication date: 11-Mar-2021
    • (2021)Reconfigurable Carry Look-Ahead Adder Trading Accuracy for Energy EfficiencyJournal of Signal Processing Systems10.1007/s11265-020-01542-193:1(99-111)Online publication date: 1-Jan-2021
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Computer
    Computer  Volume 37, Issue 3
    March 2004
    94 pages

    Publisher

    IEEE Computer Society Press

    Washington, DC, United States

    Publication History

    Published: 01 March 2004

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 27 Jul 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Synthesis of Approximate Parallel-Prefix AddersIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2023.328763131:11(1686-1699)Online publication date: 1-Nov-2023
    • (2021)Approximate adder with output correction for error tolerant applications and Gaussian distributed inputs2016 IEEE International Symposium on Circuits and Systems (ISCAS)10.1109/ISCAS.2016.7538961(1970-1973)Online publication date: 11-Mar-2021
    • (2021)Reconfigurable Carry Look-Ahead Adder Trading Accuracy for Energy EfficiencyJournal of Signal Processing Systems10.1007/s11265-020-01542-193:1(99-111)Online publication date: 1-Jan-2021
    • (2021)A Novel ASIC-Based Variable Latency Speculative Parallel Prefix Adder for Image Processing ApplicationCircuits, Systems, and Signal Processing10.1007/s00034-021-01741-640:11(5682-5704)Online publication date: 1-Nov-2021
    • (2019)Evaluation of variable bit-width units in a RISC-V processor for approximate computingProceedings of the 16th ACM International Conference on Computing Frontiers10.1145/3310273.3323159(344-349)Online publication date: 30-Apr-2019
    • (2019)Characterizing Approximate Adders and Multipliers Optimized under Different Design ConstraintsProceedings of the 2019 Great Lakes Symposium on VLSI10.1145/3299874.3319454(393-398)Online publication date: 13-May-2019
    • (2019)Design and Analysis of Approximate Redundant Binary MultipliersIEEE Transactions on Computers10.1109/TC.2018.289022268:6(804-819)Online publication date: 1-Jun-2019
    • (2019)Analysis, Modeling and Optimization of Equal Segment Based Approximate AddersIEEE Transactions on Computers10.1109/TC.2018.287109668:3(314-330)Online publication date: 1-Mar-2019
    • (2018)A Probabilistic Error Model and Framework for Approximate Booth MultipliersProceedings of the 14th IEEE/ACM International Symposium on Nanoscale Architectures10.1145/3232195.3232200(7-12)Online publication date: 17-Jul-2018
    • (2018)An Energy-Efficient Architecture for Binary Weight Convolutional Neural NetworksIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2017.276762426:2(280-293)Online publication date: 1-Feb-2018
    • Show More Cited By

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media