Consider a (48, 36) block error correcting code used in the downlink control channel of a cellular system. This code can correct up to 5 bit errors in a block of 48 bits.
If the 48 bit blocks are buffered until 10 blocks are collected and then they are interleaved and transmitted, what is the maximum error burst size that can be tolerated and still have correct reception of the data?
What is the delay incurred in buffering the data for interleaving and de-interleaving at a 48 kbps rate?
First Question:
The Burst error detection theorem states that the maximum burst error that can be detected is n - k.
According to the question n = 48 and k = 36
So, the maximum detectable burst error = (48 - 36) = 12
The theorem of burst error correction states that the maximum number of burst errors that can be corrected for any (n, k) block of code is l <= n - k - logq(n - l) + 2
We have n = 48, k = 36 and l = 5.
For the given scenario l <= 48 - 36 - log(48 - 5) + 2
or, l<= 14 - 5.2
or, l <= 8.7
So, the possible value is 8.
Hope this helps.
Consider a (48, 36) block error correcting code used in the downlink control channel of a...
Consider a binary communication channel transmitting coded words of n bits each. Assume that the probability of successful transmission of a single bit is p (and the probability of an error is q=1-p), and that the code is capable of correcting up to e (where e>= 0) errors. If we assume that the transmission of successive bits is independent, then what is the probability of successful word transmission? Hint: the word is successfully transmitted if there are e or fewer...
e) Consider a SEC (Single Error Correcting) code that protect 8 bit words with 4 parity bits. If we read the value 375H, is there an error? If so, correct the error. Problem
1. Channel Coding We would like to add linear block code (3,6) using the generator matrix: 1 001 01 G-0 1 0 0 1 1 (a) (5 points) Determine the parity check matrix H (b) (20 points) What is the minimum distance of this code? How many error can this code correct? (c) (5 points) What is the code word for the data sequence 011000101111? (d) (20 points) If you receive the codeword 010001000010101010, what is the transmitted sequence?
In the last module you learned a formula for calculating bit rate, R = b/t, that is the number of bits divided by the time. This formula expresses the number of bits that are transmitted over a circuit in a given period of time. In practice, however, we are not only concerned with the number bits transmitted, but also with the number of data bits transmitted over a circuit. The data bits are those that the sender decides to send...
Q1 Error detection/correction Can these schemes correct bit errors: Internet checksums, two-dimendional parity, cyclic redundancy check (CRC) A. Yes, No, No B. No, Yes, Yes c. No, Yes, No D. No, No, Yes E. Ho, hum, ha Q2 CRC vs Internet checksums Which of these is not true? A. CRC's are commonly used at the link layer B. CRC's can detect any bit error of up to r bits with an r-bit EDC. c. CRC's are more resilient to bursty...