Partial product reduction by using look-up tables for M×N multiplier

Authors:
Higinio Mora-Mora;Jerónimo Mora-Pascual;José Luis Sánchez-Romero;Juan Manuel García-Chamizo
Affiliations:
Department of Computer Science Technology and Computation, Specialized Processor Architecture Laboratory, University of Alicante, 03080 Alicante, Spain;Department of Computer Science Technology and Computation, Specialized Processor Architecture Laboratory, University of Alicante, 03080 Alicante, Spain;Department of Computer Science Technology and Computation, Specialized Processor Architecture Laboratory, University of Alicante, 03080 Alicante, Spain;Department of Computer Science Technology and Computation, Specialized Processor Architecture Laboratory, University of Alicante, 03080 Alicante, Spain
Venue:
Integration, the VLSI Journal
Year:
2008

Citing 25
Cited 2

An Approach to Implementing Multiplication with Small Tables

IEEE Transactions on Computers
Fast multiplication: algorithms and implementation

Fast multiplication: algorithms and implementation
Improving multiplier design by using improved column compression tree and optimized final adder in CMOS technology

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Optimal Circuits for Parallel Multipliers

IEEE Transactions on Computers
Powering by a Table Look-Up and a Multiplication with Operand Modification

IEEE Transactions on Computers
Computer arithmetic: algorithms and hardware designs

Computer arithmetic: algorithms and hardware designs
Reciprocation, Square Root, Inverse Square Root, and Some Elementary Functions Using Small Multipliers

IEEE Transactions on Computers - Special issue on computer arithmetic
High-Speed Booth Encoded Parallel Multiplier Design

IEEE Transactions on Computers - Special issue on computer arithmetic
A dual precision IEEE floating-point multiplier

Integration, the VLSI Journal
Advanced Computer Arithmetic Design

Advanced Computer Arithmetic Design
Design and Test of Large Embedded Memories: An Overview

IEEE Design & Test
Fast Hardware-Based Algorithms for Elementary Function Computations Using Rectangular Multipliers

IEEE Transactions on Computers
Implementing Multiplication with Split Read-Only Memory

IEEE Transactions on Computers
A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach

IEEE Transactions on Computers
High-Speed Double-Precision Computation of Reciprocal, Division, Square Root and Inverse Square Root

IEEE Transactions on Computers
To booth or not to booth

Integration, the VLSI Journal
Design Issues in High Performance Floating Point Arithmetic Units

Design Issues in High Performance Floating Point Arithmetic Units
Embedded Memories for the Future

IEEE Design & Test
Synthesis of integer multipliers in sum of pseudoproducts form

Integration, the VLSI Journal
Dynamic techniques to reduce memory traffic in embedded systems

Proceedings of the 1st conference on Computing frontiers
High-Speed Function Approximation Using a Minimax Quadratic Interpolator

IEEE Transactions on Computers
Decimal Multiplication with Efficient Partial Product Generation

ARITH '05 Proceedings of the 17th IEEE Symposium on Computer Arithmetic
Decimal Floating-Point Multiplication Via Carry-Save Addition

ARITH '07 Proceedings of the 18th IEEE Symposium on Computer Arithmetic
M*N Booth encoded multiplier generator using optimized Wallace trees

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Dependability evaluation of time-redundancy techniques in integer multipliers

PATMOS'07 Proceedings of the 17th international conference on Integrated Circuit and System Design: power and timing modeling, optimization and simulation

Mathematical model of stored logic based computation

Mathematical and Computer Modelling: An International Journal
Design, analysis, and implementation of partial product reduction phase by using wide m: 3 4 ≤ m ≤ 10 compressors

International Journal of High Performance Systems Architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new technique for partial product reduction in multiplication operations. The method is based on the construction of counter elements by means of look-up tables. The organization of these counters into reduction trees takes advantage of the inherent benefits of the integration of the memories and provides an alternative to classic operation methods. We show several reduction schemes that illustrate the proposed technique and describe hybrid examples that combine stored logic with classic combinational counters in order to adapt them better to each scheme. Our approach outperforms other schemes used for comparison. In this sense, not only an independent technology model has been established, but also an FPGA approximation has been implemented to measure such factors in a real-life technology platform.