Cyclic Codes Introduction Binary cyclic codes form a subclass of linear block codes. Easier to encode and decode


 Norman Griffith
 2 years ago
 Views:
Transcription
1 Cyclic Codes Introduction Binary cyclic codes form a subclass of linear block codes. Easier to encode and decode Definition A n, k linear block code C is called a cyclic code if. The sum of any two codewords in the code is also a codeword. Linear Example: C i C j C k CC.. Any cyclic shift of a codeword in the code is also a codeword. Cyclic Example: If C [ C C L C ] n is a codeword, C C M C n [ Cn C L Cn Cn ] [ C C L C C ] n are also codewords. [ C C L C C ] n n n n CC.
2 C and C i We can represent the code word C[C C C n ] by a code polynomial C C C C... C n The coefficients C i {,} and each power of in the polynomial C represents a onebit shift in time. Hence, multiplication of the polynomial C by may be viewed as a shift to the right. n Example: C [] can be represented by C CC. C i is recognized as the code polynomial of the code word [C ni C n C C C ni ] obtained by applying i cyclic shifts to the code word [C C C n ]. It can be shown that C i is the remainder resulting from i n dividing C by. That is, i C q n C i where q C n i Cn i... C n i Proof refers to p., Communication Systems CC.
3 CC.5 Example: C[] C 5 C 5 7 C [] Remainder CC. Therefore, if C is a code polynomial, then the polynomial is also a code polynomial for any cyclic shift i. modulo mod mod n i i C c
4 Generator Polynomial Theorem If g is a polynomial of degree n  k and is a factor of n, then g generates an n, k cyclic code in which the code polynomial C for a data vector M [ m m m... m k ] is generated by C M g n where C C C C... C n M g k m m m... m k n k g g g... g n k g is the generating polynomial CC.7 Example As 7 we can use either or to generate a 7, cyclic code. For M [ ] and g. C M g C [] [b:m] not systematic CC.8
5 The remaining code vectors are Message Code vectors obtained using CMg Rightshifted bit Rightshifted 5 bit Rightshifted bit Rightshifted bit : : CC.9 Systematic cyclic code generation Suppose we are given the generator polynomial g and the requirement is to encode the message sequence m, m,..., m k into an n, k systematic cyclic code. That is, the message bits are transmitted in unaltered form, as shown by the following structure for a code word b, b,..., bn k, m, m,..., mk n k parity bits k message bits Let the message polynomial be defined by k M m m... m k and let B b b... b nk nk CC.
6 We want the code polynomial to be in the form C B nk M Hence, Ag B nk M Equivalently, we may write k M A g n B g This equation states that the polynomial B is the remainder left over after dividing n k M by gx. CC. We may now summarize the steps involved in the encoding procedure for an n, k cyclic code assured of a systematic structure. Specifically, we proceed as follows:. Multiply the message polynomial M by n k.. Divide n k M by the generator polynomial g, obtaining the remainder B.. Add B to n k M, obtaining the code polynomial C. CC.
7 Example Consider the 7, cyclic code in CC.8: For M [ ] and g M n k 5 M. The division of 5 by g. can be done as CC. 5 5 Subtraction is the same as addition in modulo arithmetic Hence, n k B and then C B M C [] 5 CC.
8 Paritycheck polynomial An n,k cyclic code is uniquely specified by its generator polynomial g of order nk. Such a code is also uniquely specified by another polynomial of degree k, which is called the paritycheck polynomial, defined by k k h h h... hk. In linear block code, we have GH T. Now, we have n g h mod and we state that n g h CC.5 Syndrome Let the received word be r r... R r r r... r n [ r n n ] and Now, R q g S where S is called syndrome polynomial because its coefficients make up the syndrome S. CC.
9 CC.7 Example Hamming Codes Consider the 7, cycle code Let us take as the generating polynomial. This means that and the paritycheck polynomial is Take 7 g 7 h g h ] [ M M CC.8 Now M k n
10 Thus, the quotient A and the remainder B are A B The codeword is therefore A [] B [] { { parity check bit message CC.9 Let the transmitted code be [] and the received word be []. The syndrome is []. Since the syndrome is nonzero, the received word is in error. Using the standard array, we see that the error pattern corresponding to this syndrome is []. This indicates that the error is in the middle bit of the received word. CC.
11 Cyclic Redundancy Check Codes CRC. CRC can designed to detect many combinations of likely errors. Example: error burst contiguous error bits C[ ] R[ ] CC.. The implementation of both encoding and errordetecting circuits is practical. Flipflops and adders n k Example: n,k g g g L g n k Encoder: Parity bits Gate g g... g nk adder Flipflop Syndrome calculator:... Message bits Gate g g... g nk... Flipflop adder CC.
12 Binary n,k CRC codes are capable of detecting the following error patterns: a. All error bursts of length n  k or less. b. A fraction of error bursts of length equal to n  k ; the fraction equals  nk. c. A fraction of error bursts of length greater than n  k ; the fraction equals  nk. d. All combinations of d min  or fewer errors. e. All error patterns with an odd number of errors if the generator polynomial g for the code has an even number of nonzero coefficients. CC. Examples Code g nk CRC CRC CRC USA 5 CRCITU 5 CRC code is used for bit characters transmission. CRC and CRCITU are used for bit characters transmission. CC.
13 BoseChaudhuriHocquenghem BCH codes Primitive BCH codes are characterized for any positive integer m equal or greater than and t less than m / by the following parameters: Block length: n m  Number of message bits: k n  mt Minimum distance: d min t Hamming singleerror correcting codes is a BCH code. CC.5 ReedSolomon Codes RS An important subclass of nonbinary BCH codes. RS code differs from a binary encoder is that it operates on multiple bits rather than individual bits. An RS n,k code is used to encode k mbit symbols into blocks consisting of n m  symbols. Used in compact disc digital audio systems CC.
BINARY CYCLIC CODES. Clearly, cyclically shifting v i places to the right is equivalent to cyclically shifting v ni places to the left.
BINARY CYCLIC CODES Binary Cyclic codes was first studied by Prange in 1957. Cyclic codes form an important subclass of linear codes. These codes are attractive for two reasons: first, encoding and syndrome
More informationExample: Systematic Encoding (1) Systematic Cyclic Codes. Systematic Encoding. Example: Systematic Encoding (2)
S72.3410 Cyclic Codes 1 S72.3410 Cyclic Codes 3 Example: Systematic Encoding (1) Systematic Cyclic Codes Polynomial multiplication encoding for cyclic linear codes is easy. Unfortunately, the codes obtained
More informationPart 2.2 Cyclic redundancy check (CRC) codes
Part 2.2 Cyclic redundancy check (CRC) codes p. 1 Overview of Cyclic Redundancy Check Codes Cyclic redundancy check (CRC) codes Invented by W. Wesley Peterson, and published in 1961 A type of linear block
More informationTCOM 370 NOTES 999 CYCLIC CODES, AND THE CRC (CYCLIC REDUNDANCY CHECK) CODE
TCOM 370 NOTES 999 CYCLIC CODES, AND THE CRC (CYCLIC REDUNDANCY CHECK) CODE 1. CYCLIC CODES Cyclic codes are a special type of linear block code that are popular because they are very effective for error
More informationIntroduction to Computer Networks. Codes  Notations. Error Detecting & Correcting Codes. Parity. TwoDimensional Bit Parity
Introduction to Computer Networks Error Detecting & Correcting Codes Codes  Notations K bits of data encoded into n bits of information. nk bits of redundancy The information data is of length K The
More informationSheet 7 (Chapter 10)
King Saud University College of Computer and Information Sciences Department of Information Technology CAP240 First semester 1430/1431 Multiplechoice Questions Sheet 7 (Chapter 10) 1. Which error detection
More informationChapter 10 Error Detection and Copyright The McGrawHill Companies, Inc. Permission required for reproduction or display.
Chapter 10 Error Detection and Correction 10.1 Copyright The McGrawHill Companies, Inc. Permission required for reproduction or display. Note Data can be corrupted during transmission. Some applications
More informationAN INTRODUCTION TO ERROR CORRECTING CODES Part 1
AN INTRODUCTION TO ERROR CORRECTING CODES Part 1 Jack Keil Wolf ECE 154C Spring 2008 Noisy Communications Noise in a communications channel can cause errors in the transmission of binary digits. Transmit:
More informationThe Coding Theory Workbook
The Coding Theory Workbook A companion to EE 567 Version 1.1 Spring 2016 Matthew C. Valenti, Ph.D., P.E. West Virginia University Copyright 2012, Matthew C. Valenti Contents 1 Finite Fields 1 1.1 Sets
More informationCyclic Redundancy Checks
Cyclic Redundancy Checks Will Hasenplaugh Intel Corporation October 16, 2006 Outline Introduction to Error Control Systems Properties and Examples Cyclic Redundancy Checks Homework Break Linear Time CRC
More informationThe finite field with 2 elements The simplest finite field is
The finite field with 2 elements The simplest finite field is GF (2) = F 2 = {0, 1} = Z/2 It has addition and multiplication + and defined to be 0 + 0 = 0 0 + 1 = 1 1 + 0 = 1 1 + 1 = 0 0 0 = 0 0 1 = 0
More informationLinear Codes. Chapter 3. 3.1 Basics
Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length
More informationBinary Hamming Codes
Coding Theory Massoud Malek Binary Hamming Codes Hamming codes were discovered by R.W. Hamming and M. J. E. Golay. They form an important class of codes they have interesting properties and are easy to
More informationCoding Theory. Decimal Codes
Coding Theory Massoud Malek Decimal Codes To make error correcting codes easier to use and analyze, it is necessary to impose some algebraic structure on them. It is especially useful to have an alphabet
More informationReedSolomon Codes. by Bernard Sklar
ReedSolomon Codes by Bernard Sklar Introduction In 1960, Irving Reed and Gus Solomon published a paper in the Journal of the Society for Industrial and Applied Mathematics [1]. This paper described a
More informationFor decimal numbers we have 10 digits available (0, 1, 2, 3, 9) For binary numbers we have 2 digits available, 0 and 1.
Math 167 Ch 17 Review 1 (c) Janice Epstein, 2014 CHAPTER 17 INFORMATION SCIENCE Binary and decimal numbers a short review: For decimal numbers we have 10 digits available (0, 1, 2, 3, 9) 4731 = For binary
More informationError Detection. two copies of data receiver compares copies equal then no error. probability of same bits corrupted low.
Error Detection Add redundant bits simple case two copies of data receiver compares copies equal then no error. probability of same bits corrupted low. Add k bits
More informationDetecting Bit Errors LECTURE 7
MIT 6.02 DRAFT Lecture Notes Fall 2010 (Last update: October 7, 2010) Comments, questions or bug reports? Please contact 6.02staff@mit.edu LECTURE 7 Detecting Bit Errors These lecture notes discuss some
More informationHamming and Golay Codes
Hamming and Golay Codes Satish kumar Buddha Indiana State University Terre Haute,IN 47809, USA December 14, 2011 Abstract This project is about error detection and correction using hamming and golay codes.
More informationError Detection & Message Flow Control. Oswald Jumira Stellenbosch University
Error Detection & Message Flow Control Oswald Jumira oswald@ml.sun.ac.za Stellenbosch University Channel Coding Class of signal transformations designed to improve communications performances by enabling
More informationDigital Fundamentals
Digital Fundamentals with PLD Programming Floyd Chapter 2 29 Pearson Education Decimal Numbers The position of each digit in a weighted number system is assigned a weight based on the base or radix of
More informationError Detection and Correction: Parity Check Code; Bounds Based on Hamming Distance
Error Detection and Correction: Parity Check Code; Bounds Based on Hamming Distance Greg Plaxton Theory in Programming Practice, Fall 2005 Department of Computer Science University of Texas at Austin Error
More informationCyclic Redundancy Checking
Cyclic Redundancy Checking Norman Matloff Dept of Computer Science University of California at Davis c 2001, N Matloff September 7, 2001 1 The Importance of Error Detection A transmitted bit can be received
More informationReview/Outline Review: Check matrix criterion for min dist Vandermonde matrices ReedSolomon codes Models, computations in finite fields Today:
Review/Outline Review: Check matrix criterion for min dist Vandermonde matrices ReedSolomon codes Models, computations in finite fields Today: Hamming codes BoseChaudhuriHocquengham (BCH) codes 1 Hamming
More informationASS.PROF.DR Thamer Information Theory 4th Class in Communication. Finite Field Arithmetic. (Galois field)
Finite Field Arithmetic (Galois field) Introduction: A finite field is also often known as a Galois field, after the French mathematician Pierre Galois. A Galois field in which the elements can take q
More information6.263/16.37: Lecture 2. The Data Link Layer: Framing and Error Detection
6.263/16.37: Lecture 2 The Data Link Layer: Framing and Error Detection MIT Slide 1 Data Link Layer (DLC) Responsible for reliable transmission of packets over a link Framing: Determine the start and end
More informationLinear Codes. In the V[n,q] setting, the terms word and vector are interchangeable.
Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a subvector space of V[n,q]. If the subspace of V[n,q]
More information6.02 Fall 2012 Lecture #5
6.2 Fall 22 Lecture #5 Error correction for linear block codes  Syndrome decoding Burst errors and interleaving 6.2 Fall 22 Lecture 5, Slide # Matrix Notation for Linear Block Codes Task: given kbit
More informationModule 3. Data Link control. Version 2 CSE IIT, Kharagpur
Module 3 Data Link control Lesson 2 Error Detection and Correction Special Instructional Objectives: On completion of this lesson, the student will be able to: Explain the need for error detection and
More informationAn important class of codes are linear codes in the vector space Fq n, where F q is a finite field of order q.
Chapter 3 Linear Codes An important class of codes are linear codes in the vector space Fq n, where F q is a finite field of order q. Definition 3.1 (Linear code). A linear code C is a code in Fq n for
More informationAn Introduction to Galois Fields and ReedSolomon Coding
An Introduction to Galois Fields and ReedSolomon Coding James Westall James Martin School of Computing Clemson University Clemson, SC 296341906 October 4, 2010 1 Fields A field is a set of elements on
More informationIntroduction to Algebraic Coding Theory
Introduction to Algebraic Coding Theory Supplementary material for Math 336 Cornell University Sarah A. Spence Contents 1 Introduction 1 2 Basics 2 2.1 Important code parameters..................... 4
More informationModulo a Prime Number
Modulo a Prime Number We have seen that modular arithmetic can both be easier than normal arithmetic (in how powers behave), and more difficult (in that we can t always divide). But when n is a prime number,
More informationEITN20, PWC part 2 Lecture 1: Project overview and cyclic redundancy check (CRC) codes. Fredrik Rusek, Lund University
EITN20, PWC part 2 Lecture 1: Project overview and cyclic redundancy check (CRC) codes Fredrik Rusek, Lund University Timeline HT1 Fredrik: At LTH Mondays and Wednesdays At Huawei, Tuesdays, Thursdays,
More informationCoding Theory and Applications. Solved Exercises and Problems of Linear Codes. Enes Pasalic University of Primorska Koper, 2013
Coding Theory and Applications Solved Exercises and Problems of Linear Codes Enes Pasalic University of Primorska Koper, 2013 Contents 1 Preface 3 2 Problems 4 2 1 Preface This is a collection of solved
More informationSome facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)
Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the
More informationCoding Theory. Kenneth H. Rosen, AT&T Laboratories.
5 Coding Theory Author: Kenneth H. Rosen, AT&T Laboratories. Prerequisites: The prerequisites for this chapter are the basics of logic, set theory, number theory, matrices, and probability. (See Sections
More informationThe Essentials of Computer Organization and Architecture. Linda Null and Julia Lobur Jones and Bartlett Publishers, 2003
The Essentials of Computer Organization and Architecture Linda Null and Julia Lobur Jones and Bartlett Publishers, 2003 Chapter 2 Instructor's Manual Chapter Objectives Chapter 2, Data Representation,
More informationData Link Layer Overview
Data Link Layer Overview Date link layer deals with two basic issues: Part I How data frames can be reliably transmitted, and Part II How a shared communication medium can be accessed In many networks,
More informationChapter 4 Digital Data Communication Techniques
Chapter 4 Digital Data Communication Techniques Department of CIS Columbus, OH 43210 Jain@ACM.Org http://www.cis.ohiostate.edu/~jain/ 41 Overview Asynchronous vs Synchronous Transmissions Error Detection:
More informationPolynomials can be added or subtracted simply by adding or subtracting the corresponding terms, e.g., if
1. Polynomials 1.1. Definitions A polynomial in x is an expression obtained by taking powers of x, multiplying them by constants, and adding them. It can be written in the form c 0 x n + c 1 x n 1 + c
More informationData Coding and Error Checking Techniques
Data Coding and Error Checking Techniques Bruce Peterson Accolade Engineering Solutions 15520 Rockfield Blvd., Suite H Irvine, CA 92618 9495978378 www.accoladeeng.com 1.0 Introduction The purpose of
More informationCHAPTER 2 Data Representation in Computer Systems
CHAPTER 2 Data Representation in Computer Systems 2.1 Introduction 47 2.2 Positional Numbering Systems 48 2.3 Converting Between Bases 48 2.3.1 Converting Unsigned Whole Numbers 49 2.3.2 Converting Fractions
More informationExample. If n = 38 and m = 7, = where 5 is the quotient and 3 is the remainder. Alternatively, we sometimes write 38 7 = 5 R 3.
Division Algorithm We start with a fundamental fact about the integers, the set { 4, 3, 2, 1, 0, 1, 2, 3, 4, }. Division algorithm: If n is an integer and m is a positive integer, then n can be expressed
More informationImplementation of communication using Cyclic Redundancy Check
Implementation of communication using Cyclic Redundancy Check Jyoti Wadhwani 1, Prof. Nitin Narkhede 2 1 Department of Electronics Engineering RCOEM, Nagpur, 2 Department of Electronics & Telecommunication
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationECEN 5682 Theory and Practice of Error Control Codes
ECEN 5682 Theory and Practice of Error Control Codes Convolutional Codes University of Colorado Spring 2007 Linear (n, k) block codes take k data symbols at a time and encode them into n code symbols.
More informationCSE 461: Introduction to Computer Communications Networks Autumn Module 2.5 Bit Encoding and Errors
CSE 461: Introduction to Computer Communications Networks Autumn 2010 Module 2.5 Bit Encoding and Errors Ivayla Dermendjieva iva@cs.washington.edu Some material borrowed from slides by Jeremy Elson and
More informationINTRODUCTION TO CODING THEORY: BASIC CODES AND SHANNON S THEOREM
INTRODUCTION TO CODING THEORY: BASIC CODES AND SHANNON S THEOREM SIDDHARTHA BISWAS Abstract. Coding theory originated in the late 1940 s and took its roots in engineering. However, it has developed and
More informationAs we have discussed, digital circuits use binary signals but are required to handle
Chapter 2 CODES AND THEIR CONVERSIONS 2.1 INTRODUCTION As we have discussed, digital circuits use binary signals but are required to handle data which may be alphabetic, numeric, or special characters.
More informationHomework 5 Solutions
Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which
More informationDiscrete Mathematics: Homework 7 solution. Due: 2011.6.03
EE 2060 Discrete Mathematics spring 2011 Discrete Mathematics: Homework 7 solution Due: 2011.6.03 1. Let a n = 2 n + 5 3 n for n = 0, 1, 2,... (a) (2%) Find a 0, a 1, a 2, a 3 and a 4. (b) (2%) Show that
More informationMASTER OF ENGINEERING IN ELECTRONICS AND COMMUNICATION ENGINEERING
VHDL IMPLEMENTATION OF REED SOLOMON CODES The Thesis submitted in partial fulfillment of the requirements for the award of the degree of MASTER OF ENGINEERING IN ELECTRONICS AND COMMUNICATION ENGINEERING
More informationData Link Layer(1) Principal service: Transferring data from the network layer of the source machine to the one of the destination machine
Data Link Layer(1) Principal service: Transferring data from the network layer of the source machine to the one of the destination machine Virtual communication versus actual communication: Specific functions
More informationError detection using CRC
Error detection using CRC The goal of this task is to become familiar with functional principles of CRC (Cyclic Redundancy Check):  math background  error detection features  practical implementation
More informationReview of Number Systems The study of number systems is important from the viewpoint of understanding how data are represented before they can be processed by any digital system including a computer. Different
More informationThe string of digits 101101 in the binary number system represents the quantity
Data Representation Section 3.1 Data Types Registers contain either data or control information Control information is a bit or group of bits used to specify the sequence of command signals needed for
More informationCODING THEORY: INTRODUCTION TO LINEAR CODES AND APPLICATIONS
InSight: RIVIER ACADEMIC JOURNAL, VOLUME 4, NUMBER 2, FALL 2008 CODING THEORY: INTRODUCTION TO LINEAR CODES AND APPLICATIONS Jay Grossman * Undergraduate Student, B.A. in Mathematics Program, Rivier College
More informationNotes 11: List Decoding Folded ReedSolomon Codes
Introduction to Coding Theory CMU: Spring 2010 Notes 11: List Decoding Folded ReedSolomon Codes April 2010 Lecturer: Venkatesan Guruswami Scribe: Venkatesan Guruswami At the end of the previous notes,
More informationFUNDAMENTALS of INFORMATION THEORY and CODING DESIGN
DISCRETE "ICS AND ITS APPLICATIONS Series Editor KENNETH H. ROSEN FUNDAMENTALS of INFORMATION THEORY and CODING DESIGN Roberto Togneri Christopher J.S. desilva CHAPMAN & HALL/CRC A CRC Press Company Boca
More informationFPGA Implementation of Cyclic Code Encoder and Decoder
Advance in Electronic and Electric Engineering. ISSN 22311297, Volume 4, Number 3 (2014), pp. 273278 Research India Publications http://www.ripublication.com/aeee.htm FPGA Implementation of Cyclic Code
More informationCoping with Bit Errors using Error Correction Codes
MIT 6.02 DRAFT Lecture Notes Last update: September 23, 2012 CHAPTER 5 Coping with Bit Errors using Error Correction Codes Recall our main goal in designing digital communication networks: to send information
More informationUnderstanding Binary Numbers. Different Number Systems. Conversion: Bin Hex. Conversion MAP. Binary (0, 1) Hexadecimal 0 9, A(10), B(11),, F(15) :
Understanding Binary Numbers Computers operate on binary values (0 and 1) Easy to represent binary values electrically Voltages and currents. Can be implemented using circuits Create the building blocks
More informationChapter 3: Sample Questions, Problems and Solutions Bölüm 3: Örnek Sorular, Problemler ve Çözümleri
Chapter 3: Sample Questions, Problems and Solutions Bölüm 3: Örnek Sorular, Problemler ve Çözümleri Örnek Sorular (Sample Questions): What is an unacknowledged connectionless service? What is an acknowledged
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF SECTION 4.4 Direct Proof and Counterexample IV: Division into Cases and the QuotientRemainder Theorem Copyright Cengage Learning. All rights reserved.
More informationChapter 1 Binary Systems 11. Digital Systems
Chapter 1 Binary Systems 11. Digital Systems The Generalpurpose digital computer is the bestknown example of a digital system. The major parts of a computer are a memory unit, a central processing unit,
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.4 Direct Proof and Counterexample IV: Division into Cases and the QuotientRemainder Theorem
More informationCoding Theory Pythagorean Codes Massoud Malek. By looking at the legs of a rightangle triangle (a, b, c), Pythagoras gave us the first theorem:
By looking at the legs of a rightangle triangle (a, b, c), Pythagoras gave us the first theorem: a 2 + b 2 = c 2 The leg c, is called the hypotenuse. If no other number except one divides both a and b,
More informationHere 4 is the least significant digit (LSD) and 2 is the most significant digit (MSD).
Number System Introduction Number systems provide the basis for all operations in information processing systems. In a number system the information is divided into a group of symbols; for example, 26
More informationWhat Types of ECC Should Be Used on Flash Memory?
What Types of ECC Should Be Used on Flash Memory? Application 1. Abstract NOR Flash normally does not need ECC (ErrorCorrecting Code). On the other hand, NAND requires ECC to ensure data integrity. NAND
More informationChapter 3 Digital Transmission
Chapter 3 Digital Transmission Fundamentals Digital Representation of Information Why Digital Communications? Digital Representation of Analog Signals Characterization of Communication Channels Fundamental
More informationDefinition: Group A group is a set G together with a binary operation on G, satisfying the following axioms: a (b c) = (a b) c.
Algebraic Structures Abstract algebra is the study of algebraic structures. Such a structure consists of a set together with one or more binary operations, which are required to satisfy certain axioms.
More informationProblem Set 7  Fall 2008 Due Tuesday, Oct. 28 at 1:00
18.781 Problem Set 7  Fall 2008 Due Tuesday, Oct. 28 at 1:00 Throughout this assignment, f(x) always denotes a polynomial with integer coefficients. 1. (a) Show that e 32 (3) = 8, and write down a list
More informationImplementing CRCCs in Altera Devices
Implementing CRCCs in Altera Devices October 2005 ver.2.1 Application Note 049 Introduction Redundant encoding is a method of error detection that spreads the information across more bits than the original
More information13. NUMBERS AND DATA 13.1 INTRODUCTION
13. NUMBERS AND DATA 13.1 INTRODUCTION Base 10 (decimal) numbers developed naturally because the original developers (probably) had ten fingers, or 10 digits. Now consider logical systems that only have
More informationCHAPTER 1 BINARY SYSTEM
STUDENT COPY DIGITAL & MICROPROCESSORS 3 CHAPTER 1 BINARY SYSTEM Base Conversion: A number a n, a n 1 a 2, a 1 a 0 a 1 a 2 a 3 expressed in a base r system has coefficient multiplied by powers of r. n
More informationBit Error Rate Analysis of ReedSolomon Code for Efficient Communication System
Bit Error Rate Analysis of ReedSolomon Code for Efficient Communication System Sanjeev Kumar Asst. Professor/ ECE Amritsar college of Engg. & Technology, Amritsar, 143001, India Ragini Gupta M.Tech Scholar/ECE
More informationLSN 2 Number Systems. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology
LSN 2 Number Systems Department of Engineering Technology LSN 2 Decimal Number System Decimal number system has 10 digits (09) Base 10 weighting system... 10 5 10 4 10 3 10 2 10 1 10 0. 101 102 103
More informationChapter 3: Elementary Number Theory and Methods of Proof. January 31, 2010
Chapter 3: Elementary Number Theory and Methods of Proof January 31, 2010 3.4  Direct Proof and Counterexample IV: Division into Cases and the QuotientRemainder Theorem QuotientRemainder Theorem Given
More informationMODULAR ARITHMETIC KEITH CONRAD
MODULAR ARITHMETIC KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic. Applications of modular arithmetic
More information7. Some irreducible polynomials
7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of
More informationError Detection and Correction
Error Detection and Correction 1. Types of Errors Whenever bits flow from one point to another, they are subject to unpredictable changes because of interference. This interference can change the shape
More informationLogic Design. Dr. Yosry A. Azzam
Logic Design Dr. Yosry A. Azzam Binary systems Chapter 1 Agenda Binary Systems : Binary Numbers, Binary Codes, Binary Logic ASCII Code (American Standard Code for Information Interchange) Boolean Algebra
More informationLecture slides prepared by Dr Lawrie Brown for Data and Computer Communications, 8/e, by William Stallings, Chapter 6 Digital Data
Lecture slides prepared by Dr Lawrie Brown (UNSW@ADFA) for Data and Computer Communications, 8/e, by William Stallings, Chapter 6 Digital Data Communications Techniques. 1 This quote from the start of
More informationMODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.
MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on
More informationNumber Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may
Number Theory Divisibility and Primes Definition. If a and b are integers and there is some integer c such that a = b c, then we say that b divides a or is a factor or divisor of a and write b a. Definition
More informationPROBLEM SET # 2 SOLUTIONS
PROBLEM SET # 2 SOLUTIONS CHAPTER 2: GROUPS AND ARITHMETIC 2. Groups.. Let G be a group and e and e two identity elements. Show that e = e. (Hint: Consider e e and calculate it two ways.) Solution. Since
More informationComputer Networks Answers for Assignment No. 1 Semester 2, 2010
Computer Networks 159.334 Answers for Assignment No. 1 Semester 2, Problems Question 1 Professor Richard Harris 1.1 Suppose the length of a Base5 cable is 20 metres. If the speed of propagation in a thick
More informationThe processor can usually address a memory space that is much larger than the memory space covered by an individual memory chip.
Memory ddress Decoding The processor can usually address a memory space that is much larger than the memory space covered by an individual memory chip. In order to splice a memory device into the address
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationR&D White Paper WHP 031. ReedSolomon error correction. Research & Development BRITISH BROADCASTING CORPORATION. July 2002. C.K.P.
R&D White Paper WHP 03 July 00 Reedolomon error correction C.K.P. Clarke Research & Deelopment BRITIH BROADCATING CORPORATION BBC Research & Deelopment White Paper WHP 03 Reedolomon Error Correction
More informationChapter 1: Digital Systems and Binary Numbers
Chapter 1: Digital Systems and Binary Numbers Digital age and information age Digital computers general purposes many scientific, industrial and commercial applications Digital systems telephone switching
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More information1 Gaussian Elimination
Contents 1 Gaussian Elimination 1.1 Elementary Row Operations 1.2 Some matrices whose associated system of equations are easy to solve 1.3 Gaussian Elimination 1.4 GaussJordan reduction and the Reduced
More informationError Control Coding and Ethernet
Error Control Coding and Ethernet Steven W. McLaughlin and David Warland Calimetrics, Inc. Alameda, CA smclaughlin@calimetrics.com 1 Agenda Background on error control coding History of error control coding
More informationminimal polyonomial Example
Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We
More informationIntroduction Number Systems and Conversion
UNIT 1 Introduction Number Systems and Conversion Objectives 1. Introduction The first part of this unit introduces the material to be studied later. In addition to getting an overview of the material
More informationJUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
More informationElementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More informationDecimaltoBinary Conversion. Computer & Microprocessor Architecture HCA103. Repeated Divisionby2 Method. Repeated Multiplicationby2 Method
DecimaltoBinary Conversion Computer & Microprocessor Architecture HCA103 Computer Arithmetic Algorithm 1 Step 1: Break the number in two parts: Whole number and fraction part. Step 2: Repeated Divisionby2
More information