Method and system for encoding for 100G-KR networking
View Patent ↗Various examples are provided for encoding for 100G-KR networking. In one example, among others, a coding method uses certain forward error correcting codes based on a given transcoding method and delivers the codes according to burst interleaving. In another example, a coding method includes receiving source data from a plurality of physical lanes, combining data from the physical lanes to generate a block, transcoding the block and encoding a data stream including the transcoded block.
1. A coding method, comprising: receiving source data corresponding to plural 66-bit blocks from each of a plurality of physical lanes; combining 2×66-bit blocks from each of the physical lanes to generate a 528-bit block; transcoding the 528-bit block to a 514-bit block using 512B/514B transcoding; and encoding by an encoder a data stream consisting of a plurality of the 514-bit blocks, wherein the encoding comprises: receiving A symbols of the plurality of the 514-bit blocks for a first B cycles, where A and B are non-zero integer values; accessing two or more symbols at a given cycle for each forward error correction (FEC) frame; and providing by the encoder C symbols per cycle, where C is equal to A.
2. The method of claim 1 , wherein A is equal to 16 and B is equal to 32.
3. The method of claim 2 , wherein the accessing comprises accessing two symbols at a last cycle for each frame, and the providing comprises providing over each physical lane four (4) symbols per cycle for a total of thirty-three cycles to transmit a single FEC frame.
4. The method of claim 3 , wherein the encoding is based on Reed-Solomon (RS) codes, RS (N, K, t), wherein N is a total number of symbols of coded data, K is a total number of symbols of source data, and t is an error correcting capacity in units of symbols, wherein N is equal to 528, K is equal to 514, and t is equal to 7, RS (N, K, t) defined over a Galois field of 2^10.
5. The method of claim 2 , wherein the accessing comprising accessing two symbols at a thirty-third cycle for each frame, no data is accessed at a last cycle of each frame, and the providing comprises providing over each physical lane four (4) symbols per cycle for a total of thirty-four cycles to transmit a single FEC frame.
6. The method of claim 5 , wherein the encoding is based on Reed-Solomon (RS) codes, RS (N, K, t), wherein N is a total number of symbols of coded data, K is a total number of symbols of source data, and t is an error correcting capacity in units of symbols, wherein N is equal to 544, K is equal to 514, and t is equal to 15, RS (N, K, t) defined over a Galois field of 2^10.
7. The method of claim 1 , wherein A is equal to 32 and B is equal to 16.
8. The method of claim 7 , wherein the accessing comprises accessing at a last cycle for each frame, and the providing comprises providing over each physical lane eight (8) symbols per cycle for a total of seventeen cycles to transmit a single FEC frame.
9. The method of claim 8 , wherein the encoding is based on Reed-Solomon (RS) codes, RS (N, K, t), wherein N is a total number of symbols of coded data, K is a total number of symbols of source data, and t is an error correcting capacity in units of symbols, wherein N is equal to 544, K is equal to 514, and t is equal to 15, RS (N, K, t) defined over a Galois field of 2^10.
10. The method of claim 1 , wherein A is equal to 16 and B is equal to 32.
11. The method of claim 10 , wherein the accessing consists of accessing at a thirty-third cycle for each frame, and the providing comprises providing over each physical lane four (4) symbols per cycle for a total of 32 cycles and providing over each physical lane two (2) symbols for the thirty-third cycle, to transmit a single FEC frame.
12. The method of claim 11 , wherein the encoding is based on Reed-Solomon (RS) codes, RS (N, K, t), wherein N is a total number of symbols of coded data, K is a total number of symbols of source data, and t is an error correcting capacity in units of symbols, wherein N is equal to 536, K is equal to 514, and t is equal to 11, RS (N, K, t) defined over a Galois field of 2^10.
13. The method of claim 1 , wherein A is equal to 24 and B is equal to 21.
14. The method of claim 13 , wherein the accessing comprises accessing ten symbols at a last cycle for each frame, and the providing comprises providing over each physical lane six (6) symbols per cycle for a total of twenty-two cycles to transmit a single FEC frame.
15. The method of claim 14 , wherein the encoding is based on Reed-Solomon (RS) codes, RS (N, K, t), wherein N is a total number of symbols of coded data, K is a total number of symbols of source data, and t is an error correcting capacity in units of symbols, wherein N is equal to 528, K is equal to 514, and t is equal to 7, RS (N, K, t) defined over a Galois field of 2^10.
16. The method of claim 1 , further comprising burst interleaving the encoded symbols, the burst interleaving comprising single symbol based interleaving or multiple symbol based interleaving.