Novel Designs of Fast Parity-Preserving Reversible Vedic Multiplier

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

PourAliAkbar Ehsan; NAVI KEIVAN; Haghparast Majid; RESHADI MIDIA

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: The CSI Journal on Computer Science and Engineering Year:2019 | Volume:17 | Issue:1 Page(s): 9-20

Download Full-Text

View:

181

Download:

177

Cites:

Information Journal Paper

Title

Novel Designs of Fast Parity-Preserving Reversible Vedic Multiplier

Author(s)

PourAliAkbar Ehsan | NAVI KEIVAN | Haghparast Majid | RESHADI MIDIA | Issue Writer Certificate

Keywords

Reversible logic

Reversible array multiplier

Vedic multiplier

parity-preserving

quantum computing

Abstract

Reversible logic is a new technology that is considered as an essential requirement for the design of quantum computers. In the calculation unit of computers, multiplication is one of the most frequently used operations. In this paper, we propose new optimized algorithms to design a parity-preserving reversible Vedic multiplier. Three approaches for designing optimized reversible Vedic multiplier circuits are proposed which are better than the existing circuits in terms of quantum cost, number of garbage outputs, number of constant inputs, and other criteria. The proposed reversible Vedic multipliers can be generalized to produce parity-preserving n*n reversible multiplier. We have also achieved some relations which can calculate the quantum cost, the number of constant inputs, and the number of required garbage outputs for the proposed Vedic circuit of any dimension. We have shown that our proposed reversible Vedic multiplier in n*n scale is the best compared to the existing Vedic multipliers.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

PourAliAkbar, Ehsan, NAVI, KEIVAN, Haghparast, Majid, & RESHADI, MIDIA. (2019). Novel Designs of Fast Parity-Preserving Reversible Vedic Multiplier. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, 17(1), 9-20. SID. https://sid.ir/paper/775027/en

Vancouver: Copy

PourAliAkbar Ehsan, NAVI KEIVAN, Haghparast Majid, RESHADI MIDIA. Novel Designs of Fast Parity-Preserving Reversible Vedic Multiplier. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING[Internet]. 2019;17(1):9-20. Available from: https://sid.ir/paper/775027/en

IEEE: Copy

Ehsan PourAliAkbar, KEIVAN NAVI, Majid Haghparast, and MIDIA RESHADI, “Novel Designs of Fast Parity-Preserving Reversible Vedic Multiplier,” THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, vol. 17, no. 1, pp. 9–20, 2019, [Online]. Available: https://sid.ir/paper/775027/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops