CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
Reseach Article

High Throughput Multipliers Using Delay Equalization

by Alka Raj, N.Kayalvizhi
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 2 - Number 4
Year of Publication: 2010
Authors: Alka Raj, N.Kayalvizhi
10.5120/661-929

Alka Raj, N.Kayalvizhi . High Throughput Multipliers Using Delay Equalization. International Journal of Computer Applications. 2, 4 ( June 2010), 9-13. DOI=10.5120/661-929

@article{ 10.5120/661-929,
author = { Alka Raj, N.Kayalvizhi },
title = { High Throughput Multipliers Using Delay Equalization },
journal = { International Journal of Computer Applications },
issue_date = { June 2010 },
volume = { 2 },
number = { 4 },
month = { June },
year = { 2010 },
issn = { 0975-8887 },
pages = { 9-13 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume2/number4/661-929/ },
doi = { 10.5120/661-929 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:50:01.155452+05:30
%A Alka Raj
%A N.Kayalvizhi
%T High Throughput Multipliers Using Delay Equalization
%J International Journal of Computer Applications
%@ 0975-8887
%V 2
%N 4
%P 9-13
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Pipelining is used for increasing the throughput of the system. Wave pipelining is done by removing the intermediate registers present in the pipelined circuits so that there will be only an input register and an output register. Circuit should be modelled in such a way that all data from one stage should reach the next stage at the same time so that overlapping of data will not occur. In wave pipelined system the clock period should be greater than the difference between maximum delay and minimum delay + clocking overheads such as setup time, hold time, etc. Clock period can be reduced by minimizing the difference between maximum and minimum delay, i.e delay equalization has to be done. Delay equalization can be done by logic restructuring combined with Wong’s algorithm and Klass’s algorithm. Area can be further decreased by using delay element shifting and delay element sharing.

References
Index Terms

Computer Science
Information Sciences

Keywords

Wave pipelining Delay equalization Logic restructuring Delay element sharing and shifting