Claims
- 1. A method of encoding a serial bit stream of input data in groups of N bit data words of any data content to output codewords of 2N bits, comprising:determining remaining bits in the codewords such that, seen statistically, the codewords will include substantially as many zeros as ones, so that each codeword is unique for each word, and so that at least one of the codewords will remain unique despite any bit stream shifting processes.
- 2. The method according to claim 1, wherein the method further comprises the step of:defining N of the 2N bits in all of the codewords of the serial bit stream as the N bits input data, unchanged or inverted.
- 3. The method according to claim 1, wherein all of the codewords will remain unique despite any bit stream shifting processes.
- 4. A signal transmitting a digital bit stream encoding a series of data words of any data content as an encoded bit stream of codewords comprising:plural codewords, all codewords including a plurality of bits including, plural data word bits, each bit being obtained directly or inverted from said data words, and plural codewords bits, each said codeword bit being developed in a simple logic operation from one or more of said plural data word bits; said plural data word bits and said plural codeword bits being assembled to form plural codewords, each data word being uniquely defined by a codeword, said codewords having approximately as many logical zeros as ones and wherein at least one of said codewords is unique after any bit steam shifting.
- 5. The signal according to claim 4, wherein all of said codewords are unique despite any bit stream shifting processes.
- 6. A method of high speed coding of any data stream input as a series of data words of any data content into a stream of codewords, said method comprising:encoding said series of data words into plural codewords, all of said code words being formed by, receiving said data words in parallel as a series of data word bits, logically generating a plurality of code word bits by applying simple logical operations to said data word bits, and assembling said data word bits and code word bits to form codewords, said step of assembling said data word bits and said code word bits producing code words having fault tolerance, said code words having approximately as many logical zeros as ones and wherein at least one of said code words is unique after any bit stream shifting.
- 7. The method according to claim 6 wherein all of said codewords are unique despite any bit stream shifting processes.
Priority Claims (1)
Number |
Date |
Country |
Kind |
9700125 |
Jan 1997 |
SE |
|
Parent Case Info
This application is a divisional of application Ser. No. 09/008,608, filed on Jan. 16, 1998 now U.S. Pat. No. 6,232,895, the entire contents of which are hereby incorporated by reference.
US Referenced Citations (11)
Foreign Referenced Citations (1)
Number |
Date |
Country |
0313341 |
Apr 1989 |
EP |
Non-Patent Literature Citations (1)
Entry |
S. Benedetto, et al.; “Digital Transmission Theory”; 1987; Prentice-Hall Inc.; pp. 408-410. |