AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |
Back to Blog
Karnaugh map maker4/7/2024 ![]() Which simplifies the C++ code to just this: Using Boolean algebra, you can do the following simplifications: It would be real easy to write code like that especially if you were adding onto an existing condition, and you might not even notice that it isn’t the minimal Boolean expression to make the desired output. With multiplication being AND, addition being OR, and a line over a letter being a NOT, the above could be written in C++ code like this: For instance the below is a sum of products expression: The sum of products representation just means that you OR (sum) multiple terms that are ANDed (product) together. It’s fairly minimal in that it’s the minimal “sum of products” representation, but that might not be the minimal representation of the logic circuit. Karnaugh maps are a formalized way of turning a truth table into a fairly minimal logical expression.
0 Comments
Read More
Leave a Reply. |