exam1_solution

exam1_solution - Exam 1 CPE 229/269 j gh Name §ol EH...

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

View Full Document Right Arrow Icon
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Exam 1 CPE 229/269 j gh 2/2/07 Name §ol EH 0V\S (50 min.) open text CPE 229/269 Reader (lOOpts) I have neither been given nor have received during this exam unauthorized assistance per the university policy on cheating. Signature l.(10) State the five axioms and their duals that define the Boolean algebra (21). 10“ X:O "5‘x*¢ ’6‘ wet éxwo 20‘ \Sr XTOJ’Hov‘izl 2(1‘ we x:|)mg;o 3Q. 0‘70 =0 31:“ cL+L=1 4a 1-4:=’l. 45, O+O=o 5a. 0431030 31,. 1+0 = o+1=1 2.(lO) Given the following truth table for the Boolean function f and its variables a, b, and c, showing all steps in your solution, implement the logic function f as a function of the variables a, b, and c with a logic diagram using NOT, AND, and OR gates. 4 Ma \oyc +4 ‘ 3. Given the template VHDL code, complete the code for the architecture declaration using the dataflow style indicated for the logic equation f = (lx - y - z) + (x - y - lz) where lb => not b. Don't forget to relate the function variables to the VHDL variables. : ' Mich "l‘lxe/e we 0% Sow-1mg "Wm Qer bell ow), \a’l‘ m2); : y 0‘0) 2 3 a to) = 3 library IEEE; use IEEE.STD_LOGIC_1 164.2111; entity prob3 is port ( W a: in std_logic_vector (2 downto O); f: out std_logic ); end prob3; {Xi‘an}: 71%va : 5(a) «(ma—('01. awed}: 'xl‘tfr am» “03410) a.(10) simple signal assignment (Boolean equations) architecture dataflow of prob3 is begin Q— < =<Lwo+ on») w an) M 6(0)) W (“23W ‘3“) “’9 (Ml mo“); end dataflow; b.(10) conditional signal assignment (when-else statement) architecture dataflow of prob3 is begin H M \\ \\ $y<—,\i‘ wW<(Q:\\O\\)o\/~ (Ck— \\O )dez end dataflow; c.(10) selected signal assignment (with—select-When statement) architecture dataflow of prob3 is begin @\ MM —s an {12mm ,5 aka) ~3‘ end dataflow; 1 4. (25) Given the template VHDL code, implement the synchronous finite state machine defined by the state diagram given below using the two process PS/N S method. Define any signals that are needed to complete your implementation. library IEEE; use IEEE.STD_LOGIC_1 164.all; entity prob4 is port ( x, clk: in std_logic; f: out std_logic ); end prob4; -' - Simdci \oe logl/axltowagslmporbo’vci‘ “gar ATooiS architecture behavior‘of prob4 is ‘irql’e siméq‘ix‘ee is (32m) 0M2) 41.13 ) alt/or); 3 \flMQ 98) M ‘, gi‘oéra 313%} b \ QR PRICqu fin- pmsowd‘sctctie in “W we _— 31m - \mc: Wows: ( cm hafi\V\ )6 Hr VLSKKs\ 249% L¢\t\ Aha/u ?%<: W8) awaits?) gmcl amass sumovmfi LOAL pm ‘. 9W5“ (is;le Av \04‘)”; <:, \3 __ expel lovotc/htg4 rim) \W‘Az~'fi“3£ ngvpvv CASIQ \\ \ what rgym) :3 ‘4 49V} l; X: L Arlen/W n3 ‘4: owe) 4W2 VxS <= 4'qu Micki} 4- MO‘ LOW Om T) 4429(3‘ \ST 34: \\\Jr\”04\, V\$ ~ J th m3 4': 3‘13/0‘J wow; 1 \\ :m 449 h: <:%¢voj‘ “Mei-uoqg4zo>ssr7x \ i [:\ l i “54: (lid; ) ? A: O )— — has? Mildred \OQCOJAS! 05>: QM.M9\1VY\ZVG.}QQR 1 W toe/Md VS7-BYM 1) 'éké‘ Case; g emu (Drones: cowlo - pvuc‘J end behavior;~ 5. The VHDL code for a clocked synchronous finite state machine is given below. Showing all steps and all definitions required in your solution, determine the: a.(15) draw a logic diagram which implements the state machine with D flip-flops. library IEEE; use IEEE.STD_LOGIC_1 164.2111; entity probS is port ( X, clk: in std__logic; z: out std_logic ); end probS; architecture dataflow of prob5 is signal d: std_logic; signal q: std_logic; begin d <= not (q and x); 2 <= (not q) or x; q <= (1 when rising_edge(clk) else q; end dataflow; b.(10) state diagram indicating whether it is a Mealy or Moore architecture a t c): '1 (Q 7.- = "5‘ +7: maaixi WV‘X’L S q 50 0 St 1 s” 3c J ( Ma ass: MMW+) “Maren/Mm ism/wens) s l Mealy/mauve 2 2 skin 4 ...
View Full Document

This note was uploaded on 03/05/2008 for the course EE 228 taught by Professor Harris during the Spring '08 term at Cal Poly.

Page1 / 4

exam1_solution - Exam 1 CPE 229/269 j gh Name §ol EH...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online