`
`
`
`0111111110111111)1111ROBIlli 01011111111111111
`
`(12) United States Patent
`Fallon
`
`(10) Patent No.:
`(45) Date of Patent:
`
`US 6,195,024 B1
`Feb. 27, 2001
`
`(54) CONTENT INDEPENDENT DATA
`COMPRESSION METHOD AND SYSTEM
`
`(74) Attorney, Agent, or Firm—Frank V. DeRosa; F. Chau
`& Associates, LLP
`
`(75)
`
`Inventor: James J. Fallon, Bronxville, NY (US)
`
`(57)
`
`ABSTRACT
`
`(73) Assignee: Realtime Data, LLC, New York, NY
`(US)
`
`( * ) Notice:
`
`Subject to any disclaimer, the term of this
`patent is extended or adjusted under 35
`U.S.C. 154(b) by 0 days.
`
`(21) Appl. No.: 09/210,491
`
`(22) Filed:
`
`Dec. 11, 1998
`
` 1103M 7/34; HO3M 7/00
`(51) Int. Cl.'
` 341/51; 341/79
`(52) U.S. Cl.
` 341/51, 79, 67;
`(58) Field of Search
`709/231, 219, 236, 250; 358/1.1; 712/32;
`711/208
`
`(56)
`
`References Cited
`
`U.S. PATENT DOCUMENTS
`
`4,872,009
`4,929,946
`5,045,852
`5,097,261
`5,175,543
`
`10/1989 Tsukiyama et al. .
`5/1990 0 Brien et al. .
`9/1991 Mitchell et al. .
`3/1992 Langdon, Jr. et al. .
`12/1992 Lantz
`
`(List continued on next page.)
`
` 341/51
`
`Systems and methods for providing content independent
`lossless data compression and decompression. A data com-
`pression system includes a plurality of encoders that are
`configured to simultaneously or sequentially compress data
`independent of the data content. The results of the various
`encoders are compared to determine if compression is
`achieved and to determine which encoder yields the highest
`lossless compression ratio. The encoded data with the high-
`est lossless compression ratio is then selected for subsequent
`data processing, storage, or transmittal. A compression iden-
`tification descriptor may be appended to the encoded data
`with the highest compression ratio to enable subsequent
`decompression and data interpretation. Furthermore, a timer
`may be added to measure the time elapsed during the
`encoding process against an a priori-specified time limit.
`When the time limit expires, only the data output from those
`encoders that have completed the encoding process are
`compared. The encoded data with the highest compression
`ratio is selected for data processing, storage, or transmittal.
`The imposed time limit ensures that the real-time or pseudo
`real-time nature of the data encoding is preserved. Buffering
`the output from each encoder allows additional encoders to
`be sequentially applied to the output of the previous encoder,
`yielding a more optimal lossless data compression ratio.
`
`Primary Examiner—Patrick Wamsley
`
`34 Claims, 16 Drawing Sheets
`
`DATA STREAM
`
`•
`DATA
`BLOCK
`COUNTER
`
`10 J
`
`INPUT
`DATA
`BUFFER
`
`20 J
`
`ENCODER El
`
`ENCODER E2
`
`ENCODER E3
`
`BUFFER/
`COUNTER 1
`
`BUFFER/
`COUNTER 2
`
`BUFFER/
`COUNTER 3
`
`ENCODER En
`
`BUFFER/
`COUNTER n
`
`30.)
`
`40)
`
`•
`COMPRESSION
`RATIO
`DETERMINATION/
`COMPARISON
`
`50)
`
`ENCODED DATA
`STREAM W/
`DESCRIPTOR\
`COMPRESSION
`TYPE
`DESCRIPTION
`
`60J
`
`Comcast - Exhibit 1015, page 1
`
`

`

`US 6,195,024 B1
`Page 2
`
`U.S. PATENT DOCUMENTS
`
`5/1993 Normile et al. .
`5,212,742
`7/1993 Dangi et al. .
`5,231,492
`9/1993 Seroussi et al. .
`5,243,341
`9/1993
`Jackson .
`5,243,348
`12/1993
`Balkanski et al. .
`5,270,832
`1/1995 Storer
`.
`5,379,036
`1/1995
`Allen et al. .
`5,381,145
`2/1995 Kulakowski et al. .
`5,394,534
`5,412,384 * 5/1995 Chang et al. . ........ ........ ........ . 341/79
`5,461,679
`10/1995 Normile et al. .
`5,467,087
`11/1995 Chu
`.
`5,471,206
`11/1995
`Allen et al. .
`5,479,587
`12/1995 Campbell et al.
`5,486,826
`1/1996
`Remillard
`.
`5,495,244
`2/1996
`Je-Chang et al. .
`5,533,051
`7/1996 James .
`5,583,500
`12/1996 Allen et al. .
`5,627,534
`5/1997 Craft .
`5,654,703
`8/1997 Clark, II .
`5,668,737
`9/1997 Iler .
`
`.
`
`5,717,393
`5,717,394
`5,729,228
`5,748,904
`5,771,340
`5,784,572
`5,799,110
`5,805,932
`5,809,176
`5,818,368
`5,818,530
`5,819,215
`5,825,424
`5,847,762
`5,861,824
`5,917,438
`5,964,842
`5,991,515
`6,031,939
`
`Nakano et al. .
`2/1998
`Schwartz et al. .
`2/1998
`3/1998 Franaszek et al. .
`5/1998 Huang et al. .
`6/1998 Nakazato et al. .
`7/1998 Rostoker et al. .
`8/1998 Israelsen et al. .
`9/1998 Kawashima et al. .
`9/1998 Yajima .
`10/1998 Langley .
`10/1998 Canfield et al. .
`10/1998 Dobson et al. .
`10/1998 Canfield et al. .
`12/1998 Canfield et al. .
`1/1999 Ryu et al. .
`6/1999 Ando .
`10/1999 Packard .
`11/1999 Fall et al. .
`2/2000 Gilbert et al. .
`
`* cited by examiner
`
`Comcast - Exhibit 1015, page 2
`
`

`

`U.S. Patent
`
`Feb. 27, 2001
`
`Sheet 1 of 16
`
`US 6,195,024 B1
`
`r--
`
`INPUT DATA STREAM
`
`IDENTIFY INPUT DATA TYPE AND
`GENERATE DATA TYPE IDENTIFICATION
`SIGNAL
`
`2
`._.-/
`
`DATA TYPE
`ID SIGNAL T
`
`•
`
`COMPRESS DATA IN ACCORDANCE WITH _....--3
`IDENTIFIED DATA TYPE
`
`COMPRESSED DATA STREAM
`
`RETRIEVE DATA TYPE
`INFORMATION OF COMPRESSED
`DATA STREAM
`
`5
`
`..
`
`DECOMPRESS DATA IN ACCORDANCE
`WITH IDENTIFIED DATA TYPE
`
`6
`
`1
`
`FIG. 1
`PRIOR ART
`
`Comcast - Exhibit 1015, page 3
`
`

`

`lualud *S*11
`
`91 JO Z WIN
`
`Ill 17ZO'S6r9 Sfl
`
`DATA STREAM
`
`•
`DATA
`BLOCK
`COUNTER
`10 J
`
`INPUT
`DATA —►
`BUFFER
`20J
`
`ENCODER El
`
`ENCODER E2
`
`ENCODER E3
`
`BUFFER/
`COUNTER 1
`
`BUFFER/
`COUNTER 2
`
`BUFFER/
`COUNTER 3
`
`ENCODER En
`
`BUFFER/
`COUNTER n
`
`301
`
`40)
`
`FIG. 2
`
` V
`COMPRESSION
`RATIO
`—10-
`DETERMINATION/
`COMPARISON
`50J
`
`ENCODED DATA
`STREAM W/
`DESCRIPTOR
`
`COMPRESSION
`TYPE
`DESCRIPTION
`60J
`
`Comcast - Exhibit 1015, page 4
`
`

`

`U.S. Patent
`
`Feb. 27, 2001
`
`Sheet 3 of 16
`
`US 6,195,024 B1
`
`RECEIVE INITIAL
`DATA BLOCK FROM
`INPUT DATA STREAM
`
`300
`
`B
`
`COUNT SIZE OF
`DATA BLOCK
`
`f
`
` 302
`
`•
`
`BUFFER DATA BLOCK
`
`_7 -304
`
`COMPRESS DATA
`BLOCK WITH
`ENABLED ENCODERS
`
`_y-306
`
`308
`
`310
`
`312
`
`BUFFER ENCODED
`DATA BLOCK OUTPUT
`FROM EACH
`ENCODER
`
`COUNT SIZE OF
`ENCODED DATA
`BLOCKS
`
`CALCULATE
`COMPRESSION
`RATIOS
`
`COMPARE
`COMPRESSION
`RATIOS WITH
`THRESHOLD LIMIT
`
`A
`FIG. 3a
`
`Comcast - Exhibit 1015, page 5
`
`

`

`U.S. Patent
`
`Feb. 27, 2001
`
`Sheet 4 of 16
`
`US 6,195,024 B1
`
`316
`
`IS
`COMPRESSION
`RATIO OF AT LEAST ONE
`ENCODED DATA BLOCK
`GREATER THAN
`THRESHOLD?
`
`YES
`
`NO
`
`SELECT ENCODED
`DATA BLOCK WITH
`GREATEST
`COMPRESSION RATIO
`
`322
`
`APPEND NULL
`DESCRIPTOR TO
`UNENCODED INPUT
`DATA BLOCK
`
`318
`
`APPEND
`CORRESPONDING
`DESCRIPTOR
`
`-324
`
`•
`OUTPUT ENCODED
`DATA BLOCK WITH
`DESCRIPTOR
`
`326
`
`OUTPUT UNENCODED
`DATA BLOCK WITH
`NULL DESCRIPTOR
`
`320
`
`328
`
`NO
`
`(- 332
`
`YES
`
`TERMINATE DATA
`COMPRESSION
`PROCESS }
`
`RECEIVE NEXT DATA
`BLOCK FROM INPUT
`STREAM
`
`_y-330
`
`4,
`B
`
`FIG. 3b
`
`Comcast - Exhibit 1015, page 6
`
`

`

`lualud *S*11
`
`91 JO S lootIS
`
`Ill 17ZO'S6r9 Sfl
`
`DATA STREAM
`
`V
`DATA
`BLOCK
`COUNTER
`10 J
`
`-
`
`-10.•
`
`INPUT
`DATA
`BUFFER
`
`20 J
`
`ENCODER El
`
`ENCODER E2
`
`--Ito
`
`ENCODER E3
`
`BUFFER/
`COUNTER 1
`
`BUFFER/
`COUNTER 2
`
`BUFFER/
`COUNTER 3
`
`V
`
`ENCODED DATA
`STREAM W/
`DESCRIPTOR
`
`COMPRESSION
`COMPRESSION
`RATIO
`TYPE
`—O.
`-l-11 0.
`DETERMINATION/
`DESCRIPTION
`COMPARISON
`50J
`
`60)
`
`ENCODER En
`
`BUFFER/
`COUNTER n
`
`30
`
`40
`
`ENCODER
`DESIRABILITY
`FACTORS
`70J
`
`FIGURE OF
`MERIT
`DETERMINATION
`80J
`
`FIG. 4
`
`Comcast - Exhibit 1015, page 7
`
`

`

`U.S. Patent
`
`Feb. 27, 2001
`
`Sheet 6 of 16
`
`US 6,195,024 B1
`
`RECEIVE INITIAL
`DATA BLOCK FROM
`INPUT DATA STREAM
`
`Y
`
`COUNT SIZE OF
`DATA BLOCK
`
`BUFFER DATA BLOCK
`
`Y
`COMPRESS DATA
`BLOCK WITH
`ENABLED ENCODERS
`
`500
`
`502
`
`504
`
`506
`
`V
`APPEND CORRESPONDING
`7-508
`DESIRABILITY FACTORS TO --,
`ENCODED DATA BLOCKS
`
`BUFFER ENCODED DATA
`BLOCK OUTPUT
`FROM EACH ENCODER
`
`510
`
`_y-512
`
`514
`
`516
`
`Y
`COUNT SIZE OF
`ENCODED DATA
`BLOCKS
`
`Y
`CALCULATE
`COMPRESSION
`RATIOS
`
`COMPARE COMPRESSION
`RATIOS WITH THRESHOLD
`LIMIT
`1
`A
`FIG. 5a
`
`Comcast - Exhibit 1015, page 8
`
`

`

`U.S. Patent
`
`Feb. 27, 2001
`
`Sheet 7 of 16
`
`US 6,195,024 B1
`
`518
`
`IS
`COMPRESSION
`RATIO OF AT LEAST ONE
`ENCODED DATA BLOCK
`GREATER THAN
`THRESHOLD?
`
`YES
`
`NO
`
`CALCULATE FIGURE OF
`MERIT FOR EACH ENCODED
`DATA BLOCK WHICH EXCEED
`THRESHOLD
`
`j524
`
`APPEND NULL
`DESCRIPTOR TO
`UNENCODED INPUT
`DATA BLOCK
`
`_7 520
`
`SELECT ENCODED DATA
`BLOCK WITH GREATEST
`FIGURE OF MERIT
`
`I f 526
`
`APPEND
`CORRESPONDING
`DESCRIPTOR
`
`528
`
`OUTPUT UNENCODED
`DATA BLOCK WITH
`NULL DESCRIPTOR
`
`J-522
`
`OUTPUT ENCODED
`DATA BLOCK WITH
`DESCRIPTOR
`
`NO
`
`( -536
`
`YES
`
`TERMINATE DATA
`COMPRESSION
`PROCESS
`
`RECEIVE NEXT DATA
`BLOCK FROM INPUT
`STREAM
`
`j-534
`
`B FIG. 5b
`
`Comcast - Exhibit 1015, page 9
`
`

`

`lualud *S*11
`
`91 Jo 8 lootIS
`
`Ill 17ZO'S6r9 Sil
`
`DATA STREAM
`
`DATA
`BLOCK
`COUNTER
`10 J
`
`—110
`
`INPUT
`DATA
`BUFFER
`
`20 J
`
`ENCODER El
`
`ENCODER E2
`
`--Po
`
`ENCODER E3
`
`BUFFER/
`COUNTER 1
`
`BUFFER/
`COUNTER 2
`
`BUFFER/
`COUNTER 3
`
`•
`
`ENCODED DATA
`STREAM W/
`DESCRIPTOR
`
`COMPRESSION
`COMPRESSION -A
` ►
`RATIO
`TYPE
`—)
`—)
`DETERMINATION/
`DESCRIPTION
`COMPARISON
`60J
`
`50J
`
`USER-
`SPECIFIED TIME
`
`). TIMER
`
`90 J
`
`ENCODER En
`
`BUFFER/
`COUNTER n
`
`30
`
`40
`
`FIG. 6
`
`Comcast - Exhibit 1015, page 10
`
`

`

`U.S. Patent
`
`Feb. 27, 2001
`
`Sheet 9 of 16
`
`US 6,195,024 B1
`
`700
`
`INPUT INITIAL
`DATA BLOCK FROM
`INPUT DATA STREAM
`
`702
`B — - 0.
`
`y
`
`COUNT SIZE OF
`DATA BLOCK
`
`704-,
`
`BUFFER DATA BLOCK
`
`706
`
`INITIALIZE TIMER
`
`708_v
`
`BEGIN
`COMPRESSING
`DATA BLOCK WITH
`ENCODERS
`
`NO
`
`NO
`
`YES
`
`Y ("716
`STOP
`ENCODING
`PROCESS
`
`v
`
`(-714
`
`BUFFER
`ENCODED DATA
`BLOCK OUTPUT
`FROM EACH
`ENCODER
`
`(-718
`v
`BUFFER ENCODED
`DATA BLOCK FOR EACH
`ENCODER THAT
`COMPLETED ENCODING
`PROCESS
`WITHIN TIME LIMIT
`
`v
`COUNT SIZE OF
`ENCODED DATA
`BLOCKS
`
`v
`CALCULATE
`COMPRESSION
`RATIOS
`
`720
`
`722
`
`'y
`COMPARE COMPRESSION
`RATIOS WITH THRESHOLD
`
`__/-724
`
`LIMIT i
`
`FIG. 7a
`
`Comcast - Exhibit 1015, page 11
`
`

`

`U.S. Patent
`
`Feb. 27, 2001
`
`Sheet 10 of 16
`
`US 6,195,024 B1
`
`726
`
`IS
`COMPRESSION
`RATIO OF AT LEAST ONE
`ENCODED DATA BLOCK
`GREATER THAN
`THRESHOLD?
`
`YES
`
`NO
`
`/
`
`732
`
`SELECT ENCODED
`DATA BLOCK WITH
`GREATEST
`COMPRESSION RATIO
`
`APPEND NULL
`DESCRIPTOR TO
`UNENCODED INPUT
`DATA BLOCK
`
`728
`
`APPEND
`CORRESPONDING
`DESCRIPTOR
`
`OUTPUT ENCODED
`DATA BLOCK WITH
`DESCRIPTOR
`
`736
`
`OUTPUT UNENCODED
`DATA BLOCK WITH
`NULL DESCRIPTOR
`
`730
`
`738
`
`NO
`
`T r 742
`
`YES
`
`TERMINATE DATA
`COMPRESSION
`PROCESS
`
`RECEIVE NEXT DATA
`BLOCK FROM INPUT
`STREAM
`
`740
`
`_X•
`
`B
`
`FIG. 7b
`
`Comcast - Exhibit 1015, page 12
`
`

`

`lualud *S*11
`
`rt7,1
`7
`ts.6
`
`t.)
`o
`o
`
`91 JO II WIN
`
`Ill 17ZO'S6r9 Sfl
`
`DATA STREAM
`
`V
`INPUT DATA
`BLOCK
`PROCESSOR/
`COUNTER
`10 J
`
`-- 0.
`
`INPUT
`DATA —10-
`BUFFER
`
`20.1
`
`ENCODER El
`
`ENCODER E2
`
`ENCODER E3
`
`BUFFER/
`COUNTER 1
`
`BUFFER/
`COUNTER 2
`
`BUFFER/
`COUNTER 3
`
`ENCODER En
`
`BUFFER/
`COUNTER n
`
`V
`
`ENCODED DATA
`STREAM W/
`DESCRIPTOR
`
`COMPRESSION
`TYPE
`DESCRIPTION
`
`--\+-
`
`COMPRESSION
`RATIO
`—0.
`DETERMINATION/ —÷
`COMPARISON
`50I
`
`60J
`
`USER-
`SPECIFIED TIME
`
`-0. TIMER
`
`30)
`
`40J
`
`90 J
`
`ENCODER
`DESIRABILITY
`FACTORS
`
`70J
`
`V'
`FIGURE OF
`MERIT
`DETERMINATION
`
`80)
`
`FIG. 8
`
`Comcast - Exhibit 1015, page 13
`
`

`

`lualud *S*11
`
`IN
`
`91 JO Zi
`
`Ill 17ZO'S6r9 Sfl
`
`DATA STREAM
`
`E 1,1
`
`E 1,2
`
`E 1,n
`
`B/C 1,1
`
`B/C 1,2
`
`B/C 1,n
`
`DATA
`INPUT
`BLOCK —11. DATA
`COUNTER
`BUFFER
`
`10 )
`
`20J
`
`USER-
`SPECIFIED TIME
`
`TIMER
`
`90 J
`
`E 2,1
`
`-OP
`
`E 2,2
`
`E 2,n
`
`B/C 2,1
`
`B/C 2,2
`
`B/C 2,n
`
`E 3,1
`
`10. E 3,2
`
`E 3,n
`
`B/C 3,1
`
`B/C 3,2
`
`B/C 3,n
`
`E m,1
`
`E m,2
`
`E m,n
`
`B/C m,1
`
`B/C m,2
`
`B/C m,n
`
`30C
`
`40C
`
`ENCODER
`DESIRABILITY
`FACTORS
`
`70)
`
`FIG. 9
`
`COMPRESSION
`RATIO
`DETERMINATION
`
`50
`
`V
`
`COMPARISON ( FIGURE OF
`
`MERIT
`DETERMINATION
`
`80
`
`COMPRESSION
`TYPE
`DESCRIPTION
`
`60
`
`ENCODED DATA
`STREAM W/
`DESCRIPTOR
`
`Comcast - Exhibit 1015, page 14
`
`

`

`U.S. Patent
`
`Feb. 27, 2001
`
`Sheet 13 of 16
`
`US 6,195,024 B1
`
`100
`
`RECEIVE INITIAL
`DATA BLOCK FROM
`INPUT DATA STREAM
`
`102-
`B
`
`COUNT SIZE OF
`DATA BLOCK
`
`BUFFER DATA
`BLOCK
`
`106-
`
`INITIALIZE TIMER
`
`108
`
`APPLY INPUT DATA
`BLOCK TO FIRST
`ENCODING STAGE
`IN CASCADED
`ENCODER PATHS
`
`110
`
`TIME EXPIRED?
`
`116
`
`NO
`
`At_
`
`APPLY OUTPUT
`OF COMPLETED
`ENCODING
`STAGE TO NEXT
`ENCODING
`STAGE IN
`CASCADE PATH
`
`_/ -114
`
`*YES
`
`BUFFER
`ENCODED DATA
`BLOCK OUTPUT
`FROM
`COMPLETED
`ENCODING
`STAGE
`
`112 YES
`
`NO
`
`(-118
`
`STOP ENCODING
`PROCESS
`
`r120
`
`SELECT BUFFERED OUTPUT OF LAST
`ENCODING STAGE IN ENCODER
`CASCADE THAT COMPLETED ENCODING
`PROCESS WITHIN TIME LIMIT
`
`COUNT SIZE OF
`ENCODED DATA
`BLOCKS
`
`CALCULATE
`COMPRESSION
`RATIOS
`
``V
`COMPARE COMPRESSION
`RATIOS WITH THRESHOLD
`LIMIT
`
`1
`A
`
`FIG. 10a
`
`122
`
`124
`
`j -126
`
`Comcast - Exhibit 1015, page 15
`
`

`

`U.S. Patent
`
`Feb. 27, 2001
`
`Sheet 14 of 16
`
`US 6,195,024 B1
`
`A
`
`128
`
`IS
`COMPRESSION
`RATIO OF AT LEAST ONE
`ENCODED DATA BLOCK
`GREATER THAN
`THRESHOLD?
`
`YES
`
`CALCULATE FIGURE OF
`1341, MERIT FOR EACH ENCODED
`DATA BLOCK WHICH EXCEED
`THRESHOLD
`
`APPEND NULL
`DESCRIPTOR TO
`UNENCODED INPUT
`DATA BLOCK
`
`j 130
`
`136
`
`V
`SELECT ENCODED DATA
`BLOCK WITH GREATEST
`FIGURE OF MERIT
`
`
`
`I 138
`
`APPEND
`CORRESPONDING
`DESCRIPTOR
`
`OUTPUT UNENCODED
`DATA BLOCK WITH
`NULL DESCRIPTOR
`
`132
`
`OUTPUT ENCODED
`DATA BLOCK WITH
`DESCRIPTOR
`
`142
`
`NO
`
`( -146
`
`TERMINATE DATA
`COMPRESSION
`PROCESS
`
`YES
`V
`RECEIVE NEXT DATA
`BLOCK FROM INPUT
`STREAM
`
`,- 144
`
`B FIG. 10b
`
`Comcast - Exhibit 1015, page 16
`
`

`

`lualud *S*11
`
`IN
`
`91 JO Si
`
`Ill 17ZO'S6r9 Sil
`
`DATA W/ NULL
`DESCRIPTOR
`
`DECODER D1
`
`DECODER D2
`
`DECODER D3
`
`OUTPUT DATA
`BUFFER
`
`OUTPUT DATA
`STREAM
`
`DATA STREAM
`
`INPUT DATA
`BLOCK BUFFER
`
`DESCRIPTOR
`EXTRACTION —10-
`
`1100J
`
`1102 J
`
`1106)
`
`DECODER Dn
`
`1104)
`
`
`
`FIG. FIG. 11
`
`Comcast - Exhibit 1015, page 17
`
`

`

`U.S. Patent
`
`Feb. 27, 2001
`
`Sheet 16 of 16
`
`US 6,195,024 B1
`
`RECEIVE INITIAL
`DATA BLOCK FROM
`INPUT DATA STREAM
`
`f
`
`BUFFER DATA BLOCK
`
`1200
`
`1202
`
`EXTRACT DATA
`COMPRESSION TYPE
`DESCRIPTOR
`
`_/ -1204
`
`IS DATA
`COMPRESSION
`TYPE DESCRIPTO
`NULL?
`
`1206
`
`YES
`
`NO
`
`SELECT DECODER(S)
`CORRESPONDING TO
`DESCRIPTOR
`
`.7 - 1210
`
`DECODE DATA BLOCK USING
`SELECTED DECODER(S)
`
`1212
`
`51220
`
`RECEIVE NEXT
`DATA BLOCK IN
`INPUT STREAM
`
`YES
`
`NO
`
`( TERMINATE
`
`DECODING PROCESS
`
`FIG. 12
`
`1218
`
`Comcast - Exhibit 1015, page 18
`
`

`

`US 6,195,024 B1
`
`1
`CONTENT INDEPENDENT DATA
`COMPRESSION METHOD AND SYSTEM
`
`BACKGROUND
`
`1. Technical Field
`The present invention relates generally to data compres-
`sion and decompression and, more particularly, to systems
`and methods for providing content independent lossless data
`compression and decompression.
`2. Description of the Related Art
`Information may be represented in a variety of manners.
`Discrete information such as text and numbers are easily
`represented in digital data. This type of data representation
`is known as symbolic digital data. Symbolic digital data is
`thus an absolute representation of data such as a letter,
`figure, character, mark, machine code, or drawing.
`Continuous information such as speech, music, audio,
`images and video, frequently exists in the natural world as
`analog information. As is well-known to those skilled in the
`art, recent advances in very large scale integration (VLSI)
`digital computer technology have enabled both discrete and
`analog information to be represented with digital data.
`Continuous information represented as digital data is often
`referred to as diffuse data. Diffuse digital data is thus a
`representation of data that is of low information density and
`is typically not easily recognizable to humans in its native
`form.
`There are many advantages associated with digital data
`representation. For instance, digital data is more readily
`processed, stored, and transmitted due to its inherently high
`noise immunity. In addition, the inclusion of redundancy in
`digital data representation enables error detection and/or
`correction. Error detection and/or correction capabilities are
`dependent upon the amount and type of data redundancy,
`available error detection and correction processing, and
`extent of data corruption.
`One outcome of digital data representation is the continu-
`ing need for increased capacity in data processing, storage,
`and transmittal. This is especially true for diffuse data where
`increases in fidelity and resolution create exponentially
`greater quantities of data. Data compression is widely used
`to reduce the amount of data required to process, transmit,
`or store a given quantity of information. In general, there are
`two types of data compression techniques that may be
`utilized either separately or jointly to encode/decode data:
`lossless and lossy data compression.
`Lossy data compression techniques provide for an inexact
`representation of the original uncompressed data such that
`the decoded (or reconstructed) data differs from the original
`unencoded/uncompressed data. Lossy data compression is
`also known as irreversible or noisy compression. Entropy is
`defined as the quantity of information in a given set of data.
`Thus, one obvious advantage of lossy data compression is
`that the compression ratios can be larger than the entropy
`limit, all at the expense of information content. Many lossy
`data compression techniques seek to exploit various traits
`within the human senses to eliminate otherwise impercep-
`tible data. For example, lossy data compression of visual
`imagery might seek to delete information content in excess
`of the display resolution or contrast ratio.
`On the other hand, lossless data compression techniques
`provide an exact representation of the original uncom-
`pressed data. Simply stated, the decoded (or reconstructed)
`data is identical to the original unencoded/uncompressed
`data. Lossless data compression is also known as reversible
`
`5
`
`2 5
`
`2
`or noiseless compression. Thus, lossless data compression
`has, as its current limit, a minimum representation defined
`by the entropy of a given data set.
`There are various problems associated with the use of
`lossless compression techniques. One fundamental problem
`encountered with most lossless data compression techniques
`are their content sensitive behavior. This is often referred to
`as data dependency. Data dependency implies that the com-
`pression ratio achieved is highly contingent upon the content
`10 of the data being compressed. For example, database files
`often have large unused fields and high data redundancies,
`offering the opportunity to losslessly compress data at ratios
`of 5 to 1 or more. In contrast, concise software programs
`have little to no data redundancy and, typically, will not
`15 losslessly compress better than 2 to 1.
`Another problem with lossless compression is that there
`arc significant variations in the compression ratio obtained
`when using a single lossless data compression technique for
`data streams having different data content and data size. This
`20 process is known as natural variation.
`A further problem is that negative compression may occur
`when certain data compression techniques act upon many
`types of highly compressed data. Highly compressed data
`appears random and many data compression techniques will
`substantially expand, not compress this type of data.
`For a given application, there are many factors which
`govern the applicability of various data compression tech-
`niques. These factors include compression ratio, encoding
`30 and decoding processing requirements, encoding and decod-
`ing time delays, compatibility with existing standards, and
`implementation complexity and cost, along with the adapt-
`ability and robustness to variations in input data. A direct
`relationship exists in the current art between compression
`35 ratio and the amount and complexity of processing required.
`One of the limiting factors in most existing prior art lossless
`data compression techniques is the rate at which the encod-
`ing and decoding processes are performed. Hardware and
`software implementation tradeoffs are often dictated by
`40 encoder and decoder complexity along with cost.
`Another problem associated with lossless compression
`methods is determining the optimal compression technique
`for a given set of input data and intended application. In
`combat this problem, there are many conventional content
`45 dependent techniques which may be utilized. For instance,
`filetype descriptors are typically appended to file names to
`describe the application programs that normally act upon the
`data contained within the file. In this manner data types, data
`structures, and formats within a given file may be ascer-
`50 tamed. Fundamental problems with this content dependent
`technique are:
`(1) the extremely large number of application programs,
`some of which do not possess published or documented
`file formats, data structures, or data type descriptors;
`(2) the ability for any data compression supplier or
`consortium to acquire, store, and access the vast
`amounts of data required to identify known file descrip-
`tors and associated data types, data structures, and
`formats; and
`(3) the rate at which new application programs are devel-
`oped and the need to update file format data descrip-
`tions accordingly.
`An alternative technique that approaches the problem of
`selecting an appropriate lossless data compression technique
`65 is disclosed in U.S. Pat. No. 5,467,087 to Chu entitled "High
`Speed Lossless Data Compression System" ("Chu"). FIG. 1
`illustrates an embodiment of this data compression and
`
`55
`
`60
`
`Comcast - Exhibit 1015, page 19
`
`

`

`US 6,195,024 B1
`
`3
`4
`part of the MTF code string to perform entropy coding. This
`decompression technique. Data compression 1 comprises
`technique increases the compression rate without extending
`two phases, a data pre-compression phase 2 and a data
`the block size. Nakano employs multiple code tables within
`compression phase 3. Data decompression 4 of a com-
`a single entropy encoding unit to increase the lossless data
`pressed input data stream is also comprised of two phases,
`5 compression ratio for a given block size, somewhat reducing
`a data type retrieval phase 5 and a data decompression phase
`the data dependency of the encoding algorithm. Again, the
`6. During the data compression process 1, the data pre-
`problem with this technique is that it does not address the
`compressor 2 accepts an uncompressed data stream, identi-
`difficulties in dealing with a wide variety of data types.
`fies the data type of the input stream, and generates a data
`U.S. Pat. No. 5,809,176 to Yajima discloses a technique of
`type identification signal. The data compressor 3 selects a
`o dividing a native or uncompressed image data into a plu-
`data compression method from a preselected set of methods 1
`rality of streams for subsequent encoding by a plurality of
`to compress the input data stream, with the intention of
`identically functioning arithmetic encoders. This method
`producing the best available compression ratio for that
`demonstrates the technique of employing multiple encoders
`particular data type.
`to reduce the time of encoding for a single method of
`There are several problems associated with the Chu
`5 compression.
`method. One such problem is the need to unambiguously 1
`U.S. Pat. Nos. 5,583,500 and 5,471,206 to Allen, at al.
`identify various data types. While these might include such
`disclose systems for parallel decompression of a data stream
`common data types as ASCII, binary, or unicode, there, in
`comprised of multiple code words. At least two code words
`fact, exists a broad universe of data types that fall outside the
`are decoded simultaneously to enhance the decoding pro-
`three most common data types. Examples of these alternate
`20 cess. This technique demonstrates the prior art of utilizing
`data types include: signed and unsigned integers of various
`multiple decoders to expedite the data decompression pro-
`lengths, differing types and precision of floating point
`cess.
`numbers, pointers, other forms of character text, and a
`U.S. Pat. No. 5,627,534 to Craft teaches a two-stage
`multitude of user defined data types. Additionally, data types
`lossless compression process. A run length precompressed
`may be interspersed or partially compressed, making data
`25 output is post processed by a Lempel-Ziv dictionary sliding
`type recognition difficult and/or impractical. Another prob-
`window dictionary encoder that outputs a succession of
`lem is that given a known data type, or mix of data types
`fixed length data units. This yields a relatively high-speed
`within a specific set or subset of input data, it may be
`compression technique that provides a good match between
`difficult and/or impractical to predict which data encoding
`the capabilities and idiosyncrasies of the two encoding
`technique yields the highest compression ratio.
`30 techniques. This technique demonstrates the prior art of
`Chu discloses an alternate embodiment wherein a data
`employing sequential lossless encoders to increase the data
`compression rate control signal is provided to adjust specific
`compression ratio.
`parameters of the selected encoding algorithm to adjust the
`U.S. Pat. No. 5,799,110 to Israelsen, et al. discloses an
`compression time for compressing data. One problem with
`adaptive threshold technique for achieving a constant bit rate
`this technique is that the length of time to compress a given
`35 on a hierarchical adaptive multistage vector quantization. A
`set of input data may be difficult or impractical to predict.
`single compression technique is applied iteratively until the
`Consequently, there is no guarantee that a given encoding
`residual is reduced below a prespecified threshold. The
`algorithm or set of encoding algorithms will perform for all
`threshold may be adapted to provide a constant bit rate
`possible combinations of input data for a specific timing
`output. If the nth stage is reached without the residual being
`constraint. Another problem is that, by altering the param-
`40 less than the threshold, a smaller input vector is selected.
`eters of the encoding process, it may be difficult and/or
`U.S. Pat. No. 5,819,215 to Dobson, et al. teaches a method
`impractical to predict the resultant compression ratio.
`of applying either lossy or lossless compression to achieve
`Other conventional techniques have been implemented to
`a desired subjective level of quality to the reconstructed
`address the aforementioned problems. For instance, U.S.
`signal. In certain embodiments this technique utilizes a
`Pat. No. 5,243,341 to Seroussi et al. describes a class of
`45 combination of run-length and IIuffman encoding to take
`Lempel-Ziv lossless data compression algorithms that uti-
`advantage of other local and global statistics. The tradeoffs
`lize a memory based dictionary of finite size to facilitate the
`considered in the compression process are perceptible dis-
`compression and decompression of data. A second standby
`tortion errors versus a fixed bit rate output.
`dictionary is included comprised of those encoded data
`entries that compress the greatest amount of input data.
`When the current dictionary fills up and is reset, the standby 50
`dictionary becomes the current dictionary, thereby maintain-
`ing a reasonable data compression ratio and freeing up
`memory for newly encoded data strings. Multiple dictionar-
`ies are employed within the same encoding technique to
`increase the lossless data compression ratio. This technique 55
`demonstrates the prior art of using multiple dictionaries
`within a single encoding process to aid in reducing the data
`dependency of a single encoding technique. One problem
`with this method is that it does not address the difficulties in
`dealing with a wide variety of data types.
`U.S. Pat. No. 5,717,393 to Nakano, et al. teaches a
`plurality of code tables such as a high-usage code table and
`a low-usage code table in an entropy encoding unit. A
`block-sorted last character string from a block-sorting trans-
`forming unit is the move-to-front transforming unit is trans-
`formed into a move-to-front (MTF) code string. The entropy
`encoding unit switches the code tables at a discontinuous
`
`SUMMARY OF THE INVENTION
`The present invention is directed to systems and methods
`for providing content independent lossless data compression
`and decompression. In one aspect of the present invention,
`a method for providing content independent lossless data
`compression comprises the steps of:
`(a) receiving as input a block of data from a stream of
`data, the data stream comprising one of at least one data
`block and a plurality of data blocks;
`(b) counting the size of the input data block;
`(c) encoding the input data block with a plurality of
`lossless encoders to provide a plurality of encoded data
`blocks;
`(d) counting the size of each of the encoded data blocks;
`(e) determining a lossless data compression ratio obtained
`for each of the encoders by taking the ratio of the size
`of the encoded data block output from the encoders to
`the size of the input data block;
`
`60
`
`65
`
`Comcast - Exhibit 1015, page 20
`
`

`

`US 6,195,024 B1
`
`5
`
`6
`FIGS. 5a and 5b comprise a flow diagram of a data
`compression method according to another aspect of the
`present invention which illustrates the operation of the data
`compression system of FIG. 4;
`FIG. 6 is a block diagram of a content independent data
`compression system according to another embodiment of the
`present invention having an a priori specified timer that
`provides real-time or pseudo real-time of output data;
`FIGS. 7a and 7b comprise a flow diagram of a data
`10 compression method according to another aspect of the
`present invention which illustrates the operation of the data
`compression system of FIG. 6;
`FIG. 8 is a block diagram of a content independent data
`15 compression system according to another embodiment hav-
`ing an a priori specified timer that provides real-time or
`pseudo real-time of output data and an enhanced metric for
`selecting an optimal encoding technique;
`FIG. 9 is a block diagram of a content independent data
`20 compression system according to another embodiment of the
`present invention having an encoding architecture compris-
`ing a plurality of sets of serially-cascaded encoders;
`FIGS. 10a and 10b comprise a flow diagram of a data
`compression method according to another aspect of the
`25 present invention which illustrates the operation of the data
`compression system of FIG. 9;
`FIG. 11 is block diagram of a content independent data
`decompression system according to one embodiment of the
`present invention; and
`FIG. 12 is a flow diagram of a data decompression method
`according to one aspect of the present invention which
`illustrates the operation of the data compression system of
`FIG. 11.
`
`5
`(f) comparing each of the determined compression ratios
`with an a priori user specified compression threshold;
`(g) selecting for output the input data block and append-
`ing a null data type compression descriptor to the input
`data block, if all of the encoder compression ratios fall
`below the a priori specified compression threshold; and
`(h) selecting for output the encoded data block having the
`highest compression ratio and appending a correspond-
`ing data type compression descriptor to the selected
`encoded data block, if at least one of the compression
`ratios exceed the a priori specified compression thresh-
`old.
`In another aspect of the present invention, a timer is
`preferably added to measure the time elapsed during the
`encoding process against an a priori-specified time limit.
`When the time limit expires, only the data output from those
`encoders that have completed the present encoding cycle are
`compared to determine the encoded data with the highest
`compression ratio. The time limit ensures that the real-time
`or pseudo real-time nature of the data encoding is preserved.
`In another aspect of the present invention, the results from
`each encoder are buffered to allow additional encoders to be
`sequentially applied to the output of the previous encoder,
`yielding a more optimal lossless data compression ratio.
`In another aspect of the present invention, a method for
`providing content independent lossless data decompression
`includes the steps of receiving as input a block of data from
`a stream of data, extracting an encoding type descriptor from
`the input data block, decoding the input data block with one
`or more of a plurality of available decoders in accordance
`with the extracted encoding type descriptor, and outputting
`the decoded data block. An input data block having a null
`descriptor type extracted therefrom is output without being
`decoded.
`Advantageously, the present invention employs a plurality 35
`of encoders applying a plurality of compression techniques
`on an input data stream so as to achieve maximum com-
`pression in accordance with the real-time or pseudo real-
`time data rate constraint.