Optimal Design of Vedic Multiplier for Computation in Memory Applications

The increasing demand for computational efficiency and power management in VLSI systems highlights the need for innovative architectural solutions. Traditional designs of-ten face challenges in balancing speed, power consumption, and area efficiency due to inefficiencies in data movement between processing units and memory. Computation in Memory (CIM) techniques address the memory wall problem, where data transfer limitations between processing and memory units hinder performance. CIM enables computations to occur directly within memory arrays, significantly reducing data movement and improving both speed and power efficiency. To address these issues, a novel architecture integrates CIM with a 16x16 Vedic Multiplier, incorporating a 2x2 Vedic Multiplier within 8T SRAM memory arrays and using latch-type sense amplifiers for in-memory computation. This integration reduces data movement, latency, and power consumption. Post-routing analysis further demonstrates a power decrease from 615µW to 595W. Detailed parasitic extraction and simulation using Standard Parasitic Exchange Format (SPEF) files reveal a 15% reduction in power consumption and a 9% reduction in slack compared to traditional multipliers. This CIM-based approach enhances computational efficiency and sets a robust foundation for future advancements in VLSI design, addressing critical challenges in modern high-performance computing systems.

Authors

Institutions

Publication Details

Published
2024-11-07
DOI
https://doi.org/10.1109/csitss64042.2024.10816974
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimal Design of Vedic Multiplier for Computation in Memory Applications

N. Shylashree, Prof. Deepika P, Nikita Kulkarni
Quantum Computing Algorithms and Architecture
article

Optimal Design of Vedic Multiplier for Computation in Memory Applications

N. Shylashree, Prof. Deepika P, Nikita Kulkarni
article en

Abstract

The increasing demand for computational efficiency and power management in VLSI systems highlights the need for innovative architectural solutions. Traditional designs of-ten face challenges in balancing speed, power consumption, and area efficiency due to inefficiencies in data movement between processing units and memory. Computation in Memory (CIM) techniques address the memory wall problem, where data transfer limitations between processing and memory units hinder performance. CIM enables computations to occur directly within memory arrays, significantly reducing data movement and improving both speed and power efficiency. To address these issues, a novel architecture integrates CIM with a 16x16 Vedic Multiplier, incorporating a 2x2 Vedic Multiplier within 8T SRAM memory arrays and using latch-type sense amplifiers for in-memory computation. This integration reduces data movement, latency, and power consumption. Post-routing analysis further demonstrates a power decrease from 615µW to 595W. Detailed parasitic extraction and simulation using Standard Parasitic Exchange Format (SPEF) files reveal a 15% reduction in power consumption and a 9% reduction in slack compared to traditional multipliers. This CIM-based approach enhances computational efficiency and sets a robust foundation for future advancements in VLSI design, addressing critical challenges in modern high-performance computing systems.

Visvesvaraya Technological University (IN)
Openalex Percentile: Top 77%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.