The Physical Layer - start [kondoretfrs]物理层开始[ kondoretfrs ].pptVIP

The Data Link Layer Functions of the Data Link Layer Provide service interface to the network layer Frame delineation Dealing with transmission errors Error detection and correction codes Positive and negative acknowledgements Timers Regulating data flow Slow receivers not swamped by fast senders Functions of the Data Link Layer Relationship between packets and frames. Data Link Layer Services Unacknowledged connectionless service Acknowledged connectionless service Acknowledged connection-oriented service Frame Delimiting Character count Flag bytes with byte stuffing Starting and ending flags, with bit stuffing Framing A character stream. (a) Without errors. (b) With one error. Framing (a) A frame delimited by flag bytes. (b) Four examples of byte sequences before and after stuffing. Framing Bit stuffing (a) The original data. (b) The data as they appear on the line. (c) The data as they are stored in receiver’s memory after destuffing. Error Detection and Correction Error-Correcting Codes Error-Detecting Codes Hamming Distance Hamming distance between codewords X and Y, is the number of ones in The number of detected bit errors is d if d+1 is the minimum Hamming distance between two codes. The number of corrected bit errors is d if 2d+1 is the minimum Hamming distance between two codes. Error Correction Codeword Y is calculated from generation matrix G, and block of data X: Y=XG=[x1,x2,…,xm]·Gmxn At the receiver side the syndrom is found that detects and correct an error using check parity matrix H: S=Y’HT Error correction For generation and parity check matrices it should hold GHT=0 If G=[Im|P] Then H=[-PT|In-m] Here I is unity matrix, n is the codeword length, and m=n-k is the data block length Error correction: Hamming Code In Hamming code the codeword length is 2m-1-1, the number of added bits is 2m-1-m-1 Parity check matri