Premium
Design of high‐speed low‐power parallel‐prefix adder trees in nanometer technologies
Author(s) -
Perri Stefania,
Lanuzza Marco,
Corsonello Pasquale
Publication year - 2014
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.1886
Subject(s) - adder , prefix , computer science , cmos , parallel computing , speedup , nanometre , tree (set theory) , energy consumption , energy (signal processing) , arithmetic , algorithm , mathematics , electronic engineering , electrical engineering , engineering , statistics , combinatorics , philosophy , linguistics , chemical engineering
This paper presents a novel approach to design high‐speed low‐power parallel‐prefix adder trees. Sub‐circuits typically used in the design of parallel‐prefix trees are deeply analyzed and separately optimized. The modules used for computing the group propagate and generate signals have been designed to improve their energy‐delay behavior in an original way. When the ST 45 nm 1 V CMOS technology is used, in comparison with conventional implementations, the proposed approach exhibits computational delay with mean value and standard deviation up to 40% and 48% lower and achieves energy consumption with mean value and standard deviation up to 57% and 40% lower. A 32‐bit Brent‐Kung tree made as proposed here reaches a computational delay lower than 165 ps and dissipates 147.4fJ on average. Copyright © 2013 John Wiley & Sons, Ltd.