Appeal No. 2000-0471
Application No. 08/871,442
carry out 3/5 majority voting on each bit position of a data
word. It does this by maintaining a running count of the
number of 1's in each bit position of the incoming data words.
Once a count of three has been reached for any bit position,
there is no need to continue counting for that bit position as
the 3/5 majority voting result has essentially been produced.
Since a count of three can be maintained and stored using a
two-bit counter, only two bits of memory are required for each
bit of the incoming data word.
Representative independent claim 37 is reproduced as
follows:
37. A method for performing 3 out of 5 majority voting
in a digital communications system, wherein a data word
comprising a plurality of digital bits is transmitted five
times to form a plurality of five bit repeats, one for each
bit of the data word, and each of the plurality of five bit
repeats is assigned a respective bit value based on 3 out of 5
majority voting, the method comprising the steps of:
counting up to a maximum number of three, the number of
ones present in each of the plurality of five bit repeats;
storing the number of counted ones separately for each
five bit repeat up to a maximum number of three for each five
bit repeat in a memory means limited in size to storing a
maximum number of three; and
performing 3 out of 5 majority voting on the stored
number of counted ones for each of the plurality of five bit
repeats after all five bits of each five bit repeat have been
-2-
Page: Previous 1 2 3 4 5 6 7 8 Next
Last modified: November 3, 2007