Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
Compute the equivocation or message uncertainty in bits per character for a textual transmission using 7-hit ASCII coding.
Suppose a binary non coherent FSK link has a maximum data rate of 2.4 kbits/s with-out ISI over a channel whose nominal bandwidth is 2.4 kHz.
Table characterizes four different satellite-to-earth-terminal links. For each link assume that the space loss is 196 dB.
You are required to make modulation and error-correction code choices for a real-time communication system operating over an AWGN channel.
You are required to provide a real-time communication system to support 9600 bits/s with a required bit-error probability.
For a fixed error probability. show that the relationship between alphabet size M and required average power for MPSK versus QAM can be expressed.
Explain why a syndrome can be calculated by evaluating the received polynomial at each of the roots of the code's generator polynomial.
Explain why the curves in Figure of the text show error-performance degradation at low values of code rate.
Consider a turbo code consisting of two, four state convolutional codes as the com-ponent codes.
Form a table, similar that describes all possible transitions in this circuit, and use the table to draw a trellis section.
Illustrates a recursive systematic convolutional (RSC) rate ½, K = 4, en-coder. Note that the figure uses the format of 1-bit delay.
The inter leaver (identical to the inter leaver in the corresponding en-coder) is needed to insure that the sequence out of DEC1 is time ordered.
Calculate the minimum distance of the overall. code. Assume that there is no puncturing, so that the code rate is k
The trellis for a four-state code used as a component code within a turbo code is shown in Figure 8.25b. The code rate is z and the branch labeling.
In the implementation of the Viterbi decoding algorithm, an add-compare-select (ACS) processor is used. But, in performing the maximum a posteriori (MAP).
Considering all the ways that there are to determine whether a polynomial is primitive, the method involving a linear feedback shift register (LFSR).
One of the functions of the district officer is to ensure that each community is reasonably well served in case of a fire.
Use the method by Ford and Show the flow pattern. What is thFulkerson to determine a maximal flow. Show the flow pattern. What is the value of the maximal flow?
Use the Floyd-Warshall algorithm to determine the shortest paths between all pairs of nodes.
City Council plans the snow plowing strategies for next winter. The graph in Fig. shows the street network, which includes only one-way streets.
Is it possible for the post office to find a tour for the postman, so that the letter carrier has to traverse each street exactly once?
Consider the network shown in Fig, where the numbers next to the arcs consists of the lower and upper bound on the flow in the arc.
Consider the network in Fig. and determine the shortest paths from ns to all other nodes.
As the people in the district are fierce defenders of property rights, the roads were constructed parallel to the rectangular fields.
Consider Fig. and ignore the weights at the nodes. For p = 2, determine the vertex p-center with the bisection search algorithm.