Browse Prior Art Database

Truth Table Decode

IP.com Disclosure Number: IPCOM000044953D
Original Publication Date: 1983-Jan-01
Included in the Prior Art Database: 2005-Feb-06
Document File: 1 page(s) / 11K

Publishing Venue

IBM

Related People

Bergacs, J: AUTHOR [+3]

Abstract

In the operation of a four-station robot, it is desirable to know the readiness state of each station. Also, because of the way the language is written for the computer controlling the robot functions, it may be necessary to use as few information bits as possible so as not to exceed user's space. A two-bit truth table for four stations would look as follows: Sum of Rows STA1 0 -1 -1 STA2 0 0 0 STA3 -1 0 -1 STA4 -1 -1 -2.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 1

Truth Table Decode

In the operation of a four-station robot, it is desirable to know the readiness state of each station. Also, because of the way the language is written for the computer controlling the robot functions, it may be necessary to use as few information bits as possible so as not to exceed user's space. A two-bit truth table for four stations would look as follows: Sum of Rows

STA1 0 -1 -1

STA2 0 0 0

STA3 -1 0 -1

STA4 -1 -1 -2.

Obviously, the computer cannot differentiate between the sums of the status of Station 1 and Station 3. However, by using the language capability for multiplication, a new truth table can be formed as follows: Sum

STA1 0 (-1)x2=-2 -2

STA2 0 ( 0)x2=0 0

STA3 -1 ( 0)x2=0 -1

STA4 -1 (-1)x2=-2 -3.

The status of the stations can now be separated by the computer, and the necessary work performed.

1