Skip to content

thiruking/BOOLEAN_FUNCTION_MINIMIZATION

 
 

Repository files navigation

BOOLEAN_FUNCTION_MINIMIZATION

AIM:

To implement the given logic function verify its operation in Quartus using Verilog programming.

F1= A’B’C’D’+AC’D’+B’CD’+A’BCD+BC’D

F2=xy’z+x’y’z+w’xy+wx’y+wxy

Equipment Required:

Hardware – PCs, Cyclone II , USB flasher

Software – Quartus prime

Theory

Logic Diagram

Procedure

  1. Type the program in Quartus software.

  2. Compile and run the program.

  3. Generate the RTL schematic and save the logic diagram.

  4. Create nodes for inputs and outputs to generate the timing diagram.

  5. For different input combinations generate the timing diagram.

Program:

module experiment2(a,b,c,d,f1,w,x,y,z,f2);
input a,b,c,d,w,x,y,z;
output f1,f2;
assign f1=((~b&~c)|(~a&b&d)|(a&b&~c));
assign f2=((~y&z)|(x&y)|(w&y));
endmodule

/* Program to implement the given logic function and to verify its operations in quartus using Verilog programming.

Developed by: RegisterNumber:24900491

TRUTH TABLE image image

RTL realization Screenshot 2024-11-05 165148

Output:

RTL Screenshot 2024-11-19 142646

Timing Diagram

Result:

Thus the given logic functions are implemented using and their operations are verified using Verilog programming.

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages

  • VHDL 51.8%
  • Verilog 19.1%
  • Stata 13.6%
  • HTML 13.1%
  • Standard ML 2.4%