a) Consider 2 compression codes whose relevant information is given in the table below. You have to compare the performance of the 2 codes using the information provided in the table. You must show that which code has performed better and why? Show all steps of your calculations P,(r,) 11(r) Code 2 12(r,) Code 1 .07 00 1001 4 .15 01 2 000 .25 10 2 10 2 .53 11 2 1 1 4. b) Apply any one of the Laplacian Operator mask to the center pixel of the following 8- bit image of size 3x3 pixel and find the output value:

a) Consider 2 compression codes whose relevant information is given in the table below. You have to compare the performance of the 2 codes using the information provided in the table. You must show that which code has performed better and why? Show all steps of your calculations P,(r,) 11(r) Code 2 12(r,) Code 1 .07 00 1001 4 .15 01 2 000 .25 10 2 10 2 .53 11 2 1 1 4. b) Apply any one of the Laplacian Operator mask to the center pixel of the following 8- bit image of size 3x3 pixel and find the output value:

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter6: System Integration And Performance

Section: Chapter Questions

Problem 21VE

See similar textbooks

Similar questions

When moving images are sent across a network, redundancy is inevitable. In encoding, we employ two kinds of redundancy. With regards to compression, which of the following two methods should be used?
Consider a SEC code that protects 8-bit words with 4 parity bits. If we read the value0xABC, is there an error? If so, correct the error.Note: 0xABC = 1010 1011 1100Hint: Decode the 12-bit encoded data and find if there is an error.
1. Let M be the plaintext message M = MALAYSIA and the private key, K = ISSOGOOD, Supposed we using the appropriate steps of DES operation and the permutation compression (PC) table provided below get he final output of the key for round 1. a) Based on the output above, explain the next process using the S-box table, and show the output from this operation. b) Based on the output above, explain the next process using a straight permutation table, and show the output from this operation.
Question 4: A modified NRZ code known as enhanced-NRZ (E-NRZ) is sometimes used for high density magnetic tape recording. E-NRZ encoding entails separating the NRZ-L data stream into 7-bit words; inverting bits 2, 3, 6, and 7; and adding one parity bit to each word. The parity bit is chosen to make the total number of 1s in the 8-bit word an odd count. What are the advantages of E-NRZ over NRZ-L? Any disadvantages?
3. So I am studying Word Aligned Hybrid compression. All of it seems pretty straightforward until I stumbled upon the last part. Say you have a 8-bit compression but you only have for example 2, 3, 4, or some number of bits less than the word size. how do you "compress" or rack on the remaining bits? say we are doing a size 8 on the example: 0101000-00000000-00000000 I understand that the first 7 are taken literally then there follow 2 runs of 0's. But then what do you do about the remaining 3 or so bits? what would the compressed output look like?
1. Let M be the plaintext message M = MALAYSIA and the private key, K = ISSOGOOD a) Using the appropriate steps of DES operation, what is the final output of the key for round 1 (hint: you have to use the circular left shift and permutation compression (PC) table provided below). b) For round 1, please provide your output for the XOR operation of plaintext and the key, according to the DES operation. c) Based on the output of 4(b), explain the next process using the S-box table, and show the output from this operation. d) Based on the output of 4(c), explain the next process using a straight permutation table, and show the output from this operation.
You are given a text file of size 60 MB, which is to be encrypted using steganography in the low-order bits of each color in an image file. What size image would be required in order to encrypt the entire file? What size would be needed if the file were first compressed to a third of its original size? Give your answer in pixels, and show your calculations. Assume that the images have an aspect ratio of 3:2, for example, 3000 × 2000 pixels.
Discuss the steps on how Huffman encoding algorithm is use in determining the efficiency of data compression.
#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... .
Can I at least ensure that the length of a bitstream won't rise due to my compression algorithm?
a) Determine the 32-bit binary representation for floating point numbers in the form± I.F x be where I is the interger part,F is the fraction,b is the base, ande is the exponent.Using this format, represent the number -1.00011011101 x 225 as a 32 bit floating point number. b) During the process of digital sampling, data can be lost due to aliasing. Analyse this problem and provide at least two possible solutions. Also, determine the rate at which a signal should be sampled, if the highest frequency is 60MHz. c) In your own words, discuss the relationship between the hexadicimal number system and the binary number system. Use this relationship to convert the following hexadecimal values to binary.i) 5BC916 ii) 6EF816 iii) 8A4D16 iv) 9ED516
Discuss the role of integers in Huffman coding and Lempel-Ziv-Welch (LZW) compression algorithms. How do these algorithms use integers to achieve data compression in text and multimedia files?