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.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

One way to electrically or optically represent a binary 1 or 0 is to use the transition between a voltage level (for example, going from a state of no voltage to a state of voltage, or vice versa, on a copper cable) or the transition of having light or no light on a fiber-optic cable to represent a binary 1. Similarly, a binary 0 is represented by having no transition in a voltage level or light level from one time period to the next. This approach of representing binary digits is called state transition modulation.
Exercise 4.6 Give an example of an information channel I and an input A for which H(B)
The canonical SOP form of F(A,B.C)=A'+BC is F(A, B, C) = 0,1,2,3, F(A, B, C) = 0, 1,3,4,7 2.1.2.4.7 F(A, B, C) = F(A, B, C) =
Implement the following Boolean function F(A, B, C, D)= m(1,4, 6, 7, 8,9, 12, 13,15) with: An 8x1 MUX. Assume that the inputs A, B, and C are used for the select lines.
5.2.2 The Van der Pol oscillator The Van der Pol oscillator is a nonlinear dynamical system with many applications, e.g., in physics, biology, sociology and economics. It is a non-conservative oscillator with nonlinear damping, modelled by the differential equation x” − µ(1 − x²)x′ + x = 0, where the parameter μ measures the strength of the nonlinear damping. (5.9) (1) Rewrite Equation (5.9) as a system of two first-order ODEs for x and x'. Then, write a Python function vdp(x) which returns the vector f(x), as defined in (5.1), for the Van der Pol system. Here, x must be an array of "shape" [1,2]. (2) Solve the Van der Pol system with µ = 1/2, using your Python functions rk4 and vdp, for t = [0, 30], starting with initial conditions (i) x(0) = x'(0) = 0.1; and (ii) x(0) = −2,x'(0) = 2. (You should fix a suitable step size, h.) Then, plot time series, x(t), of the solutions (i) and (ii) in one figure, and plot phase portraits, (x(t), y(t)), for the two solutions, in another figure.…
Suppose you have a finite state machine that accepts bit strings divisible by 11. The FSM has 11 states R0, R1, ... , R10, each corresponding to the remainder when dividing by 11. Input is fed to the FSM one bit at a time from left to right, the same way we did in our in-class examples. If the machine is currently in state R7, an input of 1 should transition it to which state? Type the subscript only of the new state. Your answer should be an integer between 0 and 10, inclusive.
5.01-2. Dijkstra's Algorithm (1, part 2). Consider the network shown below, and Dijkstra's link-state algorithm. Using the algorithm statement used in the textbook and its visual representation, complete the second row in the table below showing the link state algorithm's execution by matching the table entries (a), (b), (C), (d) and (e) with their values. Write down your final [correct] answer, as you'll need it for the next question; the *s shown correspond to your answers to the question 5.01-1. [Note: You can find more examples of problems similar to this here.] Step D(v),p(v) D(w).p(w) D(x),p(x) D(y),p(y). D(z),p(z) N' u 1 (a) (b) (c) (d) (e) (a) A. 6,v (b) B. 9,x (c) С. 2,u v (d) D. 3,u (e) E. uv F. infinity G. 9,w H. 4,u I. 4,v 3. 2, 4- 2.
Question 9 Electrical resistors are said to be connected "in series" if the same current passes through each and "in parallel* if the same voltage is applied across each. If in series, they are equivalent to a single resistor whose resistance is given by R = R, + R2 + R3 + …+ R, ... If in parallel, their equivalent resistance is given by 1 + Ro 1. 1. 1 + R2 1. R R, R3 Write an M- le that prompts the user for the type of connection (series or parallel) and the number of resistors n and then computes the equivalent resistance.
5.01-3. Dijkstra's Algorithm (1, part 3). Consider the network shown below, and Dijkstra's link-state algorithm. Using the algorithm statement used in the textbook and its visual representation, complete the third row in the table below showing the link state algorithm's execution by matching the table entries (a), (b), (C), (d) and (e) with their values. Write down your final [correct] answer, as you'll need it for the next question; the *s shown correspond to your answers to earlier parts of this question. [Note: You can find more examples of problems similar to this here.] 8 4 W- u 2 3 3 6. Step ㅇ D(v),p(v) D(w),p(w) D(x),p(x) D(y),p(y) D(z),p(z) N' u 1 00 2 (a) (b) (c) (d) (e) (a) A. 9,x (b) B. uvw - (c) C. 3.u (d) D. 9,5 (e) E. 4,u F. 2,u G. uvx H. 5,x I. 9.x J. 6,V 2, 3, >>>>
13(a) Consider the alphabet Σ = {a,3,7,6}. Answer the following two questions. You must justify your answers, and not simply state numerical values. (i) How many strings of length 5 defined over Σ contain exactly one a and exactly one 3? (ii) How many strings of length 5 defined over Σ contain exactly two y's and at least one d?
(a) Model a binary counter with four bits as a propositional planning task II₁ = (V₁, I₁, 01, 71). The initial value of the counter is 0 and the goal is to obtain a value of 15. The only allowed operation is to increment the current value by 1, so your model should have a single operator. (b) Replace O₁ in your previously defined model with a set of operators O₂ without conditional effects. Your model should still resemble a binary counter. Hint: You need more than one operator to implement the single logical operation of incre- menting the counter by 1.
4.→Design·and·test·a·“sorter”.circuit.that·has·two·(2)·inputs·and.two·(2)·outputs.…It·acts·as·follows:¶ Ax OX OX 1x 1x Bx OK 1x OX 1x F18 OX OX OX 1x 28 0 OX 1x 1x 1x ¤ ¤ ¤ ¤ A B Sorter Circuit F1 F2