IP Library Granted Patent US 7,602,316
Granted Patent B2
US 7,602,316 · App. 11/776,786 · Granted Oct 13, 2009

Data coding/decoding for electrical computers and digital data processing systems

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,602,316
App. No.
11/776,786
Granted
Oct 13, 2009
Kind
B2
Abstract

Embodiments of methods, systems and/or devices for data coding are disclosed. Briefly, in accordance with one embodiment, data is coded and transmitted via an input/output portion of a computing platform to one or more other portions of the computing platform. An interconnect is employed to facilitate transmitting the coded data.

Claims (48)

1. A method of buffering data symbols comprising:

determining a maximum value resulting from coding a data symbol of a sequence of data symbols into a buffer based at least in part on a radix of the data symbol;

comparing said maximum value with a buffer capacity of the buffer;

scaling the data symbol based at least in part on the radix if the maximum value does not exceed the buffer capacity; and

coding the scaled data symbol into the buffer if the maximum value does not exceed the buffer capacity.

2. The method of claim 1 , further comprising:

repeating said determining, said comparing, said scaling, and said coding for additional data symbols from the sequence of data symbols.

3. The method of claim 1 , wherein the sequence of data symbols comprises fixed radix data symbols.

4. The method of claim 1 , wherein the sequence of data symbols comprises mixed radix data symbols.

5. The method of claim 1 , further comprising altering the buffer capacity in response to the comparing.

6. The method of claim 5 , wherein said altering comprises increasing the buffer capacity.

7. The method of claim 1 , further comprising providing the buffer to a decoder to decode contents of the buffer if the maximum value resulting from coding a second data symbol from the sequence of data symbols exceeds the buffer capacity.

8. The method of claim 7 , wherein a length of the buffer is known by the decoder prior to decoding the contents of the buffer.

9. The method of claim 7 , wherein decoding the buffer comprises decoding data symbols in an order in which they were coded.

10. The method of claim 1 , wherein a first part of a code and a second part of the code result from combinatorial coding, wherein the sequence of data symbols comprises the second part of the code.

11. A computer-readable medium having computer-readable instructions stored thereon that, if executed by a processor, cause a computing device to:

determine a maximum value resulting from coding a data symbol of a sequence of data symbols into a buffer based at least in part on a radix of the data symbol;

compare said maximum value with a buffer capacity of the buffer;

scale the data symbol based at least in part on the radix if the maximum value does not exceed the buffer capacity; and

code the scaled data symbol into the buffer if the maximum value does not exceed the buffer capacity.

12. The computer-readable medium of claim 11 , wherein the computer-readable instructions, if executed, further cause the computing device to:

repeat said determining, said comparing, said scaling, and said coding until each data symbol of the sequence of data symbols is coded.

13. The computer-readable medium of claim 11 , wherein the sequence of data symbols comprises fixed radix data symbols.

14. The computer-readable medium of claim 11 , wherein the sequence of data symbols comprises mixed radix data symbols.

15. The computer-readable medium of claim 11 , wherein the computer-readable instructions, if executed, further cause the computing device to:

alter the buffer capacity in response to the comparing.

16. The computer-readable medium of claim 15 , wherein altering the buffer capacity comprises increasing the buffer capacity to accommodate the maximum value.

17. The computer-readable medium of claim 11 , wherein the computer-readable instructions, if executed, further cause the computing device to:

provide the buffer to a decoder to decode contents of the buffer if the buffer is full.

18. The computer-readable medium of claim 17 , wherein a length of the buffer is known by the decoder prior to decoding the contents of the buffer.

19. The computer-readable medium of claim 17 , wherein data symbols are decoded in an order in which they were coded.

20. The computer-readable medium of claim 11 , wherein a first part of a code and a second part of the code result from combinatorial coding, wherein the sequence of data symbols comprises the second part of the code.

21. A buffered radix coder, comprising:

a processor configured to

determine a maximum value resulting from coding a data symbol from a sequence of data symbols into a buffer based at least in part on a radix of the data symbol;

compare said maximum value with a buffer capacity;

scale the data symbol based at least in part on the radix if the maximum value does not exceed the buffer capacity; and

code the scaled data symbol into the buffer if the maximum value does not exceed the buffer capacity.

22. The buffered radix coder of claim 21 , wherein the processor is further configured to:

repeat the determining, the comparing, the scaling, and the coding by employing one or more additional buffers until each data symbol of the sequence of data symbols is buffered.

23. The buffered radix coder of claim 21 , wherein the sequence of data symbols comprises fixed radix data symbols.

24. The buffered radix coder of claim 23 , wherein the sequence of data symbols comprises mixed radix data symbols.

25. The buffered radix coder of claim 21 , wherein the processor is further configured to:

alter the buffer capacity in response to the comparing.

26. The buffered radix coder of claim 25 , wherein the altering comprises increasing the buffer capacity to accommodate at least the maximum value.

27. The buffered radix coder of claim 21 , further comprising:

a decoding apparatus configured to decode contents of the buffer, wherein the decoding apparatus is further configured to receive the buffer when the buffer is full.

28. The buffered radix coder of claim 27 , wherein a length of the buffer is known by the decoding apparatus prior to decoding the contents of the buffer.

Assignments (2)
MERGER Recorded Sep 9, 2015
From: INTELLECTUAL VENTURES FUND 44 LLC
To: XYLON LLC
Reel/Frame 036574/0461 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 12, 2008
From: MONRO, DONALD M.
To: INTELLECTUAL VENTURES FUND 44 LLC
Reel/Frame 020495/0452 →
Continuity (1)
Related Publication 20090019069A1 · Jan 15, 2009