Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Videos
Videos
Thesis submission
Thesis submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Contact us
Contact us
Verification of delay insensitivity in bit-level pipelined dual-rail threshold logic adders
Date
2008-02-22
Author
Ismailoglu, A. Neslin
Askar, Murat
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
2
views
0
downloads
Cite This
A delay-insensitivity verification method is proposed for bit-level pipelined systolic dual-rail threshold logic adders, which achieve speed-up through early and input-incomplete carry output generation and which employ bit-wise completion at pipeline registers. The proposed method simplifies the verification task significantly, regardless of the operand length of the adder, such that analysis of three adjacent systoles for the eight possible early/late carry output generation scenarios is sufficient for detecting the input combinations which violate delay insensitivity. Using this method, structural modifications for re-establishing delay-insensitivity could be devised without sacrificing the speed-up advantages due to early carry generation. The method could also be applied to other pipelined data processing applications in dual-rail threshold logic.
Subject Keywords
Asynchronous logic circuits
,
Systolic arrays
,
Pipeline processing
,
Pipeline arithmetic
URI
https://hdl.handle.net/11511/64479
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. N. Ismailoglu and M. Askar, “Verification of delay insensitivity in bit-level pipelined dual-rail threshold logic adders,” Univ Cambridge, Cambridge, ENGLAND, 2008, p. 23, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64479.