Work Files Saved Searches
   My Account                                                  Search:   Quick/Number   Boolean   Advanced   Derwent    Help   


 The Delphion Integrated View

  Buy Now:   Buy PDF- 24pp  PDF  |   File History  |   Other choices   
  Tools:  Citation Link  |  Add to Work File:    
  View:  Expand Details   |  INPADOC   |  Jump to: 
  Go to:  Derwent  
 Email this to a friend  Email this to a friend 
       
Title: US6043763: Lossless data compression with low complexity
[ Derwent Title ]


Country: US United States of America

View Images High
Resolution

 Low
 Resolution

 
24 pages

 
Inventor: Levine, Earl; Palo Alto, CA

Assignee: Liquid Audio, Inc., Redwood City, CA
other patents from LIQUID AUDIO, INC. (749431) (approx. 16)
 News, Profiles, Stocks and More about this company

Published / Filed: 2000-03-28 / 1998-03-12

Application Number: US1998000039275

IPC Code: Advanced: H03M 7/46;
Core: more...
IPC-7: H03M 7/30;

ECLA Code: H03M7/46;

U.S. Class: Current: 341/051; 341/106;
Original: 341/051; 341/106;

Field of Search: 341/051,65,59,106

Priority Number:
1998-03-12  US1998000039275

Abstract: An adaptive predictor is used to predict samples, and residuals from such predictions are encoded using Golomb-Rice encoding to thereby compress a digital signal which includes the samples. The adaptive predictor adapts to residuals between actual and predicted samples at a particular rate. The rate of adaptation is itself adapted periodically to ensure optimum performance of the compression. A number of samples are repeatedly compressed using different adaptation rates, and the adaptation rate which produces the best compression results is used. The adaptation rate can be an exponential power of 2 such that incrementing the adaptation rate effectively doubles the rate at which the predictor is adapted and decrementing the adaptation rate effectively halves the rate at which the predictor is adapted. Accordingly, fewer trials are needed to find a relatively optimal adaptation rate for the predictor. A code length used in Golomb-Rice, which is typically referred to as the parameter k, is adapted for each sample in a predictable and repeatable manner to further reduce the size of a Golomb-Rice encoding for each sample. An infinite incident response filter of processed residuals automatically reduces influences of previously processed residuals upon such adaptation as additional samples are processed. The efficiency of Golomb-Rice encoding is improved by limiting the predicted samples to an efficient range.

Attorney, Agent or Firm: Ivey, James D. ;

Primary / Asst. Examiners: Young, Brian;

INPADOC Legal Status: Show legal status actions

Family: None

First Claim:
Show all 21 claims
What is claimed is:     1. A method for compressing a signal which includes one or more samples, the method comprising:
  • compressing the samples of the signal using an adaptive predictor which predicts samples in an adaptive manner using an adaptation rate to form a first compressed signal;
  • measuring a performance characteristic of the first compressed signal;
  • adjusting the adaptation rate;
  • compressing the samples of the signal using the adaptive predictor in accordance with the adaptation rate as adjusted to form a second compressed signal;
  • measuring a performance characteristic of the second compressed signal;
  • selecting a selected one of the first and second compressed signals according to the performance characteristics of the respective compressed signals; and
  • incorporating the selected compressed signal into a resulting compressed signal.


Background / Summary: Show background / summary

Drawing Descriptions: Show drawing descriptions

Description: Show description

Forward References: Show 9 U.S. patent(s) that reference this one

       
U.S. References: Go to Result Set: All U.S. references   |  Forward references (9)   |   Backward references (10)   |   Citation Link

Buy
PDF
Patent  Pub.Date  Inventor Assignee   Title
Buy PDF- 50pp US5414796  1995-05 Jacobs et al.  QUALCOMM Incorporated Variable rate vocoder
Buy PDF- 17pp US5418713  1995-05 Allen   Apparatus and method for an on demand data delivery system for the preview, selection, retrieval and reproduction at a remote location of previously recorded or programmed materials
Buy PDF- 12pp US5434948  1995-07 Holt et al.  British Telecommunications public limited company Polyphonic coding
Buy PDF- 30pp US5680129  1997-10 Weinberger et al.  Hewlett-Packard Company System and method for lossless image compression
Buy PDF- 11pp US5682152  1997-10 Wang et al.  Johnson-Grace Company Data compression using adaptive bit allocation and hybrid lossless entropy encoding
Buy PDF- 22pp US5734823  1998-03 Saigh et al.  Microtome, Inc. Systems and apparatus for electronic communication and storage of information
Buy PDF- 24pp US5734891  1998-03 Saigh   Systems and apparatus for electronic communication and storage of time encoded information
Buy PDF- 16pp US5794217  1998-08 Allen  NewLeaf Entertainment Corporation Apparatus and method for an on demand data delivery system for the preview, selection, retrieval and reproduction at a remote location of previously recorded or programmed materials
Buy PDF- 29pp US5819215  1998-10 Dobson et al.   Method and apparatus for wavelet based data compression having adaptive bit rate control for compression of digital audio or other sensory data
Buy PDF- 29pp US5835034  1998-11 Seroussi et al.  Hewlett-Packard Company System and method for lossless image compression
       
Foreign References: None

Other Abstract Info: DERABS G2000-270381 DERABS G2000-270381

Other References:
  • Weinberger, et al., "LOCO-I: A Low Complexity, Context-Based, Lossless Image Compression Algorithm," IEEE Computer Society Press, Mar. 31-Apr. 3, 1996, pp. 140-149.


  • Inquire Regarding Licensing

    Powered by Verity


    Plaques from Patent Awards      Gallery of Obscure PatentsNominate this for the Gallery...

    Thomson Reuters Copyright © 1997-2010 Thomson Reuters 
    Subscriptions  |  Web Seminars  |  Privacy  |  Terms & Conditions  |  Site Map  |  Contact Us  |  Help