Chapter 7 Coding, Error control and Anti-fading tech.ppt

Chapter 7: Coding, Error Control and Anti-fading Techniques Prof. Pingan Li Outline Error detection Block coding Convolution coding Turbo coding Space-time coding Equalization Diversity techniques MIMO Parity bit appended to a block of data Even parity Added bit ensures an even number of 1s Odd parity Added bit ensures an odd number of 1s Example, 7-bit character [1110001] Even parity Odd parity Transmitter For a k-bit block, transmitter generates an (n-k)-bit frame check sequence (FCS) Resulting frame of n bits is exactly divisible by predetermined number Receiver Divides incoming frame by predetermined number If no remainder, assumes no error Exclusive-OR (XOR) operation Parameters: T = n-bit frame to be transmitted D = k-bit block of data; the first k bits of T F = (n – k)-bit FCS; the last (n – k) bits of T P = pattern of n–k+1 bits; this is the predetermined divisor Q = Quotient R = Remainder For T/P to have no remainder, start with Divide 2n-kD by P gives quotient and remainder Use remainder as FCS Does R cause T/P have no remainder? Substituting, No remainder, so T is exactly divisible by P All values expressed as polynomials Dummy variable X with binary coefficients CRC using Polynomials CRC–12 X12 + X11 + X3 + X2 + X + 1 CRC–16 X16 + X15 + X2 + 1 CRC – CCITT X16 + X12 + X5 + 1 CRC – 32 X32 + X26 + X23 + X22 + X16 + X12 + X11 + X10 + X8 + X7 + X5 + X4 + X2 + X + 1 Dividing circuit consisting of: XOR gates Up to n – k XOR gates Presence of a gate corresponds to the presence of a term in the divisor polynomial P(X) A shift register String of 1-bit storage devices Register contains n – k bits, equal to the length of the FCS Block codes Transmitter Forward error correction (FEC) encoder maps each k-bit block into an n-bit block codeword Codeword is transmitted; analog for wireless transmission Receiver Incoming signal is demodulated Block passed through an FEC decoder No errors present Codeword produced by decoder matches