Analog Representations in Digital Arithmetic: A Review

Slides:



Advertisements
Similar presentations
EET260 Introduction to digital communication
Advertisements

Analog-to-Digital Converter (ADC) And
5/4/2006BAE Analog to Digital (A/D) Conversion An overview of A/D techniques.
2-1 Computer Organization Part Fixed Point Numbers Using only two digits of precision for signed base 10 numbers, the range (interval between lowest.
1 Binary Arithmetic, Subtraction The rules for binary arithmetic are: = 0, carry = = 1, carry = = 1, carry = = 0, carry =
1 Binary Numbers Again Recall that N binary digits (N bits) can represent unsigned integers from 0 to 2 N bits = 0 to 15 8 bits = 0 to bits.
Number Systems Lecture 02.
ECE 645 – Computer Arithmetic Lecture 10: Fast Dividers ECE 645—Computer Arithmetic 4/15/08.
Lecture 10 Fast Dividers.
Coping With the Carry Problem 1. Limit Carry to Small Number of Bits Hybrid Redundant Residue Number Systems 2.Detect the End of Propagation Rather Than.
Information Representation (Level ISA3) Floating point numbers.
1 Lecture 5 Floating Point Numbers ITEC 1000 “Introduction to Information Technology”
IT253: Computer Organization
ECEN2102 Digital Logic Design Lecture 1 Numbers Systems Abdullah Said Alkalbani University of Buraimi.
Digital Logic Design Lecture 3 Complements, Number Codes and Registers.
10-Sep Fall 2001: copyright ©T. Pearce, D. Hutchinson, L. Marshall Sept Representing Information in Computers:  numbers: counting numbers,
Reconfigurable Computing - Multipliers: Options in Circuit Design John Morris Chung-Ang University The University of Auckland ‘Iolanthe’ at 13 knots on.
Data Representation Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
HW/SW PARTITIONING OF FLOATING POINT SOFTWARE APPLICATIONS TO FIXED - POINTED COPROCESSOR CIRCUITS - Nalini Kumar Gaurav Chitroda Komal Kasat.
BR 8/99 Binary Numbers Again Recall than N binary digits (N bits) can represent unsigned integers from 0 to 2 N bits = 0 to 15 8 bits = 0 to 255.
Mohammad Reza Najafi Main Ref: Computer Arithmetic Algorithms and Hardware Designs (Behrooz Parhami) Spring 2010 Class presentation for the course: “Custom.
07/12/ Data Representation Two’s Complement & Binary Arithmetic.
Digital Representations ME 4611 Binary Representation Only two states (0 and 1) Easy to implement electronically %0= (0) 10 %1= (1) 10 %10= (2) 10 %11=
CS1Q Computer Systems Lecture 2 Simon Gay. Lecture 2CS1Q Computer Systems - Simon Gay2 Binary Numbers We’ll look at some details of the representation.
1 Digital Logic Design Lecture 2 More Number Systems/Complements.
Chem. 133 – 2/4 Lecture. Announcements Quiz 1 today HW Set 1.1 due today Lab –Supposed to be finishing electronics lab today (will see where you are at.
1 Integer Representations V1.0 (22/10/2005). 2 Integer Representations  Unsigned integer  Signed integer  Sign and magnitude  Complements  One’s.
MATH Lesson 2 Binary arithmetic.
CHAPTER 5: Representing Numerical Data
Data Representation COE 308 Computer Architecture
Chapter 3 Data Representation
Backgrounder: Binary Math
David Kauchak CS 52 – Spring 2017
Invitation to Computer Science, C++ Version, Fourth Edition
Data Representation ICS 233
Data Representation.
Binary Numbers The arithmetic used by computers differs in some ways from that used by people. Computers perform operations on numbers with finite and.
Electronic Devices Ninth Edition Floyd Chapter 13.
CHAPTER 9 COMPUTER ARITHMETIC - ALU
Chem. 133 – 2/7 Lecture.
Floating Point Numbers: x 10-18
UNIVERSITY OF MASSACHUSETTS Dept
Data Conversion Methods
Overview of Residue Number System (RNS) for Advanced VLSI Design and VLSI Signal Processing NTUEE 吳安宇.
Introduction The term digital is derived from the way computers perform operation, by counting digits. Application of digital technology: television, communication.
CSE 575 Computer Arithmetic Spring 2003 Mary Jane Irwin (www. cse. psu
Reconfigurable Computing - Options in Circuit Design
Digital Control Systems
The University of Adelaide, School of Computer Science
CSE 575 Computer Arithmetic Spring 2005 Mary Jane Irwin (www. cse. psu
Dr. Clincy Professor of CS
BEE1244 Digital System and Electronics BEE1244 Digital System and Electronic Chapter 2 Number Systems.
Data Representation COE 301 Computer Organization
King Fahd University of Petroleum and Minerals
Arithmetic Circuits (Part I) Randy H
Dr. Clincy Professor of CS
A Theoretical Analysis of Square versus Rectangular Component Multipliers in Recursive Multiplication Behrooz Parhami Department of Electrical and Computer.
A Case for Table-Based Approximate Computing
Digital Systems and Binary Numbers
Floating Point Numbers - continuing
Overview Part 1 – Design Procedure Part 2 – Combinational Logic
Data Representation ICS 233
Copyright © Cengage Learning. All rights reserved.
Floating Point Numbers
Presented at National Cheng Kung University, Taiwan
UNIVERSITY OF MASSACHUSETTS Dept
Data Representation COE 308 Computer Architecture
Chapter 1 Introduction.
Two’s Complement & Binary Arithmetic
Presentation transcript:

Analog Representations in Digital Arithmetic: A Review Behrooz Parhami University of California, Santa Barbara

About This Presentation This slide show was first developed in fall of 2018 for an October 2018 talk at the 52nd Asilomar Conference on Signals, Systems, and Computers), Pacific Grove, CA, USA. All rights reserved for the author. ©2018 Behrooz Parhami Edition Released Revised First Fall 2018 Oct. 2018 Analog Representations in Digital Arithmetic

Analog Computing is Back! Digital data has been replacing analog data for years: From 1986 to 2007, share of digital stored data went from near-zero to 90% [1]; a decade later, digital is fully dominant We now struggle with complexity and energy limitations: The solution seems to be approximate and analog computing Hybrid digital/analog can give us the best of both worlds: Digital’s higher latency and power used only when needed Hence, multi-resolution representations are desirable: Combine fast, efficient low-precision computation with slower, energy-intensive high-precision computation Oct. 2018 Analog Representation in Digital Arithmetic

Hybrid Digital/Analog Representations Continuous-valued number system (CVNS): A positional number system with analog digits Continuous-digit residue number system (CD-RNS): Inspired by how positional info is represented in rat’s brain Race logic represents information as timing delays: Results derived based on relative signal propagation delays Space-time logic mimics spike-based neural computing: Signal timing, as well signal magnitude, carries information Here, we qualitatively compare the CVNS and CD-RNS representations Oct. 2018 Analog Representation in Digital Arithmetic

Continuous-Valued Number System Positional representation with analog digits Contains a form of natural redundancy (digit values overlap) Leftmost analog digit ~2.38 tells us something about the next digits Overlaps make the representation/arithmetic more immune to noise Can be based on unsigned or signed digits; e.g., (–5, 5) The electric-meter analogy for CVNS [4] Oct. 2018 Analog Representation in Digital Arithmetic

Continuous-Digit RNS Representation Modular arithmetic with continuous residues Extension of RNS to non-integer moduli and residues Offers precision-range-robustness trade-offs More accurate residues widen the range and increase robustness Of interest to neuroscientists: Rat’s navigation system Rat uses “space cells” (absolute) and “grid cells” (relative) Can return to home position in the dark, without any visual cues Rat’s hex grid Localization with 2 grids in 1D space [6] Oct. 2018 Analog Representation in Digital Arithmetic

Time-Delay-Based Race Logic Not useful for general use (yet) Quite efficient in some domains Example: String alignment [8] (as in DNA/protein matching) Closeness judged by “edit distance” 2D array of simple hardware cells O(m2) hardware complexity Paths represent alignments Horizontal, vertical, diagonal moves have different latencies Fastest path = Best alignment Oct. 2018 Analog Representation in Digital Arithmetic

Brain-Like Space-Time Computing Example: Transmitting one 8-bit byte representing n Binary: Delay = 9 slots; Average energy = 5 spikes Start/synch spike, followed by 8 spikes/no-spikes Space-time: Average delay = 130 slots; Energy = 2 spikes Start/synch spike, followed by n no-spikes, then end spike Rate encoding Oct. 2018 Analog Representation in Digital Arithmetic

CVNS and CD-RNS Similarities Two-level scheme: Analog representation at the low (digit) level and digital interpretation at the high (inter-digit) level CVNS likely has performance edge in general applications Mixed-radix format: CVNS is based on fixed integer radix, but extension to mixed and non-integer radices is possible Approximate computing: Both CVNS and CD-RNS suited to low-precision, adaptive-precision, and lazy arithmetic Example mixed-radix CVNS: Representation of 9.0 = 2.5  3.6 = 2  3.6 + 1.8 Oct. 2018 Analog Representation in Digital Arithmetic

CVNS and CD-RNS Differences Word-level parallelism: CD-RNS has greater affinity with parallel processing of digits in add/subtract/multiply Input/output overheads: CVNS has simple/direct forward and reverse conversion processes (low-cost and low-energy) CD-RNS conversions are even more complex than RNS Noise immunity: Consider 2-digit CVNS and CD-RNS CVNS range decreases quadratically with increased noise immunity CD-RNS range decreases linearly with increased noise immunity (cutting the radix r in half, versus using the equation me  m0m1) Fault tolerance: CVNS can be protected through coding CD-RNS has precision-robustness trade-off built in Oct. 2018 Analog Representation in Digital Arithmetic

Conclusions and Future Work Analog computing is making a comeback and hybrid digital/analog computing is becoming more attractive D/A computing can be combined at various levels: Representation level, as in CVNS and CD-RNS Analog approximation, digital refinement Neuromorphic computing paradigm Multi-level combination methods Future work and more detailed comparisons Assessment of relative speeds in application contexts Quantifying cost and energy requirements Effects of radix and moduli selection Other D/A combination methods D / A ⛏️ Oct. 2018 Analog Representation in Digital Arithmetic

? Questions or Comments? parhami@ece.ucsb.edu http://www.ece.ucsb.edu/~parhami/ ?

Analog Representations in Digital Arithmetic: A Review Back-Up Slides Behrooz Parhami University of California, Santa Barbara

Range-Precision Trade-off in CD-RNS Dynamic range is proportional to the product of moduli, divided by maximum error Left diagram: Range extension beyond  mi Middle diagram: Decoding error Right diagram: CD-RNS with m1 = 6.5, m0 = 4.4 6 r1 5 4 3 2 1 r0 136.5 1 2 3 4 r0 r1 9 11 5 6 15 8 12 14 10 13 7 15.84 R 18 39.6 17.6 r1 r0 R (correct value) R + emax R (decoded value) R e1 e0 (Incorrect value) Line with slope of 1 R – emax Oct. 2018 Analog Representation in Digital Arithmetic

Forward/Reverse Conversion in CD-RNS CRT-like methods of conventional RNS do not carry over Small errors in residues may be amplified through the conversion process A possible way out: View reverse conversion as nonlinear optimization Single-layer feedback network (see diagram on the bottom-right) Converges to the correct result within the RC time constant of the circuit Forward conversion Reverse conversion Oct. 2018 Analog Representation in Digital Arithmetic