Efficient coding of small integer sets -> Monitor Keywords
Fresh Patents
Monitor Patents Patent Organizer File a Provisional Patent Browse Inventors Browse Industry Browse Agents Browse Locations
site info Site News  |  monitor Monitor Keywords  |  monitor archive Monitor Archive  |  organizer Organizer  |  account info Account Info  |  
10/29/09 - USPTO Class 341 |  1 views | #20090267810 | Prev - Next | About this Page  341 rss/xml feed  monitor keywords

Efficient coding of small integer sets

USPTO Application #: 20090267810
Title: Efficient coding of small integer sets
Abstract: Techniques for coding integer sets are described herein. According to one embodiment, for each data range of parameters to be encoded, a number of bits required to represent a maximum parameter among the parameters in each data range is determined, including a first number of bits and a second number of bits corresponding to the first and second data ranges. Each parameter in the first data range is encoded using the first number of bits and each parameter in the second data range is encoded using the second number of bits, where the data stream further includes a value representing the first number of bits and the data stream is to be decoded by a decoder using the value representing the first number of bits to recover the first number of bits and the second number of bits, which are used to recover each parameter from the data stream. (end of abstract)



Agent: Red Hat/bstz Blakely Sokoloff Taylor & Zafman LLP - Sunnyvale, CA, US
Inventors: James Paul Schneider, James Paul Schneider
USPTO Applicaton #: 20090267810 - Class: 341 50 (USPTO)

Efficient coding of small integer sets description/claims


The Patent Description & Claims data below is from USPTO Patent Application 20090267810, Efficient coding of small integer sets.

Brief Patent Description - Full Patent Description - Patent Application Claims
  monitor keywords TECHNICAL FIELD

The present invention relates generally to data compression. More particularly, this invention relates to methods for efficient coding of small integer sets.

BACKGROUND

Small sets of integers of distinct sizes (e.g., an 8 bit set and a 16 bit set) arise in a variety of computing applications, such as entropy encoders. However, certain conventional methods put requirements on the values, or the relationship between the values, of the integers themselves, or are not quite as efficient.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate similar elements.

FIG. 1 shows an overview of an adaptive coding compression process according to an embodiment of the invention.

FIG. 2 is a flow diagram illustrating a process for deriving coding parameters from sizes of various parameter sets according to an embodiment of the invention.

FIG. 3 is a flow diagram illustrating an encoding process according to one embodiment of the invention.

FIG. 4 is a flow diagram illustrating a decoding process according to one embodiment of the invention.

FIG. 5 is a block diagram illustrating an example of a data process system which may be used with one embodiment of the invention.

DETAILED DESCRIPTION

In the following description, numerous details are set forth to provide a more thorough explanation of the embodiments of the present invention. It will be apparent, however, to one skilled in the art, that embodiments of the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form, rather than in detail, in order to avoid obscuring embodiments of the present invention.

Reference in the specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification do not necessarily all refer to the same embodiment.

According to one embodiment, an encoding method is provided to allow an encoder to code integer sequences without regard to the relationship between the values themselves. As a result, a sequence can be coded where some values repeat and where the values are not non-increasing.

FIG. 1 illustrates an exemplary network architecture 100 in which embodiments of the present invention may operate. The network architecture 100 may include a first computing device 105 and a second computing device 110 connected via a network 130. The network may be a public network (e.g., the Internet) or a private network (e.g., a local area network (LAN), intranet, intraweb, etc.).

Each of the first computing device 105 and second computing device 110 may be a desktop computer, notebook computer, cellular phone, personal digital assistant (PDA), or other device capable of processing machine-executable code. Moreover, the first computing device 105 and second computing device 110 may each operate as a client or server in a client-server environment, or as a peer in a peer-to-peer environment. In one embodiment, the first computing device 105 and second computing device 110 each include data 115, an encoder 120, and an input/output unit 125.



Continue reading about Efficient coding of small integer sets...
Full patent description for Efficient coding of small integer sets

Brief Patent Description - Full Patent Description - Patent Application Claims

Click on the above for other options relating to this Efficient coding of small integer sets patent application.
###
monitor keywords

How KEYWORD MONITOR works... a FREE service from FreshPatents
1. Sign up (takes 30 seconds). 2. Fill in the keywords to be monitored.
3. Each week you receive an email with patent applications related to your keywords.  
Start now! - Receive info on patent apps like Efficient coding of small integer sets or other areas of interest.
###


Previous Patent Application:
Method and apparatus for high performance key detection with key debounce
Next Patent Application:
Code design with decreased transition density and reduced running digital sum
Industry Class:
Coded data generation or conversion

###

FreshPatents.com Support
Thank you for viewing the Efficient coding of small integer sets patent info.
IP-related news and info


Results in 4.06974 seconds


Other interesting Feshpatents.com categories:
Computers:  Graphics I/O Processors Dyn. Storage Static Storage Printers paws
filepatents (1K)

* Protect your Inventions
* US Patent Office filing
patentexpress PATENT INFO