toddster900
Member
Hi All
I have x number of bits representing an active state on x number of valves and I want to be able to detect when more than one valve is active.
I would like to be able to do this in ladder logic and despite thinking it would be quite simple have not managed to find a simple and clean way of doing this.
I can obviously use a long list of two bit branches to cover all the combinations of two active valves but I fell I am missing a far simpler solution.
If I move the active bits into a word can anyone think of a way to easily detect if more than bit in that word is on? Any other ideas also very welcome.
Thanks
I have x number of bits representing an active state on x number of valves and I want to be able to detect when more than one valve is active.
I would like to be able to do this in ladder logic and despite thinking it would be quite simple have not managed to find a simple and clean way of doing this.
I can obviously use a long list of two bit branches to cover all the combinations of two active valves but I fell I am missing a far simpler solution.
If I move the active bits into a word can anyone think of a way to easily detect if more than bit in that word is on? Any other ideas also very welcome.
Thanks