Design and Implementation of High Speed CRC Generators
|
|
- Clyde Stewart
- 5 years ago
- Views:
Transcription
1 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 5 UG Scholar, Department of ECE, Adhiyamaan College of Engineering, Hosur, Tamilnadu, India 1,2,3,4 Associate Professor, Department of ECE, Adhiyamaan College of Engineering, Hosur, Tamilnadu, India 5 ABSTRACT: High speed data transmission is a necessary requirement of current smart generation The networking environment is in an urge to develop extremely fast wireless communication with null occurrence of error Cyclic redundancy check (CRC) is a promising solution for error detection in data transmission The high speed data transmission with high speed error checking using parallel CRC generation is presented The proposed scheme reports parallel CRC architecture composed of 32 bits based on F matrix with a polynomial generator polynomial of order n The improved efficiency of the proposed technique verified using Xilinx ISE Simulator KEYWORDS: Cyclic Redundancy Check, Parallel CRC calculation, Linear Feedback Shift Register, LFSR, F matrix I INTRODUCTION Cyclic redundancy check is widely used in various application areas like data communication, data storage, data compression for reducing errors in data transmission The conventional hardware implementation of CRC calculations is based on the linear feedback shift registers (LFSRs) where the data is checked in a serial manner with minimum throughput Parallel CRC computation can be able to rectify these limitations to some extent such that the throughput of the 32-bit parallel calculation of CRC-32 can achieve several gigabits per second But this minimum performance improvement cannot satisfy the data transmission speed of Ethernet networks which is almost used in a huge manner Hence an alternative approaching of processing multiple bits in parallel is suggested Variants of CRCs are used in applications like CRC-16 BISYNC protocols, CRC-32 in Ethernet frame for error detection, CRC-8 in ATM, CRC-CCITT in X-25 protocol, disc storage, SDLC, and XMODEMAlbertengo et al developed z-transform based architecture for parallel CRC where synthesizable Verilog code generation is impossible Braun et al proposed a technique suitable for FPGA implementation with analytical proof of relatively high complexity Another approach based on Galois field has been proposed by Shieh et al Campobello et al suggested 32-bit parallel processing using pre-calculated F matrix whose performance will be affected by a polynomial change This paper deals with an architecture where 32-bit parallel processing is performed by means of F matrix which can be able to reduce the number of cycles of CRC to 50%This paper is organized as follows The conventional serial CRC generation technique based on LFSR is discussed in section II The parallel CRC generation scheme based on F matrix for 32 bits is presented in section III and IV respectively Simulation results are provided and discussed in section V The enhanced performance of proposed technique is concluded in section VI II SERIAL CRC Linear feedback shift registers (LFSR) are commonly used for generating serial CRC by performing a simple computation of binary divisions It can be performed by a sequence of subtractions and shifting operations In modulo -2 arithmetic, the addition and subtraction are equivalent to bitwise XORs ( ) and multiplication is equivalent to AND ( ) The basic architecture of LFSR used for serial CRC calculation is shown in Fig 1 Copyright to IJIRSET wwwijirsetcom 219
2 Department of ECE, Adhiyamaan College of Engineering, Hosur, Tamilnadu, India Fig 1: Basic LFSR Architecture As shown in above Fig d is serial input data, X represents present state (generated CRC), X represents next state and p is generator polynomial The operation of basic LFSR architecture is expressed in terms of following equations X 0 ' = (P 0 X m 1 ) d (1) X i ' = (P 0 X m 1 ) X i 1 The generator polynomial for CRC-32 is as follows G(x) = x 32 + x 26 + x 23 + x 22 + x 16 +x 12 +x 11 +x 10 +x 8 + x 7 + x 5 + x 4 + x 2 + x 1 + x 0 ; We can extract the coefficients of G(x) and represent it in binary form as P = {P32, P31, P0} P = { } Frame Check Sequence (FCS) will be generated after k+m cycle, where k denotes the number of bits of data and m denotes the order of generator polynomial In case of 32 bits serial CRC, the serial CRC generation will happen after 64 cycles when the order of generator polynomial is 32 III PARALLEL CRC There multiple techniques used for parallel generation of CRC is labeled below 1 A Table-Based Algorithm for Pipelined CRC Calculation 2 Fast CRC Updation 3 F matrix based parallel CRC generation 4 Algorithm for Unfolding, Re-timing and Pipelining LUT based architecture provides minimum memory, whereas the high pipelining table based architecture has multiple inputs such as LUT1, LUT2 and LUT3 LUT3 contains CRC values for the input followed by 12 bytes of zeros, 8 bytes of LUT2, and 4 bytes of LUT4 Higher throughput has been achieved through this algorithm But its performance is limited by pre-calculating CRC and storing it in LUT, because LUT must be changed with respect to polynomial change Pipelining algorithm can be used to reduce the critical path with the integration of delay element Copyright to IJIRSET wwwijirsetcom 220
3 Department of ECE, Adhiyamaan College of Engineering, Hosur, Tamilnadu, India Fig 2: LUT based architecture Parallel processing used to increase the throughput by producing the number of output at the same time Retiming is used to increase the clock rate of the circuit by reducing the critical path computation time The fast CRC update technique involves the calculation of CRC for the bits which undergoes any change instead of calculating CRC each time for all the data bits There are different approaches to generate the parallel CRC having advantages and disadvantages for each technique Table based architecture required pre-calculated LUT, so, it will not be used for generalized CRC, fast CRC update technique required buffer to store the old CRC and data In unfolding architecture increases the no of iteration bound The F matrix based architecture more simple and low complex A ALGORITHM FOR F MATRIX BASED ARCHITECTURE Algorithm and Parallel architecture for CRC generation based on F matrix is discussed in this section As shown in fig 2 it is basic algorithm for F matrix based parallel CRC generationparallel data input and each element of F matrix, which is generated from given generator polynomial is ANDed, result of that will XORing with present state of CRC checksum The result generated after (k+ m) /w cycle Fig 3: Algorithms for F matrix based architecture B F MATRIX GENERATION F matrix is generated from generator polynomialwhere, {p 0 p m-1 } is generator polynomialfor example, the generator polynomial for CRC4 is {1, 0, 0, 1, 1} and w bits are parallelly processed Copyright to IJIRSET wwwijirsetcom 221
4 Department of ECE, Adhiyamaan College of Engineering, Hosur, Tamilnadu, India F = Pm Pm F= Pm Pm P C PARALLEL ARCHITECTURE Parallel architecture based on F matrix illustrated in fig 3 As shown in fig 1, d is data that is parallel processed (ie 32bit), X' is next state, X is current state (generated CRC), F(i)(j) is the i th row and j th column of F matrix If X = [x m-1 x 1 x 0 ] T is utilized to denote the state of the shift registers, in linear system theory, the state equation for LFSRs can be expressed in modular-2 arithmetic as follow X i '= (P 0 X m 1 ) X i+1 (2) Where, X(i) represents the i th state of the registers, X(i + 1) denotes the (i + 1) th state of the registers, d denotes the one-bit shift-in serial input F is an m x m matrix and G is a 1 x m matrix Finally, equation (3) can be written in matrix form as G = [ ] T (3) X ' = F W X d (4) Equation (4) can be expanded as, X 3 '= X 2 X 1 X 0 d 3 X 2 '= X 3 X 2 d 2 X 1 '= X 3 X 2 X 1 d 1 X 0 '= X 3 X 2 X 1 X 0 d 0 (6) The dividend is divided into three 4-bit fields, acting as the parallel input vectors D(0), D(1), D(2), respectively The initial state is X(0) = [ ] T X(4) = F 4 X(0) D(0) X(12) = F 4 X(8) D(2) (7) calculation of the next state X by matrix F w, current state X and parallel input D, make the 32-bit parallel input vector suitable for any length of messages besides the multiple of a sequence of 32-bit parallel calculation, the final remaining number of bits of the message could be 8; 16,or 24 For all these situations, an additional parallel calculation w = 8; 16; 24 is needed by choosing the corresponding F w If the length of the message is Copyright to IJIRSET wwwijirsetcom 222
5 Department of ECE, Adhiyamaan College of Engineering, Hosur, Tamilnadu, India not the multiple of the number of parallel processing bits w = 4 ie data bit is Then last two more bits D(3) need to be calculated after getting X (12) For calculating the extra bits if the data message length is not the multiple of w, the number of parallel processing bits It is worth to notice that in CRC-32 algorithm, the initial state of the shift registers is preset to all `1's Therefore, X(0) = 0xFFFF However, the initial state X (0) does not affect the correctness of the design For better understanding, the initial state X (0) is still set to 0x0000 when the circuit is implemented IV PROPOSED DESIGN In proposed architecture w= 32 bits are parallelly processed and order of generator polynomial is m= 16 As discussed in section 3, if 32 bits are processed parallelly then CRC-32 will be generated after (k m)/w cycles If we increase number of bits to be processed parallelly, number of cycles required to calculate CRC can be reduced Proposed architecture can be realized by below equation Where, Xtemp= F W D(0to15) D(16to32) X' = F W X Xtemp (11) D (0 to 15) =first 16 bits of parallel data input D (0 to 32) = next 16 bits of parallel data input X =next state,x=present state Fig 4: Circuit diagram of parallel calculation of CRC-32 In proposed architecture d i is the parallel input and F(i)(j) is the element of F 16 matrix located at i th row and j th column As shown in figure 3 input data bits d 0 d 15 anded with each row of F W matrix and result will be xored individually with d 16, d 17 d 32 Then each xored result is then xored with the X' (i) term of CRC-32 Finally X will be the CRC generated after (k m)/w cycle, where w=3 A SYNTHESIS REPORT V RESULT The proposed architecture is synthesized in Xilinx-92i and simulated in Xilinx ISE Simulator, which required half cycle then the previous 32-bit design In our programming in Verilog by specifying only generator polynomial, it directly gives F matrix useful for parallel CRC generation that is not available in previous methods Hardware utilization is compared in table I for different approaches for different parameter like LUT, CPD and cycle Copyright to IJIRSET wwwijirsetcom 223
6 Department of ECE, Adhiyamaan College of Engineering, Hosur, Tamilnadu, India fig 7: Synthesis report for parallel CRC-32 Fig 8: Total delay of parallel CRC-32 CRC W parallel bits Cloc k cycle LUTs CPD CRC32 w=16bit[1 ] CRC32 w=32bit[8 ] CRC32 w=32bit(proposed) ns ns ns Fig 9: Comparison table for different algorithms of CRC Copyright to IJIRSET wwwijirsetcom 224
7 Department of ECE, Adhiyamaan College of Engineering, Hosur, Tamilnadu, India B SIMULATION From the table it is observe that, the architecture proposed by require 17 clock cycle to generate CRC as per equation (k+ m)/w and for proposed architecture it required only 9 cycle, CPD for proposed architecture is less than the architecture, only the disadvantage for proposed architecture is the no of LUT get increased, so area also get increase VICONCLUSION 32-bit parallel architecture required 17 ((k + m)/w) clock cycles for 32-byte data Proposed design (32bit) required only 9 cycles to generate CRC with same order of generator polynomial So, it drastically reduces computation time to 50% and same time increases the throughput Pre-calculation of F matrix is not required in proposed architecture Hence, this is compact and easy method for fast CRC generation REFERENCES [1] Campobello, G; Patane, G; Russo, M; "Parallel CRC realization," Computers, IEEE Transactions on, vol52, no10, pp , Oct2003 [2] MDShieh et al, A Systematic Approach for Parallel CRC Computations, Journal of Information Science and Engineering, May 2001 [3] Braun, F; Waldvogel, M; "Fast incremental CRC updates for IP over ATM networks," High Performance Switching and Routing,2001 IEEE Workshop on, vol, no, pp48-52, 2001 [4] Weidong Lu and Stephan Wong, A Fast CRC Update Implementation, IEEE Workshop on High Performance Switching and Routing, pp , Oct 2003 [5] RameshwarMurade, MD Manan Mujahid, MAM Sabir, The design and implementation of a Programmable CRC computation circuit architecture using FPGA 2013 [6] SR Ruckmani, P Anbalagan, High Speed cyclic Redundancy Check for USB Reasearch Scholar, Department of Electrical Engineering, Coimbatore Institute of Technology, Coimbatore , DSP Journal, Volume 6, Issue 1, September, 2006 [7] Yan Sun; Min Sik Kim; "A Pipelined CRC Calculation Using Lookup Tables," Consumer Communications and NetworkingConference (CCNC), th IEEE, vol, no, pp1-2, 9-12 Jan2010 [8] Sprachmann, M; "Automatic generation of parallel CRC circuits," Design & Test of Computers, IEEE, vol18, no3, pp , May 2001 Copyright to IJIRSET wwwijirsetcom 225
FPGA BASED DESIGN OF PARALLEL CRC GENERATION FOR HIGH SPEED APPLICATION
258 FPGA BASED DESIGN OF PARALLEL CRC GENERATION FOR HIGH SPEED APPLICATION Sri N.V.N.Prasanna Kumar 1, S.Bhagya Jyothi 2,G.K.S.Tejaswi 3 1 prasannakumar429@gmail.com, 2 sjyothi567@gmail.com, 3 tejaswikakatiya@gmail.com
More informationEECS Components and Design Techniques for Digital Systems. Lec 26 CRCs, LFSRs (and a little power)
EECS 150 - Components and esign Techniques for igital Systems Lec 26 CRCs, LFSRs (and a little power) avid Culler Electrical Engineering and Computer Sciences University of California, Berkeley http://www.eecs.berkeley.edu/~culler
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 informationCYCLIC Redundancy Check (CRC) [1], [2], [3], [4], [5] is
112 IEEE TRANSACTIONS ON COMPUTERS, VOL. 52, NO. 10, OCTOBER 200 Parallel CRC Realization Giuseppe Campobello, Giuseppe Patanè, and Marco Russo Abstract This paper presents a theoretical result in the
More informationVHDL Implementation of Reed Solomon Improved Encoding Algorithm
VHDL Implementation of Reed Solomon Improved Encoding Algorithm P.Ravi Tej 1, Smt.K.Jhansi Rani 2 1 Project Associate, Department of ECE, UCEK, JNTUK, Kakinada A.P. 2 Assistant Professor, Department of
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 informationOutline. EECS Components and Design Techniques for Digital Systems. Lec 18 Error Coding. In the real world. Our beautiful digital world.
Outline EECS 150 - Components and esign Techniques for igital Systems Lec 18 Error Coding Errors and error models Parity and Hamming Codes (SECE) Errors in Communications LFSRs Cyclic Redundancy Check
More informationEECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs)
EECS150 - igital esign Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Nov 21, 2002 John Wawrzynek Fall 2002 EECS150 Lec26-ECC Page 1 Outline Error detection using parity Hamming
More informationLinear Feedback Shift Registers (LFSRs) 4-bit LFSR
Linear Feedback Shift Registers (LFSRs) These are n-bit counters exhibiting pseudo-random behavior. Built from simple shift-registers with a small number of xor gates. Used for: random number generation
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 informationAN IMPROVED LOW LATENCY SYSTOLIC STRUCTURED GALOIS FIELD MULTIPLIER
Indian Journal of Electronics and Electrical Engineering (IJEEE) Vol.2.No.1 2014pp1-6 available at: www.goniv.com Paper Received :05-03-2014 Paper Published:28-03-2014 Paper Reviewed by: 1. John Arhter
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 informationECE 4450:427/527 - Computer Networks Spring 2017
ECE 4450:427/527 - Computer Networks Spring 2017 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 5.2: Error Detection & Correction Dr. Nghi Tran (ECE-University of Akron) ECE 4450:427/527
More informationFully-parallel linear error block coding and decoding a Boolean approach
Fully-parallel linear error block coding and decoding a Boolean approach Hermann Meuth, Hochschule Darmstadt Katrin Tschirpke, Hochschule Aschaffenburg 8th International Workshop on Boolean Problems, 28
More informationInformation redundancy
Information redundancy Information redundancy add information to date to tolerate faults error detecting codes error correcting codes data applications communication memory p. 2 - Design of Fault Tolerant
More information1 Reed Solomon Decoder Final Project. Group 3 Abhinav Agarwal S Branavan Grant Elliott. 14 th May 2007
1 Reed Solomon Decoder 6.375 Final Project Group 3 Abhinav Agarwal S Branavan Grant Elliott 14 th May 2007 2 Outline Error Correcting Codes Mathematical Foundation of Reed Solomon Codes Decoder Architecture
More informationGetting Connected. Chapter 2, Part 2. Networking CS 3470, Section 1 Sarah Diesburg
Getting Connected Chapter 2, Part 2 Networking CS 3470, Section 1 Sarah Diesburg 1 Five Problems Encoding/decoding Framing Error Detection Error Correction Media Access 2 Five Problems Encoding/decoding
More informationReduced-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 informationObjective: To become acquainted with the basic concepts of cyclic codes and some aspects of encoder implementations for them.
ECE 7670 Lecture 5 Cyclic codes Objective: To become acquainted with the basic concepts of cyclic codes and some aspects of encoder implementations for them. Reading: Chapter 5. 1 Cyclic codes Definition
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 informationEfficient Hardware Calculation of Inverses in GF (2 8 )
Efficient Hardware Calculation of Inverses in GF (2 8 ) R. W. Ward, Dr. T. C. A. Molteno 1 Physics Department University of Otago Box 56, Dunedin, New Zealand 1 Email: tim@physics.otago.ac.nz Abstract:
More informationParallel CRC Realization
Parallel CRC Realization 1 Giuseppe Campobello, Giuseppe Patanè, Marco Russo Abstract This paper presents a theoretical result in the context of realizing high speed hardware for parallel CRC checksums.
More informationOutline. EECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Simple Error Detection Coding
Outline EECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Error detection using arity Hamming code for error detection/correction Linear Feedback Shift
More informationDesign of Low Power Optimized MixColumn/Inverse MixColumn Architecture for AES
Design of Low Power Optimized MixColumn/Inverse MixColumn Architecture for AES Rajasekar P Assistant Professor, Department of Electronics and Communication Engineering, Kathir College of Engineering, Neelambur,
More informationEECS150 - Digital Design Lecture 27 - misc2
EECS150 - Digital Design Lecture 27 - misc2 May 1, 2002 John Wawrzynek Spring 2002 EECS150 - Lec27-misc2 Page 1 Outline Linear Feedback Shift Registers Theory and practice Simple hardware division algorithms
More informationB. Cyclic Codes. Primitive polynomials are the generator polynomials of cyclic codes.
B. Cyclic Codes A cyclic code is a linear block code with the further property that a shift of a codeword results in another codeword. These are based on polynomials whose elements are coefficients from
More informationDIAGNOSIS OF FAULT IN TESTABLE REVERSIBLE SEQUENTIAL CIRCUITS USING MULTIPLEXER CONSERVATIVE QUANTUM DOT CELLULAR AUTOMATA
DIAGNOSIS OF FAULT IN TESTABLE REVERSIBLE SEQUENTIAL CIRCUITS USING MULTIPLEXER CONSERVATIVE QUANTUM DOT CELLULAR AUTOMATA Nikitha.S.Paulin 1, S.Abirami 2, Prabu Venkateswaran.S 3 1, 2 PG students / VLSI
More informationOptimization of 1D and 2D Cellular Automata for Pseudo Random Number Generator.
IOSR Journal of VLSI and Signal Processing (IOSR-JVSP) Volume 4, Issue 6, Ver. I (Nov - Dec. 2014), PP 28-33 e-issn: 2319 4200, p-issn No. : 2319 4197 Optimization of 1D and 2D Cellular Automata for Pseudo
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 informationImplementation Of Digital Fir Filter Using Improved Table Look Up Scheme For Residue Number System
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
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 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 informationSimplification of Procedure for Decoding Reed- Solomon Codes Using Various Algorithms: An Introductory Survey
2014 IJEDR Volume 2, Issue 1 ISSN: 2321-9939 Simplification of Procedure for Decoding Reed- Solomon Codes Using Various Algorithms: An Introductory Survey 1 Vivek Tilavat, 2 Dr.Yagnesh Shukla 1 PG Student,
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 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 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 informationFault Tolerant Computing CS 530 Information redundancy: Coding theory. Yashwant K. Malaiya Colorado State University
CS 530 Information redundancy: Coding theory Yashwant K. Malaiya Colorado State University March 30, 2017 1 Information redundancy: Outline Using a parity bit Codes & code words Hamming distance Error
More informationError Detection & Correction
Error Detection & Correction Error detection & correction noisy channels techniques in networking error detection error detection capability retransmition error correction reconstruction checksums redundancy
More informationFPGA IMPLEMENTATION OF BASIC ADDER CIRCUITS USING REVERSIBLE LOGIC GATES
FPGA IMPLEMENTATION OF BASIC ADDER CIRCUITS USING REVERSIBLE LOGIC GATES B.Ravichandra 1, R. Kumar Aswamy 2 1,2 Assistant Professor, Dept of ECE, VITS College of Engineering, Visakhapatnam (India) ABSTRACT
More informationFormal Verification of the CRC Algorithm Properties
Formal Verification of the CRC Algorithm Properties P. Hlávka 1, V. Řehák 2, A. Smrčka 1, P. Šimeček 2, D. Šafránek 2, and T. Vojnar 1 1 FIT BUT, Brno, Czech Republic {xhlavk00,smrcka,vojnar}@fit.vutbr.cz
More informationMultimedia Systems WS 2010/2011
Multimedia Systems WS 2010/2011 15.11.2010 M. Rahamatullah Khondoker (Room # 36/410 ) University of Kaiserslautern Department of Computer Science Integrated Communication Systems ICSY http://www.icsy.de
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 Novel Ternary Content-Addressable Memory (TCAM) Design Using Reversible Logic
2015 28th International Conference 2015 on 28th VLSI International Design and Conference 2015 14th International VLSI Design Conference on Embedded Systems A Novel Ternary Content-Addressable Memory (TCAM)
More informationLogic BIST. Sungho Kang Yonsei University
Logic BIST Sungho Kang Yonsei University Outline Introduction Basics Issues Weighted Random Pattern Generation BIST Architectures Deterministic BIST Conclusion 2 Built In Self Test Test/ Normal Input Pattern
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 informationError Correction and Trellis Coding
Advanced Signal Processing Winter Term 2001/2002 Digital Subscriber Lines (xdsl): Broadband Communication over Twisted Wire Pairs Error Correction and Trellis Coding Thomas Brandtner brandt@sbox.tugraz.at
More informationAn Enhanced (31,11,5) Binary BCH Encoder and Decoder for Data Transmission
An Enhanced (31,11,5) Binary BCH Encoder and Decoder for Data Transmission P.Mozhiarasi, C.Gayathri, V.Deepan Master of Engineering, VLSI design, Sri Eshwar College of Engineering, Coimbatore- 641 202,
More information2. Accelerated Computations
2. Accelerated Computations 2.1. Bent Function Enumeration by a Circular Pipeline Implemented on an FPGA Stuart W. Schneider Jon T. Butler 2.1.1. Background A naive approach to encoding a plaintext message
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 informationA Novel LUT Using Quaternary Logic
A Novel LUT Using Quaternary Logic 1*GEETHA N S 2SATHYAVATHI, N S 1Department of ECE, Applied Electronics, Sri Balaji Chockalingam Engineering College, Arani,TN, India. 2Assistant Professor, Department
More informationDesign and Implementation of Reed-Solomon Decoder using Decomposed Inversion less Berlekamp-Massey Algorithm by
Design and Implementation of Reed-Solomon Decoder using Decomposed Inversion less Berlekamp-Massey Algorithm by Hazem Abd Elall Ahmed Elsaid A Thesis Submitted to the Faculty of Engineering at Cairo University
More informationNovel Implementation of Finite Field Multipliers over GF(2m) for Emerging Cryptographic Applications
Wright State University CORE Scholar Browse all Theses and Dissertations Theses and Dissertations 2017 Novel Implementation of Finite Field Multipliers over GF(2m) for Emerging Cryptographic Applications
More informationDesign and Implementation of Reversible Binary Comparator N.SATHISH 1, T.GANDA PRASAD 2
www.semargroup.org, www.ijsetr.com ISSN 2319-8885 Vol.03,Issue.03, March-2014, Pages:0356-0363 Design and Implementation of Reversible Binary Comparator N.SATHISH 1, T.GANDA PRASAD 2 1 PG Scholar, Dept
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 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 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 informationOptical Storage Technology. Error Correction
Optical Storage Technology Error Correction Introduction With analog audio, there is no opportunity for error correction. With digital audio, the nature of binary data lends itself to recovery in the event
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 informationGalois Field Algebra and RAID6. By David Jacob
Galois Field Algebra and RAID6 By David Jacob 1 Overview Galois Field Definitions Addition/Subtraction Multiplication Division Hardware Implementation RAID6 Definitions Encoding Error Detection Error Correction
More information74F402 Serial Data Polynomial Generator/Checker
Serial Data Polynomial Generator/Checker General Description The 74F402 expandable Serial Data Polynomial generator/ checker is an expandable version of the 74F401. It provides an advanced tool for the
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 informationFPGA Realization of Low Register Systolic All One-Polynomial Multipliers Over GF (2 m ) and their Applications in Trinomial Multipliers
Wright State University CORE Scholar Browse all Theses and Dissertations Theses and Dissertations 2016 FPGA Realization of Low Register Systolic All One-Polynomial Multipliers Over GF (2 m ) and their
More informationInformation Redundancy: Coding
Info Redundancy April 2, 23 Information Redundancy: Coding Often applied to Info transfer: often serial communication thru a channel Info storage Hamming distance: error detection & correction capability
More informationInstruction Set Extensions for Reed-Solomon Encoding and Decoding
Instruction Set Extensions for Reed-Solomon Encoding and Decoding Suman Mamidi and Michael J Schulte Dept of ECE University of Wisconsin-Madison {mamidi, schulte}@caewiscedu http://mesaecewiscedu Daniel
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 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 informationNew Implementations of the WG Stream Cipher
New Implementations of the WG Stream Cipher Hayssam El-Razouk, Arash Reyhani-Masoleh, and Guang Gong Abstract This paper presents two new hardware designs of the WG-28 cipher, one for the multiple output
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 informationIntroduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved.
Introduction to Wireless & Mobile Systems Chapter 4 Channel Coding and Error Control 1 Outline Introduction Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Information
More informationAssume that the follow string of bits constitutes one of the segments we which to transmit.
Cyclic Redundancy Checks( CRC) Cyclic Redundancy Checks fall into a class of codes called Algebraic Codes; more specifically, CRC codes are Polynomial Codes. These are error-detecting codes, not error-correcting
More informationUniversity of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering
University of Toronto Faculty of Applied Science and Engineering Edward S. Rogers Sr. Department of Electrical and Computer Engineering Final Examination ECE 241F - Digital Systems Examiners: S. Brown,
More informationReversible Implementation of Ternary Content Addressable Memory (TCAM) Interface with SRAM
International Journal of Electrical Electronics Computers & Mechanical Engineering (IJEECM) ISSN: 2278-2808 Volume 5 Issue 4 ǁ April. 2017 IJEECM journal of Electronics and Communication Engineering (ijeecm-jec)
More informationECE 512 Digital System Testing and Design for Testability. Model Solutions for Assignment #3
ECE 512 Digital System Testing and Design for Testability Model Solutions for Assignment #3 14.1) In a fault-free instance of the circuit in Fig. 14.15, holding the input low for two clock cycles should
More informationL9: Galois Fields. Reading material
L9: Galois Fields Reading material Muzio & Wesselkamper Multiple-valued switching theory, p. 3-5, - 4 Sasao, Switching theory for logic synthesis, pp. 43-44 p. 2 - Advanced Logic Design L9 - Elena Dubrova
More informationSubquadratic space complexity multiplier for a class of binary fields using Toeplitz matrix approach
Subquadratic space complexity multiplier for a class of binary fields using Toeplitz matrix approach M A Hasan 1 and C Negre 2 1 ECE Department and CACR, University of Waterloo, Ontario, Canada 2 Team
More informationCyclic Codes. Saravanan Vijayakumaran August 26, Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 25 Cyclic Codes Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay August 26, 2014 2 / 25 Cyclic Codes Definition A cyclic shift
More informationAdvanced Hardware Architecture for Soft Decoding Reed-Solomon Codes
Advanced Hardware Architecture for Soft Decoding Reed-Solomon Codes Stefan Scholl, Norbert Wehn Microelectronic Systems Design Research Group TU Kaiserslautern, Germany Overview Soft decoding decoding
More informationA Digit-Serial Systolic Multiplier for Finite Fields GF(2 m )
A Digit-Serial Systolic Multiplier for Finite Fields GF( m ) Chang Hoon Kim, Sang Duk Han, and Chun Pyo Hong Department of Computer and Information Engineering Taegu University 5 Naeri, Jinryang, Kyungsan,
More informationReview. EECS Components and Design Techniques for Digital Systems. Lec 26 CRCs, LFSRs (and a little power)
EECS 50 - Components and esign Techniques for igital Systems Lec 6 CRCs, LFSRs (and a little power) avid Culler Electrical Engineering and Computer Sciences University of California, Berkeley http://www.eecs.berkeley.edu/~culler
More informationChapter 6. BCH Codes
Chapter 6 BCH Codes Description of the Codes Decoding of the BCH Codes Outline Implementation of Galois Field Arithmetic Implementation of Error Correction Nonbinary BCH Codes and Reed-Solomon Codes Weight
More informationAustralian Journal of Basic and Applied Sciences
AENSI Journals Australian Journal of Basic and Applied Sciences ISSN:1991-8178 Journal home page: www.ajbasweb.com of SubBytes and InvSubBytes s of AES Algorithm Using Power Analysis Attack Resistant Reversible
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 informationHighly Efficient GF(2 8 ) Inversion Circuit Based on Redundant GF Arithmetic and Its Application to AES Design
Saint-Malo, September 13th, 2015 Cryptographic Hardware and Embedded Systems Highly Efficient GF(2 8 ) Inversion Circuit Based on Redundant GF Arithmetic and Its Application to AES Design Rei Ueno 1, Naofumi
More informationLow complexity bit-parallel GF (2 m ) multiplier for all-one polynomials
Low complexity bit-parallel GF (2 m ) multiplier for all-one polynomials Yin Li 1, Gong-liang Chen 2, and Xiao-ning Xie 1 Xinyang local taxation bureau, Henan, China. Email:yunfeiyangli@gmail.com, 2 School
More informationOptimization of the Hamming Code for Error Prone Media
Optimization of the Hamming Code for Error Prone Media Eltayeb Abuelyaman and Abdul-Aziz Al-Sehibani College of Computer and Information Sciences Prince Sultan University Abuelyaman@psu.edu.sa Summery
More informationEECS150 - Digital Design Lecture 26 Faults and Error Correction. Recap
EECS150 - Digital Design Lecture 26 Faults and Error Correction Nov. 26, 2013 Prof. Ronald Fearing Electrical Engineering and Computer Sciences University of California, Berkeley (slides courtesy of Prof.
More informationError Detection, Correction and Erasure Codes for Implementation in a Cluster File-system
Error Detection, Correction and Erasure Codes for Implementation in a Cluster File-system Steve Baker December 6, 2011 Abstract. The evaluation of various error detection and correction algorithms and
More informationA Multiple Bit Parity Fault Detection Scheme for The Advanced Encryption Standard Galois/ Counter Mode
Western University Scholarship@Western Electronic Thesis and Dissertation Repository October 2014 A Multiple Bit Parity Fault Detection Scheme for The Advanced Encryption Standard Galois/ Counter Mode
More informationFPGA Resource Utilization Estimates for NI PXI-7854R. LabVIEW FPGA Version: 8.6 NI-RIO Version: 3.0 Date: 8/5/2008
FPGA Resource Utilization Estimates for NI PXI-7854R LabVIEW FPGA Version: 8.6 NI-RIO Version: 3.0 Date: 8/5/2008 Note: The numbers presented in this document are estimates. Actual resource usage for your
More informationMaximum Length Linear Feedback Shift Registers
Maximum Length Linear Feedback Shift Registers (c) Peter Fischer Institute for Computer Engineering (ZITI) Heidelberg University, Germany email address: peterfischer@zitiuni-heidelbergde February 23, 2018
More informationAn Optimized Hardware Architecture of Montgomery Multiplication Algorithm
An Optimized Hardware Architecture of Montgomery Multiplication Algorithm Miaoqing Huang 1, Kris Gaj 2, Soonhak Kwon 3, and Tarek El-Ghazawi 1 1 The George Washington University, Washington, DC 20052,
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 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 informationTheoretical Modeling of the Itoh-Tsujii Inversion Algorithm for Enhanced Performance on k-lut based FPGAs
Theoretical Modeling of the Itoh-Tsujii Inversion Algorithm for Enhanced Performance on k-lut based FPGAs Sujoy Sinha Roy, Chester Rebeiro and Debdeep Mukhopadhyay Department of Computer Science and Engineering
More informationFPGA IMPLEMENTATION OF 4-BIT AND 8-BIT SQUARE CIRCUIT USING REVERSIBLE LOGIC
FPGA IMPLEMENTATION OF 4-BIT AND 8-BIT SQUARE CIRCUIT USING REVERSIBLE LOGIC Shwetha. S Patil 1, Mahesh Patil 2, Venkateshappa 3 Assistant Professor 1,PG Student 2, Professor 3 1,2,3 Dept. of ECE, 1 MVJ
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 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 informationOptimization of the Hamming Code for Error Prone Media
278 IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.3, March 2008 Optimization of the Hamming Code for Error Prone Media Eltayeb S. Abuelyaman and Abdul-Aziz S. Al-Sehibani
More informationEECS150 - Digital Design Lecture 25 Shifters and Counters. Recap
EECS150 - Digital Design Lecture 25 Shifters and Counters Nov. 21, 2013 Prof. Ronald Fearing Electrical Engineering and Computer Sciences University of California, Berkeley (slides courtesy of Prof. John
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 information