Download presentation
Presentation is loading. Please wait.
1
CS 61C Discussion 10 (1) Jaein Jeong Fall 2002 2-input MUX °Out = in0 * select’ + in1 * select in0in1selectout 0000 0010 0100 0111 1001 1010 1101 1111 Structural description module mux (in0,in1,select,out); input in0, in1, select; output out; wire s0, w0, w1; not (s0, select); and (w0, s0, in0), (w1, select, in1); or (out, w0, w1); endmodule // mux w1 w0 select in out s0 Behavioral descriptions module mux (in0,in1,select,out); input in0, in1, select; output out; reg out; if (select) out = in1; else out = in0; endmodule // mux
2
CS 61C Discussion 10 (2) Jaein Jeong Fall 2002 4-input MUX in0 in2 in1 in3 select0 select1 w0 w1 out Structural description module mux4 (in,select,out); endmodule // mux Behavioral descriptions module mux4 (in,select,out); endmodule // mux
3
CS 61C Discussion 10 (3) Jaein Jeong Fall 2002 Full Adder °S = A xor B xor Cin °Cout = AB + ACin + BCin Module FA(A, B, Cin, S, Cout); input A, B, Cin; output S, Cout; wire w0, w1, w2; xor3(S, A, B, Cin); and (w0, A, B), (w1, A, Cin), (w2, B, Cin); or3(Cout, w0, w1, w2); endmodule FA CinA B S Cout
4
CS 61C Discussion 10 (4) Jaein Jeong Fall 2002 4-bit ripple carry adder Write a structural description FA 0 A0B0 S0S1S2S3 w0 A1B1w1A2B2 w2 A3B3 C module add4 (A,B,S,C); endmodule // add4
5
CS 61C Discussion 10 (5) Jaein Jeong Fall 2002 1-bit register module DFF (CLK,Q,D,RST); input D; input CLK, RST; output Q; reg Q; always @ (posedge CLK) if (RST) Q = 0; else Q = D; endmodule // DFF module mux (in0,in1,select,out); input in0, in1, select; output out; reg out; if (select) out = in1; else out = in0; endmodule // mux Write a structural description. load w0 in w1 DFF RST CLK out module reg1 (in,load,CLK, RST, out); endmodule // dffwe reg1
6
CS 61C Discussion 10 (6) Jaein Jeong Fall 2002 4-bit shift register module shift4 (in,load,CLK,RST,out); input in, load, CLK, RST; output out; … endmodule // shift4 Write a structural description. reg1 inout load CLK load CLK load CLK load CLK RST w0
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.