Data and Computer Communications by William Stallings Eighth Edition

1. Digital Data Communications Techniques Data and Computer Communications by William Stallings Eighth Edition Click to edit Master subtitle style Chapter 6 Networks and Communication Department

2. Data transmission

3. Transmission types • 1-Serial communication: • 2-Parallel communication:

4. Transmission types

5. One of the most fundamental requirements is synchronization. • The receiver must know the rate at which bits are being received so that it can sample the line at appropriate intervals to determine the value of each received bit. • Two techniques are in common use for this purpose : • asynchronous and synchronous transmission.

6. Asynchronous Transmission • data are transmitted one character at a time. • When no character is being transmitted, the line between transmitter and receiver is in an idle state (binary 1 level). • The beginning of a character is signaled by a start bitwith a value of binary 0. • followed by the 5 to 8 bits that actually make up the character. • The bits of the character are transmitted beginning with the least significant bit. • Then the data bits are usually followed by a parity bit, set by the transmitter ,The receiver uses this bit for error detection. • The final element is a stop element, which is a binary 1.

7. Asynchronous Transmission

8. Asynchronous - Behavior • simple • cheap • good for data with large gaps) overhead could be reduced by sending larger blocks of bits between the start bit and stop element)

9. Synchronous Transmission • block of data transmitted, sent as framesin a steady stream without start and stop codes. • clocks must be synchronized • can use separate clock line • or embed clock signal in data • need to indicate start and end of block • use preamble and post-amble (flags) • more efficient than asynchronous

10. Asynchronous and Synchronous Transmission Data can be transmitted intermittently rather than in a steady stream Data an be transmitted in a steady stream, it is the receiver responsibility to group the bits

11. Types of Error • an error occurs when a bit is altered between transmission and reception • single bit errors • only one bit altered • caused by white noise • burst errors • contiguous sequence of B bits in which first, last and any number of intermediate bits are in error • caused by impulse noise

12. Error Detection • will have errors • detect using error-detecting code • added by transmitter • recalculated and checked by receiver

13. Parity check • 1- Simple • a parity bit (extra bit) is added to the end of a block of data so that character has an even number of 1s (even parity) or an odd number of 1s (odd parity).

14. Parity check-simple • Eg: Suppose that the sender wants to send the word (World) . In ASCII the five characters are coded as : • The actual bits sent: • The receiver counts the 1’s :(6,6,4,4,4,) the data accepted. • The receiver counts the 1’s :(7,6,4,4,4,) the data discarded and ask for retransmission.

15. Parity check-simple • 1000111011 ( 6 ones) • Suppose 3 bits are changed: • 1111111011 (9 ones- odd so error detected) • Suppose 2 bits are changed: • 1110111011 (8 ones – still even so error not detected) • Simple parity can detect all single bit error . It Can detect burst errors only if the total number of errors is odd

16. Cyclic Redundancy Check • one of most common and powerful checks • for block of k bits, transmitter generates an n-k bit frame check sequence (FCS) • Transmits n bits which is exactly divisible by some number • receiver divides frame by that number • if no remainder, assume no error

17. Cyclic Redundancy Check • A string o n 0's (FCS)is appended to the data unit • The number is one less than the number of bits in the divisor . • Divide the data word plus appended zeros by the divisor • Use 1-module-2 Arithmetic: • There is no carry when you add or subtract two digits. • Addition and subtraction gives the same results • This means : you can use XOR for both addition or subtraction. • The reminder resulting from the division is the CRC • The CRC of n bits replaces the appended 0s at the end of the data unit.

18. Cyclic Redundancy Check

19. Cyclic Redundancy Check

20. Cyclic Redundancy Check

21. Cyclic Redundancy Check • At the receiver : • After receiving the data appended with the CRC , it does the same module-2 division • If the reminder is all 0’s ,the CRC is dropped and data accepted(correct data) • If the reminder is not equal to zero, data discarded(wrong data)

22. Cyclic Redundancy Check

23. Cyclic Redundancy Check • 2- polynomial: • Express all values in variable X. • The divisor is represented as algebraic polynomial. • A polynomial should be selected to have the following : • It should be not divisible by x. • It should be divisible by x+1.

24. Cyclic Redundancy Check • a polynomial representing a divisor: • Degree: 5 • A degree of a polynomial is 1 less than the number of bits in the pattern

25. Cyclic Redundancy Check • Examples : • We cannot choose: • X(binary 10) • X2 +X (binary 110) • because both are divisible by X • We can choose: • X+1 (binary 11) • because it is not divisible by X ,but divisible by X+1

26. Cyclic Redundancy Check • CRC performance: • CRC an detects all burst errors that affects odd number of bits, • Detects all burst errors of length less than or equal to the degree of the polynomial • Detects all burst errors of length greater than the degree of the polynomial

27. Cyclic Redundancy Check • # CRC-12 (X12+ X11+X3+X+1) • Degree: 12 • CRC performance: • CRC an detects all burst errors that affects odd number of bits, • Detects all burst errors of length less than or equal to 12. • Detects all burst errors of length greater than 12

28. Error Correction Process

29. Error Correction figure 6.7. On the transmission end, each k-bit block of data is mapped into an n-bit block (n > k) called a codeword, using an FEC (forward error correction) encoder. The codeword is then transmitted. At the receiver, the incoming signal is demodulated to produce codeword but may contain errors. This block is passed through an FEC decoder, with one of four possible outcomes: 1. If there are no bit errors, the input to the FEC decoder is identical to the original codeword, and the decoder produces the original data block as output. 2. For certain error patterns, it is possible for the decoder to detect and correct those errors, the FEC decoder is able to map this block into the original data block. 3. For certain error patterns, the decoder can detect but not correct the errors, the decoder simply reports an uncorrectable error. For certain, typically rare, error patterns, the decoder does not detect that any errors have occurred and maps the incomingdata block into a block different from the original.

30. Error correcting codes • 1-Block Code Principles • 2-Hamming Code

31. 1- Block Code Principles • Hamming distance = difference in # of bits, • p = 011011,q = 110001, d (p,q) = 3 • Wee map each k-bit sequence into a unique n-bit codeword • DataCode • 00 00000 • 01 00111 • 10 11001 • 11 11110 • Now, suppose that a codeword block is received with the bit pattern 00100.This is not a valid codeword, and so the receiver has detected an error. • # Find the distance between all the valid codes (in pairs) on this slide. • d)11001, 001002(= 4; d)11110, 001002(= 3 • d)00000, 001002(= 1; d)00111, 001002(= 2 • the valid codeword that is closest to it (minimum distance) is selected

32. Block Code Principles • Example :if we have 01010 (Invalid) • valid 00000 and 11110 • )‘Equidistance of 2’(, More than one minimum distance!!! • Receiver has no way to choose between two alternatives. • Can always correct a single bit error . but cannot correct double bit error.

33. 2- Hamming Code • ‘use of extra parity(redundancy ) bits to allow the position identification of a single error’ • The number of redundancy bits r to correct a given number of data bits m is: 2r>= m+r+1 • Eg: if m=7 , the smallest r =4 • 1. Mark all bit positions that are powers of 2 as parity bits. (positions 1, 2, 4, 8, 16, etc.) • 2. All other bit positions are for the data to be encoded. (positions 3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, etc.)

34. Hamming Code • 3. Each parity bit calculates the parity for some of the bits in the code word. The position of the parity bit determines the sequence of bits that it checks. • Position 1: checks bits (1,3,5,7,9,11,...) – Alternate Position 2: checks bits (2,3,6,7,10,11,14,15,...) – Alternate 2-bits • Position 4: checks bits (4,5,6,7,12,13,14,15,20,21,22,23,...) -Alternate 4-bits • Position 8: checks bits (8-15,24-31,40-47,...) – Alternate 8-bits 4. Set the parity bit to 1 if the total number of ones in the position it checks is odd. Set the parity bit to 0 if the total number of ones in the position it checks is even

35. Hamming Code • Example :

36. Hamming Code At the receiver

37. Burst Error Correction • Hamming code cannot correct a burst error directly, it is possible to rearrange the data and then apply the code. • Organize N units in a column and then send the first bit for each, followed by the second bit of each , and so on. • If a burst error of M bits occurs (M<N) then the error dose not corrupt M bits of one single unit, Its corrupts only 1 bit of a unit. • With Hamming, we can then correct the corrupted bit in each unit.

38. Burst Error Correction Example :

39. Summary • asynchronous verses synchronous transmission • error detection and correction