Question
In this, CRC Calculation and Verification are both implemented using C language. Using the Polynomial: 1100 1101 1010 1 and number of padding zeros =
In this, CRC Calculation and Verification are both implemented using C language.
Using the Polynomial: 1100 1101 1010 1 and number of padding zeros = length of polynomial - 1.
1. Prompt the user to ender the message in hexidecimal.
2. translate the message from Hex to binary and print out binary message.
3. Print out modified binary message with padding and given polynomial in binary
4. Calculate CRC and print out intermediate results.
5. Print out CRC value and print out the input message with CRC attached in Hex format.
6. Strart verification and prompt the user to enter the message in hex format. You can use the generated message in 5.
7. translate from hex to binary and print out binary.
8. Calculate CRC for the input message.
if result is all zeros, print out success message, otherwise, print fail message.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started