DC-free code having limited error propagation and limited complexity
View Patent ↗A method and apparatus are provided for encoding and decoding digital information. A sequence of data words is received, wherein each data word has a running digital sum (RDS). The sequence of data words is encoded into a sequence of corresponding code words, which has a current RDS. For each data word a binary symbol is added to the data word and the data word is selectively complemented as a function of the RDS of the data word and the current RDS of the sequence of code words to form the corresponding code word.
1. A method of encoding digital information in a system, the method comprising:
(a) receiving a sequence of data words, wherein each data word has a running digital sum (RDS); and
(b) encoding the sequence of data words into a sequence of corresponding code words, which has a current RDS, wherein encoding comprises for each data word, adding a binary symbol to the data word and forming the corresponding code word by:
(b)(1) mapping the data word unchanged into the corresponding code word if a sign of the RDS of the data word is different than a sign of the current RDS of the sequence of code words; and
(b)(2) complementing the data word if the sign of the RDS of the data word is the same as the sign of the current RDS of the sequence of code words.
2. The method of claim 1 wherein (b)(2) comprises complementing the binary symbol with the data word.
3. The method of claim 2 wherein (b)(1) comprises mapping the data word and the binary symbol unchanged into the corresponding code word if the sign of the RDS of the data word is different than the sign of the current RDS of the sequence of code words.
4. The method of claim 1 and further comprising:
(c) updating the current RDS of the sequence of code words after forming the corresponding code word for one of the data words and before encoding the next data word in the sequence of data words; and
(d) concatenating the corresponding code word to the sequence of code words.
5. The method of claim 1 wherein adding a binary symbol to the data word comprises adding a binary “0” to the data word in (b)(1) and adding a binary “1” to the data word in (b)(2).
6. The method of claim 1 wherein:
(a) comprises parsing the sequence of data words into n-bit data words; and
(b) comprises encoding the sequence of n-bit data words into a sequence of corresponding (n+1) -bit code words such that the current R/DS remains less than or equal to n+1.
7. An encoder for encoding digital information, the encoder comprising:
an input for receiving a sequence of data words, wherein each data word has a running digital sum (RDS); and
encoding means for encoding the sequence of data words into a sequence of successive code words, which has a current RDS, wherein for each of the data words, the encoding means adds a binary symbol to the data word and forms the corresponding code word by mapping the data word unchanged into the corresponding code word if a sign of the RDS of the data word is different than a sign of the current RDS of the sequence of code words, and by complementing the data word if the sign of the RDS of the data word is the same as the sign of the current RDS of the sequence of code words.
8. The encoder of claim 7 wherein the encoding means further comprises:
means for updating the current RDS of the sequence of code words after forming the corresponding code word for one of the data words and before encoding the next data word in the sequence of data words; and
means for concatenating the corresponding code word to the sequence of code words.
9. The encoder of claim 7 wherein the binary symbol added to the data word by the encoding means has a binary “0” state if the sign of the RDS of the data word is different than the sign of the current RDS of the sequence of code words and has a binary “1” state if the sign of the RDS of the data word is the same as the sign of the current RDS of the sequence of code words.
10. The encoder of claim 7 wherein the encoding means selectively complements the binary symbol with the data word as a function of the RDS of the data word and the current RDS of the sequence of code words, to form the corresponding code word.
11. The encoder of claim 7 wherein the encoding means parses the sequence of data words into n-bit data words and encodes the sequence of n-bit data words into a sequence of corresponding (n+1)-bit code words such that the current RDS remains less than or equal to n+1.