|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ASCII Text | x | ||
| "Speeding Up Processing with Approximation Circuits," Computer, vol. 37, no. 3, pp. 67-73, March, 2004. | |||
| BibTex | x | ||
| @article{ 10.1109/MC.2004.10018, author = {}, title = {Speeding Up Processing with Approximation Circuits}, journal ={Computer}, volume = {37}, number = {3}, issn = {0018-9162}, year = {2004}, pages = {67-73}, doi = {http://doi.ieeecomputersociety.org/10.1109/MC.2004.10018}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - Computer TI - Speeding Up Processing with Approximation Circuits IS - 3 SN - 0018-9162 SP67 EP73 EPD - 67-73 PY - 2004 VL - 37 JA - Computer ER - | |||
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.

