6-DigitalDataComm.pptVIP

作业: 6.1 6.5 6.12 * Modeulo Arithmetic Define: T=(k+n)-bit frame to be transmitted,with n k M=k-bit message,the first k bits of T F =n-bit FCS,the last n bits of T P =pattern of n+1 bits;this is the predetermined divisor. It should be clear: T = 2nM+F * A simple example Message M=1010001101(10bits) Pattern P =110101(6bits) FCS R =to be calculated (5bits) Create: * Four versions of P(X) Polynomials * * Lecture slides prepared by Dr Lawrie Brown (UNSW@ADFA) for “Data and Computer Communications”, 8/e, by William Stallings, Chapter 6 “Digital Data Communications Techniqu