30 Oct Prove that, if every user code is orthogonal to every other user code in CDMA, unwanted signals can easily be filtered out. Note: you have to show me a generalize proof. Showing me exampl
Question 1 (10 pts): Prove that, if every user code is orthogonal to every other user code in CDMA, unwanted signals can easily be filtered out. Note: you have to show me a generalize proof. Showing me examples of three or more instances or examples is NOT a proof!
Question 3 (10 pts): Using the Hamming algorithm, determine whether the received 24-bit Hamming code 0x616FB3 is error-free. If it is not error-free and assuming that there is no error masking, fix the error. Note: read the binary values from left to right, i.e. the leftmost bit is bit # 1
Question 4 (10 pts): Using CRC, calculate the transmitted data for a message M = 1011011101001010 and a dividing polynomial P = x5 + x3 + x2 + 1.
Question 1 (10 pts): Prove that, if every user code is orthogonal to every other user code in CDMA, unwanted signals can easily be filtered out. Note: you have to show me a generalize proof. Showing me examples of three or more instances or examples is NOT a proof!
Question 3 (10 pts): Using the Hamming algorithm, determine whether the received 24-bit Hamming code 0x616FB3 is error-free. If it is not error-free and assuming that there is no error masking, fix the error. Note: read the binary values from left to right, i.e. the leftmost bit is bit # 1
Question 4 (10 pts): Using CRC, calculate the transmitted data for a message M = 1011011101001010 and a dividing polynomial P = x5 + x3 + x2 + 1.
