Problem 6. A certain binary PCM system transmits the two binary states X = +1, and X = -1 with equal probability. However, because of channel noise, the receiver makes recognition errors. Also, as a result of path distortion, the receiver may lose necessary signal strength to make any decision. Thus, there are three possible receiver states: Y = +1, Y = 0, and Y = -1. Y=0 corresponds to "loss of signal". Assume that: P(Y=-1|X = +1) = 0.1, P(Y=+1|X = -1) = 0.2, and P(Y=0|X = +1) = P(Y=0|X = -1) = 0.05 %3D %3D %3D %3D (a) Find the probability P(Y=+1), P(Y=-1), and P(Y=0). (b) Find the probability P(X=+1|Y = +1) and P(X=-1|Y = -1)

Problem 6. A certain binary PCM system transmits the two binary states X = +1, and X = -1 with equal probability. However, because of channel noise, the receiver makes recognition errors. Also, as a result of path distortion, the receiver may lose necessary signal strength to make any decision. Thus, there are three possible receiver states: Y = +1, Y = 0, and Y = -1. Y=0 corresponds to "loss of signal". Assume that: P(Y=-1|X = +1) = 0.1, P(Y=+1|X = -1) = 0.2, and P(Y=0|X = +1) = P(Y=0|X = -1) = 0.05 %3D %3D %3D %3D (a) Find the probability P(Y=+1), P(Y=-1), and P(Y=0). (b) Find the probability P(X=+1|Y = +1) and P(X=-1|Y = -1)

Introductory Circuit Analysis (13th Edition)

13th Edition

ISBN:9780133923605

Author:Robert L. Boylestad

Publisher:Robert L. Boylestad

Chapter1: Introduction

Section: Chapter Questions

Problem 1P: Visit your local library (at school or home) and describe the extent to which it provides literature...

See similar textbooks

Similar questions

Explain why NRZ coding is not attractive for signal transmission applications?! Short answer please
What are some disadvantages of designing a global communication system with a LEO constellation that requires a large number (say, more than 100) of satellites?
What is the delay of sending a data file a station to a destination station? Suppose that the length of the data file is 1 Mbytes and the bandwidth of the channel is 200 Kbps, and the network link between the sender and receiver is 2000 Km and the speed of the light inside the link is 2x108 m/s? Assume that the delay is composed of only transmission time and propagation time.
Consider a CDMA system where transmitter A has the code 101010 and transmitter B has the code 111001. Assume that 1 is represented by +1V and 0 is represented by -1V. Show that the two CDMA codes (after mapping them to voltages) are orthogonal to each other. What is transmitted if A sends a bit of 0 and B sends a bit of 1? What did A and B most likely transmit if the received word is “-1 -1 -1 +1 +1 +1”?
c) iii) We need to send 210,000 bits per second over a noiseless channel using 128- QAM. Determine the required bandwidth.
To create a Pseudo Noise code of length 15 bits, how many shift registers are required? Techniques used in Wideband Modulation are: 1. Direct Sequence Spread Spectrum 2. Orthogonal frequency Division Multiplexing 3. 1 & 2 4. Frequency Hopping 5. 1, 2, &3
Assume a digital communication system with the following specifications: the channel Pe=0.05, and (n, k) block coding with n=21 and k-bit in every message, and the block code can correct maximum of 3 bits in every received codeword. Find the following: The number of data message bits (k) in every transmitted codeword. The probability to receive the codeword (frame) with no errors when it passes through this channel. The value of (Eb/No) of the channel. NOTE: when evaluating the channel assume uncoded system.
Higher bit rates can be achieved over voice grade line by employing M-ary modulation schemes TRUE FALSE
a. If 1,000 bits per second (bps) are transmitted, what is the error probability?b. If 10,000 bps are transmitted, to what value must A be adjusted in order to attain the same error probability as in part (a)?
Suppose two hosts A and B, are separated by 10,000 kilometers and are connected by a direct link of R = 1 Mbps. Suppose the propagation speed over the link is 2.5 x 10^8 meters/sec.a. Calculate the "bandwidth-delay product", R.tprop.b. Consider sending a file of 400,000 bits from host A to B. Suppose the file is sent continuously as one big message. What is the maximum number of bits that will be in the link at any given time?c. Provide an interpretation of the bandwidth-delay product.d. What is the width (in meters) of bit in the link? Is it longer than a football field?e. Derive a general expression for the width of a bit in terms of the propagation speed s, the bandwidth R, and the length of the link d.
Suppose two hosts A and B, are separated by 10,000 kilometers and are connected by a direct link of R = 1 Gbps. Suppose the propagation speed over the link is 2.5 x 10^8 meters/sec.a. Calculate the "bandwidth-delay product", R.tprop.b. Consider sending a file of 400,000 bits from host A to B. Suppose the file is sent continuously as one big message. What is the maximum number of bits that will be in the link at any giventime?c. What is the width (in meters) of bit in the link?
Calculate channel capacity, in bits per second, of a 10-MHz channel with an S/N ratio of 50 dB *