ACM Home Page
Please provide us with feedback. Feedback
Xquasher: a tool for efficient computation of multiple linear expressions
Full text PdfPdf (194 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 46th Annual Design Automation Conference table of contents
San Francisco, California
SESSION: Advances in embedded system modeling and optimization table of contents
Pages 254-257  
Year of Publication: 2009
ISBN:978-1-60558-497-3
Authors
Arash Arfaee  University of California, San Diego
Ali Irturk  University of California, San Diego
Nikolay Laptev  University California, Los Angeles
Farzan Fallah  Envis Corporation, CA
Ryan Kastner  University of California, San Diego
Sponsors
EDAC : Electronic Design Automation Consortium
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CAS : Circuits & Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 6,   Citation Count: 0
Additional Information:

abstract   references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1629911.1629980
What is a DOI?

ABSTRACT

Digital signal processing applications often require the computation of linear systems. These computations can be considerably expensive and require optimizations for lower power consumption, higher throughput, and faster response time. Unfortunately, system designers do not have the necessary tools to take advantage of the wide flexibility in ways to evaluate these expressions. Therefore, we address the problem of efficiently computing a set of linear systems through a tool, Xquasher, that is developed by us to enable elimination of large common subexpression from expressions with an arbitrary number of terms. Xquasher provides a methodology for efficient computation of both single and multiple linear expressions. We also introduce the concept of power set encoding which helps us to provide an effective optimization method and achieves significant improvement over previously published work. Our tool provides optimized designs with 15% less area with the cost of 3% increase in delay by reducing number of additions on average by 45%.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Potkonjak, M. B. Srivastava, and A. P. Chandrakasan, "Multiple Constant Multiplications: Efficient and Versatile Framework and Algorithms for Exploring Common Subexpression Elimination," IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, 1996.
 
2
H. T. Nguyen and A. Chattejee, "Number-splitting with shift-and-add decomposition for power and hardware optimization in linear DSP synthesis," IEEE Transactions on Very Large Scale Integration (Vlsi) Systems, vol. 8, pp. 419--24, 2000.
 
3
H. Safiri, M. Ahmadi, G. A. Jullien, and W. C. Miller, "A New Algorithm for the Elimination of Common Subexpressions in Hardware Implementation of Digital Filters by Using Genetic Programming," IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP), 2000.
 
4
A. Hosangadi, F. Fallah, and R. Kastner, "Common subexpression elimination involving multiple variables linear DSP synthesis," IEEE International Conference on Application-Specific Systems, Architectures and Processors, pp. 202--12, 2004.
 
5
A. Hosangadi, F. Farzan, and R. Kastner, "Optimizing high speed arithmetic circuits using three-term extraction," Design, Automation and Test in Europe, pp. 6, 2006.
 
6
R. Zimmermann, D. Q. Tran, "Optimized Synthesis of Sum-of-Products," Proceedings 37th Asilomar Conference on Signals, Systems, and Computers, November 2003
 
7
Peter Tummeltshammer, James C. Hoe and Markus Püschel, "Time-Multiplexed Multiple Constant Multiplication", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 26, No. 9, pp. 1551--1563, 2007.