Low Complexity Three’s Complement Parallel Multiplier Using Special Operators of Ternary Logic

Arithmetic units in multivalued logic have been extensively researched in the last decade in the context of emerging nanodevices. While considerable work has been done on adder and multiplier designs, the focus has been on handling unsigned numbers. In this brief, we first present an algorithm for multiplication of a pair of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">signed ternary numbers represented in three’s complement format</i>. The algorithm leads to partial product digits which are all positive. Using a special class of operators in ternary logic, we then present a hardware-efficient realization of the algorithm that leads to low multiplexer count. The special operators also contribute to power reduction. Technology assessment using Carbon Nanotube FET (CNTFET) reveals that the proposed multiplier achieves substantial reduction in power-delay product (PDP) over the best existing design. In particular, the savings in PDP for 6 × 6 and 36 × 36 multipliers are 32% and 38% respectively.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Circuits & Systems II Express Briefs
Published
2025-09-29
DOI
https://doi.org/10.1109/tcsii.2025.3615737
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

Low Complexity Three’s Complement Parallel Multiplier Using Special Operators of Ternary Logic

B. Srinivasu, L. Hemanth Krishna
IEEE Transactions on Circuits & Systems II Express Briefs
Quantum Computing Algorithms and Architecture
article

Low Complexity Three’s Complement Parallel Multiplier Using Special Operators of Ternary Logic

B. Srinivasu, L. Hemanth Krishna
article en

Abstract

Arithmetic units in multivalued logic have been extensively researched in the last decade in the context of emerging nanodevices. While considerable work has been done on adder and multiplier designs, the focus has been on handling unsigned numbers. In this brief, we first present an algorithm for multiplication of a pair of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">signed ternary numbers represented in three’s complement format</i>. The algorithm leads to partial product digits which are all positive. Using a special class of operators in ternary logic, we then present a hardware-efficient realization of the algorithm that leads to low multiplexer count. The special operators also contribute to power reduction. Technology assessment using Carbon Nanotube FET (CNTFET) reveals that the proposed multiplier achieves substantial reduction in power-delay product (PDP) over the best existing design. In particular, the savings in PDP for 6 × 6 and 36 × 36 multipliers are 32% and 38% respectively.

IEEE Transactions on Circuits & Systems II Express BriefsVol. 72(11)
Indian Institute of Technology Madras (IN), Indian Institute of Technology Mandi (IN)
Openalex Percentile: Top 86%
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.

Low Complexity Three’s Complement Parallel Multiplier Using Special Operators of Ternary Logic — B. Srinivasu, L. Hemanth Krishna · IEEE Transactions on Circuits & Systems II Express Briefs (2025) | TGRS Research Map | TGRS