A convolutional coder CC(3,1,3) with rate R=1/3 is given in the Figure below. X shows input bits and Y shows output bits. When one bit at a time enters shift registers, this coder generates three (3) bits, i.e., Y = [Y,Y,Yo], where Y, is the first output (rightmost) bit in sequence. If the input bit sequence is given as X = [X2X1X0] = [001], where X, is the first input (rightmost) bit in sequence, what is the output bits of this convolutional coder in sequential order? K=3 X.....X2 X1 Xo İnput bits Y2 Y1 YO Lütfen birini seçin: O a. 110 101 011 b. 101 101 110 c. 011 110 101 d. 110 111 011 e. 011 101 111

A convolutional coder CC(3,1,3) with rate R=1/3 is given in the Figure below. X shows input bits and Y shows output bits. When one bit at a time enters shift registers, this coder generates three (3) bits, i.e., Y = [Y,Y,Yo], where Y, is the first output (rightmost) bit in sequence. If the input bit sequence is given as X = [X2X1X0] = [001], where X, is the first input (rightmost) bit in sequence, what is the output bits of this convolutional coder in sequential order? K=3 X.....X2 X1 Xo İnput bits Y2 Y1 YO Lütfen birini seçin: O a. 110 101 011 b. 101 101 110 c. 011 110 101 d. 110 111 011 e. 011 101 111

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

Implementing AES Implement (almost) the first round of AES with a 128-bit key. Given a 128-bit plaintext and a 128-bit key, this involves: Performing a bitwise XOR with the plaintext and the key Applying byte substitution for each byte in the state Applying shift rows on the state table rows Applying mix columns on the state table columns Output the state table at this point. The "almost" above means that you don't have to perform the XOR with the state and the first sub-key. Please name the program AESEncryptRound.java or aesencryptround.py. You may hard code the inputs. Please use the following inputs, which are the same as given in Appendix B of the FIPS197 document: plaintext = 0x3243f6a8885a308d313198a2e0370734 key = 0x2b7e151628aed2a6abf7158809cf4f3c The byte substitution, multiply-by-2, an multiply-by-3 tables are available at AEStables.txt. Each is given as a list where the ith entry is the value of applying the given operation to i. Please print the state table after each…
5.9 Implement a serial bit stream sequence detector with first two data are 00 followed by at least twoconsecutive 11 by doing the following. Specification example, if input data senquence is 0011 or 00111or 001111, ...the output will be 1; otherwise the output will be 0, such as the input is 01XX or 10XX or0010 or any sequence, ...[1] How many flip flop is needed to implement this detector?[2] Derive a state diagram for this detector.[3] What type flip flop is going to be used?[4] Draw a truth table for this detector with considering the FF chosen in [3][5] Develop state input equations[6] Sketch a logic diagram for this detector
implement bitMask(x,y) Generate a mask consisting of all 1’s from lowbit to highbit /* * bitMask - Generate a mask consisting of all 1's * lowbit and highbit* Examples: bitMask(5,3) = 0x38* Assume 0 <= lowbit <= 31, and 0 <= highbit <= 31* If lowbit > highbit, then mask should be all 0's* Legal ops: ! ~ & ^ | + << >>* Max ops: 16* Rating: 3*/int bitMask(int highbit, int lowbit) {return 2;}
Binary Arithmetic Coding: Consider integer implementation of binary arithmetic coding: Use 4 bit integers to store LOW and HIGH. At certain stage, suppose the counters for 0 and 1 are 30 and 10 respectively LOW =2, HIGH = 13, and E3 scaling counter Scale3 = 2; Describe the detains of the encoding process when the next two inputs bits are both 1;
In a Von Neumann architecture, groups of bits have no intrinsic meanings by themselves. What a bit pattern represents depends entirely on how it is used. The following table shows bit patterns expressed in hexadecimal notation i. 0x000940C2 ii. 0x8C90FFFC Qa)What decimal number does each bit pattern represent if, i.It is a two’s-complement integer? ii.It is an unsigned integer? b) If each bit pattern represents an MIPS instruction, what instruction will be executed? c) What decimal number does each bit pattern represent if it is a floating-point number in IEEE 754 standard?
#45.! Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011 Draw the graph of the i. Manchester using each of the given data streams, assuming that the last signal level has been positive. From thegraphs, guess the bandwidth for this scheme using the average number of changes in the signal level... .
In ___________ there is always a transition at the middle of the bit, but the bit values are determined at the beginning of the bit. If the next bit is 0, there is a transition; if the next bit is 1, there is none. a. Manchester b. differential Manchester c. both (a) and (b) d. neither (a) nor (b)
Consider a convolutional code with k = 1, n = 3 and L = 3. The encoder generators aregiven by 91 = [110], 92 = [001] and 93 = [011].Assume the Viterbi algorithm is used for decoding at the receiver and considerthe received bit sequence at the input of the channel decoder being [10 0100110011].Answer the following questions.(a) What is the decoded information bit sequence? (b) What is the value of the cumulative metric (i.e., Hamming distance) of thefinal survivor path of the decoding process?(c) Draw the final survivor path of the trellis for the decoding process.Instruction for Part (c): An example of drawing a path in the trellis is shown below.
a) Compute the even parity bits for the data bits: 1 1 0 1 0 1 1 1 and 1 0 0 0 1 0 1 0 b) Compute the odd parity bits for the data bits: 1 1 0 1 0 1 1 1 and 1 0 0 0 1 0 1 0 c) Transform the following bit string (D) into a 3 x 8 matrix and compute the two-dimensionaleven parity EDC bits. D = 1 1 0 1 0 0 1 0 1 1 1 0 0 0 1 1 0 0 1 1 1 0 1 1 d) Assume that a sender transmits <D, EDC> as shown and computed in c). Next, assume that thereceiver receives D’ and EDC’ as follows:D’ = 1 1 0 1 0 0 1 0 1 1 1 1 0 0 1 1 0 0 1 1 1 0 1 1; EDC’ = EDC, Does the received bit streamhave errors? If yes, how does the receiver detect or correct the errors and how many errors can bedetected or corrected?
Given are the following codewords for an error control coding scheme data 000 011 100 codeword 00011000 00000111 10101000 . a.What is the minimum Hamming distance? b. What is the coding rate for this scheme? c. what raw data rate would be required if we need a throughput of 6 Mpbs? d. in a different situation, the number of data bits to transfer is 5, and the minimum hamming distance is dmin=5. find the maximum coding rate for this situation
in hamming coding system(7,3) shown as ; 3 test bit and 7 total bit (test+data) and test bits are shown as (c1,c2,c3...) or (p1,p2,p3...) bit series coded in haming(15,4) is recieved as 0011001110111000(p1,p2,....,d11) on reciever side according to this bit series; what is the (d1,d2,...d11) ?
The 8-bit register AR, BR, CR, and DR initially have the following values: [5]AR = 11010010; BR = 11111111; CR = 10101001; DR = 10101010Determine the 8-bit values in each register after the execution of the following sequence ofmicrooperations.AR  AR + BR Add BR + ARCR  CR AND DR, BR  BR + 1 AND DR to CR, Increment BRAR AR - CR Subtract CR from AR