q11- This question involves estimation of error handling overhead for a communication link which has a BER of 10−2 Forward error correct (FEC) Frame: Total 1144 bits 1024 bit of data 120 FEC bits Error Detection + automatic repeat request (ED + ARQ) Frame: Total 1074 bits 1024 bit of data 50 CRC bits a) Our task is to find the approximate frame error rate (FER) for FEC in percentage Answer: Answer b) Estimate the approximate overhead for ED + ARQ in percentage

q11- This question involves estimation of error handling overhead for a communication link which has a BER of 10−2 Forward error correct (FEC) Frame: Total 1144 bits 1024 bit of data 120 FEC bits Error Detection + automatic repeat request (ED + ARQ) Frame: Total 1074 bits 1024 bit of data 50 CRC bits a) Our task is to find the approximate frame error rate (FER) for FEC in percentage Answer: Answer b) Estimate the approximate overhead for ED + ARQ in percentage

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 4VE

See similar textbooks

Similar questions

Computer Science A Go-Back-N (GBN) ARQ scheme has been designed with window-size W = 10 such that it is fully efficient when there are no errors on the channel. Assume that frame size is 20000 bits and the overhead bits are negligible. What is the bit probability error (as seen at Layer 2) that makes the Go-Back-N ARQ 50% efficient?
Computer Science The following character encoding is used in a data link protocol: A: 11100011 B: 01000111 FLAG (start and end character): 01111110 ESC: 00000111 Displays the transmitted bit sequence for the frame: A B ESC FLAG when using each of the following delimitation methods: (a) Delimitation by length (in this case, counting bytes) (b) Delimitation by character of beginning and end (c) hyphenation (bit stuffing)
When calculating error detection code FCS, you may use a technique called cyclic redundancy checking (CRC). What is the preset divisor P's length in bits for a 16-bit bit block with a total of 20 bits (total length of bit block and FCS combined)?
find the hamming distance (d) between the following code words X= 0000 y= 0101 Z= 1011 w= 0111 1- d (x, y)= 2- d (y , z)= O a.d (x, y)=2 and d (y, z)=3 O b. Other answer. O c.d (x, y)=3 and d (y, z)=2 O d. d (x, y)=1 and d (y, z)=2
I A channel has a frequency range between 3 KHz and 14 KHz. The SNR in this channel is 25 dB. Find the maximum Bit rate of the channel and the Signal levels. [3 marks] For a bit stream "0 1 1 0 0 1 0 1", sketch the waveforms for (i) NRZ-I - (Assume the initial level at time zero is Low) (ii) NRZ-L - (assume 0 as High and 1 as Low) (iii) RZ Encoding – (Assume the initial level at time zero is Low) [3 marks]
A cyclic redundancy check (CRC) error detection scheme is constructed to generate a 4-bit frame check sequence (FCs) for an 11-bit message. The generator polynomial, P(x) = x* + x +1 (i.e., P = поо). 1) Encode the data bit sequence M(x) = x° + +1 (i.e., M= 000011001) using the generator polynomial and state the codeword. 2) Show that the error detection scheme at the receiver can detect the received codeword and contain no error.
a. Huffman coding assigns codes to characters such that the length of the code depends on the relative frequency or weight of the corresponding character. Thus, it is a variable-length code. If the estimated frequencies for letters match the actual frequency found in an encoded message, then the length of that message will typically be less than if a fixed-length code had been used. Due to such advantages, RadiantRay Networking Sdn Bhd uses Huffman compression technique to encode the message before transmitting over the network to its customer. Suppose the message contains the following strings "a fast runner never be afraid of dark“ a. How many bits may be required for encoding the message without using Huffman coding? b. Create an Huffman table indicating the number of character bits, frequencies and the code used in transmission of the message (space is also counted as a character) c. What is the total size of the massage to be sent?
a. Huffman coding assigns codes to characters such that the length of the code depends on the relative frequency or weight of the corresponding character. Thus, it is a variable-length code. If the estimated frequencies for letters match the actual frequency found in an encoded message, then the length of that message will typically be less than if a fixed-length code had been used. Due to such advantages, RadiantRay Networking Sdn Bhd uses Huffman compression technique to encode the message before transmitting over the network to its customer. Suppose the message contains the following strings "a fast runner never be afraid of dark“ d. Construct the Huffman encoding tree e. What is the size of the table for encoding the message?
The following figure demonstrates the parity bits, the data bits and the field coverage for a Hamming error correcting code (ECC) for eight data bits. Bit position 5 6 7 89 10 11 12 1 2 4. Encoded data bits p1 p2 d1 p4 d2 d3 d4 p8 d5 d6 d7 d8 p1 X X Parity p2 X X bit Coverage p4 p8 X Assume that the following code word has been created using the even parity Hamming ECC. 001101111010 Is it correct? If yes, explain why. If no, give the correct code and the original data value. Show your work.
For the following two (2) questions, assume that the link layer uses the flag bits with bit stuffing approach for framing, with the following details: The beginning and end of a data frame are indicated by the special flag bits 01111110 (i.e., 0x7E). To handle accidental occurrence of the flag bits within the data, a 0 bit is stuffed every time 5 consecutive 1s are found in the data. For simplicity, assume that no other header/trailer information is added to the data. 1. The following bit stream represents data that needs to be framed by the link layer on the sender’s side. Derive the resultant bit stream by adding necessary flag bits and performing bits stuffing. 0111110001010011111111100101111111111110 2. The following bit stream represents data received by the link layer of a computer. For simplicity, assume that there are no errors in the bit stream. Retrieve the original data from this received bit stream. 01111110010111101111101100101001111101101111110
A bit-stuffing based framing protocol uses an 8-bit delimiter pattern of 01111110. If the output bit-string after stuffing is 01111100101, then the input bit-string is
A bit-stuffing based framing protocol uses a 8-bit delimiter pattern of 00111100. If the output bit-string after stuffing is 001110001101110011, number of bit stuffed is