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


 The Delphion Integrated View

  Buy Now:   Buy PDF- 56pp  PDF  |   File History  |   Other choices   
  Tools:  Citation Link  |  Add to Work File:    
  View:  Expand Details   |  INPADOC   |  Jump to: 
 
 Email this to a friend  Email this to a friend 
       
Title: US4558302: High speed data compression and decompression apparatus and method
[ Derwent Title ]


Country: US United States of America

View Images High
Resolution

 Low
 Resolution

 
56 pages

 
Inventor: Welch, Terry A.; Concord, MA

Assignee: Sperry Corporation, New York, NY
other patents from UNISYS CORPORATION (596125) (approx. 6,717)
 News, Profiles, Stocks and More about this company

Published / Filed: 1985-12-10 / 1983-06-20

Application Number: US1983000505638

IPC Code: Advanced: G06F 5/00; G06T 9/00; G11B 20/10; H03M 7/30; H03M 7/40; H03M 7/46; H04B 14/04; H04L 23/00;
Core: more...
IPC-7: G06F 5/00;

U.S. Class: Current: 341/051; 341/095;
Original: 340/347.DD; 235/310;

Field of Search: 340/347 DD 235/310,311 364/200,900

Priority Number:
1983-06-20  US1983000505638

Abstract: A data compressor compresses an input stream of data character signals by storing in a string table strings of data character signals encountered in the input stream. The compressor searches the input stream to determine the longest match to a stored string. Each stored string comprises a prefix string and an extension character where the extension character is the last character in the string and the prefix string comprises all but the extension character. Each string has a code signal associated therewith and a string is stored in the string table by, at least implicitly, storing the code signal for the string, the code signal for the string prefix and the extension character. When the longest match between the input data character stream and the stored strings is determined, the code signal for the longest match is transmitted as the compressed code signal for the encountered string of characters and an extension string is stored in the string table. The prefix of the extended string is the longest match and the extension character of the extended string is the next input data character signal following the longest match. Searching through the string table and entering extended strings therein is effected by a limited search hashing procedure. Decompression is effected by a decompressor that receives the compressed code signals and generates a string table similar to that constructed by the compressor to effect lookup of received code signals so as to recover the data character signals comprising a stored string. The decompressor string table is updated by storing a string having a prefix in accordance with a prior received code signal and an extension character in accordance with the first character of the currently recovered string.

Attorney, Agent or Firm: Terry, Howard P. ; Cooper, Albert B. ;

Primary / Asst. Examiners: Miller, Charles D.;

Maintenance Status: CC Certificate of Correction issued
B1 Re-examined

INPADOC Legal Status: Show legal status actions          Buy Now: Family Legal Status Report

       
Related Applications: Go to Result Set: 1 patent(s) that list this one as related
Application Number Filed Patent Pub. Date  Title
     1985-12-10  HIGH SPEED DATA COMPRESSION AND DECOMPRESSION APPARATUS AND METHOD


       
Designated Country: DE FR GB IT 

Family: Show 11 known family members

First Claim:
Show all 181 claims
I claim:     1. In a data compression and data decompression system, compression apparatus for compressing a stream of data character signals into a compressed stream of code signals, said compression apparatus comprising
  • storage means for storing strings of data character signals encountered in said stream of data character signals, said stored strings having code signals associated therewith, respectively,
  • means for searching said stream of data character signals by comparing said stream to said stored strings to determine the longest match therewith,
  • means for inserting into said storage means, for storage therein, an extended string comprising said longest match with said stream of data character signals extended by the next data character signal following said longest match,
  • means for assigning a code signal corresponding to said stored extended string, and
  • means for providing the code signal associated with said longest match so as to provide said compressed stream of code signals.


Background / Summary: Show background / summary

Drawing Descriptions: Show drawing descriptions

Description: Show description

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

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

Buy
PDF
Patent  Pub.Date  Inventor Assignee   Title
Get PDF - 69pp US4464650  1984-08 Eastman  Sperry Corporation Apparatus and method for compressing data signals and restoring the compressed data signals
       
Foreign References: None

Other Abstract Info: DERABS G85-001600

Other References:
  • Ziv, "IEEE Transactions on Information Theory", IT-24-5, Sep. 1977, pp. 530-537.
  • Ziv, "IEEE Transactions on Information Theory", IT-23-3, May 1977, pp. 337-343. (7 pages) Cited by 109 patents


  • Inquire Regarding Licensing

    Powered by Verity


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

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