![]() ![]() ![]() ![]() As the truth tables below show, the AND gate needs all inputs (A and B) to be true before the output becomes true, whereas the OR gate needs just one input (A or B) to be true to make the output true. The two logic gates that you will see represented most often in Ladder Logic are the AND and OR gates. Instead, we’ll just look at a few logic gates and how they work. Now, this blog is not intended to be a Digital Systems class so put away your Karnaugh maps, you won’t need them. And to do that, we need to first understand Boolean math and logic gates. So now that we have a understanding of what Ladder Logic is, we can dig a little deeper into how ladder instructions work. In Understanding Ladder Logic we touched on the origins of Ladder Logic, its structure and execution.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |