Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS3656178 A
Publication typeGrant
Publication dateApr 11, 1972
Filing dateSep 15, 1969
Priority dateSep 15, 1969
Publication numberUS 3656178 A, US 3656178A, US-A-3656178, US3656178 A, US3656178A
InventorsMaine Paul A D De, Springer Gordon K
Original AssigneeResearch Corp
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Data compression and decompression system
US 3656178 A
Abstract
A high speed, multistage, compressor-decompressor system for processing arbitrary bit strings by reversibly removing redundant information. Alphanumeric information is processed by Type 1 compression which involves removing patterns of contiguous bytes and replacing each removed pattern by decompression information which takes considerably less storage space, and Type 2 compression which involves removing individual redundant bytes and constructing a bit map identifying the location of the removed bytes. Numerical information is processed by a compression technique involving truncation, recursive differencing, sequence removal, packing, and then utilizing the Type 1 and Type 2 compression which are used in conjunction with alphanumeric information. The information which is to be compressed is arranged in strings of bytes and any information defining removal of redundant information from a string is kept together with the string. As a result, each string is self-defined in the sense that it contains all information needed to decompress that string.
Images(30)
Previous page
Next page
Claims  available in
Description  (OCR text may contain errors)

United States Patent De Maine et al.

[54] DATA COMPRESSION AND DECOMPRESSION SYSTEM [72] Inventors: Paul A. D. De Maine; Gordon K. Springer,

both of State College, Pa.

LAD. D e Maine, B. A Mgrron, and K. Kloss, The Solid System 11; Numeric Compression The Solid System 111; Alphanumeric Compression Nat. Bureau of Standards Technical Note 413, Aug. 15,1967

[451 Apr. 11, 1972 R.W. Bemer, Data Compression System, IBM Tech. Disc. Bull. Vol. 3, No. 8, Jan. 1961 Primary Examiner-Raulfe B. Zache Assistant Examiner-Sydney R. Chirlin Attorney-Robert S. Dunham, P. E. Henninger, Lester W. Clark, Gerald W. Griffin, Thomas F. Maran, Howard .1.

Churchill, R. Bradlee Boal, Christopher C. Dunham, Robert [5 7] ABSTRACT A high speed, multistage, compressor-decompressor system for processing arbitrary bit strings by reversibly removing redundant information. Alphanumeric information is processed by Type 1 compression which involves removing patterns of contiguous bytes and replacing each removed pattern by decompression information which takes considerably less storage space, and Type 2 compression which involves removing individual redundant bytes and constructing a bit map identifying the location of the removed bytes. Numerical information is processed by a compression technique involving truncation, recursive differencing, sequence removal, packing, and then utilizing the Type 1 and Type 2 compression which are used in conjunction with alphanumeric information. The information which is to be compressed is arranged in strings of bytes and any information defining removal of redundant information from a string is kept together with the string. As a result, each string is self-defined in the sense that it contains all information needed to decompress that string.

25 Claims, 38 Drawing Figures SANPAKD PATENTEuIPRITIIm 1 3,656,178

SHEET mar 30 sET ALL YES REGISTERS AND F COUNTERS IS THIS TYPE 2 COMPRESSION FIG. 1A

COMPUTE sAvINe RATIO AND FIND OUT WHETHER TO ADD, DELETE, OR UPDATE PCORDSI FIND ALL l2 AVAILABLE CODES.

STORE lN LEXICON ARE THERE ANY coDEs LEFT AVAILABLE FOR SUBSTITUTION FOR A PATTERN ANY CODES AVAILABL SET COUNTERS R AND RM A B UPDATE COUNTERS SELECT coDE FROM U No 807 LEXICON ARRAY I P {30 RM=RM-l LDAD IRE wITH ADDRESS OF MATCH 36 FROM TL (IR4) (94) m TWIN/(IRS.- E PAUL A.D. de MAINE INGER m- AY GORDON K AA 34 v LERNER DAVID 8I BEHR ATTORN E YS PAIENTEBIPII I I I972 SHEET SET UP COUNTERS AND REGISTERS FOR TYPE 2 COMPRESSION SET UP COUNTERS AND REGISTERS FOR FAST MODE GET NEXT TYPE 2 CODE TO SEARCH STRING FOR GET NEXT PCORD O SEARCH FOR IN STRING FIG. 1B

WAS THERE A SAVINGS GO TO POINT MARKED K SET UP COUNTERS TO ASSEMBLE LEXICON GO TO POINT MARKED L ARE THERE ANY ANY MORE TYPE 2 CODES GO TO POINT MARKED J ANY MORE PCORDS FOR THIS ENGTH TH ERE A SAVINGS RRL JII,CS4

ANY MORE TYPE 2 CODES ARE THERE ANY YES RELOAD REG. 8: IRR AND BRANCH SAVINGS SAVINGSR PATENTED PR 1 1 m2 SHEET 830F310 UN UNLN 20mm wooo mkmJwQ PATENTEIJIPII I I I972 SET NDR IN SOSIIRI) ZERO. MAKE SOSIIRI) NEGATIVE USED).

SHEET OSUF 3'0 LOGICAL ADD THE LAST 4 BITS OF NUMBER AT LOCATION OIBRYY) WITH ITSELF AND THE SHIFT RESULT TO RIGHT 8 BITS, TRUNCATION WITH ROUNDING STORE STORE IO LSX(IRI)/2.0 IN BWXIIRII lN BWX (IRI) 7 FIND MIN (1R4) 2'8 2 x v 234 STORE 0.0 ,E Q JQZ IN BWX (IR'I IN SUBSTRING 236 V I INCREASE SETI 220 BRYY BY 4 FIND THE MIN '98 YM (1R|I= 1R4 I DECREASE 1R3 (1R4) 8 THE DUMI=IIR5-1R4I BY 4 MAX.IIR5) IN /BWX (IRI I SUBSTRING 238 (6(BRYY I 222 0 200 IF SE I g DUMI B O YM(1R|)=(IR4+1R5I 61.08364 /2 so 1R5=I YMIIRI )I DEc E vQI I igm I224 BRYY 8Y4 (:52 a CSI5 SHIFT 6(BRYY) LOGICAL LEFT REPLACE GIBRYYI a STORE IN E6(BRYY)YM(IRI)J LOAD IRS 8| /BWX(IR|) CHECKIIRI) BRYY FROM cs2 a cs I5 LOAD BRYY r 228 AND [R3 FROM SUBTRACT TRUN Csls CS2 YMIIRIIFROM 6(BRYY) O'YYIYY l IR3=IR34 230 244 A BRYY=BRYY +4 2I4 INCREASE BRYY BY 4 DECREASE o I ma BY 4 so 50 IF 0 FIG.

PATENTEDIPR I I I972 3. 656, 1 78 SHEET 06 (1F 30 IE H I? 5 EW TTN I I sTo II: IRI a |R5 I 2$8RIHIIRTOII$3I I IN a IR3) AND .1 ADD FOUR TO IR4 I DUMIIIM) LOAD BRYY FROM LOAD I CSISIDECREASE I I FROM BRYY I I |R3 BY FOUR, I D I INCREASE IR3v8IIR4 I I BY FouRsToREIRe I w BEGIN THE FLOAD me I GIIRZI I I SIGNIFICANT I R BRYY OM e( I I I E LTI 'I'BRIED IN RT I INCREASE IR4,IR5a I I E B S O I I IR6 BY4,88II I EAEH \A I2R STORE IRS IN 9(IR3).INCREASE IR3, IR5 BI BRYY BY FOUR. LOAD IRG FROM GIBRYY). DECREASE IRI BY ONE.

TRANSFER IR? BYTES FROM 9(IR2) TO 6(IR3) STORE IR6 IN DUMI. ASSEMBLE THE CONDENSED SUBSTRING LOAD BRYY a I I IRIWITH IR28I9 I so I M355? RI CONDENSED STRINGS II IIRS+IR4 IS N0.0F I

\BYTES (III) I W I.

LOAD IR4,IR5 8IIR7 WITH ZERO LOAD IR6 8IlR4 WITH ONE 8 GIBRY LOAD IR4 POSITIVE BI IR? WITH ONE MOVE lR4-IR5 LEFT ONE BIT. INCREASE IR6 BY ONE LOAD IR4 WITH IR7. SHIFT IR4-IR5 RT. ONE

ADD IR6 TO IRS LOGICAL STORE IRS IN GIBRYY).

ADD FOUR TO BRYY. SUBSTRACT FOUR FROM IR3.

PATENTEDIPIIII I972 I SNUPAKC I SHEET 070F 3O TRUNCATION MAKE IRS POSITIVE ADD IR5 TO IRS LOAD IRI,IR3 AND BRYY FROM CS2,

I oAD IR2,|R3 a BRYY FROM cs3, (:54 a csI5:IRe, IRI,IR4 T0 IR? WITH ZERO LOAD IR? FROM GIBRYY) IF I R7-IRO MAKE IRO POSITIVE ADD IR5 TO IRG ADD IRG TO IR4 HAS IR4 OVERFLOWED YES LOAD IRB FROM IR7 IR5 WITH ZERO INCREASE B RYY BY FOUR DECR-EASE IR3 BY FOUR ITRTIEURSTRFIE INDEX IR3=NO. OF BYTES I Nos. IN suBsTRINs IR5= NO. OF CONSECUTIVE IEQUELLEILEQEFLSJ INCREASE IR5 BY ONE LOAD IRI WITH 'TFFFFFFF' cs4 a CSIS BRYY=ADDRESS l I RIDE-155W I SUBSTRING STEP (a) CONVERTED TO I INTEGERS AND I HAS IRG OVERFLOWED ADD IRS TOIR4 STORE IR4 IN IRI LOAD BRYY FROM Calf) WITH ZERO THE SUM OF I ABS. INTEGERS \L L JIBE I SUBTRACT [R6 FROM GIBRYY) 8| STORE DIFF. IN IR4. LOAD BRY WITH POSITIVE IR7 IF BRY- LOAD IRS FROM GIBRYY) INCREASE IR5 BY ONE PATENTEIII-PII II Ian 3,656,178

SHEET O8BF 30 '*G a -PTQKIE hl I l mERF Bic-1m? TFE" ADD IRs To sAvE IR8 IN wcD PACKING OF E 1 POSITIVE IRe INIRe I SETALL REGISTERS INTEGERS IN ARRAY ADD 1R0 To IR4 AND INDICATORS 9(BRYYHNTO ARRAYI I \E Y L J I SETKMZASKI AND L @EI E M s HAS No LOAD FROM LOAD IRI FROM sEouENcEs I ovERFLowED IR? INCREASE [R5 BY ONE DUMI. SHIFT IRI CONDENSED I LEFT 3 BITS \LN S'EEP (P I I I-o lBNYCgfiSLEOlXgR I LOAD IR8,CS6 AND BRYY BIIRI FROM I cs7 WITH ZERO CSI5 a cs2 I l4-K INSERT IN ExTRAcT FROM mEK :2 lS SOSURDLOAD R7: 9(BRYY) THE usED TO I NO. OF SIGN BITS ExTRAcT THIS I h ZERO I86 I INTo IR3I ADD NO. FROM RT. I L I ONE TO IR8 Il3 l J UENC'NG ,'u BsTIN CONDENSAT'ON [F 0 TRANSFER CS6 TO I AND COUNT cs7 AND STORE PROCEDURES |R3-cs6 "IT 0 IR? BY FOUR Z HAS IRs OVERFLOWED LOADIR3 BI |R2 WITH CS6 BI ZERO MULTIPLY |R2 BY IRB AND STORE THE ANSWER IN |R3 S INcREAsE BRYY BY LOAD RYY a FOURDECREASE IR3 FROM IR? BY FOUR csIs a cs4 LOAD IRe WITH 0 0(8RYY) H DEcREAsE IRB BY l E ONE.TRAN$FER ADD FOUR T0 CS7 T0 C56 BRYY. SUBTRACT FOUR FROM 0 m3 DIvIDE cs5 BY 0 IR8.QUOT|ENT a REMAINDER K so LOAD IRI FROM STORED IR4. INcREAsE AND (WCD +4) NDR BY ONE F N 0 USE MASK2 TO ExTRAcT No. OF SIGNIFICANT BITs LOAD R FROM DIBRYITIIEN OUBRYY) SUBTRACT (A COMPACT INTEGER Ims FROM 00mm IN 9(BRY) IN RIGHT III/III IHG I RUMIHI IR3 BITS OF IR2 FIG. 6B

PATENTEIIIPII I I I972 SHEET 090F130 M PAEFIN'G P T q T I gEEII/IENT? IF I MOVE REGISTERS BEING PACKED LOAD BRY,IR5 AND IRO a IRI INTO DOUBLE BRYY FROM CSIS, LEFT IRS BITS REG|STER5 C53 AND 1R6 I \L i-L J I I Wa N5 3'5"? ADD LOGICAL SUBTRACT BRY BYTES m I IIIEREIS E BRY FROMIRS ADD COMPRESSED I cs4 T0 BRY I BY FOUR.SUBTRACT 'N I ONE FROM |R8 SHIFT REGISTERS IRQ 8 IRI LEFT LOGICAL(WCD+4) BITS INSERT RT. FIVE I WEIEI=I )F BITS F cs8 INTO SEGMENTS IN THE THE LEFT FIVE \DOUBLE WORD LOAD BRY FROM BRYY MOVE DOUBLE WORD IN MASK4 INTO 6(IR6) INCREASE IRS BY EIGHT YES STORE IRS-IRI IN MASK4 AND 'ee' IN CORDI LOAD me a lRl WITH ZERO STORE 56 IN CS5 TRANSFER MASK4 TO IRS. INCREASE IRS BY EIGHT MOVE THE IR5 BYTES OF UNCOMPRESSED INFO. FROM 6(BRY) TO 9(BRYY) LOAD IR9,IR| AND BRYY FROM csI, (:32 a CS|5.STORE IR6 IN cs4 a J l INSERT NDR AND JI IN SOSHRI) LOAD IRB FROM WCD BRANCH TO BRADD EID \ CONSTRUCTED I I I I I I I I I I I I T 2775 TT PAIENIEIIAPRIIIHIZ SET ALL INDICATORS AND REGISTERS CONSTRUCT IN MASK2 THE MASK FOR EXTRACTING NS AND NOS LOAD IRE 8 IR3 WITH DOUBLE WORD FROM GIBRYY) INCREASE BRYY BY EIGHT DECREASE IR7 BY EIGHT EXTRACT NS FROM IR2 WITH MASK2 INTO IRS 8: NS (RT ADJUSTED) COMPUTE THE NUMBER OFBITS/ SEGMENT FROM IRQ 8 C55 IN IR4 CONSTRUCT MASK FOR EXTRACTING SEGMENTS IN SHIFT DOUBLE REGISTER IR2-IR3 LEFT LOGICAL 8. LOAD IR5 FROM CS5 MASKI I I EXTRACT NOS FROM IRE WITH MASK2 INTO LSX SHIFT IR2 IR3 LEFT LOGICAL 8 INCREASE IRI BY FOUR EXTRACT SEGMENT FROM m2 INTO IR5 SHEET ET JT M I BRY a BRYY I I CONTAIN ADDRESS OF I DOUBLE WORD I Nos: NO OF CONDENSED ESTSW LEFT-MOST I FIVE BITS OF I ERWKINE IETI FOR THE FIRST DOUBLE WORD I L9 F A R RAY YL I 555 13 THE I NUMBER OF I CONDENSED STRINGS IN IL E E LJ EXPAND SEGMENT IN IR5 TO FULL WORD AND STORE IN LSX (IRI) LOAD IR5 WITH NS AND SUBTRACT ONE STORE IR5 IN NS SHIFT IRZ-IR3 LEFT LOGICAL IR4 BITS SUBTRACT ONE FROM IRS STORE IRB IN CS7 LOAD IRG AND IRI WITH NS AND ZERO EXTRACT SEGMENT FROM IR2 INTO IR5 FIG. 7A

DECREASE IRS BY ONE.STORE IRG IN CS7 PATENTEDIIIR II I972 EXPAND SEGMENT IN IR5 AND STORE IN DUNIIIRI).

ADD FOUR TO IRI SHEET SAVE BRYY 8| BRY IN CS9 8s CSIOI LOAD IRS FROM BRYY 8 SUBTRACT BRY GEENTTIBE -I OF TRANSFER I OF INFORMATION I IN ARRAY DUNI T O ARRAY YY ADD IR7 a C53 TO BRYY. SUBTRACT EJE E E S ONE FROM BRYY LQE l 'i I Dm N TAT I S SUBTRACT IRs AND THE ASDRESS I ADD IRI T0 BRYY OF THE BYTE IaIZBRNYCSS ON RT HAND I I ll I I EE ALL Q E I R-2.IS T R E I ADD cs3 TO R7 IN R2 NUMBER OF BYTESI RM vc e, IR2,BRY, 9,8RYY

IROTTE OF F2 7 BYTES CREATED I IE E E E J RELOAD BRYY, BRY AND |R2 FROM CS9, CSIO 8 OS I I TRANSFER IRI BYTES F ROM DUNI TO HOLE (6(BRY)) ADD IRI TO BRY THEN STORE IN BRYY LOAD IRI WITH ZERO SHIFT IR2-IR3 LEFT LOGICAL ONE SEGMENT(IR4I DECREASE IRS BY ONE LOAD IRS AND IRS FROM CS4 AND LSX. LOAD IRI 8I |R2 WITH ZERO EEOINNINI; i

OF THE EXPANSION OF I CONDENSED PAIENTEIIM'R 1 1 m2 SHEET [JIR PARM l sosu I CHECK I I sos (2) CHECK (2) BWX (2) I mm) BYTES =4 LSUBSTRINEI Lsu BSTRING Q & SUBSTRINGTVI FIG. 6

SOS

LSX

FORMATTYPE COPAK COMPRESSOR OPTION E AND/OR F E AND/OR F USE SANPAKC ONLY USE SANPAKC ONLY USE SNUPAKII) THEN SANPAKC USE SNUPAKIZ) THEN SANPAKC USE SNUPAKI3I THEN SANPAKC DON'T USE SNUPAK OR SANPAKC WRITE THE RESI- DENT MB IN CURR E NT LOCATION FIG. .9

REWRITE THE RE- SIDENT MB IN LOCATION CURRENT READ MB IN LOCATION ADDRESS BIT 02 OFF BIT OI OFF LOAD CURRENT UPDATE EMPTY BIT 80-OFF BIT OZ-ON SET CURRENT mm FIG. 11

PATENTEDAPR 1 1 1912 SHEET 1; 0F 30 EXECUTIVE POINTERS LINK ADDRESS (BADDL BYTES) FIG. 12

moqmohm FIG. 13

BD(|) LD( I) RFILE MAIN FILE JMM) SIIEET 15UF 3O IMACH|NE-INDEPENDENT INSTRUCTION SET I LAST CODING LEVEL CONTAINING ASSEMBLY LANGUAGE L 1 1 4 A 4 1 A A A [CODING LEVEL 7 I E 1 1 1 1 1 1 1E LCODING LEVEL 6 1 I I I I I EODING LEVEL 5 LCODING LEVEL 4 MACROPAK CODING LEVEL 3 SERVICE MACROS [RESERVE I I ASSEMBLY LANGUAGE FIG. 14

CONTROL ROUTINE T T T SRI SR2 SR3 SRZA SR3A SRBB 1 n In FIG. 15

PATENTEDAPR 1 1 m2 EHEET 15 0F 3-0 INITIALIZE (SSTATECL) MSIGNAL=OO(80) NORMAL ENTRY 604 F 606 FOR SSEARCH INITIALJZE START SEARCH BITS 3c OFF N SCREEN 0 YES INDEX SCREEN AUXFILE SEARCH SEARCH 650 SEARCH (20) (20) (0| 20) ONE TM 20 7 g? UNSUCESSFUL \sla zERo SEARCH (04) 682/ SUCCESSFUL 622 620 SEARCH E .E.\L M .E E- CREATE TsMEMoRY (so) I 4o -ON M912? 2. E $9599 ZER INCREMENT JOB-LIST ITEM DISCRIPTOR A 626 POINTER l8) FIG. 16'

PATENTEDAPR 11 m2 3,656,178

SHEET 18 0F 30 686 720 COMPUTE EP 7 LENGTH IN m4, AND TOTAL SET LENGTH OF ALL me |R6+ BRY EPS IN ARRAY COMPUTE IN RI LOAD R0 TO R|5 FROM ARRAY DUMX +8 IS RI DIVISIBLE 9 SET LOAD RO TO 6 MSIGNAL X 20' Rl5 FROM THE BIT ON- ARRAY DUMX+8 |R6=|R3 70o v 692 Q INSERT TESTS FOR OVERIDE CODESJF ANY ARE PRESENT BRANCH TO THE LOCATION MMATCH IN SSEARCH SET RI=A(8ADDI) 8ADDL,8|LFAST,

I BLTHAYY SUPERSCH D aAooL, aLFAsT CSCREEN 706 FIG. 18A

PATENTEUAPR 1 1 I972 TIC MMATCH N SHEET SSEARCH lSOF 30 STORE R0 TO R6 IN ARRAY Cl SET IR|=LEXICON +8 SET LMOVE MASKI,O(IR6), C(IRI) l 874 20 SET 5 IRI=LEXICON+4 SET R1: RIRO-, STORE R0 TO R6 IN ARRAY c|-, IR3=|R3RO LMOVE DUNI,O(IR2), OHRI) SET ONE C(LEXICON)=X'OO' LOAD R0 TO R6 FROM ARRAY c| LEXICON x'o|' SETIMSIGNAL x o BIT ON 2 8'8) ZERO SET IRIIAYY+8LTHAYY TO --H(DUN|)', TBADDNE LEXICON+4=IR|- IN LEx|coN+8=|R|-Ro;

SSEARCH Y FIG. 183

Y FIG. 20A

Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US3237170 *Jul 17, 1962Feb 22, 1966IbmAdaptive data compactor
US3273130 *Dec 4, 1963Sep 13, 1966IbmApplied sequence identification device
US3289169 *Sep 27, 1962Nov 29, 1966Beckman Instruments IncRedundancy reduction memory
US3310786 *Jun 30, 1964Mar 21, 1967IbmData compression/expansion and compressed data processing
US3413611 *Jan 17, 1966Nov 26, 1968David PfuetzeMethod and apparatus for the compaction of data
US3422403 *Dec 7, 1966Jan 14, 1969NasaData compression system
US3490690 *Oct 26, 1964Jan 20, 1970IbmData reduction system
US3535696 *Nov 9, 1967Oct 20, 1970NasaData compression system with a minimum time delay unit
Non-Patent Citations
Reference
1 *P.A.D. de Maine, B. A. Marron, and K. Kloss, The Solid System II; Numeric Compression The Solid System III; Alphanumeric Compression Nat. Bureau of Standards Technical Note 413, Aug. 15, 1967
2 *R.W. Bemer, Data Compression System, IBM Tech. Disc. Bull. Vol. 3, No. 8, Jan. 1961
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US3772654 *Dec 30, 1971Nov 13, 1973IbmMethod and apparatus for data form modification
US4021782 *Apr 30, 1975May 3, 1977Hoerning John SData compaction system and apparatus
US4056809 *Apr 30, 1975Nov 1, 1977Data Flo CorporationFast table lookup apparatus for reading memory
US5363098 *Oct 25, 1993Nov 8, 1994Digital Equipment CorporationByte aligned data compression
US5414425 *May 9, 1994May 9, 1995StacData compression apparatus and method
US5463390 *Jul 21, 1994Oct 31, 1995Stac Electronics, Inc.Data compression apparatus and method
US5506580 *Dec 6, 1994Apr 9, 1996Stac Electronics, Inc.For converting an input data stream into an encoded data character stream
US5542068 *Dec 10, 1991Jul 30, 1996Microsoft CorporationMethod and system for storing floating point numbers to reduce storage space
US5546575 *May 23, 1994Aug 13, 1996Basil E. Potter & Associates, Inc.Encoding method for compressing a tabular database by selecting effective compression routines for each field and structure of partitions of equal sized records
US5673209 *Mar 29, 1995Sep 30, 1997International Business Machines CorporationApparatus and associated method for compressing and decompressing digital data
US5710719 *Oct 19, 1995Jan 20, 1998America Online, Inc.Apparatus and method for 2-dimensional data compression
US5940833 *Jul 12, 1996Aug 17, 1999Microsoft CorporationComputer implemented method
US6006232 *Oct 21, 1997Dec 21, 1999At&T Corp.System and method for multirecord compression in a relational database
US6145068 *Sep 16, 1997Nov 7, 2000Phoenix Technologies Ltd.Data transfer to a non-volatile storage medium
US6512515Sep 18, 1999Jan 28, 2003WildtangentData compression through motion and geometric relation estimation functions
US6577769Sep 18, 1999Jun 10, 2003Wildtangent, Inc.Data compression through adaptive data size reduction
US6697530Mar 1, 2002Feb 24, 2004Wildtangent, Inc.Data compression through adaptive data size reduction
US7382878 *Jun 22, 2001Jun 3, 2008Uponus Technologies, LlcSystem and method for data encryption
US7479905 *Jul 28, 2003Jan 20, 2009International Business Machines CorporationApparatus, system and method for data compression using irredundant patterns
US7711685 *Oct 16, 1999May 4, 2010Computer Associates Think, Inc.Method and system for an extensible macro language
US7734457Apr 18, 2006Jun 8, 2010Computer Associates Think, Inc.Method and system for generating dynamic comparison models
US8190513Oct 22, 2008May 29, 2012Fraud Control Systems.Com CorporationMethod of billing a purchase made over a computer network
US8228216 *Sep 8, 2010Jul 24, 2012Hewlett-Packard Development Company, L.P.Systems and methods for data compression
US8229844Oct 22, 2008Jul 24, 2012Fraud Control Systems.Com CorporationMethod of billing a purchase made over a computer network
US8250043Aug 19, 2008Aug 21, 2012Netapp, Inc.System and method for compression of partially ordered data sets
US8473722 *Jul 1, 2004Jun 25, 2013Universitaet StuttgartProcessor architecture for exact pointer identification
US8630942Oct 22, 2008Jan 14, 2014Fraud Control Systems.Com CorporationMethod of billing a purchase made over a computer network
US8843457 *Feb 14, 2013Sep 23, 2014Sony CorporationData conversion device, data conversion method, and program
US20080209149 *Jul 1, 2004Aug 28, 2008Universitat StuttgartProcessor Architecture for Exact Pointer Identification
US20120056763 *Sep 8, 2010Mar 8, 2012Giovanni MottaSystems and methods for data compression
US20130159264 *Feb 14, 2013Jun 20, 2013Taizo ShiraiData conversion device, data conversion method, and program
WO2010021698A2 *Aug 18, 2009Feb 25, 2010Netapp, Inc.System and method for compression of partially ordered data sets
Classifications
U.S. Classification341/87
International ClassificationH03M7/30
Cooperative ClassificationH03M7/3066
European ClassificationH03M7/30M