Question

3. (5pts) Lets assume we have a source message with 10 bits and the probability for any single bit going wrong is 0.1, then

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Solution; Given that A source message with lo bits probability for any single bit going wrong (P; 2= to > weigh information cgiven Pi = 011, N = 10 HCP) = { 0.1 1072 Los n - 10 Xol x3.32 HCP) = 3.3 224 bits So, esctha 4 bits needed so total 14 minim

Add a comment
Know the answer?
Add Answer to:
3. (5pts) Let's assume we have a source message with 10 bits and the probability for...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 15. Assume a three-bit message is to be transmitted. To clear the encoder two zero-bits are appen...

    15. Assume a three-bit message is to be transmitted. To clear the encoder two zero-bits are appended after message. Thus 5 bits are fed into the encoder to produce 10 coded bits (codeword). Assume that the channel error probability is p-0.1. If we observe 10,01,10,11,00 in the receiver what is the most likely transmitted sequence? (Hint: use Viterbi algorithms) Received sequence10 01 10 10 15. Assume a three-bit message is to be transmitted. To clear the encoder two zero-bits are...

  • 3. We want to transmit commands to a drone over a wireless channel. The commands and...

    3. We want to transmit commands to a drone over a wireless channel. The commands and the probability of transmission are as follows: up (0.1), down (0.1), forward (0.4), left (0.15), right (0.15) and hover (0.1). (30) (a) What is a compact binary code to transmit these messages? (5) b) Suppose for hardware simplification reasons, a fixed 4-bit representation of each of the commands is used instead of the compact code. If a command is sent every second, how inefficient...

  • Say you have an n block of bits message. You split it to 8 bits each (assume that 8 divides n). For each of the 8 bit we...

    Say you have an n block of bits message. You split it to 8 bits each (assume that 8 divides n). For each of the 8 bit we choose a permutation of the bits. How many different codes could come out of this? Explain or prove the correctness of your analysis.

  • assume we want to send a dataword of two bits using FEC based on the Hamming...

    assume we want to send a dataword of two bits using FEC based on the Hamming distance. Show how the following list of dataword/codewords can automatically correct up to a one bit error in transmission dataword-codeword 00- 00000 01- 01011 10- 10101 11- 11110

  • Consider a noisy communication channel, where each bit is flipped with probability p (the probability that...

    Consider a noisy communication channel, where each bit is flipped with probability p (the probability that a bit is sent in error is p). Assume that n−1 bits, b1,b2,⋯,b(n−1), are going to be sent on this channel. A parity check bit is added to these bits so that the sum b1+b2+⋯+bn is an even number. This way, the receiver can distinguish occurrence of odd number of errors, that is, if one, three, or any odd number of errors occur, the...

  • 1. Suppose that we have a floating point real number structure shown as below 10 bits 22 bits exp...

    1. Suppose that we have a floating point real number structure shown as below 10 bits 22 bits exponent mantisa 1-1. Find the minimum and maximum value of this floating point real number 1-2. Suppose that A. B and C are real numbers represented by this floating point real number. Suggest a function that calculates CA * B. You may write a function with pseudocode or any languages 1. Suppose that we have a floating point real number structure shown...

  • Please solvve this... Detailed solution please Thank you!! 2. (20 points) Let's assume that we have...

    Please solvve this... Detailed solution please Thank you!! 2. (20 points) Let's assume that we have to multiply two 3-bit positive numbers or two 3-bit negative numbers. That is, the signs of the input numbers are guaranteed to be the same. Draw a logic diagram for the modified multiplier. You can use any kind of combinational blocks such as multiplexors, half-adders, etc. Try to minimize the number of gates/blocks. 3.115 points] Find the answer for the following calculations. Circle ifit...

  • Let's assume that rather than having a single representative firm we have 2 refiners of gasoline...

    Let's assume that rather than having a single representative firm we have 2 refiners of gasoline who have different marginal costs of reductions: MCRz = 0+2*Q2 (Note that these two cost functions are not going to give the economy wide MCR above in part A, so don't worry if this gives different results than above.) Each firm normally emits 6 units of pollution, so there would be 12 units of pollution total.

  • thank you in advance Sample Problem: MIPS is a 32-bit ISA. The I instructions in MIPS have the following format: [...

    thank you in advance Sample Problem: MIPS is a 32-bit ISA. The I instructions in MIPS have the following format: [opcode (6bits)ー!RS (5 bits) (l6 bits) |1mm (16bits) Rt(5 bits) (1) Assume that we want to implement a single-cycle datapath for I MIPS instructions, write down the "in" ports part of the VHDL entity declaration for the single-cycle datapath controller. (Hint: what information does the single-cycle controller use?) entity singlecyclecontroller is port (???: in STD LOGIC); end foo; (2) Now...

  • 1. Let's assume that we want to fabricate a device with 3 lithography steps. During designing...

    1. Let's assume that we want to fabricate a device with 3 lithography steps. During designing of a photomasks, what should we add in the photomask? (a) Negative lithography mask with alignment patterns in the first two masks. (b) Positive mask lithography mask with alignment patterns in the first two masks. (c) Alignment patterns in all masks without depending on the PR type. (d) Alignment patterns in the first two masks without depending on the PR type. 2. If a...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT