Legal claims defining the scope of protection, as filed with the USPTO.
1. A communication system comprising: a first node configured to communicate with a second node; the first node comprises an encoder and a transmitter; the encoder is configured to encode a first frame, an idle sequence including X code words, and a second frame; the encoder is further configured to determine X minus M code words of the idle sequence to be equal to X minus M code words of a basic idle sequence; wherein the basic idle sequence is obtained utilizing a first line-code having a binary code word length N_idle; the encoder is further configured to determine remaining M code words of the idle sequence to be alternative code words, wherein each alternative code word is equal to at least one code word of the basic idle sequence; the encoder is further configured to maintain over the idle sequence absolute value of running disparity lower than or equal to K, wherein K is lower than N_idle/2; the transmitter is configured to transmit the first frame, idle sequence, and second frame; the second node is characterized by not being able to determine a starting point of the second frame based only on the idle sequence and the second frame; and the second node is further characterized by being able to determine the starting point of the second frame based on difference between the basic idle sequence and the idle sequence.
2. The communication system of claim 1 , wherein the basic idle sequence is obtained by encoding an output of a pseudorandom bit generator, and the pseudorandom bit generator starts at a predetermined state.
3. The communication system of claim 1 , wherein the encoder is further configured to encode a header of the second frame utilizing a second line-code; and a first output set consisting of all words of the first line-code and a second output set consisting of all code words produced by the second line-code are mutually exclusive to each other.
4. The communication system of claim 3 , wherein the encoder is further configured to encode a payload of the second frame utilizing a third line-code; and a third output set consisting of all code words produced by the third line-code and the first output set have at least one common code word.
5. The communication system of claim 1 , wherein the encoder is further configured to encode a payload of the second frame utilizing a third line-code; and each one of the code words of the idle sequence belongs to a third output set consisting of all code words produced by the third line-code.
6. The communication system of claim 1 , wherein the difference between the idle sequence and the basic idle sequence is measured using Hamming distance.
7. The communication system of claim 1 , wherein a Hamming distance between the idle sequence and the basic idle sequence is equal to or higher than D_idle, and the second communication node is able to determine the start of the second frame as long as a number of channel errors in the received idle sequence is lower than D_idle/2: wherein D idle represents the Hamming distance between the idle sequence and the basic idle sequence.
8. The communication system of claim 7 , wherein D_idle is equal to or higher than 3.
9. The communication system of claim 7 , wherein D_idle is higher than or equal to N_idle-2.
10. The communication system of claim 1 , wherein the M code words are located at M predetermined locations relative to end of the idle sequence.
11. The communication system of claim 1 , wherein the running disparity at a certain symbol is a difference between number of ones and number of zeroes encoded up to and including the certain symbol.
12. The communication system of claim 1 , wherein K is lower than 3.
13. A method for indicating an end of an idle sequence residing between first and second frames, while maintaining bounded running disparity, the method comprising: maintaining, from a beginning of a first frame to an end of a second frame, absolute value of running disparity lower than or equal to K, while: encoding the first frame; encoding a basic idle sequence utilizing a first line-code having a binary code word length N_idle, wherein K is lower than N_idle/2; producing an idle sequence by replacing M code words of the basic idle sequence with M alternative code words, wherein each one of the M alternative code words is equal to at least one code word of the basic idle sequence; encoding the second frame; transmitting the first frame, the idle sequence, and the second frame; and receiving the second frame by a second communication node; the second communication node is unable to determine a starting point of the second frame based only on the idle sequence and the second frame, but is able to determine the starting point of the second frame based on difference between the basic idle sequence and the idle sequence.
14. The method of claim 13 , further comprising producing the basic idle sequence by encoding an output of a pseudorandom bit generator.
15. The method of claim 14 , further comprising starting the pseudorandom bit generator at a predetermined state.
16. The method of claim 13 , further comprising encoding a payload of the first frame utilizing a third line-code; wherein each one of the code words of the idle sequence belongs to a third set consisting of all code words produced by the third line-code.
17. The method of claim 13 , wherein the difference between the idle sequence and the basic idle sequence is measured using Hamming distance.
18. The method of claim 13 , wherein a Hamming distance between the idle sequence and the basic idle sequence is equal to or higher than D_idle, and the second communication node is able to determine the start of the second frame as long as a number of channel errors in the received idle sequence is lower than D_idle/2; wherein D idle represents the Hamming distance between the idle sequence and the basic idle sequence.
19. The method of claim 18 , wherein D_idle is equal to or higher than 3.
20. The method of claim 18 , wherein D_idle is higher than or equal to N_idle-2.
21. The method of claim 13 , wherein the M alternative code words are located at M predetermined locations relative to the end of the idle sequence.
22. The method of claim 13 , wherein K is lower than 3.
Unknown
February 23, 2016
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.