Implementation Of Digital Fir Filter Using Improved Table Look Up Scheme For Residue Number System
|
|
- Cameron Baldwin
- 6 years ago
- Views:
Transcription
1 Implementation Of Digital Fir Filter Using Improved Table Look Up Scheme For Residue Number System G.Suresh, G.Indira Devi, P.Pavankumar Abstract The use of the improved table look up Residue Number System (RNS) and Dynamic Distributed Arithmetic Algorithm (DDAA) in modern telecommunication and multimedia applications is becoming more and more important because it allows interesting advantages in terms of area, power consumption and speed.. This paper presents a general conversion procedure based on a {2 n - 1,2 n, 2 n + 1 } moduli set. Based on the improved table look up RNS and DAA algorithm, an architecture which efficiently implements the digital fir filter is synthesized using Xilinx VirtexE.It is observed that upto 82.85% reduction in number of slices,upto 100% reduction in number of flip flops and upto 87.21% reduction in number of Look Up Tables(LUT) is achieved. The speed of the filter is improved by 30.98%. Keywords: Residue arithmetic, Distributed arithmetic, FIRfilters, high speed, VLSI. 1 Introduction The advantages of Residue Number System (RNS) processing are discussed in several publications and books [5], [8], [9]. Error free computation, simplified and fast addition and multiplication, possibility to obtain parallel architectures are among the more important advantages. The use of the RNS allows the decomposition of a given dynamic range in slices of smaller range on which the computation can be efficiently implemented in parallel [1],[2]. In fact, the implementation of the converters constitutes a fixed overhead on the total area, delay and power dissipation [6], [7]. For these reasons the output conversion, which is generally performed using the Chinese Remainder Theorem (CRT) and Mixed Radix Conversion (MRC) still appears to be a crucial point in the realization of competitive RNS subsystems and, therefore, represents one of the main topics in the recent RNS research activities. Previous work demonstrated that FIR filters implemented in the Residue Number System (RNS) offer better performance of filters realized in the traditional binary system in terms of area and power dissipation [3],[4].This research paper deals with the design of digital fir filter based on improved table look up scheme for CRT and Dynamic Distributed Arithmetic (DDA).The block diagram of digital fir filter based on DAA and CRT is shown in fig.1. X (n) Binary to Residue converter Dynamic Distributed Arithmetic based FIR filter Residue to Binary converter Y (n) Figure 1: Block diagram of digital fir filter 2 Residue Number System A residue number system is defined by a set of N integer constants,{m 1, m 2, m 3,..., m N },referred to as the moduli. Let M be the least common multiple of all the m i. Any arbitrary integer X smaller than M can be represented in the defined residue number system as a set of N smaller integers {x 1, x 2, x 3,..., x N }with x i = X mod m i representing the residue class of X to that modulus.m is then the product of all the m i. The only requirement for a modulus to be in a set is that it has to be a pair-wise relatively prime to any other moduli in the set [5]. A moduli set can have moduli that have common factor, hence there are not relatively prime to one another. The example for this type of moduli set used in this research is {2 n - 1,2 n, 2 n + 1 }. Using CRT a binary number X can be found from its residue representation by n X = j R j / j (1) j=1 M Where X is the decimal representation of a number
2 j International Journal of Science and Engineering Research (IJ0SER), r j is the j th residue digit of X i.e. R j = X mod is the j th moduli X[n] Input L U A D Reg Buffer T D Y[n] j = M / and M = П here j and R j / j are constant. So equation (1) can be re written as n X = C j R j (2) j=1 M where C j = j 1 / j a = 1 / j is called multiplicative inverse. It can be calculated using the following formula a = 1 / j = ( j) m i -2 mod mj Equation (2) expands to X = C 1 R 1 +C 2 R 2 +.+C n R n ) mod M For j=1 to n, C j is known and can be stored in a look up table. However, to implement X,it requires n multiplication units and summation units capable of handling n inputs. This method is not suitable to meet the goal of maximizing the speed of the conversion. 3 Dynamic Distributed Arithmetic Based fir filter The input sequence is fed into the input buffer register at the input sample rate. The co-efficient are also fed to the corresponding buffer. The serial output is presented to the RAM based shift registers The RAM based shift register stores the data in a particular address. The outputs of registered LUTs are added and loaded to the scaling accumulator from LSB to MSB and the result which is the filter output will be accumulated on to the output register over the time. For an n bit input, n+1 clock cycles are needed for a symmetrical filter to generate the output. if there is any change in h[n], it will be updated and the resultant content is stored in the LUTs. This is shown in fig.2. For example, consider m1= 7, m2 = 8, m3 = 9. so M will be 504.Using the formulae stated above,the values of a 1 =4, a 2 =7 and a 3 =5.So C 1 = 288, C 2 = 441 and C 3 = 280. Therefore X= (288 R R ) mod 504. The direct implementation of the X requires 504 entries in the table shown in Table.1.This increases the size of look up table, latency and decreases the speed of operation. h[n] Co- Efficient Buffer S H I F T Figure 2: Block diagram of Dynamic Distributed Algorithm based FIR filter 4 Proposed method In this proposed method of RNS to binary conversion, the speed is increased by reducing the size of the table look up. Also this paper proposes the new formulae to find out the multiplicative inverses. The new given formulae perform only shifting operation compared to conventional method in which the calculation of multiplicative inverses are difficult and time consuming process. The following are the new formulae for the calculation of multiplicative inverses a 1 =2 n-1, a 2 =2 n -1, a 1 =2 n-1 +1 (3) R2 R 1 X To be continued till 504 entries Table 1: Direct implementation of X The depth of the table 1 can be reduced by using three separate tables, one for each moduli set to facilitate parallel access which is shown in Table 2.
3 Access R 2 R 1 X mod M R R Table 2: Look up table for parallel Access The items fetched from the three tables are added together and mod M operation is done for final X value. For example, to convert the residue numbers {R1, R 2, } = {3, 4, 5} with moduli set {7,8,9}. From the table 2. R 1 =3 corresponds to 864, R 2 =4 corresponds to 1764 and =5 corresponds to 1400.Then the value of X is given by X= ( ) mod 504 = 500.In this method of conversion mod operation must be performed which is time consuming and costly to implement in hardware. This mod operation can be eliminated by considering the following property. [X+ (a. m)] mod M =X for a=1,2.n. This is true for [X- (a. m)] mod M =X for a=1,2.n. From the table 2. the residue number { R 1, R 2, } ={1,0,0}with moduli set {7,8,9}corresponds to decimal number 288.It also corresponds to(-216) by the above definition. The new improved table shown in table 3. If { R 1, R 2, }={3,4,5}with moduli set {7,8,9},the corresponding decimal number is computed as follows: Conventional method (from table 2) {3,4,5} ={3,0,0} = 360 +{0,4,0} = 252 +{0,0,5} = mod So the X value is 500.Here mod operation is must. Proposed method (from table 3) {3,4,5} ={3,0,0} = {0,4,0} = 252 +{0,0,5} = If the sums of X values are negative which are not desired results (0<X<M), just add value of M to the X value. So the X value is = 500. In this method, R 1 =6 corresponds to the decimal number 216 and R 1 =1 corresponds to the decimal number So R1=1 and R 1 = 6 are dual of each other. Hence it is possible to eliminate half of the entries in the table.3.in this proposed method, the speed can be increased by parallel accessing of residues R 1, R 2 and.also the area required for the implementation of the converter is reduced by reducing the size of the look up table using the property of the residue number.(note that { R 1, R 2, } = {0,0,0} is trivial and is eliminated from the table). Xilinx VirtexE are programmed using Verilog HDL; a popular hardware description language [10]. The language has capabilities to describe the behavioral nature of a design, the data flow of a design, a design s structural composition, delays and a waveform generation mechanism. Models written in this language can be verified using a Verilog simulator. Access R3 R 2 R 1 X mod M (-216) R (-144) (-72) (-63) (-126) (-189) R (-224) (-168) (-112) (-56) Table 3: Proposed look up table
4 Delay (ns) Memory( MB) 15 Array International Journal of Science and Engineering Research (IJ0SER), 5 Results and Discussion The goal of research work is to compare the number of resources consumed by the DDA method with improved table look up scheme for RNS with that produced by other conventional methods. For our experiments, we considered 4 tap FIR filters and targeted the Xilinx VirtexE device. The constants were normalized to 4 digit of precision and the input samples were assumed to be 4 bits wide. We used the Xilinx Integrated Software Environment (ISE) for performing synthesis and implementation of the designs. All the designs were synthesized for maximum performance. Table 4. shows the reduction in the number of resources, in terms of the number of Slices, Look Up Tables (LUTs) and the number of Flip Flops (FFs).From the table 4., it is observed that the number of slices reduced by 82.85% and LUTs by 87.21%.The number of flip flops also reduced by 100% compared to other methods of filter implementation. The number of Input Output Block (IOB) requires is only 90 out of 126. Pro Method / Direct Baugh posed parameter Braun Array Wooley method Slices (3584) Flip Flops (7168) LUT (7168) IOB (141) Table 4: Resources utilization for the various filters. From the table.5, it is noted that proposed method only needs shifters, adders and subtractors.but direct method requires multipliers and registers. All other methods requires only adder - subtracter, register and shifters. Method / Direct Braun Baugh Array Proposed method parameter Wooley Registers Adders/ Sub tractors Multipliers 12 shifters 9 Table 5: Macro Statistics for the various filters. From the figure 3, it is cleared that the delay of proposed method is very much less than that of other methods of filter implementation. So its speed is increased by approximately 31% Delay Comparison 10 Braun Direct Baugh Wooley 5 Pro posed method 0 1 Types of filter Figure 3: Delay comparison of various filters The area occupied by the proposed method is reduced by approximately 7% compared to other methods of filter implementation as shown in figure Area Comparison Baugh Wooley 50 Direct 40 Braun 20 Array Types of filter Figure 4: Area comparison of various filters 6 Conclusion Pro posed method This research work presented a multiplier less technique, based on the DDA method with improved table look up based RNS for low area and high speed implementations of FIR filters. The validation carried out over VertexE devices where we observed significant speed improvement and area reductions over traditional methods. In future, we would like to modify our
5 algorithm to make use of the limited number of embedded resources available on the FPGA devices. References 1.A. Del Re, A. Nannarelli, and M. Re. Implementation of Digital Filters in Carry-Save Residue Number System, Proc. of 35th Asilomar Conference on Signals, Systems, and Computers, November 4-7( 2001) 2 A. Nannarelli, M. Re and GC. Cardarilli. Tradeoffs between Residue Number System and Traditional FIR Filters, Proc. of 2001 IEEE International Symposium on Circuits and Systems, Vol.II, pp , (2001). 3.G. C. Cardarilli, A. Del Re, A. Nannarelli, and M. Re. Residue Number System Reconfigurable Datapath,,Proc. of IEEE International Symposium on Circuits and Systems, Vol.II, pp ,(2002). 4.G. C. Cardarilli, A. Del Re, A. Nannarelli, and M. Re. Power Characterization of Digital Filters Implemented on FPGA, Proc. of IEEE International Symposium on Circuits and Systems, Vol.V, pp (2002). 5. M.A. Sodestrand, W.K. Jenkins, G. A. Jullien, F. J. Taylor. "Residue Number System Arithmetic: Modern Applications in Digital Signal Processing", New York: IEEE Press (1986). 6.M.A. Soderstrand and K.Al Marayati. VLSI implementationof very high-order FIR filters, IEEE International Symposium on Circuits and Systems Vol.2, pp , (1995). 7.[9]M.N. Mahesh and M. Mehndale. `Low power realization of residue number system based fir filters'', Thirteenth International Conference on VLSI Design, pp ,(2000). 8. N.S. Szabo and R.I. Tanaka, "Residue Arithmetic and its Applications in Computer Technology",New York: McGraw- Hill. 9.S. K. Mitra, J. F. Kaiser."Handbook for Digital Signal Processing", John Wiley & Sons. 10.S.Palnitkar. Verilog HDL primer, SunSoft Press.
Reduced-Area Constant-Coefficient and Multiple-Constant Multipliers for Xilinx FPGAs with 6-Input LUTs
Article Reduced-Area Constant-Coefficient and Multiple-Constant Multipliers for Xilinx FPGAs with 6-Input LUTs E. George Walters III Department of Electrical and Computer Engineering, Penn State Erie,
More informationDesign and FPGA Implementation of Radix-10 Algorithm for Division with Limited Precision Primitives
Design and FPGA Implementation of Radix-10 Algorithm for Division with Limited Precision Primitives Miloš D. Ercegovac Computer Science Department Univ. of California at Los Angeles California Robert McIlhenny
More informationKEYWORDS: Multiple Valued Logic (MVL), Residue Number System (RNS), Quinary Logic (Q uin), Quinary Full Adder, QFA, Quinary Half Adder, QHA.
GLOBAL JOURNAL OF ADVANCED ENGINEERING TECHNOLOGIES AND SCIENCES DESIGN OF A QUINARY TO RESIDUE NUMBER SYSTEM CONVERTER USING MULTI-LEVELS OF CONVERSION Hassan Amin Osseily Electrical and Electronics Department,
More informationInternational Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research)
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
More informationDesign and Study of Enhanced Parallel FIR Filter Using Various Adders for 16 Bit Length
International Journal of Soft Computing and Engineering (IJSCE) Design and Study of Enhanced Parallel FIR Filter Using Various Adders for 16 Bit Length D.Ashok Kumar, P.Samundiswary Abstract Now a day
More informationAnalysis and Synthesis of Weighted-Sum Functions
Analysis and Synthesis of Weighted-Sum Functions Tsutomu Sasao Department of Computer Science and Electronics, Kyushu Institute of Technology, Iizuka 820-8502, Japan April 28, 2005 Abstract A weighted-sum
More informationAn Effective New CRT Based Reverse Converter for a Novel Moduli Set { 2 2n+1 1, 2 2n+1, 2 2n 1 }
An Effective New CRT Based Reverse Converter for a Novel Moduli Set +1 1, +1, 1 } Edem Kwedzo Bankas, Kazeem Alagbe Gbolagade Department of Computer Science, Faculty of Mathematical Sciences, University
More informationA High-Speed Realization of Chinese Remainder Theorem
Proceedings of the 2007 WSEAS Int. Conference on Circuits, Systems, Signal and Telecommunications, Gold Coast, Australia, January 17-19, 2007 97 A High-Speed Realization of Chinese Remainder Theorem Shuangching
More informationResidue Number Systems Ivor Page 1
Residue Number Systems 1 Residue Number Systems Ivor Page 1 7.1 Arithmetic in a modulus system The great speed of arithmetic in Residue Number Systems (RNS) comes from a simple theorem from number theory:
More informationNumbering Systems. Computational Platforms. Scaling and Round-off Noise. Special Purpose. here that is dedicated architecture
Computational Platforms Numbering Systems Basic Building Blocks Scaling and Round-off Noise Computational Platforms Viktor Öwall viktor.owall@eit.lth.seowall@eit lth Standard Processors or Special Purpose
More informationPower Consumption Analysis. Arithmetic Level Countermeasures for ECC Coprocessor. Arithmetic Operators for Cryptography.
Power Consumption Analysis General principle: measure the current I in the circuit Arithmetic Level Countermeasures for ECC Coprocessor Arnaud Tisserand, Thomas Chabrier, Danuta Pamula I V DD circuit traces
More informationOptimization of new Chinese Remainder theorems using special moduli sets
Louisiana State University LSU Digital Commons LSU Master's Theses Graduate School 2010 Optimization of new Chinese Remainder theorems using special moduli sets Narendran Narayanaswamy Louisiana State
More informationLow-complexity generation of scalable complete complementary sets of sequences
University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 2006 Low-complexity generation of scalable complete complementary sets
More informationOn Equivalences and Fair Comparisons Among Residue Number Systems with Special Moduli
On Equivalences and Fair Comparisons Among Residue Number Systems with Special Moduli Behrooz Parhami Department of Electrical and Computer Engineering University of California Santa Barbara, CA 93106-9560,
More informationForward and Reverse Converters and Moduli Set Selection in Signed-Digit Residue Number Systems
J Sign Process Syst DOI 10.1007/s11265-008-0249-8 Forward and Reverse Converters and Moduli Set Selection in Signed-Digit Residue Number Systems Andreas Persson Lars Bengtsson Received: 8 March 2007 /
More informationOn the Complexity of Error Detection Functions for Redundant Residue Number Systems
On the Complexity of Error Detection Functions for Redundant Residue Number Systems Tsutomu Sasao 1 and Yukihiro Iguchi 2 1 Dept. of Computer Science and Electronics, Kyushu Institute of Technology, Iizuka
More informationEECS150 - Digital Design Lecture 21 - Design Blocks
EECS150 - Digital Design Lecture 21 - Design Blocks April 3, 2012 John Wawrzynek Spring 2012 EECS150 - Lec21-db3 Page 1 Fixed Shifters / Rotators fixed shifters hardwire the shift amount into the circuit.
More informationA Deep Convolutional Neural Network Based on Nested Residue Number System
A Deep Convolutional Neural Network Based on Nested Residue Number System Hiroki Nakahara Tsutomu Sasao Ehime University, Japan Meiji University, Japan Outline Background Deep convolutional neural network
More informationGENERALIZED ARYABHATA REMAINDER THEOREM
International Journal of Innovative Computing, Information and Control ICIC International c 2010 ISSN 1349-4198 Volume 6, Number 4, April 2010 pp. 1865 1871 GENERALIZED ARYABHATA REMAINDER THEOREM Chin-Chen
More informationDESIGN AND IMPLEMENTATION OF EFFICIENT HIGH SPEED VEDIC MULTIPLIER USING REVERSIBLE GATES
DESIGN AND IMPLEMENTATION OF EFFICIENT HIGH SPEED VEDIC MULTIPLIER USING REVERSIBLE GATES Boddu Suresh 1, B.Venkateswara Reddy 2 1 2 PG Scholar, Associate Professor, HOD, Dept of ECE Vikas College of Engineering
More informationDesign and Implementation of Efficient Modulo 2 n +1 Adder
www..org 18 Design and Implementation of Efficient Modulo 2 n +1 Adder V. Jagadheesh 1, Y. Swetha 2 1,2 Research Scholar(INDIA) Abstract In this brief, we proposed an efficient weighted modulo (2 n +1)
More informationA Suggestion for a Fast Residue Multiplier for a Family of Moduli of the Form (2 n (2 p ± 1))
The Computer Journal, 47(1), The British Computer Society; all rights reserved A Suggestion for a Fast Residue Multiplier for a Family of Moduli of the Form ( n ( p ± 1)) Ahmad A. Hiasat Electronics Engineering
More informationFPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials
FPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials C. Shu, S. Kwon and K. Gaj Abstract: The efficient design of digit-serial multipliers
More informationPipelined Viterbi Decoder Using FPGA
Research Journal of Applied Sciences, Engineering and Technology 5(4): 1362-1372, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scientific Organization, 2013 Submitted: July 05, 2012 Accepted: August
More informationComputer Architecture 10. Residue Number Systems
Computer Architecture 10 Residue Number Systems Ma d e wi t h Op e n Of f i c e. o r g 1 A Puzzle What number has the reminders 2, 3 and 2 when divided by the numbers 7, 5 and 3? x mod 7 = 2 x mod 5 =
More informationA VLSI Algorithm for Modular Multiplication/Division
A VLSI Algorithm for Modular Multiplication/Division Marcelo E. Kaihara and Naofumi Takagi Department of Information Engineering Nagoya University Nagoya, 464-8603, Japan mkaihara@takagi.nuie.nagoya-u.ac.jp
More informationEECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs. Cross-coupled NOR gates
EECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs April 16, 2009 John Wawrzynek Spring 2009 EECS150 - Lec24-blocks Page 1 Cross-coupled NOR gates remember, If both R=0 & S=0, then
More informationFAST FIR ALGORITHM BASED AREA-EFFICIENT PARALLEL FIR DIGITAL FILTER STRUCTURES
FAST FIR ALGORITHM BASED AREA-EFFICIENT PARALLEL FIR DIGITAL FILTER STRUCTURES R.P.MEENAAKSHI SUNDHARI 1, Dr.R.ANITA 2 1 Department of ECE, Sasurie College of Engineering, Vijayamangalam, Tamilnadu, India.
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 8, August 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Efficient
More informationOn LUT Cascade Realizations of FIR Filters
On LUT Cascade Realizations of FIR Filters Tsutomu Sasao 1 Yukihiro Iguchi 2 Takahiro Suzuki 2 1 Kyushu Institute of Technology, Dept. of Comput. Science & Electronics, Iizuka 820-8502, Japan 2 Meiji University,
More informationFast Fir Algorithm Based Area- Efficient Parallel Fir Digital Filter Structures
Fast Fir Algorithm Based Area- Efficient Parallel Fir Digital Filter Structures Ms. P.THENMOZHI 1, Ms. C.THAMILARASI 2 and Mr. V.VENGATESHWARAN 3 Assistant Professor, Dept. of ECE, J.K.K.College of Technology,
More informationdoi: /TCAD
doi: 10.1109/TCAD.2006.870407 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 25, NO. 5, MAY 2006 789 Short Papers Analysis and Synthesis of Weighted-Sum Functions Tsutomu
More informationVolume 3, No. 1, January 2012 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at
Volume 3, No 1, January 2012 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at wwwjgrcsinfo A NOVEL HIGH DYNAMIC RANGE 5-MODULUS SET WHIT EFFICIENT REVERSE CONVERTER AND
More informationHigh Speed Time Efficient Reversible ALU Based Logic Gate Structure on Vertex Family
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 11, Issue 04 (April 2015), PP.72-77 High Speed Time Efficient Reversible ALU Based
More informationA Gray Code Based Time-to-Digital Converter Architecture and its FPGA Implementation
A Gray Code Based Time-to-Digital Converter Architecture and its FPGA Implementation Congbing Li Haruo Kobayashi Gunma University Gunma University Kobayashi Lab Outline Research Objective & Background
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Digital IC packages TTL (transistor-transistor
More informationEECS150 - Digital Design Lecture 24 - Arithmetic Blocks, Part 2 + Shifters
EECS150 - Digital Design Lecture 24 - Arithmetic Blocks, Part 2 + Shifters April 15, 2010 John Wawrzynek 1 Multiplication a 3 a 2 a 1 a 0 Multiplicand b 3 b 2 b 1 b 0 Multiplier X a 3 b 0 a 2 b 0 a 1 b
More informationGF(2 m ) arithmetic: summary
GF(2 m ) arithmetic: summary EE 387, Notes 18, Handout #32 Addition/subtraction: bitwise XOR (m gates/ops) Multiplication: bit serial (shift and add) bit parallel (combinational) subfield representation
More informationA 32-bit Decimal Floating-Point Logarithmic Converter
A 3-bit Decimal Floating-Point Logarithmic Converter Dongdong Chen 1, Yu Zhang 1, Younhee Choi 1, Moon Ho Lee, Seok-Bum Ko 1, Department of Electrical and Computer Engineering, University of Saskatchewan
More informationLogic and Computer Design Fundamentals. Chapter 8 Sequencing and Control
Logic and Computer Design Fundamentals Chapter 8 Sequencing and Control Datapath and Control Datapath - performs data transfer and processing operations Control Unit - Determines enabling and sequencing
More informationHardware Operator for Simultaneous Sine and Cosine Evaluation
Hardware Operator for Simultaneous Sine and Cosine Evaluation Arnaud Tisserand To cite this version: Arnaud Tisserand. Hardware Operator for Simultaneous Sine and Cosine Evaluation. ICASSP 6: International
More informationA COMBINED 16-BIT BINARY AND DUAL GALOIS FIELD MULTIPLIER. Jesus Garcia and Michael J. Schulte
A COMBINED 16-BIT BINARY AND DUAL GALOIS FIELD MULTIPLIER Jesus Garcia and Michael J. Schulte Lehigh University Department of Computer Science and Engineering Bethlehem, PA 15 ABSTRACT Galois field arithmetic
More informationMultivariate Gaussian Random Number Generator Targeting Specific Resource Utilization in an FPGA
Multivariate Gaussian Random Number Generator Targeting Specific Resource Utilization in an FPGA Chalermpol Saiprasert, Christos-Savvas Bouganis and George A. Constantinides Department of Electrical &
More informationDesign and Implementation of REA for Single Precision Floating Point Multiplier Using Reversible Logic
Design and Implementation of REA for Single Precision Floating Point Multiplier Using Reversible Logic MadivalappaTalakal 1, G.Jyothi 2, K.N.Muralidhara 3, M.Z.Kurian 4 PG Student [VLSI & ES], Dept. of
More informationTate Bilinear Pairing Core Specification. Author: Homer Hsing
Tate Bilinear Pairing Core Specification Author: Homer Hsing homer.hsing@gmail.com Rev. 0.1 March 4, 2012 This page has been intentionally left blank. www.opencores.org Rev 0.1 ii Revision History Rev.
More informationLOGIC CIRCUITS. Basic Experiment and Design of Electronics
Basic Experiment and Design of Electronics LOGIC CIRCUITS Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Combinational logic circuits Output
More informationInformation encoding and decoding using Residue Number System for {2 2n -1, 2 2n, 2 2n +1} moduli sets
Information encoding and decoding using Residue Number System for {2-1, 2, 2 +1} moduli sets Idris Abiodun Aremu Kazeem Alagbe Gbolagade Abstract- This paper presents the design methods of information
More informationChinese Remainder Algorithms. Çetin Kaya Koç Spring / 22
Chinese Remainder Algorithms http://koclab.org Çetin Kaya Koç Spring 2018 1 / 22 The Chinese Remainder Theorem Some cryptographic algorithms work with two (such as RSA) or more moduli (such as secret-sharing)
More informationEfficient random number generation on FPGA-s
Proceedings of the 9 th International Conference on Applied Informatics Eger, Hungary, January 29 February 1, 2014. Vol. 1. pp. 313 320 doi: 10.14794/ICAI.9.2014.1.313 Efficient random number generation
More informationLow Power, High Speed Parallel Architecture For Cyclic Convolution Based On Fermat Number Transform (FNT)
RESEARCH ARTICLE OPEN ACCESS Low Power, High Speed Parallel Architecture For Cyclic Convolution Based On Fermat Number Transform (FNT) T.Jyothsna 1 M.Tech, M.Pradeep 2 M.Tech 1 E.C.E department, shri Vishnu
More informationI. INTRODUCTION. CMOS Technology: An Introduction to QCA Technology As an. T. Srinivasa Padmaja, C. M. Sri Priya
International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2018 IJSRCSEIT Volume 3 Issue 5 ISSN : 2456-3307 Design and Implementation of Carry Look Ahead Adder
More informationLogic Design II (17.342) Spring Lecture Outline
Logic Design II (17.342) Spring 2012 Lecture Outline Class # 10 April 12, 2012 Dohn Bowden 1 Today s Lecture First half of the class Circuits for Arithmetic Operations Chapter 18 Should finish at least
More informationLecture 8: Sequential Multipliers
Lecture 8: Sequential Multipliers ECE 645 Computer Arithmetic 3/25/08 ECE 645 Computer Arithmetic Lecture Roadmap Sequential Multipliers Unsigned Signed Radix-2 Booth Recoding High-Radix Multiplication
More informationNovel Bit Adder Using Arithmetic Logic Unit of QCA Technology
Novel Bit Adder Using Arithmetic Logic Unit of QCA Technology Uppoju Shiva Jyothi M.Tech (ES & VLSI Design), Malla Reddy Engineering College For Women, Secunderabad. Abstract: Quantum cellular automata
More informationDIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute
DIGITAL TECHNICS Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 4. LECTURE: COMBINATIONAL LOGIC DESIGN: ARITHMETICS (THROUGH EXAMPLES) 2016/2017 COMBINATIONAL LOGIC DESIGN:
More informationDE58/DC58 LOGIC DESIGN DEC 2014
Q.2 a. In a base-5 number system, 3 digit representations is used. Find out (i) Number of distinct quantities that can be represented.(ii) Representation of highest decimal number in base-5. Since, r=5
More informationHARDWARE IMPLEMENTATION OF FIR/IIR DIGITAL FILTERS USING INTEGRAL STOCHASTIC COMPUTATION. Arash Ardakani, François Leduc-Primeau and Warren J.
HARWARE IMPLEMENTATION OF FIR/IIR IGITAL FILTERS USING INTEGRAL STOCHASTIC COMPUTATION Arash Ardakani, François Leduc-Primeau and Warren J. Gross epartment of Electrical and Computer Engineering McGill
More informationChinese Remainder Theorem
Chinese Remainder Theorem Çetin Kaya Koç koc@cs.ucsb.edu Çetin Kaya Koç http://koclab.org Winter 2017 1 / 16 The Chinese Remainder Theorem Some cryptographic algorithms work with two (such as RSA) or more
More informationSample Test Paper - I
Scheme G Sample Test Paper - I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fan-in iii) Fan-out b) Convert the following:
More informationIntroduction to Digital Logic Missouri S&T University CPE 2210 Subtractors
Introduction to Digital Logic Missouri S&T University CPE 2210 Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and Technology cetinkayae@mst.edu
More information9. Datapath Design. Jacob Abraham. Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017
9. Datapath Design Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin VLSI Design Fall 2017 October 2, 2017 ECE Department, University of Texas at Austin
More informationNCU EE -- DSP VLSI Design. Tsung-Han Tsai 1
NCU EE -- DSP VLSI Design. Tsung-Han Tsai 1 Multi-processor vs. Multi-computer architecture µp vs. DSP RISC vs. DSP RISC Reduced-instruction-set Register-to-register operation Higher throughput by using
More informationA Low-Error Statistical Fixed-Width Multiplier and Its Applications
A Low-Error Statistical Fixed-Width Multiplier and Its Applications Yuan-Ho Chen 1, Chih-Wen Lu 1, Hsin-Chen Chiang, Tsin-Yuan Chang, and Chin Hsia 3 1 Department of Engineering and System Science, National
More informationPerformance Evaluation of Signed-Digit Architecture for Weighted-to-Residue and Residue-to-Weighted Number Converters with Moduli Set (2 n 1, 2 n,
Regular Paper Performance Evaluation of Signed-Digit Architecture for Weighted-to-Residue and Residue-to-Weighted Number Converters with Moduli Set (2 n 1, 2 n, 2 n +1) Shuangching Chen and Shugang Wei
More informationDesign of Arithmetic Logic Unit (ALU) using Modified QCA Adder
Design of Arithmetic Logic Unit (ALU) using Modified QCA Adder M.S.Navya Deepthi M.Tech (VLSI), Department of ECE, BVC College of Engineering, Rajahmundry. Abstract: Quantum cellular automata (QCA) is
More informationAREA EFFICIENT MODULAR ADDER/SUBTRACTOR FOR RESIDUE MODULI
AREA EFFICIENT MODULAR ADDER/SUBTRACTOR FOR RESIDUE MODULI G.CHANDANA 1 (M.TECH),chandana.g89@gmail.com P.RAJINI 2 (M.TECH),paddam.rajani@gmail.com Abstract Efficient modular adders and subtractors for
More informationVectorized 128-bit Input FP16/FP32/ FP64 Floating-Point Multiplier
Vectorized 128-bit Input FP16/FP32/ FP64 Floating-Point Multiplier Espen Stenersen Master of Science in Electronics Submission date: June 2008 Supervisor: Per Gunnar Kjeldsberg, IET Co-supervisor: Torstein
More informationHardware Acceleration of the Tate Pairing in Characteristic Three
Hardware Acceleration of the Tate Pairing in Characteristic Three CHES 2005 Hardware Acceleration of the Tate Pairing in Characteristic Three Slide 1 Introduction Pairing based cryptography is a (fairly)
More informationImplementation of Nonlinear Template Runner Emulated Digital CNN-UM on FPGA
Implementation of Nonlinear Template Runner Emulated Digital CNN-UM on FPGA Z. Kincses * Z. Nagy P. Szolgay * Department of Image Processing and Neurocomputing, University of Pannonia, Hungary * e-mail:
More informationECE380 Digital Logic. Positional representation
ECE380 Digital Logic Number Representation and Arithmetic Circuits: Number Representation and Unsigned Addition Dr. D. J. Jackson Lecture 16-1 Positional representation First consider integers Begin with
More informationA NOVEL APPROACH FOR HIGH SPEED CONVOLUTION OF FINITE AND INFINITE LENGTH SEQUENCES USING VEDIC MATHEMATICS
A NOVEL APPROACH FOR HIGH SPEED CONVOLUTION OF FINITE AND INFINITE LENGTH SEQUENCES USING VEDIC MATHEMATICS M. Bharathi 1, D. Leela Rani 2 1 Assistant Professor, 2 Associate Professor, Department of ECE,
More informationEECS150 - Digital Design Lecture 11 - Shifters & Counters. Register Summary
EECS50 - Digital Design Lecture - Shifters & Counters February 24, 2003 John Wawrzynek Spring 2005 EECS50 - Lec-counters Page Register Summary All registers (this semester) based on Flip-flops: q 3 q 2
More informationCHAPTER 2 NUMBER SYSTEMS
CHAPTER 2 NUMBER SYSTEMS The Decimal Number System : We begin our study of the number systems with the familiar decimal number system. The decimal system contains ten unique symbol 0, 1, 2, 3, 4, 5, 6,
More informationEfficient Polynomial Evaluation Algorithm and Implementation on FPGA
Efficient Polynomial Evaluation Algorithm and Implementation on FPGA by Simin Xu School of Computer Engineering A thesis submitted to Nanyang Technological University in partial fullfillment of the requirements
More informationA Novel Efficient Hardware Implementation of Elliptic Curve Cryptography Scalar Multiplication using Vedic Multiplier
A Novel Efficient Hardware Implementation of Elliptic Curve Cryptography Scalar Multiplication using Vedic Multiplier Rakesh K. Kadu Department of Computer Technology YCCE, Nagpur, India rakeshkadu@gmail.com
More informationABHELSINKI UNIVERSITY OF TECHNOLOGY
On Repeated Squarings in Binary Fields Kimmo Järvinen Helsinki University of Technology August 14, 2009 K. Järvinen On Repeated Squarings in Binary Fields 1/1 Introduction Repeated squaring Repeated squaring:
More informationTHE discrete sine transform (DST) and the discrete cosine
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS-II: EXPRESS BIREFS 1 New Systolic Algorithm and Array Architecture for Prime-Length Discrete Sine Transform Pramod K. Meher Senior Member, IEEE and M. N. S. Swamy
More informationElliptic Curve Group Core Specification. Author: Homer Hsing
Elliptic Curve Group Core Specification Author: Homer Hsing homer.hsing@gmail.com Rev. 0.1 March 4, 2012 This page has been intentionally left blank. www.opencores.org Rev 0.1 ii Revision History Rev.
More informationA HIGH-SPEED PROCESSOR FOR RECTANGULAR-TO-POLAR CONVERSION WITH APPLICATIONS IN DIGITAL COMMUNICATIONS *
Copyright IEEE 999: Published in the Proceedings of Globecom 999, Rio de Janeiro, Dec 5-9, 999 A HIGH-SPEED PROCESSOR FOR RECTAGULAR-TO-POLAR COVERSIO WITH APPLICATIOS I DIGITAL COMMUICATIOS * Dengwei
More informationA Parallel Method for the Computation of Matrix Exponential based on Truncated Neumann Series
A Parallel Method for the Computation of Matrix Exponential based on Truncated Neumann Series V. S. Dimitrov 12, V. Ariyarathna 3, D. F. G. Coelho 1, L. Rakai 1, A. Madanayake 3, R. J. Cintra 4 1 ECE Department,
More informationDesign and Implementation of High Speed CRC Generators
Department of ECE, Adhiyamaan College of Engineering, Hosur, Tamilnadu, India Design and Implementation of High Speed CRC Generators ChidambarakumarS 1, Thaky Ahmed 2, UbaidullahMM 3, VenketeshK 4, JSubhash
More informationAn Implementation of an Address Generator Using Hash Memories
An Implementation of an Address Generator Using Memories Tsutomu Sasao and Munehiro Matsuura Department of Computer Science and Electronics, Kyushu Institute of Technology, Iizuka 820-8502, Japan Abstract
More informationDSP Configurations. responded with: thus the system function for this filter would be
DSP Configurations In this lecture we discuss the different physical (or software) configurations that can be used to actually realize or implement DSP functions. Recall that the general form of a DSP
More informationCOVER SHEET: Problem#: Points
EEL 4712 Midterm 3 Spring 2017 VERSION 1 Name: UFID: Sign here to give permission for your test to be returned in class, where others might see your score: IMPORTANT: Please be neat and write (or draw)
More informationAddition of QSD intermediat e carry and sum. Carry/Sum Generation. Fig:1 Block Diagram of QSD Addition
1216 DESIGN AND ANALYSIS OF FAST ADDITION MECHANISM FOR INTEGERS USING QUATERNARY SIGNED DIGIT NUMBER SYSTEM G.MANASA 1, M.DAMODHAR RAO 2, K.MIRANJI 3 1 PG Student, ECE Department, Gudlavalleru Engineering
More informationOptimizing Loop Operation and Dataflow in FPGA Acceleration of Deep Convolutional Neural Networks
2017 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays Optimizing Loop Operation and Dataflow in FPGA Acceleration of Deep Convolutional Neural Networks Yufei Ma, Yu Cao, Sarma Vrudhula,
More informationProduct Obsolete/Under Obsolescence. Quantization. Author: Latha Pillai
Application Note: Virtex and Virtex-II Series XAPP615 (v1.1) June 25, 2003 R Quantization Author: Latha Pillai Summary This application note describes a reference design to do a quantization and inverse
More informationIntroduction to the Xilinx Spartan-3E
Introduction to the Xilinx Spartan-3E Nash Kaminski Instructor: Dr. Jafar Saniie ECE597 Illinois Institute of Technology Acknowledgment: I acknowledge that all of the work (including figures and code)
More informationFPGA Implementation of Ripple Carry and Carry Look Ahead Adders Using Reversible Logic Gates
FPGA Implementation of Ripple Carry and Carry Look Ahead Adders Using Reversible Logic Gates K. Rajesh 1 and Prof. G. Umamaheswara Reddy 2 Department of Electronics and Communication Engineering, SVU College
More informationBinary Multipliers. Reading: Study Chapter 3. The key trick of multiplication is memorizing a digit-to-digit table Everything else was just adding
Binary Multipliers The key trick of multiplication is memorizing a digit-to-digit table Everything else was just adding 2 3 4 5 6 7 8 9 2 3 4 5 6 7 8 9 2 2 4 6 8 2 4 6 8 3 3 6 9 2 5 8 2 24 27 4 4 8 2 6
More informationHardware Design I Chap. 4 Representative combinational logic
Hardware Design I Chap. 4 Representative combinational logic E-mail: shimada@is.naist.jp Already optimized circuits There are many optimized circuits which are well used You can reduce your design workload
More informationISSN (PRINT): , (ONLINE): , VOLUME-5, ISSUE-7,
HIGH PERFORMANCE MONTGOMERY MULTIPLICATION USING DADDA TREE ADDITION Thandri Adi Varalakshmi Devi 1, P Subhashini 2 1 PG Scholar, Dept of ECE, Kakinada Institute of Technology, Korangi, AP, India. 2 Assistant
More informationDesign of Sequential Circuits
Design of Sequential Circuits Seven Steps: Construct a state diagram (showing contents of flip flop and inputs with next state) Assign letter variables to each flip flop and each input and output variable
More informationVHDL DESIGN AND IMPLEMENTATION OF C.P.U BY REVERSIBLE LOGIC GATES
VHDL DESIGN AND IMPLEMENTATION OF C.P.U BY REVERSIBLE LOGIC GATES 1.Devarasetty Vinod Kumar/ M.tech,2. Dr. Tata Jagannadha Swamy/Professor, Dept of Electronics and Commn. Engineering, Gokaraju Rangaraju
More informationHigh Performance GHASH Function for Long Messages
High Performance GHASH Function for Long Messages Nicolas Méloni 1, Christophe Négre 2 and M. Anwar Hasan 1 1 Department of Electrical and Computer Engineering University of Waterloo, Canada 2 Team DALI/ELIAUS
More informationTunable Floating-Point for Energy Efficient Accelerators
Tunable Floating-Point for Energy Efficient Accelerators Alberto Nannarelli DTU Compute, Technical University of Denmark 25 th IEEE Symposium on Computer Arithmetic A. Nannarelli (DTU Compute) Tunable
More informationDigital/Analog Arithmetic with Continuous-Valued Residues
Digital/Analog Arithmetic with Continuous-Valued Residues Behrooz Parhami Department of Electrical and Computer Engineering University of California, Santa Barbara, USA parhami@ece.ucsb.edu Abstract Residue
More informationCost/Performance Tradeoff of n-select Square Root Implementations
Australian Computer Science Communications, Vol.22, No.4, 2, pp.9 6, IEEE Comp. Society Press Cost/Performance Tradeoff of n-select Square Root Implementations Wanming Chu and Yamin Li Computer Architecture
More informationChapter 5. Digital Design and Computer Architecture, 2 nd Edition. David Money Harris and Sarah L. Harris. Chapter 5 <1>
Chapter 5 Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris Chapter 5 Chapter 5 :: Topics Introduction Arithmetic Circuits umber Systems Sequential Building
More informationDesign and Implementation of a Low Power RSA Processor for Smartcard
I.J.Modern Education and Computer Science, 2011, 3, 8-14 Published Online June 2011 in MECS (http://www.mecs-press.org/) esign and Implementation of a Low Power RSA Processor for Smartcard Zhen Huang Institute
More information