IDEAS home Printed from https://ideas.repec.org/a/epw/comput/v2y2022i4id10071.html

Hardware Implementation of a High Efficiency and High-Speed Squaring Architecture

Author

Listed:
  • Shiva Maleki Varnosfaderani

    (Wayne State Universty, USA)

  • Bahram Rashidi

    (University of Ayatollah Ozma Broujerdi, Iran)

  • Mohammad Alhawari

    (Wayne State University, USA)

Abstract

This paper presents the design of a high speed and simple squaring structure based on half adder and full adder. The proposed architecture consists of three main steps; simplification of the squaring structure, calculation and transferring of the carry bit to the next part, and finally, applying the modified Wallace Tree Adder to calculate the summation of the products. The proposed squaring architecture is formed only by 13 half adders and 20 full adders for 8-bit squaring which has the lowest complexity compared to other works. The proposed structure is modeled by using Field-Programmable Gate Array (FPGA) and has been successfully synthesized and implemented with Xilinx Spartan-6 and Virtex-4 FPGA. Simulation results show that the proposed structure has high speed and excellent performance with low power consumption while having the lowest propagation delay (3.25 ns) and acceptable hardware utilization compared to existing squaring models. The gate-level design of 8-bit squaring is implemented using Cadence layout tools in 65 nm CMOS technology which has a total area of 0.095 mm2.

Suggested Citation

Handle: RePEc:epw:comput:v:2:y:2022:i:4:id:10071
DOI: 10.24018/compute.2022.2.4.71
as

Download full text from publisher

File URL: https://eu-opensci.org/index.php/compute/article/view/10071
File Function: Abstract page
Download Restriction: no

File URL: https://eu-opensci.org/index.php/compute/article/download/10071/1802
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.24018/compute.2022.2.4.71?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Keywords

;
;
;
;
;
;
;
;
;

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:epw:comput:v:2:y:2022:i:4:id:10071. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Support Team (email available below). General contact details of provider: https://eu-opensci.org/index.php/compute .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.