Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
Determine the matrix GH G, and thus show that the code is not orthogonal.
Consider a TDMA system where each user is limited to a transmitted power P, independent of the number of users.
Plot the graph of the points (C2,C1) as a varies in the range 0 = a =
Determine the variances of n1 and n2 and the covariance of n1 and n2.
Determine and plot the probability of error for hard decision decoding. Assume that the transmitted waveforms corresponding to the coded bits fade independently
Determine the product distance and the free Euclidean distance of the coded modulation scheme .
Consider an (NT , NR) = (2, 1) MIMO system that employs the Alamouti code to transmit a binary sequence using binary PSK modulation.
Determine the capacity of a MIMO system that employs selection diversity.
Determine the capacity of this SIMO channel when h is known at the receiver only.
Determine the capacity of this MISO channel when h is known at the receiver only.
Determine the average probability of error Pb for the demodulator that employs a filter matched to s1(t).
What is the capacity of the MISO channel when h is known at the transmitter?
Determine the outage probability of an (NT, NR) = (4, 1) MIMO system for an SNR ? = 20 dB .
Determine the transmitted symbols from each antenna for each signaling interval.
In a block diagram, give the precise specifications of the optimum receiver using matched filters. Label the diagram carefully.
Sketch the functional block diagram of the entire receiver, including the demodulator, the combiner, and the detector.
To avoid pulse overlap between successive transmissions, the transmission rate in bits/s is selected to be R = ½T.
he two transmitting antennas are sufficiently separated so as to provide dual spatial diversity in the transmission of the signal.
If a binary memory less source with P(U = 0) = 1-P(U = 1) = 0.4 which generates 7500 symbols per second is to be transmitted once via channel 1 .
Now assume that the transmitter can control the state of the channel and the receiver has access to channel state information.
Determine the capacity of a finite-state channel in which state information is only available at the receiver.
Determine the capacity of a finite-state channel in which the same state information is available at the transmitter .
Determine the capacity of the channel, assuming that channel state information S is available at both sides.
Determine the capacity of this channel, assuming no state information is available to the transmitter or the receiver.