Chapter 9 
149 
Logic programming – Function blocks 
 
Truth tables for the Binary decoder function block 
The following applies for the truth table in this section: 
  “0” means logic Low. 
  “1” means logic High. 
Input A  Output 2 Output 1
0 0 1 
1 1 0 
 
Input B  Input A Output 4 Output 3 Output 2 Output 1 
0  0 0 0 0 1 
0  1 0 0 1 0 
1  0 0 1 0 0 
1  1 1 0 0 0 
 
Input C  Input B  Input A Output 8  Output 7 Output 6 Output 5 Output 4 Output 3  Output 2  Output 1
0  0  0 0 0 0 0 0 0 0 1 
0  0  1 0 0 0 0 0 0 1 0 
0  1  0 0 0 0 0 0 1 0 0 
0  1  1 0 0 0 0 1 0 0 0 
1  0  0 0 0 0 1 0 0 0 0 
1  0  1 0 0 1 0 0 0 0 0 
1  1  0 0 1 0 0 0 0 0 0 
1  1  1 1 0 0 0 0 0 0 0 
 
Table 54: 
Truth table for the Binary decoder with 3 inputs in One out of N mode 
 
Input A  Output 2 Output 1
0 0 1 
1 1 1 
 
Input B  Input A Output 4 Output 3 Output 2 Output 1 
0  0 0 0 0 1 
0  1 0 0 1 1 
1  0 0 1 1 1 
1  1 1 1 1 1 
 
Input C  Input B  Input A Output 8  Output 7 Output 6 Output 5 Output 4 Output 3  Output 2  Output 1
0  0  0 0 0 0 0 0 0 0 1 
0  0  1 0 0 0 0 0 0 1 1 
0  1  0 0 0 0 0 0 1 1 1 
0  1  1 0 0 0 0 1 1 1 1 
1  0  0 0 0 0 1 1 1 1 1 
1  0  1 0 0 1 1 1 1 1 1 
1  1  0 0 1 1 1 1 1 1 1 
1  1  1 1 1 1 1 1 1 1 1 
 
Table 57: 
Truth table for the Binary decoder with 3 inputs in Priority mode 
Table 52: 
Truth table for the Binary 
decoder with 1 input in One 
out of N mode 
Table 53: 
Truth table for the Binary 
decoder with 2 inputs in One 
out of N mode 
Table 55: 
Truth table for the Binary 
decoder with 1 input in 
Priority mode 
Table 56: 
Truth table for the Binary 
decoder with 2 inputs in 
Priority mode