
3. A data packet containing 18 bits is sent over a noisy communication channel. The probability...
Consider a noisy communication channel, where each bit is flipped with probability p (the probability that a bit is sent in error is p). Assume that n−1 bits, b1,b2,⋯,b(n−1), are going to be sent on this channel. A parity check bit is added to these bits so that the sum b1+b2+⋯+bn is an even number. This way, the receiver can distinguish occurrence of odd number of errors, that is, if one, three, or any odd number of errors occur, the...
A message is sent over a noisy channel. The message is a sequence 1,2,... .*n Of n bits (ri E 0, 1)). Since the channel is noisy, there is a chance that any bit might be corrupted, resulting in an error (a 0 becomes a 1 or vice versa). Assume that the error events are independent. Let p be the probability that an individual bit has an error (0 < p < 1/2). Let yì,U2, . . . ,Un be...
Problem # 3. A pair of packets is sent over the network to an end user. It is known that the first packet will be lost with probability 1/3. If the first packet is received, then the second packet is lost with probability 1/6. If the first packet is lost then the second packet is lost with probability 2/3. Find the probabilities of the events: a) Exactly one packet is received by the end user. b) Both packets are lost.
Information bits {0,1} are sent over binary symmetric communication channel with conditional probabilities P(YX) as shown below. The priory probabilities of 0 and 1 are P(X=0)=0.3, P(X=1)=0.7. The error probability {=0.2. transmitter X 0 1-€ receiver Y 0 ៩ w 1-€ a) If 1 is transmitted, what are the probabilities of receiving 0 and 1? P(Y=0|X=1) and P(Y=1X=1) b) If 0 is received, what are the probabilities that 0 and 1 information bit is transmitted? P(X=0 Y=0) and P(X=1 Y=0)
A data packet is transmitted over a lossy wireless channel with
packet error rate 0.3. Most communication systems adopt
the Automatic Repeat reQuest (ARQ) protocol. That is, if a packet
is successfully (with probability 0.7) or unsuccessfully
(with probability 0.3) received, the receiver respectively
sends a one-bit ‘ACK’ or ‘NAK’ message (over a separate feedback
channel) to the transmitter. After receiving an ‘ACK’, the
transmitter will move on to the next packet transmission;
otherwise, the transmitter will re-transmit the same...
% Use MATLAB to build a simulation of Quiz 2.3. simulate the transmission % of 10000 packets, each containing 100 bits. Count the number of packets % that abilities. Also calculate the probability of a packet is decoded % correctly. Compare your numbers from MATLAB with your theoretical % calculation. (Hint: look at Example 2.25.) -close all -clear all clc x = randi ( [0 1] , 100, 10000) ; numel (X) -nume l (X (find (Х--1 ) ) )...
QUIZ 2.3
EXAMPLE 2.25
Please help me build the MATLAB code
Use MATLAB to build a simulation of Quiz 2.3. Simulate the transmission of 10000 packets, each containing 100 bits. Count the number of packets that contain no error, one, two, three- bit errors, calculate their probabilities. Also calculate the probability of a packet is decoded correctly. Compare your numbers from MATLAB with your theoretical calculation. (Hint: look at Example 2.25.) Data packets containing 100 bits are transmitted over a...
Problem 3. A binary message either 0 or 1 is transmitted by wire. However, data sent over the wire is subject to channel noise disturbance. If x is the value sent (either 0 or 1), then the value received at the other end is R-x+x, where Ņ represents the noise. Assume that Ņ is a normal random variable with mean μ 0 and variance σ2-0.04. Assume that a message sent is equally likely to be 0 or 1. When the...
Problem 3. A binary message either 0 or 1 is transmitted by wire. However, data sent over the wire is subject to channel noise disturbance. If x is the value sent (either 0 or 1), then the value received at the other end is R-x+x, where Ņ represents the noise. Assume that Ņ is a normal random variable with mean μ 0 and variance σ2-0.04. Assume that a message sent is equally likely to be 0 or 1. When the...
Problem 4 Suppose three active nodes A, B, and C are competing for accessing a channel using slotted ALOHA. Assume each node has infinitely many packets to send. Each node transmits in each slot with probability p. The slots are numbered slot 1, slot 2, slot 3, etc. Give the probability for each of the following events a) node B succeeds in slot 4; b) node B succeeds for the first time in slot 4; c) any node succeeds in...