DocumentCode :
3082887
Title :
Optimisation of mutually exclusive arithmetic sum-of-products
Author :
Drane, T. ; Constantinides, G.
Author_Institution :
Imagination Technol. Ltd., Kings Langley, UK
fYear :
2011
fDate :
14-18 March 2011
Firstpage :
1
Lastpage :
6
Abstract :
Arithmetic blocks consume a major portion of chip area, delay and power. The arithmetic sum-of-product (SOP) is a widely used block. We introduce a novel binary integer linear program (BLP) based algorithm for optimising a general class of mutually exclusive SOPs. Benchmarks drawn from existing literature, standard APIs and constructed for demonstration purposes, exhibit speed improvements of up to 16% and area reduction of up to 57% in a 65nm TSMC process.
Keywords :
Boolean algebra; digital arithmetic; linear programming; TSMC process; arithmetic block; arithmetic sum of products; binary integer linear program based algorithm; Arrays; Benchmark testing; Delay; Equations; Matrix decomposition; Merging; Optimization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design, Automation & Test in Europe Conference & Exhibition (DATE), 2011
Conference_Location :
Grenoble
ISSN :
1530-1591
Print_ISBN :
978-1-61284-208-0
Type :
conf
DOI :
10.1109/DATE.2011.5763224
Filename :
5763224
Link To Document :
بازگشت