6) For m 5 determine the Reed-Solomon code that can correct 3 erroneous symbols, i.e., find the b...
Problem (A1) (20 points): Huffman Coding Consider a message having the 5 symbols (A,B,C,D,E) with probabilities (0.1,0.1,0.2 ,0.2, 0.4), respectively. For such data, two different sets of Huffman codes can result from a different tie breaking during the construction of the Huffman trees. • Construct the two Huffman trees. (8 points) Construct the Huffman codes for the given symbols for each tree. (4 points) Show that both trees will produce the same average code length. (4 points) For data transmission...
Consider the following code mapping for k = 2 bits of information with n = 5. How many errors at maximum can this code correct? What are the generator and parith check matrices of the code? (Enough to provide one valid parity check matrix). Information bits Codeword 00 00000 01 00111 10 11100 11 11011
Consider a convolutional code with code rate R 1/2,k- 1, and constraint length L-3. The generators a) Find the output for input 10100 based on the trellis diagram of this convolutional code. (6 marks) b) Suppose that the received sequence is 1110110010. Use the Viterbi algorithm to find the most likely transmitted data sequence. (10 marks)
Consider a convolutional code with code rate R 1/2,k- 1, and constraint length L-3. The generators a) Find the output for input 10100 based...
9. (4) Select the best choice as Huffman code for the following symbols and their probabilities: A-0.10 C-0.17 E-0.21 B-0.21 D-0.06 F-0.25 (a) A: O, B: 10, C: 110, D: 1110, E: 11110, F: 11111 (b) A: 0,B: 10, C: 11111, D: 1110, E: 11110, F: 110 (c) A: 11110, B: 10, C: 1110, D: 11111, E: 110, F: 0 (d) A: 11111, B: 11110, C: 1110, D: 110, E: 10, F: 0 (e) A: 0,B: 01, C: 0001, D:...
Consider the following assembly code. 1. 1, LOAD R, #1 2, LOADS, #1 3, LOAD T, #(k-3) 4. ADD AC, R, S 5. LOAD R, S 6. LOAD S, AC 8. BRP 4, T 9. STOR AC, M where R, S, T, AC are is addressing and BRP stands for "branch if positive". sters, M is a memory location, # indicates immediate (a) Explain what this code computes (assuming that k is a natural number greater than two). (6 marks)...
3. A 10 kg block A is released from rest 2 m above the 5 kg plate P, which can slide freely along the smooth vertical guides BC and DE. The coefficient of restitution between the block and the plate is e 0.75. Determine the veloc 2 ity of the block and the plate just after impact. What is impact? The spring has an unstretched length of 600 m450 mm Ans: A 2.61 m/s, p 7.31 m/s and d 0.32...
Hi, can you solve the question for me step by step, I will rate
up if the working is correct. I will post the answer together with
the question.
Answer:
Question 4 A particle of mass m is moving in a horizontal plane in a circle of radius R, with angular velocity 6, anti-clockwise given by é t+cos(2t) Implement plane polar unit vectors er and ee, in the horizontal plane, and k in the vertical direction, giving a right-handed coordinate...
(b.) Huffman code is a way to encode information using variable-length binary strings to represent symbols depending on the frequency of each individual letter. Specifically, letters that appear more frequently can be encoded into strings of shorter lengths, while rarer letters can be turned into longer binary strings. On average, Huffman code is a more efficient way to encode a message as the number of bits in the output string will be shorter than if a fixed-length code was used....
Question 5 P 0.8 m A rigid uniform square block of mass m = 60 kg is resting on the ground as shown above. A force P is applied to the block at 0.8 m above the ground. The coefficient of kinetic friction between the ground and the block is given by uk = 0.2. It can be shown that the free-body diagram for the situation above is as given below, where F is the friction, N is the normal...
Please explain answer :D
Question 5 (5 marks] Consider the syntactically correct C code below, which is missing a function print_diagonal include <stdio.h> • typedef int Table(100) (100); */• print diagonal (T, n) . Given a Table T, which will have n rows and n columns, print all of the 1 entries on the main diagonal of T (that is, entries whose row number and column number are equal). Remember to print a newline at the end. / ► /...