CSE370 Assignment 5


Distributed: 22 February 2001
Due: 2 March 2001


Reading:


Exercises:

  1. Problems 5 and 9 inherited from Assignment 4.
  2. Create a 3-bit Gray code counter with an offset. The starting count value is loaded serially. While the starting value is loaded (input PIN=1), the counter does not count. While PIN=0, the counter counts according to one of six different Gray code sequences. Sequence selection is done as in the previous assignment. Use an already developed Gray code block. 
  3. Create a 16-bit carry lookahead adder using 4 4-bit adder modules: i) a 4-bit carry-ripple adder and ii) a 4-bit carry-lookahead adder. Analyze the delay vs. gate count for the two different implementations. Consider only two-input gates. The report should clearly show the critical path of both implementations and provide insights how the gate count was computed.
    (extra credit + 5%) derive generic formulas for delay and gate count for a 4N-bit adder implemented using both types of 4-bit adders. 
  4. Create a pattern recognizer that detects any sequence AB or BA of the following two patterns: A=1001 and B=0101. Use minimal number of D-FFs. The input arrives serially, one bit per cycle. Once pattern is recognized the search is reset (for example, within 100101010010101  only the first sequence is detected).
  5. Create an 8-bit bidirectional counter with offset that is loaded in parallel.
  6. Create a sorter of 4 4-bit registers.
  7. An external input is sampled using a clock at 1MHz. The length of the correct input signal is exactly 4 clock cycles. This signal arrives asynchronously with respect to the clock. Length of a glitch is 0.1microsecond. 
    a) The expectation of glitch occurrence at a single clock rising edge is 1/10. 
    b) (extra credit + 5%) Likelihood of glitch occurrence within a single clock cycle is 1/10. The circuit should obey the setup and hold times for the reception FF logic. The sum of the setup and hold time is 0.1microsecond.
    Create an asynchronous receiver of the main signal with probability of 10^(-9) of false alarm due to a glitch. 
  8. Katz 6.11

Comments to: cse370-webmaster@cs.washington.edu (Last Update: 02/09/01 )