Design of a Reformed Array Logic Binary Multiplier for High-Speed Computations

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Mohammad, Sakib, Haniotakis, Themistoklis
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909325256032256
author Mohammad, Sakib
Haniotakis, Themistoklis
author_facet Mohammad, Sakib
Haniotakis, Themistoklis
contents Binary multipliers have long been a staple component in digital circuitry, serving crucial roles in microprocessor design, digital signal processing units and many more applications. This work presents a unique design for a multiplier that utilizes a reformed-array-logic approach to compute the product of two unsigned binary numbers. We employed a multiplexer and a barrel shifter to multiply partial products in a single clock cycle to speed up the traditional array logic. In addition, we have employed a combination of Carry Save Adders (CSA) and Ripple Carry Adders (RCA) to accumulate the partial products instead of using standalone RCAs to speed up the multiplication process further. Finally, we have demonstrated our design to perform multiplication of two 16-bit unsigned binary numbers on Cadence Virtuoso. Our design is modular and can be scaled up or down to accommodate the multiplication of any n-bit unsigned numbers.
format Preprint
id arxiv_https___arxiv_org_abs_2409_16405
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Design of a Reformed Array Logic Binary Multiplier for High-Speed Computations
Mohammad, Sakib
Haniotakis, Themistoklis
Hardware Architecture
Binary multipliers have long been a staple component in digital circuitry, serving crucial roles in microprocessor design, digital signal processing units and many more applications. This work presents a unique design for a multiplier that utilizes a reformed-array-logic approach to compute the product of two unsigned binary numbers. We employed a multiplexer and a barrel shifter to multiply partial products in a single clock cycle to speed up the traditional array logic. In addition, we have employed a combination of Carry Save Adders (CSA) and Ripple Carry Adders (RCA) to accumulate the partial products instead of using standalone RCAs to speed up the multiplication process further. Finally, we have demonstrated our design to perform multiplication of two 16-bit unsigned binary numbers on Cadence Virtuoso. Our design is modular and can be scaled up or down to accommodate the multiplication of any n-bit unsigned numbers.
title Design of a Reformed Array Logic Binary Multiplier for High-Speed Computations
topic Hardware Architecture
url https://arxiv.org/abs/2409.16405