Cyclic Redundancy Check Part-2
Duration: 4 min
This video lesson is available to enrolled students.
AI Summary
An AI-generated summary of this video lecture.
The video lecture provides a detailed explanation of Cyclic Redundancy Check (CRC), a method used to create cyclic codes to correct errors in data transmission. The instructor outlines the encoding process where a dataword of k bits is transformed into a codeword of n bits. Specifically, for the example shown, the dataword has 4 bits and the codeword has 7 bits. The process involves augmenting the dataword by appending n-k zeros to its right side. This augmented word is then fed into a generator that uses a predefined divisor of size n-k+1 bits. The generator performs modulo-2 division, discarding the quotient and appending the remainder to the dataword to create the final codeword.
Chapters
0:00 – 2:00 00:00-02:00
During the first segment, the instructor focuses on the encoder block diagram labeled Sender. He points to the slide text which reads, In the encoder, the dataword has k bits (4 here), the codeword has n bits (7 here). He explains that the size of the dataword is augmented by adding n-k (3 here) 0s to the right-hand side. To clarify the divisor size, he writes on the whiteboard, calculating n-k=3 and n-k+1=4. The diagram shows the dataword entering the generator, which outputs a remainder (r2 r1 r0) that is appended to the dataword to form the codeword.
2:00 – 3:48 02:00-03:48
The second segment covers the decoding process. The slide text states, The decoder receives the possibly corrupted codeword. A copy of all n bits is fed to the checker which is a replica of the generator. The instructor explains that the remainder produced by the checker is a syndrome of n-k bits. This syndrome is fed to a decision logic analyzer. If the syndrome bits are all zeros, the 4 leftmost bits are accepted as the dataword, interpreted as no error. Otherwise, the bits are discarded. He demonstrates this with handwritten binary division examples on the whiteboard, showing the modulo-2 division steps to illustrate how remainders are calculated and how a non-zero result indicates an error.
The lecture effectively bridges the gap between theoretical definitions and practical application. It starts by defining the parameters of the CRC encoder, emphasizing the augmentation and division steps. It then transitions to the receiver, explaining how the checker and decision logic analyze the syndrome to detect errors. The use of whiteboard calculations reinforces the abstract concepts of modulo-2 division and syndrome generation, providing a complete picture of the CRC error detection mechanism.