A Theoretical Analysis of Square versus Rectangular Component Multipliers in Recursive Multiplication Behrooz Parhami Department of Electrical and Computer.

Slides:



Advertisements
Similar presentations
Unified Approach to the Design of Modulo-(2 n ± 1) Adders Based on Signed-LSB Representation of Residues Ghassem Jaberipur Dept. Electrical & Computer.
Advertisements

Multioperand Addition Lecture 6. Required Reading Chapter 8, Multioperand Addition Note errata at:
Lecture 10 Jianjun Hu Department of Computer Science and Engineering University of South Carolina CSCE350 Algorithms and Data Structure.
Optimizing high speed arithmetic circuits using three-term extraction Anup Hosangadi Ryan Kastner Farzan Fallah ECE Department Fujitsu Laboratories University.
1 A Timing-Driven Synthesis Approach of a Fast Four-Stage Hybrid Adder in Sum-of-Products Sabyasachi Das University of Colorado, Boulder Sunil P. Khatri.
Copyright 2008 Koren ECE666/Koren Part.6b.1 Israel Koren Spring 2008 UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Digital Computer.
A High Performance Application Representation for Reconfigurable Systems Wenrui GongGang WangRyan Kastner Department of Electrical and Computer Engineering.
VLSI Arithmetic. Multiplication A = a n-1 a n-2 … a 1 a 0 B = b n-1 b n-2 … b 1 b 0  eg)  Shift.
1 Design of a Parallel-Prefix Adder Architecture with Efficient Timing-Area Tradeoff Characteristic Sabyasachi Das University of Colorado, Boulder Sunil.
UNIVERSITY OF MASSACHUSETTS Dept
M. Interleaving Montgomery High-Radix Comparison Improvement Adders CLA CSK Comparison Conclusion Improving Cryptographic Architectures by Adopting Efficient.
An Extra-Regular, Compact, Low-Power Multiplier Design Using Triple-Expansion Schemes and Borrow Parallel Counter Circuits Rong Lin Ronald B. Alonzo SUNY.
Mixed Non-Rectangular Block Packing for Non-Manhattan Layout Architectures M. Wu, H. Chen and J. Jou Department of EE, NCTU HsinChu, Taiwan ISQED 2011.
Introduction to Adaptive Digital Filters Algorithms
Philip Brisk 2 Paolo Ienne 2 Hadi Parandeh-Afshar 1,2 1: University of Tehran, ECE Department 2: EPFL, School of Computer and Communication Sciences Efficient.
Introduction to Geometric Sequences and Series
ICCD Conversion Driven Design of Binary to Mixed Radix Circuits Ashur Rafiev, Julian Murphy, Danil Sokolov, Alex Yakovlev School of EECE, Newcastle.
Reconfigurable Computing - Multipliers: Options in Circuit Design John Morris Chung-Ang University The University of Auckland ‘Iolanthe’ at 13 knots on.
Description and Analysis of MULTIPLIERS using LAVA.
Implementation of Finite Field Inversion
The Fast Optimal Voltage Partitioning Algorithm For Peak Power Density Minimization Jia Wang, Shiyan Hu Department of Electrical and Computer Engineering.
A Reconfigurable Low-power High-Performance Matrix Multiplier Architecture With Borrow Parallel Counters Counters : Rong Lin SUNY at Geneseo
Complexity 20-1 Complexity Andrei Bulatov Parallel Arithmetic.
ECE 645 – Computer Arithmetic Lecture 6: Multi-Operand Addition ECE 645—Computer Arithmetic 3/5/08.
Pipelining and number theory for multiuser detection Sridhar Rajagopal and Joseph R. Cavallaro Rice University This work is supported by Nokia, TI, TATP.
Limits On Wireless Communication In Fading Environment Using Multiple Antennas Presented By Fabian Rozario ECE Department Paper By G.J. Foschini and M.J.
Multi-Split-Row Threshold Decoding Implementations for LDPC Codes
Recursive Architectures for 2DLNS Multiplication RESEARCH CENTRE FOR INTEGRATED MICROSYSTEMS - UNIVERSITY OF WINDSOR 11 Recursive Architectures for 2DLNS.
Multioperand Addition
Comparison of Various Multipliers for Performance Issues 24 March Depart. Of Electronics By: Manto Kwan High Speed & Low Power ASIC
CSE477 L21 Multiplier Design.1Irwin&Vijay, PSU, 2002 CSE477 VLSI Digital Circuits Fall 2002 Lecture 21: Multiplier Design Mary Jane Irwin (
Tree and Array Multipliers Lecture 8. Required Reading Chapter 11, Tree and Array Multipliers Chapter 12.5, The special case of squaring Note errata at:
Fang Fang James C. Hoe Markus Püschel Smarahara Misra
Partial Reconfigurable Designs
ECE 1304 Introduction to Electrical and Computer Engineering
UNIVERSITY OF MASSACHUSETTS Dept
Multiplier Design [Adapted from Rabaey’s Digital Integrated Circuits, Second Edition, ©2003 J. Rabaey, A. Chandrakasan, B. Nikolic]
CSE477 VLSI Digital Circuits Fall 2003 Lecture 21: Multiplier Design
Sequential Multipliers
UNIVERSITY OF MASSACHUSETTS Dept
Multipliers Multipliers play an important role in today’s digital signal processing and various other applications. The common multiplication method is.
Lecture 9 Basic Dividers.
Design and Analysis of Algorithms (07 Credits / 4 hours per week)
Radix 2 Sequential Multipliers
Efficient CRT-Based RSA Cryptosystems
ECE 434 Advanced Digital System L12
Lower Bound Theory.
Tree and Array Multipliers
VLSI Arithmetic Lecture 10: Multipliers
Instructor: Prof. Chung-Kuan Cheng
EFFICIENT ADDERS TO SPEEDUP MODULAR MULTIPLICATION FOR CRYPTOGRAPHY
A Case for Table-Based Approximate Computing
Analog Representations in Digital Arithmetic: A Review
Numerical Algorithms Quiz questions
Topics Multipliers..
UNIVERSITY OF MASSACHUSETTS Dept
Multioperand Addition
UNIVERSITY OF MASSACHUSETTS Dept
Tree and Array Multipliers
UNIVERSITY OF MASSACHUSETTS Dept
Data Wordlength Reduction for Low-Power Signal Processing Software
UNIVERSITY OF MASSACHUSETTS Dept
Lecture 9 Digital VLSI System Design Laboratory
Comparison of Various Multipliers for Performance Issues
UNIVERSITY OF MASSACHUSETTS Dept
Description and Analysis of MULTIPLIERS using LAVA
Arithmetic Building Blocks
Sajib Kumar Mitra, Lafifa Jamal and Hafiz Md. Hasan Babu*
UNIVERSITY OF MASSACHUSETTS Dept
A Random Access Scan Architecture to Reduce Hardware Overhead
Presentation transcript:

A Theoretical Analysis of Square versus Rectangular Component Multipliers in Recursive Multiplication Behrooz Parhami Department of Electrical and Computer Engineering University of California, Santa Barbara, USA parhami@ece.ucsb.edu 50th Asilomar Conference on Signals, Systems, and Computers Pacific Grove, CA, USA, November 6-9, 2016

Outline Introduction Additive Multiply Modules Design of AMMs Recursive Multiplication Basic Theory Delay-Optimized Layout-Optimized Theoretical Comparisons Special Case of Squaring Conclusion

Introduction: Multiplier Design Multiplication is a very important building block Different algorithms offer various trade-offs Naïve binary algorithm: O(k) cost; O(k log k) delay Basic binary with carry-save: O(k) cost; O(k) delay Radix-2h algorithm: O(hk) cost; O(k/h + log k) delay Partial-tree multiplier: Same as high-radix, with h = O(k) Tree multiplier: O(k2) cost; O(log k) delay Array multiplier: O(k2) cost; O(k) delay Recursive multiplier (our focus here)

Additive Multiply Modules AMM b-bit and c-bit multiplicative inputs b  c AMM b-bit and c-bit additive inputs (b + c)-bit output (2b – 1)  (2c – 1) + (2b – 1) + (2c – 1) = 2b+c – 1

Square vs. Nonsquare AMMs Height-5 column

Recursive Construction Nonsquare AMMs Square AMMs

Recursive Construction: Square AMMs

8  8 Multiplier Built 4  2 of AMMs Apr. 2015 Computer Arithmetic, Multiplication 8  8 Multiplier Built 4  2 of AMMs

8  8 Multiplier: Layout-Optimized Apr. 2015 Computer Arithmetic, Multiplication 8  8 Multiplier: Layout-Optimized

Other Examples of Non-Sqaure BBs

A Bound on Matrix Height Reduction xmax = max[0, min(h, g – 1 – hc/b)] g groups of b bits h groups of c bits

Example with No Height Reduction

Examples of Matrix Height Reduction Efstathiou, et al., 2004

Special Case of Squaring Non-square building blocks not beneficial because we won’t be able to use squarers A single multiplier Two squarers

Conclusion and Future Work Non-square components may be advantageous Closed-form formula for matrix height Formula valid in all cases of practical interest Fails in some corner cases that are uninteresting Choice of aspect ratio affects overall speed It also affects design complexity and regularity LUT schemes favor 4  2 and 3  3 modules Multi-level synthesis: 4  2  16  8  32  32

Questions? The PDF file of the final paper will be made available at: www.ece.ucsb.edu/~parhami/publications.htm