Consider 7-bit messages that we encode into 11-bit codewords using 4 parity bits. Thus our codewords look like: ⟨a, b, c, d, e, f, g, p1, p2, p3, p4⟩ where a, b, c, d, e, f, g are the original 7-bits of the message, and p1, p2, p3, p4 are 4 parity bits. Recall the two properties from Tutorial 2: (0) each bit of the original message appears in at least two parity bits, and (1) no two bits of the original message appear in exactly the same set of parity bits. For the following proposed parity bits, select whether they satisfy property (0), property (1), both, or neither. p1 = a ⊕ e p2 = b ⊕ e ⊕ f p3 = c ⊕ f ⊕ g p4 = d ⊕ g

Next time you snap a picture,  you realize you are capturing millions of pixels into a buffer.  The buffer data is read and converted into JPEG in real time.  Each pixel in that buffer is  an unsigned int  (four bytes ): Alpha, Blue, Green, and Red.  Let us ignore alpha for now.  As you know, a unsigned byte can have a value 0 to 255.  In remote sensing jargons,  it is called blue channel, green channel, and red channel.  Each channel  provides valuable information such as, say farm lands, forest fire, drought, landscape,  diseases ,    If a pixel has a value (say in hex) = 0x00a1b1c1 ,  then 0xc1 is the red pixel, 0xb1 is the green pixel, 0xa1 is the blue and 00 is the alpha. #define RED 1 #define GREEN 2 #define BLUE 3   then, develop a function   void  calculateSum ( unsigned int *ptr , int count ,  unsigned char channel ,  unsigned int *sum,  float *average ) {  *sum = 0;     if (channel == RED )        calculate sum and average for red channel     else     if (channel == GREEN )…

Consider a hypothetical 8 bit floating point machine representation with a sign bit, a 3 bit exponent, and a 4 bit mantissa (se1e2e3b1b2b3b4), where the exponent bias is 3 (add 3 to exponent of number to form machine representation). Recall that actual mantissa has 5 bits, since the leading 1 is not stored on the machine. (a) What is the number ?≈2.718 in this 8-bit format? (b) What is the number that (10100111)2 represents in this 8-bit format? (c) What is the upper bound of the relative error when representing a real number in this 8-bit format?

1. Generate the Hamming-code for the following 12-bit data string : 1 0 1 0 1 1 0 1 1 1 0 1 Show that the generated binary string does not have any errors.