Legal claims defining the scope of protection, as filed with the USPTO.
1. A communication node comprising: an encoder and a transmitter; the encoder is configured to encode a first header of a first frame utilizing a first line-code having a binary code word length N 1 and a minimal Hamming distance D 1 ; the encoder is further configured to encode a first payload of the first frame utilizing the first line-code; wherein the first line-code is selected based on a first data type of a first data comprised in the first payload; the encoder is further configured to encode a second header of a second frame utilizing the first line-code; the encoder is further configured to encode a second payload of the second frame utilizing a second line-code having a binary code-word length N 2 and a minimal Hamming distance D 2 lower than D 1 ; wherein the second line-code is selected based on a second data type of a second data comprised in the second payload; the encoder is further configured to maintain, from beginning of the first frame to end of the second frame, absolute value of running disparity lower than or equal to K, wherein K is lower than both N 1 /2 and N 2 /2; and the transmitter is configured to transmit the first and second frames over a communication channel characterized by first and second channel conditions, respectively; wherein differences between the first and second channel conditions are not enough for selecting different line-codes for encoding the first and second payloads.
2. The communication node 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.
3. The communication node of claim 1 , wherein K is lower than both N 1 /4 and N 2 /4.
4. The communication node of claim 1 , wherein K is lower than 3.
5. The communication node of claim 1 , wherein N 2 is equal to N 1 , and a first output set consisting of all code words produced by 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.
6. The communication node of claim 1 , wherein a first output set consisting of all code words produced by the first line-code is a subset of a second output set consisting of all code words produced by the second line-code.
7. The communication node of claim 1 , wherein the first header comprises an indication that the first payload is encoded utilizing the first line-code, and the second header comprises an indication that the second payload is encoded utilizing the second line-code.
8. The communication node of claim 1 , wherein the encoder is further configured to produce an idle sequence comprising code words of length N_idle which is transmitted between the first and second frames.
9. The communication node of claim 8 , wherein N_idle equals N 1 .
10. The communication node of claim 1 , wherein the encoder is further configured to encode a third data and a fourth data comprised in a third payload of a third frame utilizing the second line-code and a third line-code, and to encode a third header of the third frame utilizing the first line-code; wherein the second and third line-codes are selected based on a third and fourth data types of the third data and the fourth data, respectively; and the third line-code has a binary code-word length equal to N 3 and a minimal Hamming distance D 3 different from D 2 .
11. The communication node of claim 10 , wherein D 3 is lower than D 2 .
12. The communication node of claim 10 , wherein the third line-code coincides with the first line-code.
13. A method for encoding frames utilizing at least two line-codes having different minimal Hamming distances, 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 a first header of the first frame utilizing a first line-code, wherein the first line-code has a binary code word length N 1 and a minimal Hamming distance D 1 ; selecting the first line-code for encoding a first payload of the first frame based on a first data type of a first data comprised in the first payload; encoding the first payload of the first frame utilizing the first line-code; encoding a second header of the second frame utilizing the first line-code; selecting a second line-code for encoding a second payload of the second frame based on a second data type of a second data comprised in the second payload, wherein the second line-code has a binary code word length N 2 and a minimal Hamming distance D 2 lower than D 1 ; encoding the second payload of the second frame utilizing the second line-code; and transmitting the first and second frames over a communication channel characterized by first and second channel conditions, respectively; wherein differences between the first and second channel conditions are not enough for selecting the second line-code instead of the first line-code for encoding the second payload, and K is lower than both N 1 /2 and N 2 /2.
14. The method of claim 13 , wherein K is lower than both N 1 /4 and N 2 /4.
15. The method of claim 13 , wherein K is lower than 3.
16. The method of claim 13 , wherein N 2 is equal to N 1 .
17. The method of claim 13 , wherein N 2 is equal to N 1 , and a first output set consisting of all code words produced by 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.
18. The method of claim 13 , wherein a first output set consisting of all code words produced by the first line-code is a subset of a second output set consisting of all code words produced by the second line-code.
19. The method of claim 13 , wherein the first header comprises an indication that the first payload is encoded utilizing the first line-code, the second header comprises an indication that the second payload is encoded utilizing the second line-code.
20. The method of claim 13 , further comprising producing an idle sequence comprising code words of length N_idle and residing between the first frame and second frames.
21. The method of claim 20 , wherein N_idle equals N 1 .
22. The method of claim 13 , further comprising encoding a third data and a fourth data comprised in a third payload of a third frame utilizing the second line-code and a third line-code, and encoding a third header of the third frame utilizing the first line-code; wherein the second and third line-codes are selected based on a third and fourth data types of the third data and the fourth data, respectively; and the third line-code has a binary code-word length equal to N 3 and a minimal Hamming distance D 3 different from D 2 .
23. The method of claim 22 , wherein D 3 is lower than D 2 .
24. The method of claim 22 , wherein the third line-code coincides with the first line-code.
Unknown
February 23, 2016
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.