Area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders
This article presents two area/latency optimized gate level asynchronous full adder designs which correspond to early output logic. The proposed full adders are constructed using the delay-insensitive dual-rail code and adhere to the four-phase return-to-zero handshaking. For an asynchronous ripple...
Saved in:
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/88586 http://hdl.handle.net/10220/46942 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-88586 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-885862022-02-16T16:26:42Z Area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders Balasubramanian, Parvathavarthini Yamashita, Shigeru School of Computer Science and Engineering DRNTU::Engineering::Computer science and engineering Asynchronous Design Full Adder This article presents two area/latency optimized gate level asynchronous full adder designs which correspond to early output logic. The proposed full adders are constructed using the delay-insensitive dual-rail code and adhere to the four-phase return-to-zero handshaking. For an asynchronous ripple carry adder (RCA) constructed using the proposed early output full adders, the relative-timing assumption becomes necessary and the inherent advantages of the relative-timed RCA are: (1) computation with valid inputs, i.e., forward latency is data-dependent, and (2) computation with spacer inputs involves a bare minimum constant reverse latency of just one full adder delay, thus resulting in the optimal cycle time. With respect to different 32-bit RCA implementations, and in comparison with the optimized strong-indication, weak-indication, and early output full adder designs, one of the proposed early output full adders achieves respective reductions in latency by 67.8, 12.3 and 6.1 %, while the other proposed early output full adder achieves corresponding reductions in area by 32.6, 24.6 and 6.9 %, with practically no power penalty. Further, the proposed early output full adders based asynchronous RCAs enable minimum reductions in cycle time by 83.4, 15, and 8.8 % when considering carry-propagation over the entire RCA width of 32-bits, and maximum reductions in cycle time by 97.5, 27.4, and 22.4 % for the consideration of a typical carry chain length of 4 full adder stages, when compared to the least of the cycle time estimates of various strong-indication, weak-indication, and early output asynchronous RCAs of similar size. All the asynchronous full adders and RCAs were realized using standard cells in a semi-custom design fashion based on a 32/28 nm CMOS process technology. Published version 2018-12-13T02:41:18Z 2019-12-06T17:06:40Z 2018-12-13T02:41:18Z 2019-12-06T17:06:40Z 2016 Journal Article Balasubramanian, P., & Yamashita, S. (2016). Area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders. SpringerPlus, 5, 440-. doi:10.1186/s40064-016-2074-z 2193-1801 https://hdl.handle.net/10356/88586 http://hdl.handle.net/10220/46942 10.1186/s40064-016-2074-z 27104128 en SpringerPlus © 2016 Balasubramanian and Yamashita. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. 26 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Computer science and engineering Asynchronous Design Full Adder |
spellingShingle |
DRNTU::Engineering::Computer science and engineering Asynchronous Design Full Adder Balasubramanian, Parvathavarthini Yamashita, Shigeru Area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders |
description |
This article presents two area/latency optimized gate level asynchronous full adder designs which correspond to early output logic. The proposed full adders are constructed using the delay-insensitive dual-rail code and adhere to the four-phase return-to-zero handshaking. For an asynchronous ripple carry adder (RCA) constructed using the proposed early output full adders, the relative-timing assumption becomes necessary and the inherent advantages of the relative-timed RCA are: (1) computation with valid inputs, i.e., forward latency is data-dependent, and (2) computation with spacer inputs involves a bare minimum constant reverse latency of just one full adder delay, thus resulting in the optimal cycle time. With respect to different 32-bit RCA implementations, and in comparison with the optimized strong-indication, weak-indication, and early output full adder designs, one of the proposed early output full adders achieves respective reductions in latency by 67.8, 12.3 and 6.1 %, while the other proposed early output full adder achieves corresponding reductions in area by 32.6, 24.6 and 6.9 %, with practically no power penalty. Further, the proposed early output full adders based asynchronous RCAs enable minimum reductions in cycle time by 83.4, 15, and 8.8 % when considering carry-propagation over the entire RCA width of 32-bits, and maximum reductions in cycle time by 97.5, 27.4, and 22.4 % for the consideration of a typical carry chain length of 4 full adder stages, when compared to the least of the cycle time estimates of various strong-indication, weak-indication, and early output asynchronous RCAs of similar size. All the asynchronous full adders and RCAs were realized using standard cells in a semi-custom design fashion based on a 32/28 nm CMOS process technology. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Balasubramanian, Parvathavarthini Yamashita, Shigeru |
format |
Article |
author |
Balasubramanian, Parvathavarthini Yamashita, Shigeru |
author_sort |
Balasubramanian, Parvathavarthini |
title |
Area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders |
title_short |
Area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders |
title_full |
Area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders |
title_fullStr |
Area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders |
title_full_unstemmed |
Area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders |
title_sort |
area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders |
publishDate |
2018 |
url |
https://hdl.handle.net/10356/88586 http://hdl.handle.net/10220/46942 |
_version_ |
1725985613647183872 |