A New Family of High-Performance Parallel Decimal Multipliers*
|
|
|
- Estella Spencer
- 5 years ago
- Views:
Transcription
1 A New Family of High-Performance Parallel Decimal Multipliers* Alvaro Vázquez, Elisardo Antelo Dept. of Electronic and Computer Science University of Santiago de Compostela Spain Paolo Montuschi Dept. of Computer Engineering Politecnico di Torino Italy *A. Vázquez and E. Antelo supported in part by the Ministry of Science and Technology of Spain under contract TIN C02 and Xunta de Galicia under contract PGIDT03TIC10502PR. ARITH 18 - Montpellier, France. June 25-27,
2 Outline Introduction. Previous work. Implementation of decimal parallel multiplication: Fast carry-save addition using non conventional BCD. Design of high-performance decimal p:2 CSAs. Parallel partial product generation. Architectures. Signed-digit (SD) Radix-10. SD Radix-4/Radix-5 (combined binary/decimal). Evaluation and Comparison. Conclusions. ARITH 18 - Montpellier, France. June 25-27,
3 Introduction High-performance decimal floating-point units. Parallel multiplier: scaling performance by pipelining. Multiplication stages: 1. Generation of partial products (PPG) 2. Reduction of partial products (PPR) 3. Conversion to non-redundant representation. Problems of decimal implementation: High value-range for decimal digits (0-9) PPG Inefficiency of conventional BCD coding PPG, PPR ARITH 18 - Montpellier, France. June 25-27,
4 Previous Work on Decimal Multiplication Previous proposals for PPG 1. Direct generation of partial products (digit-by-digit) 2. Using multiplicand multiples (X,2X,3X,4X,,9X). Direct implementation. SD multiplier. [Ex. 2 radix5 digits (-5X, 5X) (-2X,-X, X,2X)] Previous proposals for PPR 1. Carry-save BCD a. Full BCD operands (3:2 CSAs + correction) b. Carry operand 1 bit each 4-bit. (4-bit decimal CPAs) 2. Signed-digit representation for decimal digits. SD adders more complex than CSA based implementations. ARITH 18 - Montpellier, France. June 25-27,
5 Proposed techniques X multiplicand, Y multiplier BCD integer words. BCD digit represented as: 3 BCD-8421 (r j =2 j ) Z i = j = 0 z i, j 1. Decimal carry-save addition using BCD Implementation of decimal CSAs for PPR. 3. Implementation of PPG using multiplier recoding: SD radix-10 SD radix-4. SD radix-5. r j BCD-4221 (r 3,r 2,r 1,r 0 ) = (4,2,2,1) BCD-5211 (r 3,r 2,r 1,r 0 ) = (5,2,1,1) ARITH 18 - Montpellier, France. June 25-27,
6 Decimal carry-save addition (BCD-8421) Add 3 decimal digits to produce 2 decimal digits (sum and carry digits). A i : A i +B i +C i = S i +2H i A i,b i,c i,s i,h i є[0,9] a i,j b i,j c i,j 2H i є[0,18] and even B i : :2 CSA C i : S i : 2H i : H i : Carry-out A i +B i +C i = S i +2H i = 20 Carry-in s i,j = Xor(a i,j,b i,j,c i,j ) h i,j = a i,j b i,j + (a i,j + b i,j ) c i,j PROBLEM WITH BCD-8421 Input digits in [0,9] BUT Sum digit out of decimal range [0,9] ->[0,16] Sum digits require correction ARITH 18 - Montpellier, France. June 25-27,
7 Decimal carry-save addition (BCD-4221) H i : S i : 2H i : A i : B i : C i : Carry-out Add 3 decimal digits to produce 2 decimal digits (sum and carry digits). A i +B i +C i = S i +2H i = S i +L1-shift(W i ) W i : (BCD-5211) L1-shift (W i ) A i +B i +C i = S i +2H i = 20 Carry-in a i,j b i,j c i,j 3:2 CSA s i,j = Xor(a i,j,b i,j,c i,j ) h i,j = a i,j b i,j + (a i,j + b i,j ) c i,j SOLUTION WITH BCD-4221 A i,b i,c i,s i,h i,w i є[0,9] Input digits in [0,9] and Sum digit always in range [0,9]. ARITH 18 - Montpellier, France. June 25-27,
8 Decimal carry-save addition (BCD-5211) A i : B i : C i : S i : H i : H i : Carry-out Add 3 decimal digits to produce 2 decimal digits (sum and carry digits). A i +B i +C i = S i +2H i = S i +L1-shift(H i ) BCD A i +B i +C i = S i +2H i = 20 Carry-in L1-shift BCD-4221 BCD-5211 a i,j b i,j c i,j 3:2 CSA s i,j = Xor(a i,j,b i,j,c i,j ) h i,j = a i,j b i,j + (a i,j + b i,j ) c i,j SOLUTION WITH BCD-5211 A i,b i,c i,s i,h i є[0,9] Input digits in [0,9] and Sum digit always in range [0,9]. ARITH 18 - Montpellier, France. June 25-27,
9 Decimal multiplication by ±2 n and ±5 n Multiplication by 2 BCD-4221 Digit recoding BCD L1-SHIFT BCD Multiplication by 5 BCD-4221 L3-SHIFT BCD-5211 BCD-4221 Negative operands (10 s s complement) by bit inversion (2 s s complement) BCD-4221 x x x Digit recoding Bit-complement BCD = Hot-one ARITH 18 - Montpellier, France. June 25-27, x5 x x100 x x100 x
10 Proposed decimal 3:2 CSA (BCD-4221) A i +B i +C i = S i +2H i = S i +L1-shift(W i ) ARITH 18 - Montpellier, France. June 25-27,
11 Proposed decimal 3:2 CSA (BCD-4221) BCD-4221 BCD Critical path Digit recoder BCD-4221 to BCD-5211 AREA: 18 NAND (0.35 times 4-bit 3:2 CSA area) DELAY: 4 FO4 (0.9 times binary 3:2 CSA delay) Decimal (digit) 3:2 CSA AREA: 66 NAND2 (1.35 times 4-bit 3:2 CSA area) *DELAY: 1.4 times carry path/same sum path *Ratio respect sum path (critical path) delay of bin. 3:2 CSA. ARITH 18 - Montpellier, France. June 25-27,
12 Decimal CSA tree (BCD-4221) 4-bit 3:2 4-bit 3:2 4-bit 3:2 4-bit 3:2 Mux 2:1 For combined Decimal/Binary CSA 4-bit 3:2 Critical path 4-bit 3:2 4-bit 3:2 Example: 9:2 Decimal CSA (digit slice) area ratio resp. binary CSA delay ratio resp. binary CSA. Hardware complexity (1 digit): 4-bit 3to2: 7x48 NAND2 Digit recoder (): 7x18 NAND2. Critical path delay: 1-bit 3to2: 4.5/2.2 FO4 (2/1 XOR) Recoder: 4 FO4 (1.75 XOR) 9:2 Decimal CSA: 25 FO4. 9:2 Binary CSA: 18 FO4. ARITH 18 - Montpellier, France. June 25-27,
13 Decimal CSA tree BCD-4221 (area-optimized) 4-bit 3:2 4-bit 3:2 4-bit 3:2 Critical path x1 4-bit 3:2 4-bit 3:2 4-bit 3:2 Example: 9:2 Decimal CSA (digit slice). Area optimization: Group inputs with similar multiplicative factor area ratio resp. binary CSA delay ratio resp. binary CSA. Hardware complexity (1 digit): 4-bit 3to2: 7x48 NAND2 Digit recoder (): 5x18 NAND2. x1 Critical path delay: 4-bit 3:2 9:2 Decimal CSA: 25 FO4. 9:2 Binary CSA: 18 FO4. ARITH 18 - Montpellier, France. June 25-27,
14 SD radix-10 multiplier recoding Multiplicand X (BCD-4221) 4d Multiplier Y (BCD-8421) Y i є [0,9] x5 4 SD radix-10 digit recoder 4d-bit decimal adder Mult. multiples gen. 5 1 Yb i є [-5,5] (hot-one code) X 2X 3X 4X 5X Mux-5 (recoded sign) 4d Integer d-digit precision operands 1 SD radix-10 digit/multiplicand digit d+1 partial products (additional encoded SD radix-10 digit) ARITH 18 - Montpellier, France. June 25-27,
15 SD radix-4 multiplier recoding Multiplicand X (BCD-4221) 4d Multiplier Y (BCD-8421) Y i є [0,9] 4 SD radix-4 digit recoder Yb i = Y U i 4+ YL i Y U i є [0,2] Y L i є [-2,2] 8X 4X 2X X Mult. multiples gen. (hot-one code) Mux-2 Mux-2 (recoded sign) 4d 4d Integer d-digit precision operands 2 SD radix-4 digit/multiplicand digit 2d partial products ARITH 18 - Montpellier, France. June 25-27,
16 SD radix-5 multiplier recoding Multiplicand X (BCD-4221) 4d Multiplier Y (BCD-8421) Y i є [0,9] x10 x5 4 SD radix-5 digit recoder 10X 4-bit left wired shift 5X Mux-2 2X X Mux-2 Mult. multiples gen. Y U i є [0,2] 2 (recoded sign) 2 (hot-one code) 1 Yb i = YU i 5+ YL i Y L i є [-2,2] 4d 4d Integer d-digit precision operands 2 SD radix-5 digit/multiplicand digit. 2d partial products Simple PPG: area/latency figures similar as Booth radix-4. ARITH 18 - Montpellier, France. June 25-27,
17 Radix-10 architecture X Mult. multiples gen. X 2X 3X 4X 5X 17x partial products Decimal 17:2 CSA tree 128 Mux bit Decimal Adder Y SD radix-10 recoder 17x5 16 (recoded signs) Z= X x Y only decimal multiplications. 16 BCD-digit (64 bits) significands (IEEE-754r Decimal64 format). SD radix-10 multiplier recoding. 17 partial products generated. Z 64 Easily pipelined. ARITH 18 - Montpellier, France. June 25-27,
18 Radix-4/5 architecture X Y Mult. multiples gen. SD radix-4/5 recoder Can perform binary/decimal multiplications Z= X x Y. 10X/8X Mux-2 5X/4X 2X X Mux-2 32x5 32x5 16 (recoded signs) SD radix-5/4 multiplier recoding (2 SD digits/bcd digit) 16x 64 16x partial products Decimal 32:2 CSA tree 32 partial products generated. Easily pipelined bit Decimal Adder Z 64 ARITH 18 - Montpellier, France. June 25-27,
19 Evaluation results Area-delay model based on logical effort (delay in FO4;area in NAND2) Architecture Delay Area (64-bits) (FO4) Ratio (Nand2) Ratio Bin. radix-4 Bin. radix-8 Dec. radix-4 Dec. radix-5 Bin/dec. radix-4 Bin/dec. radix-4/5 Dec. Radix-10 Proposed in [8] /75 61/ / / ARITH 18 - Montpellier, France. June 25-27, [8] T. Lang and A. Nannarelli. A radix-10 combinational multiplier. Proc. 40th Asilomar Conf. on Signals, Systems, and Computers, pp , Oct
20 Comparison of decimal carry-free trees Architecture carry-free adder Binary 16:2 CSA Decimal 16:2 CSA (area optimized) SD tree [5,14] 4-bit CLA tree [4,7] Delay Ratio Area Ratio Binary Our Proposal Other proposals BCD-8421 CSA [11] Non Spec. CSA [6] [4] M. A. Erle and M. J. Schulte. Decimal multiplication via carry-save addition. In Proc. IEEE Int l Conference on Application-Specific Systems, Architectures, and Processors, pp , June [5] M. A. Erle, E. M. Schwarz, and M. J. Schulte. Decimal multiplication with efficient partial product generation. Proc. IEEE 17th Symposium on Computer Arithmetic, pp , June [6] R. D. Kenney and M. J. Schulte. High-speed multioperand decimal adders. IEEE Trans. on Computers, 54(8): , Aug [7] R. D. Kenney, M. J. Schulte, and M. A. Erle. High-frequency decimal multiplier. In Proc. IEEE Int l Conference on ComputerDesign: VLSI in Computers and Processors, pp , Oct [11] T. Ohtsuki. Apparatus for decimal multiplication. U.S.Patent No. 4,677,583, June [14] B. Shirazi, D. Y. Y. Yun, and C. N. Zhang. RBCD: Redundant binary coded decimal adder. IEE Proc - Computers and Digital Techniques, 136(2): , Mar ARITH 18 - Montpellier, France. June 25-27,
21 Conclusions New family of parallel decimal multipliers: decimal radix-10 and combined radix-4/5 architectures. Decimal carry-save addition algorithm using BCD-4221 (also valid for BCD-5211). Efficient designs of decimal p:2 CSA trees for PPR. Parallel PPG using multiplicand multiples and three different SD recodings of the multiplier. Area-delay figures outstand other proposals and comparable to binary parallel multipliers (1.3/1.1 latency/area ratios for decimal SD radix-5 resp. binary Booth radix-4). Future work: decimal floating-point VLSI implementations. ARITH 18 - Montpellier, France. June 25-27,
CHAPTER 4 RESULTS & DISCUSSION
CHAPTER 4 RESULTS & DISCUSSION 3.2 Introduction This project aims to prove that Modified Baugh-Wooley Two s Complement Signed Multiplier is one of the high speed multipliers. The schematic of the multiplier
ALONG with the progressive device scaling, semiconductor
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 57, NO. 4, APRIL 2010 285 LUT Optimization for Memory-Based Computation Pramod Kumar Meher, Senior Member, IEEE Abstract Recently, we
Implementation of Memory Based Multiplication Using Micro wind Software
Implementation of Memory Based Multiplication Using Micro wind Software U.Palani 1, M.Sujith 2,P.Pugazhendiran 3 1 IFET College of Engineering, Department of Information Technology, Villupuram 2,3 IFET
An Efficient High Speed Wallace Tree Multiplier
Chepuri satish,panem charan Arur,G.Kishore Kumar and G.Mamatha 38 An Efficient High Speed Wallace Tree Multiplier Chepuri satish, Panem charan Arur, G.Kishore Kumar and G.Mamatha Abstract: The Wallace
An Efficient Reduction of Area in Multistandard Transform Core
An Efficient Reduction of Area in Multistandard Transform Core A. Shanmuga Priya 1, Dr. T. K. Shanthi 2 1 PG scholar, Applied Electronics, Department of ECE, 2 Assosiate Professor, Department of ECE Thanthai
A Novel Architecture of LUT Design Optimization for DSP Applications
A Novel Architecture of LUT Design Optimization for DSP Applications O. Anjaneyulu 1, Parsha Srikanth 2 & C. V. Krishna Reddy 3 1&2 KITS, Warangal, 3 NNRESGI, Hyderabad E-mail : anjaneyulu_o@yahoo.com
An MFA Binary Counter for Low Power Application
Volume 118 No. 20 2018, 4947-4954 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu An MFA Binary Counter for Low Power Application Sneha P Department of ECE PSNA CET, Dindigul, India
Design of Carry Select Adder using Binary to Excess-3 Converter in VHDL
Journal From the SelectedWorks of Kirat Pal Singh Summer May 18, 2016 Design of Carry Select Adder using Binary to Excess-3 Converter in VHDL Brijesh Kumar, Vaagdevi college of engg. Pune, Andra Pradesh,
Implementation of Low Power and Area Efficient Carry Select Adder
International Journal of Engineering Science Invention ISSN (Online): 2319 6734, ISSN (Print): 2319 6726 Volume 3 Issue 8 ǁ August 2014 ǁ PP.36-48 Implementation of Low Power and Area Efficient Carry Select
Combinational Logic Design
Lab #2 Combinational Logic Design Objective: To introduce the design of some fundamental combinational logic building blocks. Preparation: Read the following experiment and complete the circuits where
VLSI IEEE Projects Titles LeMeniz Infotech
VLSI IEEE Projects Titles -2019 LeMeniz Infotech 36, 100 feet Road, Natesan Nagar(Near Indira Gandhi Statue and Next to Fish-O-Fish), Pondicherry-605 005 Web : www.ieeemaster.com / www.lemenizinfotech.com
Implementation and Analysis of Area Efficient Architectures for CSLA by using CLA
Volume-6, Issue-3, May-June 2016 International Journal of Engineering and Management Research Page Number: 753-757 Implementation and Analysis of Area Efficient Architectures for CSLA by using CLA Anshu
LUT Optimization for Memory Based Computation using Modified OMS Technique
LUT Optimization for Memory Based Computation using Modified OMS Technique Indrajit Shankar Acharya & Ruhan Bevi Dept. of ECE, SRM University, Chennai, India E-mail : indrajitac123@gmail.com, ruhanmady@yahoo.co.in
Design of Memory Based Implementation Using LUT Multiplier
Design of Memory Based Implementation Using LUT Multiplier Charan Kumar.k 1, S. Vikrama Narasimha Reddy 2, Neelima Koppala 3 1,2 M.Tech(VLSI) Student, 3 Assistant Professor, ECE Department, Sree Vidyanikethan
Hardware Modeling of Binary Coded Decimal Adder in Field Programmable Gate Array
American Journal of Applied Sciences 10 (5): 466-477, 2013 ISSN: 1546-9239 2013 M.I. Ibrahimy et al., This open access article is distributed under a Creative Commons Attribution (CC-BY) 3.0 license doi:10.3844/ajassp.2013.466.477
FPGA IMPEMENTATION OF LOW POWER AND AREA EFFICIENT CARRY SELECT ADDER
FPGA IMPEMENTATION OF LOW POWER AND AREA EFFICIENT CARRY SELECT ADDER A.Nithya [3],A.G.Priyanka [3],B.Ajitha [3],D.Gracia Nirmala Rani [2],S.Rajaram [1] [1]- Associate Professor, [2]- Assistant Professor,
Reconfigurable Fir Digital Filter Realization on FPGA
Reconfigurable Fir Digital Filter Realization on FPGA Atmakuri Vasavi 1 Sita Madhuri Bondila 2 1 PG Student (M.Tech), Dept. of ECE, Gandhiji Institute of Science & Tech., Jaggaiahpeta, AP, India 2 Assistant
OMS Based LUT Optimization
International Journal of Advanced Education and Research ISSN: 2455-5746, Impact Factor: RJIF 5.34 www.newresearchjournal.com/education Volume 1; Issue 5; May 2016; Page No. 11-15 OMS Based LUT Optimization
Implementation of efficient carry select adder on FPGA
Journal From the SelectedWorks of Kirat Pal Singh Summer May 18, 2016 Implementation of efficient carry select adder on FPGA Balaji Goswami, RajLakshmi Engineering College, Tamil Nadu, India Ms. Priya,
FPGA Implementation of Low Power and Area Efficient Carry Select Adder
Journal From the SelectedWorks of Kirat Pal Singh Summer July 17, 2014 FPGA Implementation of Low Power and Area Efficient Carry Select Adder A. Nithya, Thiagarajar College of Engineering, Madurai, India
Design and Implementation of Partial Reconfigurable Fir Filter Using Distributed Arithmetic Architecture
Design and Implementation of Partial Reconfigurable Fir Filter Using Distributed Arithmetic Architecture Vinaykumar Bagali 1, Deepika S Karishankari 2 1 Asst Prof, Electrical and Electronics Dept, BLDEA
DESIGN OF HIGH PERFORMANCE, AREA EFFICIENT FIR FILTER USING CARRY SELECT ADDER
DESIGN OF HIGH PERFORMANCE, AREA EFFICIENT FIR FILTER USING CARRY SELECT ADDER G. Vijayalakshmi, A. Nithyalakshmi, J. Priyadarshini Assistant Professor, ECE, Prince Shri Venkateshwara Padmavathy Engg College,
International Journal of Engineering Trends and Technology (IJETT) - Volume4 Issue8- August 2013
International Journal of Engineering Trends and Technology (IJETT) - Volume4 Issue8- August 2013 Design and Implementation of an Enhanced LUT System in Security Based Computation dama.dhanalakshmi 1, K.Annapurna
Memory efficient Distributed architecture LUT Design using Unified Architecture
Research Article Memory efficient Distributed architecture LUT Design using Unified Architecture Authors: 1 S.M.L.V.K. Durga, 2 N.S. Govind. Address for Correspondence: 1 M.Tech II Year, ECE Dept., ASR
1. True/False Questions (10 x 1p each = 10p) (a) I forgot to write down my name and student ID number.
CprE 281: Digital Logic Midterm 2: Friday Oct 30, 2015 Student Name: Student ID Number: Lab Section: Mon 9-12(N) Mon 12-3(P) Mon 5-8(R) Tue 11-2(U) (circle one) Tue 2-5(M) Wed 8-11(J) Wed 6-9(Y) Thur 11-2(Q)
A High-Speed Low-Power Modulo 2 n +1 Multiplier Design Using Carbon-Nanotube Technology
A High-Speed Low-Power Modulo 2 n +1 Multiplier Design Using Carbon-Nanotube Technology A Thesis Presented by He Qi to The Department of Electrical and Computer Engineering in partial fulfillment of the
Implementation of Area Efficient Memory-Based FIR Digital Filter Using LUT-Multiplier
Implementation of Area Efficient Memory-Based FIR Digital Filter Using LUT-Multiplier K.Purnima, S.AdiLakshmi, M.Jyothi Department of ECE, K L University Vijayawada, INDIA Abstract Memory based structures
Design and Analysis of Modified Fast Compressors for MAC Unit
Design and Analysis of Modified Fast Compressors for MAC Unit Anusree T U 1, Bonifus P L 2 1 PG Student & Dept. of ECE & Rajagiri School of Engineering & Technology 2 Assistant Professor & Dept. of ECE
Find the equivalent decimal value for the given value Other number system to decimal ( Sample)
VELAMMAL COLLEGE OF ENGINEERING AND TECHNOLOGY, MADURAI 65 009 Department of Information Technology Model Exam-II-Question bank PART A (Answer for all Questions) (8 X = 6) K CO Marks Find the equivalent
Midterm Exam 15 points total. March 28, 2011
Midterm Exam 15 points total March 28, 2011 Part I Analytical Problems 1. (1.5 points) A. Convert to decimal, compare, and arrange in ascending order the following numbers encoded using various binary
Research Article VLSI Architecture Using a Modified SQRT Carry Select Adder in Image Compression
Research Journal of Applied Sciences, Engineering and Technology 11(1): 14-18, 2015 DOI: 10.19026/rjaset.11.1670 ISSN: 2040-7459; e-issn: 2040-7467 2015 Maxwell Scientific Publication Corp. Submitted:
Design and Implementation of LUT Optimization DSP Techniques
Design and Implementation of LUT Optimization DSP Techniques 1 D. Srinivasa rao & 2 C. Amala 1 M.Tech Research Scholar, Priyadarshini Institute of Technology & Science, Chintalapudi 2 Associate Professor,
A Fast Constant Coefficient Multiplier for the XC6200
A Fast Constant Coefficient Multiplier for the XC6200 Tom Kean, Bernie New and Bob Slous Xilinx Inc. Abstract. We discuss the design of a high performance constant coefficient multiplier on the Xilinx
The main design objective in adder design are area, speed and power. Carry Select Adder (CSLA) is one of the fastest
ISSN: 0975-766X CODEN: IJPTFI Available Online through Research Article www.ijptonline.com IMPLEMENTATION OF FAST SQUARE ROOT SELECT WITH LOW POWER CONSUMPTION V.Elanangai*, Dr. K.Vasanth Department of
Efficient Implementation of Multi Stage SQRT Carry Select Adder
International Journal of Research Studies in Science, Engineering and Technology Volume 2, Issue 8, August 2015, PP 31-36 ISSN 2349-4751 (Print) & ISSN 2349-476X (Online) Efficient Implementation of Multi
An Efficient 64-Bit Carry Select Adder With Less Delay And Reduced Area Application
An Efficient 64-Bit Carry Select Adder With Less Delay And Reduced Area Application K Allipeera, M.Tech Student & S Ahmed Basha, Assitant Professor Department of Electronics & Communication Engineering
FUNCTIONS OF COMBINATIONAL LOGIC
FUNCTIONS OF COMBINATIONAL LOGIC Agenda Adders Comparators Decoders Encoders Multiplexers Demultiplexers Adders Basic Adders Adders are important in computers other types of digital systems in which numerical
Implementation of High Speed Adder using DLATCH
International Journal of Emerging Engineering Research and Technology Volume 3, Issue 12, December 2015, PP 162-172 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) Implementation of High Speed Adder using
Keywords Xilinx ISE, LUT, FIR System, SDR, Spectrum- Sensing, FPGA, Memory- optimization, A-OMS LUT.
An Advanced and Area Optimized L.U.T Design using A.P.C. and O.M.S K.Sreelakshmi, A.Srinivasa Rao Department of Electronics and Communication Engineering Nimra College of Engineering and Technology Krishna
128 BIT CARRY SELECT ADDER USING BINARY TO EXCESS-ONE CONVERTER FOR DELAY REDUCTION AND AREA EFFICIENCY
128 BIT CARRY SELECT ADDER USING BINARY TO EXCESS-ONE CONVERTER FOR DELAY REDUCTION AND AREA EFFICIENCY 1 Mrs.K.K. Varalaxmi, M.Tech, Assoc. Professor, ECE Department, 1varuhello@Gmail.Com 2 Shaik Shamshad
An Efficient Carry Select Adder
An Efficient Carry Select Adder with Reduced Area Application M.Manjula M.Tech,Panem Charan Aurora M.Tech, Bogati Vijaya Bhaskar Reddy, Vendidandi Ajith Babu, Kethu Dinesh,S.K.Mahmod Rafi UG Students[
Modified Reconfigurable Fir Filter Design Using Look up Table
Modified Reconfigurable Fir Filter Design Using Look up Table R. Dhayabarani, Assistant Professor. M. Poovitha, PG scholar, V.S.B Engineering College, Karur, Tamil Nadu. Abstract - Memory based structures
6.3 Sequential Circuits (plus a few Combinational)
6.3 Sequential Circuits (plus a few Combinational) Logic Gates: Fundamental Building Blocks Introduction to Computer Science Robert Sedgewick and Kevin Wayne Copyright 2005 http://www.cs.princeton.edu/introcs
Design and Implementation of High Speed 256-Bit Modified Square Root Carry Select Adder
Design and Implementation of High Speed 256-Bit Modified Square Root Carry Select Adder Muralidharan.R [1], Jodhi Mohana Monica [2], Meenakshi.R [3], Lokeshwaran.R [4] B.Tech Student, Department of Electronics
ISSN:
427 AN EFFICIENT 64-BIT CARRY SELECT ADDER WITH REDUCED AREA APPLICATION CH PALLAVI 1, VSWATHI 2 1 II MTech, Chadalawada Ramanamma Engg College, Tirupati 2 Assistant Professor, DeptofECE, CREC, Tirupati
An optimized implementation of 128 bit carry select adder using binary to excess-one converter for delay reduction and area efficiency
Journal From the SelectedWorks of Journal December, 2014 An optimized implementation of 128 bit carry select adder using binary to excess-one converter for delay reduction and area efficiency P. Manga
Research Article Design and Implementation of High Speed and Low Power Modified Square Root Carry Select Adder (MSQRTCSLA)
Research Journal of Applied Sciences, Engineering and Technology 12(1): 43-51, 2016 DOI:10.19026/rjaset.12.2302 ISSN: 2040-7459; e-issn: 2040-7467 2016 Maxwell Scientific Publication Corp. Submitted: August
Figure 1.LFSR Architecture ( ) Table 1. Shows the operation for x 3 +x+1 polynomial.
High-speed Parallel Architecture and Pipelining for LFSR Vinod Mukati PG (M.TECH. VLSI engineering) student, SGVU Jaipur (Rajasthan). Vinodmukati9@gmail.com Abstract Linear feedback shift register plays
Flip Flop. S-R Flip Flop. Sequential Circuits. Block diagram. Prepared by:- Anwar Bari
Sequential Circuits The combinational circuit does not use any memory. Hence the previous state of input does not have any effect on the present state of the circuit. But sequential circuit has memory
Adaptive Fir Filter with Optimised Area and Power using Modified Inner-Product Block
Adaptive Fir Filter with Optimised Area and Power using Modified Inner-Product Block Jesmin Joy M. Tech Scholar (VLSI & Embedded Systems), Dept. of ECE, IIET, M. G. University, Kottayam, Kerala, India
Improved 32 bit carry select adder for low area and low power
Journal From the SelectedWorks of Journal October, 2014 Improved 32 bit carry select adder for low area and low power Syed Javeed Chanukya Rani Imthiazunnisa Begum Korani Ravinder This work is licensed
Optimization of memory based multiplication for LUT
Optimization of memory based multiplication for LUT V. Hari Krishna *, N.C Pant ** * Guru Nanak Institute of Technology, E.C.E Dept., Hyderabad, India ** Guru Nanak Institute of Technology, Prof & Head,
R13 SET - 1 '' ''' '' ' '''' Code No: RT21053
SET - 1 1. a) What are the characteristics of 2 s complement numbers? b) State the purpose of reducing the switching functions to minimal form. c) Define half adder. d) What are the basic operations in
Research Article Low Power 256-bit Modified Carry Select Adder
Research Journal of Applied Sciences, Engineering and Technology 8(10): 1212-1216, 2014 DOI:10.19026/rjaset.8.1086 ISSN: 2040-7459; e-issn: 2040-7467 2014 Maxwell Scientific Publication Corp. Submitted:
Lab #12: 4-Bit Arithmetic Logic Unit (ALU)
Lab #12: 4-Bit Arithmetic Logic Unit (ALU) ECE/COE 0501 Date of Experiment: 4/3/2017 Report Written: 4/5/2017 Submission Date: 4/10/2017 Nicholas Haver nicholas.haver@pitt.edu 1 H a v e r PURPOSE The purpose
12-bit Wallace Tree Multiplier CMPEN 411 Final Report Matthew Poremba 5/1/2009
12-bit Wallace Tree Multiplier CMPEN 411 Final Report Matthew Poremba 5/1/2009 Project Overview This project was originally titled Fast Fourier Transform Unit, but due to space and time constraints, the
Design of Modified Carry Select Adder for Addition of More Than Two Numbers
Design of Modified Carry Select Adder for Addition of More Than Two Numbers Jasbir Kaur 1 and Lalit Sood 2 Assistant Professor, ECE Department, PEC University of Technology, Chandigarh, India 1 PG Scholar,
Digital Circuits ECS 371
Digital Circuits ECS 37 Dr. Prapun Suksompong prapun@siit.tu.ac.th Lecture 0 Office Hours: BKD 360-7 Monday 9:00-0:30, :30-3:30 Tuesday 0:30-:30 Announcement HW4 posted on the course web site Chapter 5:
Analogue Versus Digital [5 M]
![Analogue Versus Digital [5 M]](/thumbs/93/111640168.jpg "Analogue Versus Digital [5 M]")
Q.1 a. Analogue Versus Digital [5 M] There are two basic ways of representing the numerical values of the various physical quantities with which we constantly deal in our day-to-day lives. One of the ways,
TIME SCHEDULE. MODULE TOPICS PERIODS 1 Number system & Boolean algebra 17 Test I 1 2 Logic families &Combinational logic
COURSE TITLE : DIGITAL INSTRUMENTS PRINCIPLE COURSE CODE : 3075 COURSE CATEGORY : B PERIODS/WEEK : 4 PERIODS/SEMESTER : 72 CREDITS : 4 TIME SCHEDULE MODULE TOPICS PERIODS 1 Number system & Boolean algebra
Modified128 bit CSLA For Effective Area and Speed
Modified128 bit CSLA For Effective Area and Speed Shaik Bademia Babu, Sada.Ravindar,M.Tech,VLSI, Assistant professor Nimra Inst Of Sci and tech college, jupudi, Ibrahimpatnam,Vijayawada,AP state,india
Reconfigurable FPGA Implementation of FIR Filter using Modified DA Method
Reconfigurable FPGA Implementation of FIR Filter using Modified DA Method M. Backia Lakshmi 1, D. Sellathambi 2 1 PG Student, Department of Electronics and Communication Engineering, Parisutham Institute
Efficient Method for Look-Up-Table Design in Memory Based Fir Filters
International Journal of Computer Applications (975 8887) Volume 78 No.6, September Efficient Method for Look-Up-Table Design in Memory Based Fir Filters Md.Zameeruddin M.Tech, DECS, Dept. of ECE, Vardhaman
A Review on Hybrid Adders in VHDL Payal V. Mawale #1, Swapnil Jain *2, Pravin W. Jaronde #3
A Review on Hybrid Adders in VHDL Payal V. Mawale #1, Swapnil Jain *2, Pravin W. Jaronde #3 #1 Electronics & Communication, RTMNU. *2 Electronics & Telecommunication, RTMNU. #3 Electronics & Telecommunication,
R13. II B. Tech I Semester Regular Examinations, Jan DIGITAL LOGIC DESIGN (Com. to CSE, IT) PART-A
SET - 1 Note: Question Paper consists of two parts (Part-A and Part-B) Answer ALL the question in Part-A Answer any THREE Questions from Part-B a) What are the characteristics of 2 s complement numbers?
Design and Simulation of Modified Alum Based On Glut
IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vol. 08, Issue 6 (June. 2018), V (I) PP 67-73 www.iosrjen.org Design and Simulation of Modified Alum Based On Glut Ms. Shreya
LECTURE NOTES. ON Digital Circuit And Systems
Digital circuit&systems LECTURE NOTES ON Digital Circuit And Systems 2018 2019 III B. Tech I Semester (JNTUA-R15) Mrs.M.CHANDINI, Assistant Professor CHADALAWADA RAMANAMMA ENGINEERING COLLEGE (AUTONOMOUS)
MODULE 3. Combinational & Sequential logic
MODULE 3 Combinational & Sequential logic Combinational Logic Introduction Logic circuit may be classified into two categories. Combinational logic circuits 2. Sequential logic circuits A combinational
Design And Implimentation Of Modified Sqrt Carry Select Adder On FPGA
Design And Implimentation Of Modified Sqrt Carry Select Adder On FPGA Ch. Pavan kumar #1, V.Narayana Reddy, *2, R.Sravanthi *3 #Dept. of ECE, PBR VIT, Kavali, A.P, India #2 Associate.Proffesor, Department
Design and Implementation of Low-Power and Area-Efficient for Carry Select Adder (Csla)
Design and Implementation of Low-Power and Area-Efficient for Carry Select Adder (Csla) M.Deepika Department of the Electronics and Communication Engineering, NITS, Hyderabad, AP, India. K.Srinivasa Reddy
K. Phanindra M.Tech (ES) KITS, Khammam, India
Volume 7, Issue 5, May 2017 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com LUT Optimization
Solution to Digital Logic )What is the magnitude comparator? Design a logic circuit for 4 bit magnitude comparator and explain it,
Solution to Digital Logic -2067 Solution to digital logic 2067 1.)What is the magnitude comparator? Design a logic circuit for 4 bit magnitude comparator and explain it, A Magnitude comparator is a combinational
PHYSICS 5620 LAB 9 Basic Digital Circuits and Flip-Flops
PHYSICS 5620 LAB 9 Basic Digital Circuits and Flip-Flops Objective Construct a two-bit binary decoder. Study multiplexers (MUX) and demultiplexers (DEMUX). Construct an RS flip-flop from discrete gates.
LUT Design Using OMS Technique for Memory Based Realization of FIR Filter
International Journal of Emerging Engineering Research and Technology Volume. 2, Issue 6, September 2014, PP 72-80 ISSN 2349-4395 (Print) & ISSN 2349-4409 (Online) LUT Design Using OMS Technique for Memory
EECS 270 Midterm 2 Exam Closed book portion Fall 2014
EECS 270 Midterm 2 Exam Closed book portion Fall 2014 Name: unique name: Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. Scores: Page # Points
Efficient Architecture for Flexible Prescaler Using Multimodulo Prescaler
Efficient Architecture for Flexible Using Multimodulo G SWETHA, S YUVARAJ Abstract This paper, An Efficient Architecture for Flexible Using Multimodulo is an architecture which is designed from the proposed
COMP12111: Fundamentals of Computer Engineering
COMP2: Fundamentals of Computer Engineering Part I Course Overview & Introduction to Logic Paul Nutter Introduction What is this course about? Computer hardware design o not electronics nothing nasty like
TYPICAL QUESTIONS & ANSWERS
DIGITALS ELECTRONICS TYPICAL QUESTIONS & ANSWERS OBJECTIVE TYPE QUESTIONS Each Question carries 2 marks. Choose correct or the best alternative in the following: Q.1 The NAND gate output will be low if
DESIGN OF LOW POWER AND HIGH SPEED BEC 2248 EFFICIENT NOVEL CARRY SELECT ADDER
DESIGN OF LOW POWER AND HIGH SPEED BEC 2248 EFFICIENT NOVEL CARRY SELECT ADDER Sakshi Rajput 1, Gitanjali 2, Priya Sharma 2 and Garima 2 1 Assistant Professor, Department of Electronics and Communication
A Novel Bus Encoding Technique for Low Power VLSI
A Novel Bus Encoding Technique for Low Power VLSI Jayapreetha Natesan and Damu Radhakrishnan * Department of Electrical and Computer Engineering State University of New York 75 S. Manheim Blvd., New Paltz,
BCN1043. By Dr. Mritha Ramalingam. Faculty of Computer Systems & Software Engineering
BCN1043 By Dr. Mritha Ramalingam Faculty of Computer Systems & Software Engineering mritha@ump.edu.my http://ocw.ump.edu.my/ authors Dr. Mohd Nizam Mohmad Kahar (mnizam@ump.edu.my) Jamaludin Sallim (jamal@ump.edu.my)
Designing Fir Filter Using Modified Look up Table Multiplier
Designing Fir Filter Using Modified Look up Table Multiplier T. Ranjith Kumar Scholar, M-Tech (VLSI) GITAM University, Visakhapatnam Email id:-ranjithkmr55@gmail.com ABSTRACT- With the advancement in device
N.S.N College of Engineering and Technology, Karur
Modified Reconfigurable CSD Fir Filter Design Using Look up Table Sivakumar.M 1, Ranjitha.S 2, Vijayabharathi.P 3, Dhivya.G 4 1 Assistant professor, 2,3,4 UG student-final year, Department of Electronics
Dev Bhoomi Institute Of Technology Department of Electronics and Communication Engineering PRACTICAL INSTRUCTION SHEET
Dev Bhoomi Institute Of Technology Department of Electronics and Communication Engineering PRACTICAL INSTRUCTION SHEET LABORATORY MANUAL EXPERIMENT NO. 1 ISSUE NO. : ISSUE DATE: REV. NO. : REV. DATE :
Available online at ScienceDirect. Procedia Computer Science 46 (2015 ) Aida S Tharakan a *, Binu K Mathew b
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 46 (2015 ) 1409 1416 International Conference on Information and Communication Technologies (ICICT 2014) Design and Implementation
128 BIT MODIFIED CARRY SELECT ADDER USING BINARY TO EXCESS-ONE CONVERTER
128 BIT MODIFIED CARRY SELECT ADDER USING BINARY TO EXCESS-ONE CONVERTER M.Srinivasaperumal 1, S.Pavithra 2, V.S.Kavya Lekshmi 3, K.MohammedArshad 4 1,2,3,4 Dept. of ECE, SNS College of Technology Coimbatore,(
1. Convert the decimal number to binary, octal, and hexadecimal.
1. Convert the decimal number 435.64 to binary, octal, and hexadecimal. 2. Part A. Convert the circuit below into NAND gates. Insert or remove inverters as necessary. Part B. What is the propagation delay
CS/ECE 250: Computer Architecture. Basics of Logic Design: ALU, Storage, Tristate. Benjamin Lee
CS/ECE 25: Computer Architecture Basics of Logic esign: ALU, Storage, Tristate Benjamin Lee Slides based on those from Alvin Lebeck, aniel, Andrew Hilton, Amir Roth, Gershon Kedem Homework #3 ue Mar 7,
Microprocessor Design
Microprocessor Design Principles and Practices With VHDL Enoch O. Hwang Brooks / Cole 2004 To my wife and children Windy, Jonathan and Michelle Contents 1. Designing a Microprocessor... 2 1.1 Overview
Chapter 8 Functions of Combinational Logic
ETEC 23 Programmable Logic Devices Chapter 8 Functions of Combinational Logic Shawnee State University Department of Industrial and Engineering Technologies Copyright 27 by Janna B. Gallaher Basic Adders
DIGITAL 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 7. LECTURE: REGISTERS, COUNTERS AND SERIAL ARITHMETIC CIRCUITS st (Autumn) term 208/209 7. LECTURE: REGISTERS,
data and is used in digital networks and storage devices. CRC s are easy to implement in binary
Introduction Cyclic redundancy check (CRC) is an error detecting code designed to detect changes in transmitted data and is used in digital networks and storage devices. CRC s are easy to implement in
Tutorial Outline. Design Levels
Tutorial Outline 8:3-8:45 8:45-9:5 9:5-9:3 9:3-1:3 1:3-1:5 1:5-12:15 12:15-1:3 1:3-2:3 2:3-3:3 3:3-3:5 3:5-4:3 4:3-4:45 Introduction and motivation Sources of power in CMOS designs Power analysis tools
Section 6.8 Synthesis of Sequential Logic Page 1 of 8
Section 6.8 Synthesis of Sequential Logic Page of 8 6.8 Synthesis of Sequential Logic Steps:. Given a description (usually in words), develop the state diagram. 2. Convert the state diagram to a next-state
DYNAMIC INSTRUCTION SCHEDULING WITH TOMASULO
DYNAMIC INSTRUCTION SCHEDULING WITH TOMASULO Slides by: Pedro Tomás Additional reading: Computer Architecture: A Quantitative Approach, 5th edition, Chapter 3, John L. Hennessy and David A. Patterson,
Modeling Digital Systems with Verilog
Modeling Digital Systems with Verilog Prof. Chien-Nan Liu TEL: 03-4227151 ext:34534 Email: jimmy@ee.ncu.edu.tw 6-1 Composition of Digital Systems Most digital systems can be partitioned into two types
Digital Networks and Systems Laboratory 2 Basic Digital Building Blocks Time 4 hours
Digital Networks and Systems Laboratory 2 Basic Digital Building Blocks Time 4 hours Aim To investigate the basic digital circuit building blocks constructed from combinatorial logic or dedicated Integrated
FPGA Implementation of DA Algritm for Fir Filter
International Journal of Computational Engineering Research Vol, 03 Issue, 8 FPGA Implementation of DA Algritm for Fir Filter 1, Solmanraju Putta, 2, J Kishore, 3, P. Suresh 1, M.Tech student,assoc. Prof.,Professor
Optimization of Multi-Channel BCH Error Decoding for Common Cases. Russell Dill Master's Thesis Defense April 20, 2015
Optimization of Multi-Channel BCH Error Decoding for Common Cases Russell Dill Master's Thesis Defense April 20, 2015 Bose-Chaudhuri-Hocquenghem (BCH) BCH is an Error Correcting Code (ECC) and is used
An Efficient Viterbi Decoder Architecture
IOSR Journal of VLSI and Signal Processing (IOSR-JVSP) Volume, Issue 3 (May. Jun. 013), PP 46-50 e-issn: 319 400, p-issn No. : 319 4197 An Efficient Viterbi Decoder Architecture Kalpana. R 1, Arulanantham.