Proceedings of the 2016 International Conference on Communications, Information Management and Network Security

Implementation of a Parallel Prefix Adder Based on Kogge-Stone Tree

Authors
Yancang Chen, Minlei Zhang, Pei Wei, Sai Sui, Yaxin Zhao, Lunguo Xie
Corresponding Author
Yancang Chen
Available Online September 2016.
DOI
10.2991/cimns-16.2016.58How to use a DOI?
Keywords
parallel prefix adder; CMOS process; maximal delay; average power; kogge-stone tree
Abstract

Binary adder is an important module for microprocessors. We present a novel structure of binary adder, named Hyper-Parallel Prefix Adder (HPPA) in this paper. The basic idea of HPPA is to divide the addition into two levels, both of which are parallel prefix adder architecture. It can perfectly reduce the delay of wire loads by reducing the wire length in the critical paths; hence the performance of the adder can be significantly improved. Moreover, we present an optimized carry tree structure which is based on Kogge-stone tree named Grouped-Kogge-Stone tree (GKS tree), which has small nodes especially in the top level. Combining HPPA with GKS tree, we designed and implemented a 64-bit full adder. At the top level, we divide the two 64-bit addition operands into 8 groups, each of which is 8-bit. At the bottom level, we divide each 8-bit group into 4 equal sub-groups. Both of the two levels are composed of parallel prefix adders based on Grouped-Kogge-Stone tree. We design the adder using Verilog HDL to verify the performance. We have implemented the adder under 0.13um CMOS process. Simulation results show that the maximal delay of the proposed adder layout is 578ps with the average power of 18.3mW.

Copyright
© 2016, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

Volume Title
Proceedings of the 2016 International Conference on Communications, Information Management and Network Security
Series
Advances in Computer Science Research
Publication Date
September 2016
ISBN
978-94-6252-247-3
ISSN
2352-538X
DOI
10.2991/cimns-16.2016.58How to use a DOI?
Copyright
© 2016, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - CONF
AU  - Yancang Chen
AU  - Minlei Zhang
AU  - Pei Wei
AU  - Sai Sui
AU  - Yaxin Zhao
AU  - Lunguo Xie
PY  - 2016/09
DA  - 2016/09
TI  - Implementation of a Parallel Prefix Adder Based on Kogge-Stone Tree
BT  - Proceedings of the 2016 International Conference on Communications, Information Management and Network Security
PB  - Atlantis Press
SP  - 234
EP  - 237
SN  - 2352-538X
UR  - https://doi.org/10.2991/cimns-16.2016.58
DO  - 10.2991/cimns-16.2016.58
ID  - Chen2016/09
ER  -