Question 1 Show that C = {000, 111} is a linear code and C = {000, 001, 101} is not a linear code? Input S, S2 S, o Output Fig. 9.65. Question 2 (i)Determine the state diagram for the convolutional encoder shown in figure 9.65. Draw the Trellis diagram through the first set of steady state transitions. On the second Trellis diagram, show the termination of the Trellis to all-zero state. (ii) For the convolutional encoder arrangement shown in figure, draw the state diagram and hence trellis diagram. Determine output digit sequence for the data digits 11010100. What are the dimensions fo the code (n, k) and constraint length? Use Viterbi's algorithm to decode the sequence. 100 110 111 101 001 101 001 010 Compare the convenience of code tree, trellis diagram and state diagram from encoding and decoding of convolutional codes point of view.

Question 1 Show that C = {000, 111} is a linear code and C = {000, 001, 101} is not a linear code? Input S, S2 S, o Output Fig. 9.65. Question 2 (i)Determine the state diagram for the convolutional encoder shown in figure 9.65. Draw the Trellis diagram through the first set of steady state transitions. On the second Trellis diagram, show the termination of the Trellis to all-zero state. (ii) For the convolutional encoder arrangement shown in figure, draw the state diagram and hence trellis diagram. Determine output digit sequence for the data digits 11010100. What are the dimensions fo the code (n, k) and constraint length? Use Viterbi's algorithm to decode the sequence. 100 110 111 101 001 101 001 010 Compare the convenience of code tree, trellis diagram and state diagram from encoding and decoding of convolutional codes point of view.

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

CREATING A CIRCUIT DIAGRAM Questions 4 and 5 refer to the function defined by the following truth table: w result 00001 00010 00110 00101 01101 01111 01010 0100 0 1 1000 1 1 0 1 0 1 111 0 11101 1 010 1 0 1 1 0 1 - 1 0010 1 000 1 Question 4 Fill in the values and draw the groupings of the Karnaugh Map. ५३ Wx 00 01. 11 10 00 01 11 10
Task: Draw the State Diagram for the Moore Sequence Detector FSM. How many states have the New State diagram? Given VHDL Code for the Moore Sequence Detector FSM: LIBRARY ieee;USE ieee.std logic 1164.all; ENTITY Seq_Detector_Moore ISPORT ( Clock : IN STD_LOGIC ;Resetn : IN STD _LOGIC ;w : IN STD_LOGIC ;z : OUT STD _LOGIC ) ;END Seq_Detector_Moore; ARCHITECTURE Behavior OF Seq_Detector_Moore ISTYPE state _type IS ( A, B, C) ;SIGNAL current _state, next _state : state _type;BEGIN --next state decoderProcess (current_state, w)BEGINCASE current_state IS WHEN A =>IF w = ’1’ THEN next _state <= A ;ELSE next _state <= B ;END IF ; WHEN B =>IF w = ’1’ THEN next _state <= A ;ELSE next _state <= C ;END IF ; WHEN C =>IF w = ’1’ THEN next _state <= A ;ELSE next _state <= C ;END IF ; WHEN OTHERS =>next_state<= A ; -- go back to the initial stateEND CASEEND PROCESS ; --state memory (FFs)PROCESS ( Clock, Resetn )BEGINIF Resetn = ’1’ THENcurrent_state <=…
Our Problem bībo be two-bit binary Let A = a1 ao and B = numbers. A and B can take on values from 0 to 3 (for example, A = 2 when aj ao = 10. Let C be a two bit binary number whose value equals the magnitude of the difference A – B. We have C = c¡c0 = |A – B|. (This means that if B is larger than A then you consider B-A.) You are to design a circuit which accepts A and B (i.e., aj aob¡bo) as inputs and outputs the result C = c¡c0. The circuit thus has four inputs and two outputs. For example, the circuit should output cjco = 10 when ajao = 01 and bibo = 11 (C = 2 when A = 1 and B = 3). -
7. Write the simplified (minimized) expression for the Boolean function defined by the following Karnaugh Map (KMap) in Sum of Product (SOP) form. WX yz 00 01 11 10 00 0 0 1 1 01 1 1 1 1 11 0 1 0 0 10 1 1 0 1
b. Write sum-of-products expansion of the Boolean function F(x, y,z) = 0 if and only if ỹz = 0.
For the Boolean function F1(AB,C,D)=Em(0,2,4,6,7,8,10,12,14,15)+d(3,11) do the following: a) Draw a truth table. b) Find minimal SOP expression for Boolean function F1 using K-map. c) Draw a circuit diagram.
1. Write the truth table that provides the following Boolean function. F = AB' + AD +BC + CD' + A'B'C' D' 2. Write the Karnaugh map of the truth table. 3. Group all l's on the Karnaugh map to obtain simplified F function. 4. Group all 0's on the Karnaugh map to obtain simplified F' function. 5. Design the circuits of F and F' functions by using NAND gates.
4. Study the below truth table (A, B, C, D are inputs, and Z is the output) then do the following: A D 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Draw the Karnaugh Map for the above truth table and write the simplified Boolean equation from it.
Question 1 Show that C = {000, 111} is a linear code and C = {000, 001, 101} is not a linear code? %3D Input S, S2 S, o Output Fig. 9.65. Question 2 (i)Determine the state diagram for the convolutional encoder shown in figure 9.65. Draw the Trellis diagram through the first set of steady state transitions. On the second Trellis diagram, show the termination of the Trellis to all-zero state. (ii) For the convolutional encoder arrangement shown in figure, draw the state diagram and hence trellis diagram. Determine output digit sequence for the data digits 11010100. What are the dimensions fo the code (n, k) and constraint length? Use Viterbi's algorithm to decode the sequence. 100 110 111 101 001 101 001 010 Compare the convenience of code tree, trellis diagram and state diagram from encoding and decoding of convolutional codes point of view.
Discussion 1. Prepare the implementation of three inputs AND gate by using NOR gate only. Then show how NAND gate can be used for build the logic circuit for X = A + BC. 2. Can you suggest why all logic function in a digital system are often generated with single gate type. 3. Draw the logical circuit (F) by using only NAND gate F = AB + D(B + C), and describe it's truth table. 4. Prove: 1. A + AB = A + B. 2. (A+B)(A + C) = AC + AB + BC. 3. A.B.C.D=A+B+C+D. 4. ABC + ABC + ABC = A (B+C). 5. AC + ABC = C (A + B). 6. AC + ABC + ACD+CD= A + CD.
Write the Boolean algebra expressions and simplify using Karnaugh map for the following table of combinations, where A, B and C are inputs and X, Y are outputs. Draw the schematics, compile and simulate the circuit using Altera Quartus software. Turn in the schematics and the waveform simulation diagram of the design (snapshots copied in PowerPoint or Word and saved as PDF files, no jpeg or other picture files). A C Y 1 1 1 1 1 0. 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
Draw the Moore and Mealy State Diagram of a Finite State Machine thatfunctions as a Binary Sequence Detector for the following sequence:can you answer letter b onlyb. 1011 and/or 0100Obtain the State Table for each of your diagrams.