• Home
  • About Me

C. Yeung. C. Yeung Run

My tiny corner of the Internet for me to voice off on various topics.

Shameless Plugs

Firefox 3

Use OpenOffice.org

Links

  • Cherie Angelica
  • University of Texas Solar Vehicles Team

My Friends

  • Chris123NT’s Blog
  • codyg1985’s Think Tank
  • geek without a cause
  • Meaningful Energetic Zest
  • Mr. City’s Web Life
  • The Life that I Learn By
  • Those Who Walk On The Grass
  • Who am I? Thomas Close.

Categories

  • Etc. (73)
  • FIG Notebook (2)
  • Funny Snippets of My Life (15)
  • Linux Notebook (7)
  • Opinions (20)
  • Orientation Advising 2007 Notebook (10)
  • So Sue Me (9)
  • Uncategorized (10)
  • UTSVT Notebook (13)

 

April 2006
S M T W T F S
    May »
 1
2345678
9101112131415
16171819202122
23242526272829
30  

EE 316 Fun

April 23rd, 2006 by dasunst3r

So, while I was grinding on my EE 316, I came across this very delightful problem:

14.8) A sequential circuit has two inputs and two outputs. The inputs (X1 and X2) represent a 2-bit binary number, N. If the present value of N is greater than the previous value, then Z1 is 1. If the present value of N is less than the previous value, then Z2 is 1. Otherwise, Z1 and Z2 are 0. When the first pair of inputs is received, there is no previous value of N, so we cannot determine whether the present N is greater than or less than the previous one; therefore, the “otherwise” category applies.

a) Find a Mealy state table or graph for the circuit (minimum number of states, including starting state, is five).
b) Find a Moore state table for the circuit (minimum number of states is 11).

Answer

Posted in Etc. |

Leave a Comment

Please note: Comment moderation is enabled and may delay your comment. There is no need to resubmit your comment.

 
Wordpress Themes by and Website Templates by Blogcut