| Efficient coding of small integer sets -> Monitor Keywords |
|
Efficient coding of small integer setsEfficient coding of small integer sets description/claimsThe 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 The present invention relates generally to data compression. More particularly, this invention relates to methods for efficient coding of small integer sets. 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. 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. 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. 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. ### 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 |
* Protect your Inventions * US Patent Office filing
PATENT INFO |
|