midterm.w05

# midterm.w05 - 1. (1pts) What is the Hamming distance...

This preview shows pages 1–4. Sign up to view the full content.

1. (1pts) What is the Hamming distance between these twobit patterns: 1001 and 0101? 2. (3pts) Write the equation for the carry out of the 3rd adder cell in an ALU using carry- lookahead, in terms of P’sand G’s. 3. (3pts) What is the difference between the Mealy and Moore models of sequential design? 4. (3pts) What is the difference between a Flip-Flop and a latch? 5. (5pts) In the ALU you designed in the homework, howdid you differentiate between an operation being an "add" and an operation being a "subtract"? In other words, what bit/bits were set/cleared in order to indicate that the values were to be added instead of subtracted? Whydid this work so well?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
6. (10 pts) Assuming a rising edge-triggered DFF ,what is the maximum clock frequencypos- sible for the following circuit? (In other words, what is the maximum clock frequencythat will still guarantee correct behavior?) Use the following delay values, and assume all input signals become valid at time 0. (Tprop is the propagation time for the flipflop, the time it takes from the rising edge of the clock until the output of the FF is valid.) AND: 3 ns NAND: 7ns MUX:6 ns Tprop: 5 ns Tsetup: 2ns Thold: 1ns 1 0 1 0 1 0 Clock X Y SEL Q DFF Q Q DFF
7. (3pts) Howfar apart must valid code words be to allowDouble Error Detection (DED)?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 05/06/2008 for the course ECS 154a taught by Professor Singh during the Winter '05 term at UC Davis.

### Page1 / 8

midterm.w05 - 1. (1pts) What is the Hamming distance...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online