Method of and system for the efficient encoding of data

• US 5,790,057 A
• Filed: 08/12/1996
• Issued: 08/04/1998
• Est. Priority Date: 08/12/1996
• Status: Expired due to Fees

• Current Assignee: LANart Corp. (Pineapple Energy LLC)
• Original Assignee: LANart Corp. (Pineapple Energy LLC)
• Inventors: Tabor, Jeffrey F., Linde, Yoseph L.
• Primary Examiner(s): Young, Brian K.
• Application Number:
  US08/695,885
• Time in Patent Office: 722 Days
• Field of Search: 341/68, 341/51, 341/59, 341/57, 341/70, 341/71, 341/87
• US Class Current: 341/68
• CPC Class Codes: H03M 5/16 the pulses having three levels
• CPC Class Codes: H04L 1/0057 Block codes H04L1/0061, H04L1/0064 take precedence

Abstract

The invention relates to the efficient coding of packetized binary (NRZ) data, for example Ethernet packets, over a binary channel. Since Ethernet packetized data has three states (0, 1, and Idle), the theoretical bandwidth required for transmission, assuming completely random packets of arbitrary length and arbitrary interpacket idle periods, i.e. gaps, is 1.585 the data rate. The invention uses the information that both packets and gaps have predetermined minimum lengths constructs more efficient codes. In particular, a coding scheme is shown that provides in two states signal requiring a bandwidth of only 1.25 the three state signal data rate.

Claims

1. A system for transforming three state data to two state data, said three state data containing a succession of sequences of idle symbols and sequences of binary data symbols, where the said succession of idle signals has a minimum length of N_I symbols and said succession of data signals has a minimum length of N_D symbols, and said two state data containing a succession of binary data symbols, said system comprising:

A. means for separating said three state data into input blocks of N successive symbols from said three state data, where N is less than both N_I +2 and N_D +2;

B. means for converting each of said input blocks to an encoded block of N+1 binary values each of said encoded block including;

i. when the last symbol in the next previous input block is an idle symbol;

a. n symbols having a first binary value, where n equals the number of idle symbols in said input block,

b. one separator symbol having a second binary value, and

c. N-n symbols, said N-n symbols corresponding in accordance with a first predetermined relationship to the binary values of the N-n data symbols in said input block, and

ii. when the last symbol in the previous input block is a data symbol;

a. n symbols having said first binary value, where n equals the number of idle symbols in said input block,

b. one separator symbol having said second binary value, and

c. N-n symbols, said N-n symbols corresponding in accordance with a second predetermined relationship to the binary values of the N-n data symbols in said input block.

2. The system according to claim 1 wherein in accordance with said first and said second predetermined relationships, each of said N-n symbols corresponds directly to a correspondingly positioned data symbol in said input block.

3. The system according to claim 1 wherein in accordance with said first predetermined relationship, each of said N-n symbols corresponds directly to a corresponding sequentially positioned data symbol in said input block, and wherein in accordance with said second predetermined relationship, each of said N-n symbols corresponds to an inverse sequentially positioned data symbol in said input block.

4. The system according to claim 1 wherein in accordance with said first predetermined relationship, each of said N-n symbols corresponds directly to an inverse, sequentially positioned data symbol in said input block, and

wherein in accordance with said second predetermined relationship, each of said N-n symbols corresponds to a corresponding sequentially positioned data symbol in said input block.

5. The system according to claim 1 wherein said data consists of a sequence of at least x contiguous idle symbols and a sequence of at least y contiguous data symbols and wherein said block of N symbols contains fewer than x+2 symbols and fewer than y+2 symbols.

6. The system according to claim 5 wherein said block of N symbols contains the smaller of x+1 symbols and y+1 symbols.

7. The system according to claim 5 wherein said block of N symbols contains the smaller of x/2 symbols and y+2 symbols.

8. The system according to claim 1 wherein said data consists of a sequence of at least 48 contiguous idle symbols and a sequence of at least 64 contiguous data symbols and wherein said block of N symbols contains four symbols.

9. A system for transforming a succession of N+1 symbol blocks of two state data to a corresponding succession of N symbol blocks of three state data, wherein each block of two state data includes:

A. n symbols having a first binary value, where n equals the number of idle symbols to be in said corresponding block of two state data,

B. a separator symbol having a second binary value, and

C. N-n symbols corresponding to binary values of data symbols to be in said corresponding block of two state data, and wherein each block of said three state data contains a sequence of i idle symbols and a sequence of j binary value data symbols, where 0≦

i≦

N, 0≦

j≦

N and i+j=N,

said system comprising;

means operative in succession for each block of said two state data to generate an output signal in the form of an output three state block having n idle symbols and N-n binary data symbols, whereby said succession of three state output blocks form said three state data, having successions of idle symbols having minimum length less than N_I and having successions of data symbols having minimum length less than N_D, wherein N_I and N_D are both less than N.

10. A system for encoding nonreturn to zero (NRZ) data containing a sequence of idle symbols and data symbols, comprising:

A. means for separating said data into blocks of N symbols;

B. means for classifying each of said blocks as either an idle block or data block, an idle block comprising a sequence beginning with at least one idle symbol and including a sequence of up to N-1 data symbols, a data block comprising a sequence beginning with at least one data symbol and including a sequence of up to N-1 idle symbols,

C. means for converting each idle block to an encoded idle block of N+1 binary values, said encoded idle block including;

i. a sequence of x binary idle symbol values, where x corresponds to the number of idle symbols in said idle block,

ii. a separator symbol, and

iii. a sequence of binary data values, each binary data value corresponding in the same order to an equivalent binary value for each of said sequential data symbols;

D. means for converting each data block to an encoded data block of N+1 binary values, said encoded data block including;

i. a sequence of x binary idle symbol values, where x corresponds to the number of idle symbols in said data block,

ii. a separator symbol, and

iii. a sequence of binary data values, each binary data value corresponding in reverse order to an equivalent binary value for each of said sequential data symbol.

11. A system according to claim 10 wherein said data consists of a sequence of at least x contiguous idle symbols and a sequence of at least y contiguous data symbols and wherein said block of N symbols contains fewer than x+2 symbols and fewer than y+2 symbols.

12. A system according to claim 11 wherein said block of N symbols contains the smaller of x+1 symbols and y+1 symbols.

13. A system according to claim 11 wherein said block of N symbols contains the smaller of x/2 symbols and y+1 symbols.

14. A system according to claim 10 wherein said data consists of a sequence of at least 48 contiguous idle symbols and a sequence of at least 64 contiguous data symbols and wherein said block of n symbols contains four symbols.

15. A system for decoding binary data containing a sequence of idle symbols values, a separator symbol and binary data values, comprising:

A. means for separating for said data into blocks of N binary data units;

B. means for converting each of said blocks to an decoded block of N-1 three state data symbols, said decoded block including

i. a sequence of x idle symbols, where x corresponds to the number of idle symbol values in said block, and

ii. a sequence of data symbols, each data symbol corresponding to an equivalent value for each of said sequential binary data values.

16. A method of encoding nonreturn to zero (NRZ)/(3 state) data containing a sequence of idle symbols and data symbols, comprising the steps of:

A. separating said data into blocks of N symbols;

B. converting each of said blocks to an encoded block of N+1 binary values, said encoded block including

i. a sequence of x binary idle symbol values, where x corresponds to the quantity of idle symbols in said block,

ii. a separator symbol, and

iii. a sequence of binary data values, each binary data value corresponding to an equivalent binary value for each of said sequential data symbols.

17. A method according to claim 16 wherein said data consists of a sequence of at least x contiguous idle symbols and a sequence of at least y contiguous data symbols and wherein said block of n symbols contains fewer than x+2 idle symbols and fewer than y+2 data symbols.

18. A method according to claim 17 wherein said block of N symbols contains the smaller of x+1 symbols and y+1 symbols.

19. A method according to claim 17 wherein said block of N symbols contains the smaller of x/2 symbols and y+1 symbols.

20. A method according to claim 16 wherein said data consists of a sequence of at least 48 contiguous idle symbols and a sequence of at least 64 contiguous data symbols and wherein said block of n symbols contains four symbols.

21. A method according to claim 16, wherein

each of said binary idle symbol values is the binary value zero (0).

22. A method according to claim 16 wherein

said separator symbol is the binary value one (1).

23. A method according to claim 16 wherein

each of said binary idle symbol values is the binary value one (1).

24. A method according to claim 16 wherein

said separator symbol is the binary value zero (0).