ECE354 S'09 hw9

ECE354 S'09 hw9 - assuming the input signal probabilities...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
NEW JERSEY INSTITUTE OF TECHNOLOGY ACADEMIC YEAR 2008-2009 SEMESTER 2 ECE354 DIGITAL TEST HW 9 Refer to the following circuit: A B C D F 1 g 2 g 3 g 4 g 5 g 6 g 7 g 8 g 9 g 10 g 11 g Fig. 1. Circuit for HW9 1. Compute the signal probabilities of all lines in the circuit using the Parker- McCluskey method. The input signal probabilities are flat random. 2. How many cutting patterns can be devised in order to compute the signal probabilities of all lines using the cutting algorithm? How many cuts need to be imposed for a given cutting pattern? 3. Compute the signal probability of all lines in the circuit using the cutting algorithm,
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: assuming the input signal probabilities are flat random. Perform the computation for all possible cutting patterns, and then use all this information to compute the best signal probability bound for every line. 4. Compute the exact detection probability of / 5 g using the Parker-McCluskey method. Assume flat random input signal probabilities. 5. Compute a lower bound on the detection probability of / 5 g using the cutting algorithm. Assume flat random input signal probabilities. 1...
View Full Document

This note was uploaded on 02/18/2010 for the course ECET 354 taught by Professor Sa during the Spring '07 term at NJIT.

Ask a homework question - tutors are online