Repetition Decoder
Repetition decoding is usually done using Majority logic detection. To determine the value of a particular bit, we look at the received copies of the bit in the stream and choose the value that occurs more frequently.
For example, suppose we have a repetition code and we are decoding the signal . The decoded message is, as we have most occurrence of 1's (two to one), 0's (two to one), and 1's (three to zero) in the first, second, and third code sequences, respectively.
This approach discards any 'soft' probability information obtained when decoding each received bit, and the performance of the code can be improved by retaining this probability information and using it to derive a joint probability across all n bits of the actual information bit value.
Read more about this topic: Repetition Code
Famous quotes containing the word repetition:
“When sins are dear to us we are too prone to slide into them again. The act of repentance itself is often sweetened with the thought that it clears our account for a repetition of the same sin.”
—Thomas Jefferson (1743–1826)