The system receives three binary streams: A, B, and C. The system takes a look during each clock cycle at the last four bits of each stream (a(t), a(t-1), a(t-2), a(t-3)), (b(t), b(t-1), b(t-2), b(t-3)) and (c(t), c(t-1), c(t-2), c(t-3)). If each of the streams is unique according to the last four symbols, the system generates the string that is most similar to all strings when compared bitwise. If exactly two streams are identical, the system outputs the four bits of the unique stream. Finally, if all three streams are identical, the system outputs that string.
E.g. Given A=1011, B=1001, and C=0110 then the string "most similar to all strings when compared bitwise" is 1011, the most significant bit is 1 because A and B are both 1 and one is the majority among the tree strings, etc.