After finding the un-simplified equation of the specific voting procedures for each congressional position, I created this truth table to show the different ways each position could vote and work together to fill the requirement of the equation.

The truth table shows each possible circuit and the outcome of the votes, and the number of rows is correspondent to 2 to the power of the number of variables. In the case of a tie the table shows that the result is the same as the president's vote.

If a truth table is completed for the logic equation, it is a fairly easy step to get a maxterm equation and simplify it with an entered variable K-map. Knowing how to use and read a K-map is a fundamental step in creating a digital circuit with minimum transistors and no redundancies.

For this project, I was tasked with creating a circuit that can take take input variables, (or in this case a yes or no vote), and decide what the majority vote is.

A Truth Table is a chart that lists all possible combinations of inputs, and the output of those combinations under a set of gates. Here is an example of a Truth Table from the Majority vote project. P

In this project, you will use only AND, OR & Inverter logic gates, frequently referred to as AOI logic, to design, simulate, and build a Majority Vote voting machine that meets these design specifications. To the right is a 4 input truth table. One input for each of the members voting.

In creating a design for a machine that does this, I first created a truth table, which is a table of values that analyzes all the possible inputs for votes and what their outcomes would be to understand which combinations of votes I would need to …

Using the following variable names and assignment conditions, create a truth table shown for your Majority Vote – Voting Machine. Using the truth table, write the un-simplified logic expression for the output function Decision. Be sure that your answer is in the Sum-of-Products form.

Be able to derive a logic equation from a truth table. Be able to describe logic functions using Verilog HDL and implement them on an FPGA. After you're done, you should: Understand and be able to use Boolean Algebra. Know how to create a K-Map from a truth table. Know how to create minimized logic equation using K-map.

Using the following variable names and assignment conditions, create a truth table shown for your Majority Vote – Voting Machine. P: President → 0=No / 1=Yes ; V: Vice President → 0=No / 1=Yes ; S: Secretary → 0=No / 1=Yes ; T: Treasurer → …