INPUT TO (TM/TC) CHANNEL CODING GREEN BOOK(s) AS DISCUSSED AT THE MEETING IN CRYSTAL CITY, VA (USA) on 12 March Frame Error Control Field
|
|
- Marylou Hicks
- 5 years ago
- Views:
Transcription
1 INUT TO (TM/TC) CHANNEL CODING GREEN BOOK(s) AS DISCUSSED AT THE MEETING IN CRYSTAL CITY, VA (USA) on 12 March Frame Error Control Field [Reply to comment GC2] - Section of CCSDS 13.1-G-1 provides information about the error detection capability of a generic CRC obtained by cyclic code shortening. On the other hand, in this document the error detection capability is specifically discussed for the CRC CCITT. - Only generic information about CRC encoding and decoding are provided in CCSDS 13.1-G-1. More detailed information is provided in the present document. - Section of CCSDS 13.1-G-1 also contains a figure clarifying the concatenation of the CRC and Turbo encoder. - Section of CCSDS 13.1-G-1 discusses the situations where the use of CRC is advisable and the situations where the use of CRC can be avoided (e.g., RS code with E=16). Comment [GC1]: It is proposed this update to be inserted into the Channel Coding Breen Book and not in the (partly) obsolete TM Green Book. Comment [GC2]: CCSDS 13.1-G-1 contains a section called: 8.4 CERTIFICATION OF THE DECODED DATA (FRAME INTEGRITY CHECKS) It shall be checked how this input integrates with this section about CRC in Turbo Codes. Theoretical Background The Frame Error Control Field (FECF) of the TM/TC Transfer Frame is more commonly known in coding theory as Cyclic Redundancy Check (CRC), i.e. a binary systematic code used to detect bit errors after transmission. Usually, the term CRC refers to the parity bits produced by the encoding circuit, which are appended to the message before transmission. The concatenation of bit message and CRC is known as codeword. Rather than a cyclic code, the CRC is usually a shortened cyclic code. The CRC encoding and error detection procedure can be conveniently described by means of polynomials in binary algebra. This is possible by representing a message of k bits as a binary polynomial of degree k - 1. In [TM SDL Blue book] it is adopted the convention to represent a bit message [M, M 1,, M k-2, M k-1 ] of length k as a polynomial M(X) = M X k-1 + M 1 X k M k-2 X + M k-1. Conventionally, the coefficient M of the highest power of X is the bit which is transferred first. Adopting this polynomial description, a (n-k)-bits CRC is computed as the remainder (X) = X n-k X n-k n-k-2 X + n-k-1 of the long division between the degree n - 1 polynomial M(X) X n-k, where M(X) is the message polynomial of degree k-1, and a degree-(n-k) polynomial G(X) known as the generator polynomial, i.e. M(X) X n-k = G(X) Q(X) + (X), where Q(X) is the quotient of the division, which is not used. In other words we have
2 (X) = M(X) X n-k modulo G(X) (1) The CRC encoding principle is sketched in Figure 1, where the message bit M is input first to the encoder and the encoded bits are output in the order M,, q. M, M 1,, M k-2, M k-1 CRC ENCODER M, M 1,, M k-2, M k-1,, 1,, n-k-2, n-k-1 Figure 1: CRC encoding principle The CRC encoding block can be conveniently implemented using linear feedback shift-register (LFSR) circuits. In particular, the above mentioned long division is performed by the circuit shown in [TM SDL blue book, Figure ink 1], which was first proposed in [1]. INFORMATION BITS (M transferred first) M M n-17 (1) (1) Comment [GC3]: It may be wise to repeat the drawings here instead of just referencing to other books. Comment [GC4]: It may be wise to repeat the drawings here instead of just referencing to other books. CODED DATA OUTUT (2) (2) ZERO X X 1 X 2 X 3 X 4 X 5 X 6 X 7 X X 9 X 1 X 11 X X X 14 X rovided that all the shift register storage cells are initialized to, the coefficients of the remainder (X) are stored in the cells in the clock time in which the bit M k-1 is output by the encoding circuit. The CRC error detection is based on the following observation (use binary algebra): M(X) X n-k = G(X) Q(X) + R(X) M(X) X n-k + R(X) = G(X) Q(X), where M(X) X n-k + R(X) is the polynomial representation of the transmitted codeword, which is divisible by G(X). Then, on the decoding side, the remainder of the division between the n-bits received message C * (X) = C * X n-1 + C * 1 X n C * n-2 X + C * n-1 and G(X) is checked. This remainder is known as the syndrome, denoted by S(X) = S X n-k-1 + S 1 X n-k S n-k-2 X + S n-k-1. Comment [GC5]: Here C(X) should be replaced by C*(X) Comment [GC6]: It seems that C* as received codeblock (opposite to the transmitted codeblock) is not defined.
3 [Reply to comment GC6] A possibility is to modify from Then, on the decoder size to the expression of S(X) as follows: Let C * (X) = C * X n-1 + C * 1 X n C * n-2 X + C * n-1 denote the n-bits received message on the decoder side. Here, the remainder of the division between C * (X) and G(X) is checked. This remainder is known as the syndrome, denoted by S(X) = S X n-k-1 + S 1 X n-k S n-k-2 X + S n-k-1. Comment [GC7]: Here C(X) should be replaced by C*(X) Comment [GC8]: It seems that C* as received codeblock (opposite to the transmitted codeblock) is not defined. Then we have S(X) = C * (X) mod G(X). (2) If the syndrome is the all-zero string, then the received message is a valid codeword and the transmission is assumed as correct and incorrect otherwise. An undetected error takes place when the syndrome is the all zero string but the transmitted codeword was affected by errors. A LFSR circuit which allows checking the syndrome of the received word C * (X) is sketched in [TM SDL Blue book, Figure ink 2]. [Reply to comment GC7] The acronym LFSR (linear feedback shift-register) was actaully explained at its first use, a few lines above. OK for adding it to the acronym list. Comment [GC9]: Acronym to be explained in the first occurrence and to be included (if not yet) in the acronyms list. Comment [GC1]: Again, better repeating the drawing S S S S 15 S S S S S S 12 S S S S 11 1 S 9 S X X 1 X 2 X 3 X 4 X 5 X 6 X 7 X X 9 X 1 X 11 X X X 14 X FRAME BITS C C n-1 (C transferred first) This circuit is essentially the same that is used for encoding. All the storage cells of the shift register are initialized to. The syndrome of C * (X) is present in the shift register cells in the time clock subsequent to that in which the bit C * n-1 is input to the circuit. It is worthwhile noting that, using this circuit, one will actually check the remainder of the division between X n-k C * (X) and G(X): since G(X) has not X among its factors, the syndrome of C * (X) is zero if and only if the syndrome of X n-k C * (X) is zero. CCSDS Recommended CRC: Encoding and Error Detection
4 The 16-bit FECF (n k = 16) recommended by the CCSDS for the TM Space Data Link rotocol and for the TC Space Data Link rotocol is the CRC CCITT, whose generating polynomial is given by G(X) = X 16 + X 12 + X (3) We know that a necessary and sufficient condition for the corresponding binary (n, k) code to be cyclic is that G(X) is a factor of X n + 1. It is possible to show that the smallest n such that this condition is fulfilled is n = (2 15-1), so that selecting k = and using the encoding circuit of [TM SDL Blue book, Figure ink 2] we obtain a (32767, 32751) code, where the value n = is sometimes called the natural length. When using the encoding circuit of [TM SDL Blue book, Figure ink 2] with some k < we loose the code cyclicity. The obtained code is known as shortened cyclic code. In theory the initial value of the shift register storage cells has no affect on the CRC undetected error probability (the error detection capability of a CRC code employing the generating polynomial (3) is discussed in the next subsection.). However, there might be practical considerations leading to prefer an initial word to another one. For example, any CRC encoder where all the shift register storage cells are initialized to has no state transition if an all-zero message is input. In some situations a non-zero initial word may be preferred. A non-zero initial word is recommended in [TM SDL Blue book], where the encoding and syndrome computation rules are slightly different from (1) and (2). A degree-15 presetting polynomial 15 L(X) = i = i X (4) is first introduced, corresponding to the all-one sequence of length 16. Then, the FECF (encoding side) and the syndrome (decoding side) are computed as and FECF = [(X 16 M(X)) + (X (n 16) L(X))] mod G(X) (5) S(X) = [(X 16 C * (X)) + (X n L(X))] mod G(X) (6) respectively. It is possible to show that (5) and (6) correspond to input M(X) and C * (X) to the encoding and decoding circuits, respectively, presetting in both circuits all the storage cells to one. A formal proof can be found in [2]. Error Detection Capability In general, the error detection capability of a shortened cyclic code depends on the generating polynomial G(X) and on the input message length (k). We discuss next the error detection capability of a shortened cyclic code with G(X) = X 16 + X 12 + X Comment [GC11]: Correct the style to be less paper oriented.
5 [Reply to Comment GC11] We may modify just removing the phrase starting with We discuss next and writing Concerning the CRC with G(X) = X 16 + X 12 + X 5 + 1, its minimum distance is equal to. The minimum distance of this CRC code is equal to 4 for 2 k < and is equal to 2 for k Then, if 2 k < any single, double or triple error is detected. Observing that G(X) = (X+1) (X 15 + X 14 + X 13 + X 12 + X 14 + X 13 + X 12 + X + 1), we recognize that (X + 1) is a factor of G(X), that is the code provides a parity-check, which ensures that any pattern of an odd number of errors is detected. In general, if the bit errors take place independent of each other with probability e, then the undetected error probability of the CRC CCITT code can be approximated as u = A 4 e 4 (1- e ) n-4, where the values of A 4 as a function of k are provided in [3], where it is also advised that common operations such as bit stuffing can dramatically increase the undetected error probability. [Reply to Comment GC12]. For any (n,k) linear block code over the BSC, an undetected error occurs when the error pattern is a non-zero codeword. Letting p denote the error probability of the BSC, and letting A i denote the multiplicity of the weight-i codewords (i.e., the weight enumerating function), we have Comment [GC12]: This formula is causing some debate; ACTION to check and comment against the referenced paper. Comment [GC13]: Should in u the letter u be subscript? The same for letter e in e. Comment [GC14]: It could be very nice to add a table showing the values of such a probability for some typical frames sizes. The table could be limited to the frame sized allowed for Turbo Codes + I=8. u = n i = 1 A i p i ( 1 p) n 1 For small enough p, this is well approximated by considering only the terms in the summation associated with minimum weight codewords. More in general, by considering only this term, a lower bound on the undetected error probability is obtained. Note that the CCITT CRC has d min =4 for the frame lengths of interest for the CCSDS. Then, the term associated with A 4 has to be considered. It is worthwhile noting that in some real situations the errors are not independent but occur in bursts (this may be the case when using an error correcting code). By definition, the received sequence is said to be affected by a burst error of length b when the error pattern only occurs over a span of b encoded bits. More specifically, two bits of index j and j + b 1 within the same codeword are in error, some of the intermediate b 2 bits are in error and all the other bits are correctly received. A CRC constructed by shortening a cyclic code is capable of detecting any error burst of length b n k. This is because the error detection capability of a shortened cyclic code is at least the same as the original cyclic code. In the specific case of the CRC CCITT this means that the code is capable of detecting any burst error of length 16 or less. The expression (b, p) probabilistic burst error is used sometimes to refer to a burst error of length b where each of the b 2 intermediate encoding bits is in error with probability p. An analysis of the undetected error probability of cyclic and shortened cyclic codes affected by probabilistic burst errors can be found, for instance, in [4], [5].
6 References [1] W.W. eterson and D.T. Brown, Cyclic Codes for Error Detection, roceedings of the IRE, vol. 49, no. 1, pp , Jan [2] T.G. Berry, A note on the modified CRC, ACM SIGCOMM Computer Communication Review, vol. 2, no. 5, pp , Oct [3] D. Fiorini, M. Chiani, V. Tralli and C. Salati, Can we trust in HDLC?, ACM SIGCOMM Computer Communication Review, vol. 24, no. 5, pp. 61 8, Oct [4] V.K. Agarwal and A. Ivanov, Computing the robability of Undetected Error for Shortened Cyclic Codes, IEEE Transactions on Communications, vol. 4, no. 3, pp , Mar [5] J.K. Wolf and D. Chun, The Single Burst Error Detection erformance of Binary Cyclic Codes, IEEE Transactions on Communications, vol. 42, no. 4, pp , Jan
Ch. 7 Error Detection and Correction
Ch. 7 Error Detection and Correction Error Detection and Correction Data can be corrupted during transmission. Some applications require that errors be detected and corrected. 2 1. Introduction Let us
More informationChapter 10 Error Detection and Correction. Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 10 Error Detection and Correction 0. Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Note The Hamming distance between two words is the number of differences
More informationCS321: Computer Networks Error Detection and Correction
CS321: Computer Networks Error Detection and Correction Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Jodhpur E-mail: manaskhatua@iitj.ac.in Error Detection and Correction Objective: System must
More informationSMALL DISTANCE CODES FOR HEADER ERROR DETECTION IN ATM NETWORKS
SMALL DISTANCE CODES FOR HEADER ERROR DETECTION IN ATM NETWORKS Tony Antonio Universitas Pancasila, Jakarta Jl. Srengseng Sawah Jagakarsa, Jakarta 12640 tony.antonio@yahoo.com Abstrak On transmission links
More informationEE 6900: FAULT-TOLERANT COMPUTING SYSTEMS
EE 6900: FAULT-TOLERANT COMPUTING SYSTEMS LECTURE 6: CODING THEORY - 2 Fall 2014 Avinash Kodi kodi@ohio.edu Acknowledgement: Daniel Sorin, Behrooz Parhami, Srinivasan Ramasubramanian Agenda Hamming Codes
More informationPROXIMITY-1 SPACE LINK PROTOCOL CODING AND SYNCHRONIZATION SUBLAYER
Draft Recommendation for Space Data System Standards PROXIMITY-1 SPACE LINK PROTOCOL CODING AND SYNCHRONIZATION SUBLAYER DRAFT RECOMMENDED STANDARD CCSDS 211.2-P-2.1 PINK SHEETS March 2019 Draft Recommendation
More informationError Correction and Detection using Cyclic Redundancy Check
Error Correction and Detection using Cyclic Redundancy Check Dr. T. Logeswari Associate Professor, Dept of Computer Science, New Horizon College, Banglore, Karnataka, India ABSTRACT: In this paper Cyclic
More informationImplementing CRCCs. Introduction. in Altera Devices
Implementing CRCCs in Altera Devices July 1995, ver. 1 Application Note 49 Introduction Redundant encoding is a method of error detection that spreads the information across more bits than the original
More informationCMSC 2833 Lecture 18. Parity Add a bit to make the number of ones (1s) transmitted odd.
Parity Even parity: Odd parity: Add a bit to make the number of ones (1s) transmitted even. Add a bit to make the number of ones (1s) transmitted odd. Example and ASCII A is coded 100 0001 Parity ASCII
More informationCSN Telecommunications. 5: Error Coding. Data, Audio, Video and Images Prof Bill Buchanan
CSN874 Telecommunications 5: Error Coding Data, Audio, Video and Images http://asecuritysite.com/comms Prof Bill Buchanan CSN874 Telecommunications 5: Error Coding: Modulo-2 Data, Audio, Video and Images
More informationEITF25 Internet Techniques and Applications L3: Data Link layer. Stefan Höst
EITF25 Internet Techniques and Applications L3: Data Link layer Stefan Höst Communication on physical layer To transmit on the physical medium use signals At each computer it can be seen as transmitting
More informationAdvanced Computer Networks. Rab Nawaz Jadoon DCS. Assistant Professor COMSATS University, Lahore Pakistan. Department of Computer Science
Advanced Computer Networks Department of Computer Science DCS COMSATS Institute of Information Technology Rab Nawaz Jadoon Assistant Professor COMSATS University, Lahore Pakistan Advanced Computer Networks
More informationELG3175 Introduction to Communication Systems. Introduction to Error Control Coding
ELG375 Introduction to Communication Systems Introduction to Error Control Coding Types of Error Control Codes Block Codes Linear Hamming, LDPC Non-Linear Cyclic BCH, RS Convolutional Codes Turbo Codes
More informationLecture / The Data Link Layer: Framing and Error Detection
Lecture 2 6.263/16.37 The Data Link Layer: Framing and Error Detection MIT, LIDS Slide 1 Data Link Layer (DLC) Responsible for reliable transmission of packets over a link Framing: Determine the start
More informationChapter 3. The Data Link Layer
Chapter 3 The Data Link Layer 1 Data Link Layer Algorithms for achieving reliable, efficient communication between two adjacent machines. Adjacent means two machines are physically connected by a communication
More informationCSE123A discussion session
CSE23A discussion session 27/2/9 Ryo Sugihara Review Data Link Layer (3): Error detection sublayer CRC Polynomial representation Implementation using LFSR Data Link Layer (4): Error recovery sublayer Protocol
More information4. Error correction and link control. Contents
//2 4. Error correction and link control Contents a. Types of errors b. Error detection and correction c. Flow control d. Error control //2 a. Types of errors Data can be corrupted during transmission.
More informationChapter 10 Error Detection and Correction 10.1
Chapter 10 Error Detection and Correction 10.1 10-1 INTRODUCTION some issues related, directly or indirectly, to error detection and correction. Topics discussed in this section: Types of Errors Redundancy
More informationChapter 3. The Data Link Layer. Wesam A. Hatamleh
Chapter 3 The Data Link Layer The Data Link Layer Data Link Layer Design Issues Error Detection and Correction Elementary Data Link Protocols Sliding Window Protocols Example Data Link Protocols The Data
More informationFault Tolerance & Reliability CDA Chapter 2 Additional Interesting Codes
Fault Tolerance & Reliability CDA 5140 Chapter 2 Additional Interesting Codes m-out-of-n codes - each binary code word has m ones in a length n non-systematic codeword - used for unidirectional errors
More informationSpace engineering. SpaceWire Protocols
Space engineering SpaceWire Protocols This ECSS is a draft standard circulated for xxxxxxxxxx. It is therefore subject to change without notice and may not be referred to as an ECSS Standard until published
More informationISO/OSI Reference Model. Data Link Layer. 7. Application. 6. Presentation. 5. Session. 4. Transport. 3. Network. 2. Data Link. 1.
Data Link Layer 1 ISO/OSI Reference Model 7. Application E-Mail, Terminal, Remote login 6. Presentation System dependent presentation of data (EBCDIC/ASCII) 5. Session Connection establishment, termination,
More informationAchieving Reliable Digital Data Communication through Mathematical Algebraic Coding Techniques
International Journal of Pure and Applied Mathematical Sciences. ISSN 0972-9828 Volume 9, Number 2 (2016), pp. 183-190 Research India Publications http://www.ripublication.com Achieving Reliable Digital
More informationA Novel Approach for Parallel CRC generation for high speed application
22 International Conference on Communication Systems and Network Technologies A Novel Approach for Parallel CRC generation for high speed application Hitesh H. Mathukiya Electronics and communication Department,
More information(Refer Slide Time: 2:20)
Data Communications Prof. A. Pal Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture-15 Error Detection and Correction Hello viewers welcome to today s lecture
More informationLecture 6: Reliable Transmission. CSE 123: Computer Networks Alex Snoeren (guest lecture) Alex Sn
Lecture 6: Reliable Transmission CSE 123: Computer Networks Alex Snoeren (guest lecture) Alex Sn Lecture 6 Overview Finishing Error Detection Cyclic Remainder Check (CRC) Handling errors Automatic Repeat
More informationLECTURE #34. Data Communication (CS601)
LECTURE #34 Error Detection And Correction Methods Longitudinal Red Check(LRC) o In LRC, a block of bits is organized in a table (rows and columns) o For example instead of sending 32 bits, we organize
More informationAnnouncement. (CSC-3501) Lecture 3 (22 Jan 2008) Today, 1 st homework will be uploaded at our class website. Seung-Jong Park (Jay)
Computer Architecture (CSC-3501) Lecture 3 (22 Jan 2008) Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark 1 Announcement Today, 1 st homework will be uploaded at our class website Due date is the beginning
More informationLecture 5: Data Link Layer Basics
Lecture 5: Data Link Layer Basics Dr. Mohammed Hawa Electrical Engineering Department University of Jordan EE426: Communication Networks Layer 2 PDU: Frame 2 1 Bit-oriented vs. Byte-oriented Layer 2 protocols
More informationPROXIMITY-1 SPACE LINK PROTOCOL CODING AND SYNCHRONIZATION SUBLAYER
Draft Recommendation for Space Data System Standards PROXIMITY-1 SPACE LINK PROTOCOL CODING AND SYNCHRONIZATION SUBLAYER DRAFT RECOMMENDED STANDARD CCSDS 211.2-P-1.1 PINK BOOK March 2012 Draft Recommendation
More informationInst: Chris Davison
ICS 153 Introduction to Computer Networks Inst: Chris Davison cbdaviso@uci.edu ICS 153 Data Link Layer Contents Simplex and Duplex Communication Frame Creation Flow Control Error Control Performance of
More informationCSMC 417. Computer Networks Prof. Ashok K Agrawala Ashok Agrawala. Nov 1,
CSMC 417 Computer Networks Prof. Ashok K Agrawala 2018 Ashok Agrawala 1 Message, Segment, Packet, and Frame host host HTTP HTTP message HTTP TCP TCP segment TCP router router IP IP packet IP IP packet
More informationCSE 123A Computer Networks
CSE 123A Computer Networks Winter 2005 Lecture 4: Data-Link I: Framing and Errors Some portions courtesy Robin Kravets and Steve Lumetta Last time How protocols are organized & why Network layer Data-link
More informationCSE 123: Computer Networks
Student Name: PID: UCSD email: CSE 123: Computer Networks Homework 1 Solution (Due 10/12 in class) Total Points: 30 Instructions: Turn in a physical copy at the beginning of the class on 10/10. Problems:
More informationDESIGN AND IMPLEMENTATION OF HIGH SPEED 64-BIT PARALLEL CRC GENERATION
DESIGN AND IMPLEMENTATION OF HIGH SPEED 64-BIT PARALLEL CRC GENERATION MADHURI KARUMANCHI (1), JAYADEEP PAMULAPATI (2), JYOTHI KIRAN GAVINI (3) 1 Madhuri Karumanchi, Dept Of ECE, SRM University, Kattankulathur,
More informationData link layer functions. 2 Computer Networks Data Communications. Framing (1) Framing (2) Parity Checking (1) Error Detection
2 Computer Networks Data Communications Part 6 Data Link Control Data link layer functions Framing Needed to synchronise TX and RX Account for all bits sent Error control Detect and correct errors Flow
More informationCSCI-1680 Link Layer I Rodrigo Fonseca
CSCI-1680 Link Layer I Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Last time Physical layer: encoding, modulation Today Link layer framing Getting frames
More information)454 6 TELECOMMUNICATION STANDARDIZATION SECTOR OF ITU
INTERNATIONAL TELECOMMUNICATION UNION )454 6 TELECOMMUNICATION STANDARDIZATION SECTOR OF ITU $!4! #/--5.)#!4)/. /6%2 4(% 4%,%0(/.%.%47/2+ #/$%).$%0%.$%.4 %22/2#/.42/, 3934%- )454 Recommendation 6 (Extract
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd Chapter 2 2009 Pearson Education, Upper 2008 Pearson Saddle River, Education NJ 07458. All Rights Reserved Decimal Numbers The position of each digit in a weighted
More informationUNIT-II 1. Discuss the issues in the data link layer. Answer:
UNIT-II 1. Discuss the issues in the data link layer. Answer: Data Link Layer Design Issues: The data link layer has a number of specific functions it can carry out. These functions include 1. Providing
More informationCSCI-1680 Link Layer Reliability Rodrigo Fonseca
CSCI-1680 Link Layer Reliability Rodrigo Fonseca Based partly on lecture notes by David Mazières, Phil Levis, John Janno< Last time Physical layer: encoding, modulation Link layer framing Today Getting
More information2 Asst Prof, Kottam College of Engineering, Chinnatekur, Kurnool, AP-INDIA,
www.semargroups.org ISSN 2319-8885 Vol.02,Issue.06, July-2013, Pages:413-418 A H/W Efficient 64-Bit Parallel CRC for High Speed Data Transactions P.ABDUL RASOOL 1, N.MOHAN RAJU 2 1 Research Scholar, Kottam
More informationCHAPTER 7. Copyright Cengage Learning. All rights reserved.
CHAPTER 7 FUNCTIONS Copyright Cengage Learning. All rights reserved. SECTION 7.1 Functions Defined on General Sets Copyright Cengage Learning. All rights reserved. Functions Defined on General Sets We
More informationPART III. Data Link Layer MGH T MGH C I 204
PART III Data Link Layer Position of the data-link layer Data link layer duties LLC and MAC sublayers IEEE standards for LANs Chapters Chapter 10 Error Detection and Correction Chapter 11 Data Link Control
More informationIntroduction to Computer Networks. 03 Data Link Layer Introduction
Introduction to Computer Networks 03 Data Link Layer Introduction Link Layer 1 Introduction and services 2 Link Layer Services 2.1 Framing 2.2 Error detection and correction 2.3 Flow Control 2.4 Multiple
More informationFault-Tolerant Computing
Fault-Tolerant Computing Dealing with Mid-Level Impairments Oct. 2007 Error Detection Slide 1 About This Presentation This presentation has been prepared for the graduate course ECE 257A (Fault-Tolerant
More informationA High Performance CRC Checker for Ethernet Application
A High Performance CRC Checker for Ethernet Application Deepti Rani Mahankuda & M. Suresh Electronics and Communication Engineering Dept. National Institute of Technology, Berhampur, Odisha, India. E-mail:deepti.rani07@gmail.com
More informationChapter 6 Digital Data Communications Techniques
Chapter 6 Digital Data Communications Techniques Asynchronous and Synchronous Transmission timing problems require a mechanism to synchronize the transmitter and receiver receiver samples stream at bit
More informationData Link Networks. Hardware Building Blocks. Nodes & Links. CS565 Data Link Networks 1
Data Link Networks Hardware Building Blocks Nodes & Links CS565 Data Link Networks 1 PROBLEM: Physically connecting Hosts 5 Issues 4 Technologies Encoding - encoding for physical medium Framing - delineation
More informationMYcsvtu Notes DATA REPRESENTATION. Data Types. Complements. Fixed Point Representations. Floating Point Representations. Other Binary Codes
DATA REPRESENTATION Data Types Complements Fixed Point Representations Floating Point Representations Other Binary Codes Error Detection Codes Hamming Codes 1. DATA REPRESENTATION Information that a Computer
More informationThe Data Link Layer Chapter 3
The Data Link Layer Chapter 3 Data Link Layer Design Issues Error Detection and Correction Elementary Data Link Protocols Sliding Window Protocols Example Data Link Protocols Revised: August 2011 & February
More informationTYPES OF ERRORS. Data can be corrupted during transmission. Some applications require that errors be detected and corrected.
Data can be corrupted during transmission. Some applications require that errors be detected and corrected. TYPES OF ERRORS There are two types of errors, 1. Single Bit Error The term single-bit error
More informationEC500. Design of Secure and Reliable Hardware. Lecture 9. Mark Karpovsky
EC500 Design of Secure and Reliable Hardware Lecture 9 Mark Karpovsky 1 1 Arithmetical Codes 1.1 Detection and Correction of errors in arithmetical channels (adders, multipliers, etc) Let = 0,1,,2 1 and
More informationCSE123A discussion session
CSE123A discussion session 2007/02/02 Ryo Sugihara Review Data Link layer (1): Overview Sublayers End-to-end argument Framing sublayer How to delimit frame» Flags and bit stuffing Topics Data Link Layer
More informationSome portions courtesy Robin Kravets and Steve Lumetta
CSE 123 Computer Networks Fall 2009 Lecture 4: Data-Link I: Framing and Errors Some portions courtesy Robin Kravets and Steve Lumetta Administrative updates I m Im out all next week no lectures, but You
More information64-bit parallel CRC Generation for High Speed Applications
64-bit parallel CRC Generation for High Speed Applications 1.P.Sushma (Student) 2.N.Sushma (Student) 3.V.Sowmya (Student) 4.B.Krishna Associate Professor 5.D.ArunKumar Assistant Professor KITE WOMEN S
More informationEfficient Majority Logic Fault Detector/Corrector Using Euclidean Geometry Low Density Parity Check (EG-LDPC) Codes
Efficient Majority Logic Fault Detector/Corrector Using Euclidean Geometry Low Density Parity Check (EG-LDPC) Codes 1 U.Rahila Begum, 2 V. Padmajothi 1 PG Student, 2 Assistant Professor 1 Department Of
More informationREVIEW ON CONSTRUCTION OF PARITY CHECK MATRIX FOR LDPC CODE
REVIEW ON CONSTRUCTION OF PARITY CHECK MATRIX FOR LDPC CODE Seema S. Gumbade 1, Anirudhha S. Wagh 2, Dr.D.P.Rathod 3 1,2 M. Tech Scholar, Veermata Jijabai Technological Institute (VJTI), Electrical Engineering
More informationLinear Block Codes. Allen B. MacKenzie Notes for February 4, 9, & 11, Some Definitions
Linear Block Codes Allen B. MacKenzie Notes for February 4, 9, & 11, 2015 This handout covers our in-class study of Chapter 3 of your textbook. We ll introduce some notation and then discuss the generator
More informationCSE 461: Framing, Error Detection and Correction
CSE 461: Framing, Error Detection and Correction Next Topics Framing Focus: How does a receiver know where a message begins/ends Error detection and correction Focus: How do we detect and correct messages
More informationCSCI-1680 Link Layer Reliability John Jannotti
CSCI-1680 Link Layer Reliability John Jannotti Based partly on lecture notes by David Mazières, Phil Levis, Rodrigo Fonseca Roadmap Last time Physical layer: encoding, modulation Link layer framing Today
More informationTelecom Systems Chae Y. Lee. Contents. Flow Control Error Detection/Correction Link Control (Error Control) Link Performance (Utility)
Data Link Control Contents Flow Control Error Detection/Correction Link Control (Error Control) Link Performance (Utility) 2 Flow Control Flow control is a technique for assuring that a transmitting entity
More informationCHAPTER 2 Data Representation in Computer Systems
CHAPTER 2 Data Representation in Computer Systems 2.1 Introduction 37 2.2 Positional Numbering Systems 38 2.3 Decimal to Binary Conversions 38 2.3.1 Converting Unsigned Whole Numbers 39 2.3.2 Converting
More informationCHAPTER 2 Data Representation in Computer Systems
CHAPTER 2 Data Representation in Computer Systems 2.1 Introduction 37 2.2 Positional Numbering Systems 38 2.3 Decimal to Binary Conversions 38 2.3.1 Converting Unsigned Whole Numbers 39 2.3.2 Converting
More informationCSE 123: Computer Networks Alex C. Snoeren. HW 1 due Thursday!
CSE 123: Computer Networks Alex C. Snoeren HW 1 due Thursday! Error handling through redundancy Adding extra bits to the frame Hamming Distance When we can detect When we can correct Checksum Cyclic Remainder
More informationLink Layer: Error detection and correction
Link Layer: Error detection and correction Topic Some bits will be received in error due to noise. What can we do? Detect errors with codes Correct errors with codes Retransmit lost frames Later Reliability
More informationData Link Control Layer, Error Detection, Error Correction, and Framing
Data Link Control Layer, Error Detection, Error Correction, and Framing EEE 538, WEEK 2 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department 1 Error Detection Techniques Used
More informationCommunication Fundamentals in Computer Networks
Lecture 7 Communication Fundamentals in Computer Networks M. Adnan Quaium Assistant Professor Department of Electrical and Electronic Engineering Ahsanullah University of Science and Technology Room 4A07
More informationWhere we are in the Course
Link Layer Where we are in the Course Moving on up to the Link Layer! Application Transport Network Link Physical CSE 461 University of Washington 2 Scope of the Link Layer Concerns how to transfer messages
More information3. Data Link Layer 3-2
3. Data Link Layer 3.1 Transmission Errors 3.2 Error Detecting and Error Correcting Codes 3.3 Bit Stuffing 3.4 Acknowledgments and Sequence Numbers 3.5 Flow Control 3.6 Examples: HDLC, PPP 3. Data Link
More informationCIS 551 / TCOM 401 Computer and Network Security. Spring 2007 Lecture 7
CIS 551 / TCOM 401 Computer and Network Security Spring 2007 Lecture 7 Announcements Reminder: Project 1 is due on Thursday. 2/1/07 CIS/TCOM 551 2 Network Architecture General blueprints that guide the
More informationDesign of Flash Controller for Single Level Cell NAND Flash Memory
Design of Flash Controller for Single Level Cell NAND Flash Memory Ashwin Bijoor 1, Sudharshana 2 P.G Student, Department of Electronics and Communication, NMAMIT, Nitte, Karnataka, India 1 Assistant Professor,
More informationMULTIPLE LAYERED REED-SOLOMON CODES IN AUDIO DISKS WITH A FEEDBACK SYSTEM SREENIVAS RAO BELAVADI SATISH THESIS
MULTIPLE LAYERED REED-SOLOMON CODES IN AUDIO DISKS WITH A FEEDBACK SYSTEM BY SREENIVAS RAO BELAVADI SATISH THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science
More informationVHDL IMPLEMENTATION OF REED-SOLOMON CODING
VHDL IMPLEMENTATION OF REED-SOLOMON CODING A Thesis Submitted in partial fulfilment of the requirements for the award of the degree of MASTER OF TECHNOLOGY IN ELECTRONICS & COMMUNICATION ENGINEERING (With
More informationET3110 Networking and Communications UNIT 2: Communication Techniques and Data Link Control Protocol skong@itt-tech.edutech.edu Learning Objectives Identify methods of detecting errors. Use Hamming code
More informationFAULT TOLERANT SYSTEMS
FAULT TOLERANT SYSTEMS http://www.ecs.umass.edu/ece/koren/faulttolerantsystems Part 6 Coding I Chapter 3 Information Redundancy Part.6.1 Information Redundancy - Coding A data word with d bits is encoded
More informationCSE 123: Computer Networks
CSE 123: Computer Networks Homework 1 Solutions Total points = 44 Problems 1. Modified HDLC Framing [6 points] Assume we are following the protocol described in the textbook except our modified HDLC frames
More informationCSMC 417. Computer Networks Prof. Ashok K Agrawala Ashok Agrawala Set 4. September 09 CMSC417 Set 4 1
CSMC 417 Computer Networks Prof. Ashok K Agrawala 2009 Ashok Agrawala Set 4 1 The Data Link Layer 2 Data Link Layer Design Issues Services Provided to the Network Layer Framing Error Control Flow Control
More informationSPM90 MODBUS PROTOCOL AND REGISTER LIST V1.0
SPM90 MODBUS PROTOCOL AND REGISTER LIST V1.0 目 录 1. Introduction... 1 1.1 Purpose of the Communication Protocol... 1 1.2 Version of Communication Protocol... 1 2. Detailed Description of the SPM90 Modbus
More informationMajority Logic Decoding Of Euclidean Geometry Low Density Parity Check (EG-LDPC) Codes
Majority Logic Decoding Of Euclidean Geometry Low Density Parity Check (EG-LDPC) Codes P. Kalai Mani, V. Vishnu Prasath PG Student, Department of Applied Electronics, Sri Subramanya College of Engineering
More informationCSEP 561 Error detection & correction. David Wetherall
CSEP 561 Error detection & correction David Wetherall djw@cs.washington.edu Codes for Error Detection/Correction ti ti Error detection and correction How do we detect and correct messages that are garbled
More informationOverview. Data Link Technology. Role of the data-link layer. Role of the data-link layer. Function of the physical layer
Overview Data Link Technology Functions of the data link layer Technologies concept and design error control flow control fundamental protocols Suguru Yamaguchi Nara Institute of Science and Technology
More informationComputer and Network Security
CIS 551 / TCOM 401 Computer and Network Security Spring 2009 Lecture 6 Announcements First project: Due: 6 Feb. 2009 at 11:59 p.m. http://www.cis.upenn.edu/~cis551/project1.html Plan for Today: Networks:
More informationChapter 3 A 3D Parity Bit Structure 1
Chapter 3 A 3D Parity Bit Structure 1 3. Introduction There is always a major role of data structure used in any program or software. Bad programmers worry about the code, good programmers worry about
More informationPacket/Frame, Error Detection How to send data efficiently & reliably?
Packet/Frame, Error Detection How to send data efficiently & reliably? Packet and Packet Communication - Shared Network Resource, Fairness, Reliability Frame - Byte Oriented Frame and Bit Oriented Frame
More informationENEE x Digital Logic Design. Lecture 3
ENEE244-x Digital Logic Design Lecture 3 Announcements Homework due today. Homework 2 will be posted by tonight, due Monday, 9/2. First recitation quiz will be tomorrow on the material from Lectures and
More informationEITF25 Internet- - Techniques and Applica8ons Stefan Höst. L4 Data link (part 1)
EITF25 Internet- - Techniques and Applica8ons Stefan Höst L4 Data link (part 1) Previously on EITF25 (or digital signal) 2 Data Link Layer Medium Access Control Access to network Logical Link Control Node-
More informationC LDPC Coding Proposal for LBC. This contribution provides an LDPC coding proposal for LBC
C3-27315-3 Title: Abstract: Source: Contact: LDPC Coding Proposal for LBC This contribution provides an LDPC coding proposal for LBC Alcatel-Lucent, Huawei, LG Electronics, QUALCOMM Incorporated, RITT,
More informationCS 4453 Computer Networks Winter
CS 4453 Computer Networks Chapter 2 OSI Network Model 2015 Winter OSI model defines 7 layers Figure 1: OSI model Computer Networks R. Wei 2 The seven layers are as follows: Application Presentation Session
More informationR07. Code No: V0423. II B. Tech II Semester, Supplementary Examinations, April
SET - 1 II B. Tech II Semester, Supplementary Examinations, April - 2012 SWITCHING THEORY AND LOGIC DESIGN (Electronics and Communications Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions
More informationBINARY SYSTEM. Binary system is used in digital systems because it is:
CHAPTER 2 CHAPTER CONTENTS 2.1 Binary System 2.2 Binary Arithmetic Operation 2.3 Signed & Unsigned Numbers 2.4 Arithmetic Operations of Signed Numbers 2.5 Hexadecimal Number System 2.6 Octal Number System
More informationT325 Summary T305 T325 B BLOCK 4 T325. Session 3. Dr. Saatchi, Seyed Mohsen. Prepared by:
T305 T325 B BLOCK 4 T325 Summary Prepared by: Session 3 [Type Dr. Saatchi, your address] Seyed Mohsen [Type your phone number] [Type your e-mail address] Dr. Saatchi, Seyed Mohsen T325 Error Control Coding
More informationData Link Control. Surasak Sanguanpong Last updated: 11 July 2000
1/14 Data Link Control Surasak Sanguanpong nguan@ku.ac.th http://www.cpe.ku.ac.th/~nguan Last updated: 11 July 2000 Flow Control 2/14 technique for controlling the data transmission so that s have sufficient
More informationCOMPUTER NETWORKS UNIT I. 1. What are the three criteria necessary for an effective and efficient networks?
Question Bank COMPUTER NETWORKS Short answer type questions. UNIT I 1. What are the three criteria necessary for an effective and efficient networks? The most important criteria are performance, reliability
More informationLecture 4: CRC & Reliable Transmission. Lecture 4 Overview. Checksum review. CRC toward a better EDC. Reliable Transmission
1 Lecture 4: CRC & Reliable Transmission CSE 123: Computer Networks Chris Kanich Quiz 1: Tuesday July 5th Lecture 4: CRC & Reliable Transmission Lecture 4 Overview CRC toward a better EDC Reliable Transmission
More informationPoint-to-Point Links. Outline Encoding Framing Error Detection Sliding Window Algorithm. Fall 2004 CS 691 1
Point-to-Point Links Outline Encoding Framing Error Detection Sliding Window Algorithm Fall 2004 CS 691 1 Encoding Signals propagate over a physical medium modulate electromagnetic waves e.g., vary voltage
More information1. How many white tiles will be in Design 5 of the pattern? Explain your reasoning.
Algebra 2 Semester 1 Review Answer the question for each pattern. 1. How many white tiles will be in Design 5 of the pattern Explain your reasoning. 2. What is another way to represent the expression 3.
More informationSection 2-7. Graphs of Rational Functions
Section 2-7 Graphs of Rational Functions Section 2-7 rational functions and domain transforming the reciprocal function finding horizontal and vertical asymptotes graphing a rational function analyzing
More informationSurvey on Error Control Coding Techniques
Survey on Error Control Codin Techniques Suriya.N 1 SNS Collee of Enineerin, Department of ECE, surikala@mail.com S.Kamalakannan 2 SNS Collee of Enineerin, Department of ECE, kamalakannan.ap@mail.com Abstract
More informationINF Data Communication Data Link Layer
INF3190 - Data Communication Data Link Layer Carsten Griwodz Email: griff@ifi.uio.no most slides from: Ralf Steinmetz, TU Darmstadt and a few from Olav Lysne, J. K. Kurose og K. W. Ross Function, Services
More information