3.1 Redo the Trellis of a convolution channel with memory one, 3 information Bits, known start and stop So = S4 = 1 and BPSK (s; € {−1, +1}) as in class, however with other weights instead of 1 and 2, and a different received word. (Pick both yourself). 3.2 Compute the state diagram for a channel with memory 2. I.e., with họ, h₁, and h₂. Pick the values again by yourself. 3.3. What is the complexity for QPSK and memory 3? How many links do you then have between the layers.

3.1 Redo the Trellis of a convolution channel with memory one, 3 information Bits, known start and stop So = S4 = 1 and BPSK (s; € {−1, +1}) as in class, however with other weights instead of 1 and 2, and a different received word. (Pick both yourself). 3.2 Compute the state diagram for a channel with memory 2. I.e., with họ, h₁, and h₂. Pick the values again by yourself. 3.3. What is the complexity for QPSK and memory 3? How many links do you then have between the layers.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.3: Data Types

Problem 9E: (Practice) Although the total number of bytes varies from computer to computer, memory sizes of...

See similar textbooks

Similar questions

Consider a telegraph source having two symbols, dot and dash. The dot duration is 0.2 second. The dash duration is three times the dot duration. The probability of the dot’s occurring is twice that of the dash, and the time between symbols is 0.2 second. Assume n = 2 ( 2nd extension of the code), pdash = S0 and pdot = S11. Determine the equivalent codeword for each symbol using Shannon Code. Supersymbol Code S0 S0 S0 S1 S1 S0 S1 S1 2. Determine the coding efficiency.
Q1. Give a comparison of FIFO, LRU and OPTIMAL algorithms in term of Page faults with three and four frames in each case for the reference string of pages duly demanded in Main Memory. Reference String: 2, 3, 3, 2, 1, 4, 0, 0, 3, 2, 1, 1, 2, 3, 4
Assume the following parameters for Go-Back-N a) N 3 b) Round Trip Time (RTT)10 ms c) Retransmission Timeout period 40 ms d) Segment Size: 1200 bytes. Suppose that Bob sends 7 segments, numbere1 through 7, to Alice using the Go-Back-N mechanism. Suppose that Segment 3 and Segment are lost the first time the segments are sent to Alice, but reach Alice correctly when retransmitted. Apart from the above, there were no other segment losses. What is the average throughput obtained in sending all segments (in bytes/sec)? Draw a diagram to show your work in detail. 2. Assume the following parameters for Selective Repeat: b) Round Trip Time (RTT)10 ms c) Retransmission Timeout period 40 ms d) Segment Size: 1200 bytes Suppose that Bob sends 6 segments, numbered 1 through 6, to Alice using Selective Repeat. Suppose that Segment 3 gets lost the first time Bob sends it to Alice, but reaches Alice correctly when retransmitted Apart from the above, there were no other segment losses. What is the…
We want to verify that IP(·) and IP−1(·) are truly inverse operations. We consider a vector x = (x1,x2,...,x64) of 64 bit. Show that IP−1(IP(x)) = x for the firstfive bits of x, i.e. for xi, i = 1,2,3,4,5.
Implement 4-bit block cipher using 4 XOR gates, plain text input [3:0] p, key input [3:0] k and cipher text output [3:0] c using Verilog. Use two of 4-bit block cipher and 2 XOR gates to implement 8-bit block cipher with plain text input [7:0] p, key input [3:0] k, initialization vector input [3:0] and cipher text output [7:0] c. ex) IV = 4’b1101, key = 4’b1000, plaintext = 8’b01100001 (‘a’, 97)
Problem with constructing MAC. The messages X to be authenticated consists of z independent blocks, so that: X = x1||x2|| . . . ||xz, where every xi consists of |xi| = 8 bits. The input blocks are consecutively put into the compression function ci = h(ci−1, xi) = ci−1⊕xi At the end, the MAC value: MACk(X) = cz+k mod 28 is calculated, where k is a 64-bit long shared key. Describe how exactly the (effective part of the) key k can be calculated with only one known message X.
4. (a) Suppose the encoding matrix is1−3 − 3 − 40 1 14 3 43Use the encoding matrix above to encode the messageGOOD LUCKUsing 1 for the letter A, 2 for B,….26 for Z and 27 for space.(b) Decode the encoded message(-19, -61, 83, -34, -111, 136, -35, -101, 119,-29,-83,84)using the following decoding matrix10 1 15 − 3 − 1−3 2 13What does the message say?
In this exercise, we consider the execution of a loop in a statically scheduled superscalar processor that has full forwarding. Loop: lw $t3, 0($s1) lw $t4, 0($s2) mul $t1, $t3, $t4 add $s0, $t1, $s0 addi $s1, $s1, -8 addi $s2, $s2, -8 bne $s1, $zero, Loop Unroll this loop so that three iterations of it are done at once and schedule it for a 2-issue pipelined processor. This processor can issue one ALU/branch instruction and one lw/sw instruction each cycle. Assume that the loop always executes a number of iterations that is a multiple of 3. You can use any unused registers when changing the code to eliminate dependencies.
Electrical Engineering Here is a resubmission of my question: I am given the task of writing a code(MATLAB or Python) that will compare the 3 path loss models( C.I, F.I and Dual Slope)models. I just uploaded a screenshot of the formulars/models. The operating frequency = 61 GHz. The plot should be PATHLOSS versus Distance. Distance here refers to the Rx-Tx ( a set of distances between the Transmitting antenna and Receiving antenna )and they could be from 2m to 20m, or to any range of your choice. # If you need further information, you please let me know. I am hopeful. Many thanks
(Practice) Although the total number of bytes varies from computer to computer, memory sizes of millions and billions of bytes are common. In computer language, the letter M representsthe number 1,048,576, which is 2 raised to the 20th power, and G represents 1,073,741,824, which is 2 raised to the 30th power. Therefore, a memory size of 4 MB is really 4 times 1,048,576 (4,194,304 bytes), and a memory size of 2 GB is really 2 times 1,073,741,824 (2,147,483,648 bytes). Using this information, calculate the actual number of bytes in the following: a. A memory containing 512 MB b. A memory consisting of 512 MB words, where each word consists of 2 bytes c. A memory consisting of 512 MB words, where each word consists of 4 bytes d. A thumb drive that specifies 2 GB e. A disk that specifies 4 GB f. A disk that specifies 8 GB
Scenario: In a biased N-bit binary number system with bias B, positive and negative numbers are represented as their value plus the bias B. For example, for 5-bit numbers with a bias of 15, the number 0 is represented as 01111, 1 as 10000, and so forth. Biased number systems are sometimes used in floating point mathematics. Consider a biased 8-bit binary number system with a bias of 12710 Question: What is the representation and value of the most negative number?
Q3) Consider weighted queueing scheme with three queues at the output port. The weights assigned to queues are w = 4, w = 2, and w = 1. The contents of each queue at time t1 are shown in below Figure. Assume packets are all the same size and that transmission time for each is 1 micro-second. Answer the following: b) Find the departure delay of each packet with respect to the previous packet in each class .