US007415530B2
`
`(12)
`
`United States Patent
`Fallon
`
`(10) Patent N0.:
`(45) Date of Patent:
`
`US 7,415,530 B2
`Aug. 19, 2008
`
`(54) SYSTEM AND METHODS FOR
`ACCELERATED DATA STORAGE AND
`RETRIEVAL
`
`(75) Inventor: James J Fallon, Armonk, NY (US)
`
`(73) Asslgnee: Realtlme 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(1)) by 0 days'
`(21) Appl' No‘: 11/553,426
`
`FOREIGN PATENT DOCUMENTS
`
`DE
`
`4127518
`
`2/1992
`
`Continued
`(
`)
`OTHER PUBLICATIONS
`Rice, Robert F., “Some Practical Universal Noiseless Coding Tech
`niques”, Jet Propulsion Laboratory, Pasadena, California, JPL Pub
`lication 79-22, Mar. 15, 1979.
`
`(Continued)
`Primary ExamineriDavidY Eng
`(74) Attorney, Agent, or FirmiRopes & Gray LLP
`
`(22) Filed:
`
`0a. 26, 2006
`
`(57)
`
`ABSTRACT
`
`(65)
`
`Prior Publication Data
`
`US 2007/0067483 A1
`
`Mar- 22, 2007
`
`Related U-s- Application Data
`(63) Continuation of application NO 10/628,795, ?led on
`Ju1_ 28’ 2003, HOW Pat NO 7,130,913, which is a
`Continuation of application NO_ 09/266,394, ?led on
`Man 11, 1999’ HOW Pat NO_ 6,601,104
`
`(51) Int CL
`(200601)
`G06F 13/00
`(52) US. Cl. .................................................... .. 709/231
`(58) Field of Classi?cation Search n
`_ 709/231
`709033’
`See application ?le for Complete Search history'
`
`(56)
`
`References Cited
`
`U.S. PATENT DOCUMENTS
`
`4,302,775 A 11/1981 Widergren et al.
`4,394,774 A
`7/1983 Widergren et al.
`4,574,351 A
`3/1986 Danget al.
`4,593,324 A
`6/1986 Ohkubo et al.
`4,682,150 A
`7/1987 Mathes et al.
`4,730,348 A
`3/1988 MacCrisken
`
`Systems and methods for providing accelerated data storage
`and retrieval utilizing lossless data compression and decom
`pression. A data storage accelerator includes one or a plurality
`of high speed data compression encoders that are con?gured
`to simultaneously or sequentially losslessly compress data at
`a rate equivalent to or faster than the transmission rate of an
`input data stream. The compressed data is subsequently
`stored in a target memory or other storage device Whose input
`data storage bandwidth is loWer than the original input data
`stream bandwidth. Similarly, a data retrieval accelerator
`includes one or a plurality of high speed data decompression
`decoders that are con?gured to simultaneously or sequen
`tiany losslessly decompress data at a rate equivalent to or
`faster than the input data stream from the target memory or
`storage device. The decompressed data is then output at rate
`data that is greater than the output rate from the target
`memory or data storage device. The data storage and retrieval
`accelerator method and system may employed: in a disk
`storage adapter to reduce the time required to store and
`retrieve data from computer to disk; in conjunction With ran
`dom access memory to reduce the time required to store and
`retrieve data from random access memory; in a display con
`troller to reduce the time required to send display data to the
`display controller or processor; and/ or in an input/output
`controller to reduce the time required to store, retrieve, or
`transmit data.
`
`(Continued)
`
`23 Claims, 20 Drawing Sheets
`
`Al
`
`Bullet
`Data am
`
`510
`
`I
`
`Delmrnlm
`m1 Bandwidth:
`
`e12
`
`Manly
`N“ ,1 Input Bandwidth a:
`/ Cnmprunlnn m 1
`EuIferm
`'
`
`we Data Black! in
`InDuk 5mm 7
`
`No
`
`Tanninlto Stmsgs
`Mamba PM!
`
`522
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 001
`
`

`
`US. PATENT DOCUMENTS
`Wright
`Makansi et al.
`Van Maren et al.
`Tsukiyama et al.
`Storer
`Dinan et al.
`Swanson
`O’Brien et al.
`Herrmann
`Hori et al.
`O’Brien
`Huang
`Fascenda
`Mitchell et al.
`Taaffe et al.
`Gibson et al.
`Krause et al.
`Langdon, Jr. et al.
`Dinwiddie, Jr. et al.
`SZymborski
`Chu
`Rabin et al.
`LantZ
`Taaffe et al.
`Keith et al.
`Hasegawa et al.
`Chevion et al.
`Hiyama et al.
`Normile et al.
`Westaway et al.
`Ett
`Dangi et al.
`Miller et al.
`Hannon, Jr.
`Seroussi et al.
`Jackson
`O’Brien et al.
`Osterlund et al.
`Toms et al.
`Balkanski et al.
`Barrett
`Carr
`Feigenbaum et al.
`Akins et al.
`Provino et al.
`Pattisam et al.
`Storer
`Hiyama et al.
`Allen et al.
`KulakoWski et al.
`Garahi
`WasileWski et al.
`Belsan et al.
`Graybill et al.
`Anderson et al.
`Chang et al.
`Whiting
`Perkins
`Yaso et al.
`Dicecco
`Normile et al.
`Chu
`Allen et al.
`Campbell et al.
`Alur et al.
`Remillard
`Jeong et al.
`Rao
`Mohler
`Hiatt et al.
`James
`
`6/1988
`2/1989
`9/1989
`10/1989
`10/1989
`12/1989
`3/1990
`5/1990
`9/1990
`10/1990
`1/1991
`7/1991
`9/1991
`9/1991
`9/1991
`9/1991
`2/1992
`3/1992
`5/1992
`6/1992
`9/1992
`10/1992
`12/1992
`1/1993
`2/1993
`3/1993
`4/1993
`5/1993
`5/1993
`7/1993
`7/1993
`7/1993
`8/1993
`8/1993
`9/1993
`9/1993
`9/1993
`9/1993
`11/1993
`12/1993
`2/1994
`3/1994
`4/1994
`5/1994
`10/1994
`10/1994
`1/1995
`1/1995
`1/1995
`2/1995
`3/1995
`3/1995
`4/1995
`4/1995
`4/1995
`5/1995
`5/1995
`5/1995
`7/1995
`9/1995
`10/1995
`11/1995
`11/1995
`12/1995
`1/1996
`1/1996
`2/1996
`4/1996
`4/1996
`6/1996
`7/1996
`
`4,754,351
`4,804,959
`4,870,415
`4,872,009
`4,876,541
`4,888,812
`4,906,995
`4,929,946
`4,953,324
`4,965,675
`4,988,998
`5,028,922
`5,045,848
`5,045,852
`5,046,027
`5,049,881
`5,091,782
`5,097,261
`5,113,522
`5,121,342
`5,150,430
`5,159,336
`5,175,543
`5,179,651
`5,187,793
`5,191,431
`5,204,756
`5,209,220
`5,212,742
`5,226,176
`5,227,893
`5,231,492
`5,237,460
`5,237,675
`5,243,341
`5,243,348
`5,247,638
`5,247,646
`5,263,168
`5,270,832
`5,287,420
`5,293,379
`5,307,497
`5,309,555
`5,355,498
`5,357,614
`5,379,036
`5,379,757
`5,381,145
`5,394,534
`5,396,228
`5,400,401
`5,403,639
`5,406,278
`5,406,279
`5,412,384
`5,414,850
`5,420,639
`5,434,983
`5,452,287
`5,461,679
`5,467,087
`5,471,206
`5,479,587
`5,483,470
`5,486,826
`5,495,244
`5,506,844
`5,506,872
`5,530,845
`5,533,051
`
`US 7,415,530 B2
`Page 2
`
`5,535,356
`5,537,658
`5,557,551
`5,557,668
`5,557,749
`5,561,824
`5,563,961
`5,574,952
`5,574,953
`5,576,953
`5,583,500
`5,590,306
`5,596,674
`5,604,824
`5,606,706
`5,611,024
`5,612,788
`5,613,069
`5,615,017
`5,621,820
`5,623,623
`5,623,701
`5,627,534
`5,627,995
`5,629,732
`5,630,092
`5,635,632
`5,635,932
`5,638,498
`5,640,158
`5,642,506
`5,649,032
`5,652,795
`5,652,857
`5,652,917
`5,654,703
`5,655,138
`5,666,560
`5,668,737
`5,671,389
`5,675,333
`5,686,916
`5,694,619
`5,696,927
`5,703,793
`5,715,477
`5,717,393
`5,717,394
`5,719,862
`5,721,958
`5,724,475
`5,729,228
`5,748,904
`5,757,852
`5,771,340
`5,778,411
`5,781,767
`5,784,572
`5,787,487
`5,796,864
`5,799,110
`5,805,932
`5,808,660
`5,809,176
`5,809,337
`5,812,789
`5,818,368
`5,818,369
`5,818,530
`5,819,215
`5,825,424
`5,825,830
`5,832,037
`
`7/1996
`7/1996
`9/1996
`9/1996
`9/1996
`10/1996
`10/1996
`11/1996
`11/1996
`11/1996
`12/1996
`12/1996
`1/1997
`2/1997
`2/1997
`3/1997
`3/1997
`3/1997
`3/1997
`4/1997
`4/1997
`4/1997
`5/1997
`5/1997
`5/1997
`5/1997
`6/1997
`6/1997
`6/1997
`6/1997
`6/1997
`7/1997
`7/1997
`7/1997
`7/1997
`8/1997
`8/1997
`9/1997
`9/1997
`9/1997
`10/1997
`11/1997
`12/1997
`12/1997
`12/1997
`2/1998
`2/1998
`2/1998
`2/1998
`2/1998
`3/1998
`3/1998
`5/1998
`5/1998
`6/1998
`7/1998
`7/1998
`7/1998
`7/1998
`8/1998
`8/1998
`9/1998
`9/1998
`9/1998
`9/1998
`9/1998
`10/1998
`10/1998
`10/1998
`10/1998
`10/1998
`10/1998
`11/1998
`
`Kim et al.
`Bakke et al.
`Craft
`Brady
`Norris
`Carreiro et al.
`Rynderman et al.
`Brady et al.
`Rust et al.
`Hugentobler
`Allen et al.
`Watanabe et al.
`Bhandari et al.
`Chui et al.
`Takamoto et al.
`Campbell et al.
`Stone
`Walker
`Choi
`Rynderman et al.
`Kim et al.
`Bakke et al.
`Craft
`Miller et al.
`MoskoWitZ et al.
`Carreiro et al.
`Fay et al.
`Shinagawa et al.
`Tyler et al.
`Okayama et al.
`Lee
`Burt et al.
`Dillon et al.
`Shimoi et a1.
`Maupin et al.
`Clark, 11
`Kikinis
`Moertl et al.
`Iler
`Saliba
`Boursier et al.
`Bakhmutsky
`Konno
`MacDonald et al.
`Wise et al.
`Kikinis
`Nakano et al.
`Schwartz et al.
`Lee et al.
`Kikinis
`Kirsten
`FranasZek et al.
`Huang et al.
`Jericevic et al.
`NakaZato et al.
`DeMoss et al.
`Inoue et al.
`Ro stoker et al.
`Hashimoto et al.
`Callahan
`Israelsen et al.
`KaWashima et al.
`Sekine et al.
`Yajima
`Hannah et al.
`DiaZ et al.
`Langley
`Withers
`Can?eld et al.
`Dobson et al.
`Can?eld et al.
`Kopf
`Park
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 002
`
`

`
`US 7,415,530 B2
`Page 3
`
`5,832,126 A 11/1998 Tanaka
`5,836,003 A 11/1998 Sadeh
`5,838,996 A 11/1998 deCarmo
`5,839,100 A 11/1998 Wegener
`5,841,979 A 11/1998 Schulhofet al.
`5,847,762 A 12/1998 Can?eld
`5,861,824 A
`1/1999 Ryu et al.
`5,861,920 A
`1/1999 Mead et al.
`5,864,342 A
`1/1999 Kajiya et al.
`5,867,167 A
`2/1999 Deering
`5,867,602 A
`2/1999 Zandi et al.
`5,870,036 A
`2/1999 FranasZek et a1.
`5,870,087 A
`2/1999 Chau
`5,872,530 A
`2/1999 Domyo et a1.
`5,883,975 A
`3/1999 Narita et al.
`5,886,655 A
`3/1999 Rust
`5,889,961 A
`3/1999 Dobbek
`5,915,079 A
`6/1999 Vondran, Jr. et al.
`5,917,438 A
`6/1999 Ando
`5,920,326 A
`7/1999 Rentschler et al.
`5,936,616 A
`8/1999 Torborg, Jr. et al.
`5,949,355 A
`9/1999 Panaoussis
`5,955,976 A
`9/1999 Heath
`5,960,465 A
`9/1999 Adams
`5,964,842 A 10/1999 Packard
`5,968,149 A 10/1999 Jaquette et al.
`5,973,630 A 10/1999 Heath
`5,974,235 A 10/1999 Nunally et al.
`5,974,471 A 10/1999 Belt
`5,978,483 A 11/1999 Thompson, Jr. et al.
`5,982,723 A 11/1999 Kamatani
`5,991,515 A 11/1999 Fall et al.
`5,996,033 A 11/1999 Chiu-Hao
`6,000,009 A 12/1999 Brady
`6,002,411 A 12/1999 Dye
`6,003,115 A 12/1999 Spear et al.
`6,008,743 A 12/1999 Jaquette
`6,011,901 A
`1/2000 Kirsten
`6,014,694 A
`1/2000 Aharoniet al.
`6,026,217 A
`2/2000 Adiletta
`6,028,725 A
`2/2000 Blumenau
`6,031,939 A
`2/2000 Gilbert et al.
`6,032,148 A
`2/2000 Wilkes
`6,061,398 A
`5/2000 Satoh et a1.
`6,073,232 A
`6/2000 Kroeker et al.
`6,075,470 A
`6/2000 Little et al.
`6,091,777 A
`7/2000 GuetZ et al.
`6,094,634 A
`7/2000 Yahagiet al.
`6,097,520 A
`8/2000 Kadnier
`6,104,389 A
`8/2000 Ando
`6,105,130 A
`8/2000 Wu et al.
`6,128,412 A 10/2000 Satoh
`6,141,053 A 10/2000 Saukkonen
`6,145,069 A 11/2000 Dye
`6,169,241 B1
`1/2001 ShimiZu
`6,172,936 B1
`1/2001 Kitazaki
`6,173,381 B1
`1/2001 Dye
`6,182,125 B1
`1/2001 Borella et a1.
`6,192,082 B1
`2/2001 Moriarty et al.
`6,195,024 B1
`2/2001 Fallon
`6,195,465 B1
`2/2001 Zandi et al.
`6,222,886 B1
`4/2001 Yogeshwar .......... .. 375/240.23
`6,225,922 B1
`5/2001 Norton
`6,226,667 B1
`5/2001 Matthews et al.
`6,226,740 B1
`5/2001 Iga
`6,253,264 B1
`6/2001 Sebastian
`6,272,178 B1
`8/2001 Nieweglowskiet al.
`6,272,627 B1
`8/2001 Mann
`6,272,628 B1
`8/2001 Aguilar et al.
`6,282,641 B1
`8/2001 Christensen
`6,308,311 B1
`10/2001 Carmichael et al.
`6,309,424 B1
`10/2001 Fallon
`6,317,714 B1
`11/2001 Del Castillo et a1.
`
`12/2001 Schaefer
`6,330,622 B1
`2/2002 Booth
`6,345,307 B1
`5/2002 Satoh
`6,392,567 B2
`6/2002 Chen et al.
`6,404,931 B1
`7/2002 Rhee
`6,421,387 B1
`8/2002 Kari
`6,434,168 B1
`8/2002 Esfahaniet a1.
`6,434,695 B1
`8/2002 Blumenau
`6,442,659 B1
`9/2002 Toorians
`6,449,682 B1
`9/2002 Morein
`6,452,602 B1
`10/2002 Teoman et al.
`6,463,509 B1
`11/2002 Lipasti
`6,487,640 B1
`6,489,902 B2 12/2002 Heath
`6,513,113 B1
`1/2003 Kobayashi
`6,529,633 B1
`3/2003 Easwar et al.
`6,532,121 B1
`3/2003 Rustet a1. .................... .. 360/8
`6,539,456 B2
`3/2003 Stewart
`6,542,644 B1
`4/2003 Satoh
`6,577,254 B2
`6/2003 Rasmussen
`6,590,609 B1
`7/2003 Kitade et al.
`6,597,812 B1
`7/2003 Fallon et al.
`6,601,104 B1
`7/2003 Fallon
`6,604,040 B2
`8/2003 Kawasaki et al.
`6,604,158 B1
`8/2003 Fallon
`6,606,040 B2
`8/2003 Abdat
`6,606,413 B1
`8/2003 Zeineh
`6,609,223 B1
`8/2003 Wolfgang
`6,618,728 B1
`9/2003 Rail
`6,624,761 B2
`9/2003 Fallon
`6,650,261 B2 11/2003 Nelson et al.
`6,661,839 B1
`12/2003 Ishida et al.
`6,661,845 B1
`12/2003 Herath
`6,704,840 B2
`3/2004 Nalawadi et al.
`6,711,709 B1
`3/2004 York
`6,717,534 B2
`4/2004 Yokose
`6,731,814 B2
`5/2004 Zeck et al.
`6,745,282 B2
`6/2004 Okada et al.
`6,748,457 B2
`6/2004 Fallon et al.
`6,756,922 B2
`6/2004 Ossia
`6,810,434 B2 10/2004 Muthujumaraswathy et al.
`6,856,651 B2
`2/2005 Singh
`6,885,316 B2
`4/2005 Mehring
`6,885,319 B2
`4/2005 Geiger et al.
`6,888,893 B2
`5/2005 Li et al.
`6,909,383 B2
`6/2005 Shokrollahiet al.
`6,944,740 B2
`9/2005 Abaliet al.
`7,054,493 B2
`5/2006 Schwartz
`7,102,544 B1
`9/2006 Liu
`7,130,913 B2 10/2006 Fallon
`7,161,506 B2
`1/2007 Fallon
`7,181,608 B2
`2/2007 Fallon et al.
`7,190,284 B1
`3/2007 Dye et al.
`7,321,937 B2
`1/2008 Fallon
`2001/0031092 A1 10/2001 Zeck et al.
`2001/0032128 A1 10/2001 Kepecs
`2001/0052038 A1 12/2001 Fallon et al.
`2002/0037035 A1
`3/2002 Singh
`2002/0080871 A1
`6/2002 Fallon et al.
`2002/0101367 A1
`8/2002 Geiger et al.
`2002/0104891 A1
`8/2002 Otto
`2002/0126755 A1
`9/2002 Li et al.
`2002/0191692 A1 12/2002 Fallon et al.
`2003/0030575 A1
`2/2003 Frachtenberg et al.
`2003/0034905 A1
`2/2003 Anton et al.
`2003/0084238 A1
`5/2003 Okada et al.
`2003/0142874 A1
`7/2003 Schwartz
`2003/0191876 A1 10/2003 Fallon
`2004/0042506 A1
`3/2004 Fallon et al.
`2004/0073710 A1
`4/2004 Fallon
`2006/0015650 A1
`1/2006 Fallon
`2006/0181441 A1
`8/2006 Fallon
`2006/0181442 A1
`8/2006 Fallon
`2006/0184696 A1
`8/2006 Fallon
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 003
`
`

`
`US 7,415,530 B2
`Page 4
`
`2006/0190644 A1
`2006/0195601 A1
`2007/0043939 A1
`2007/0050514 A1
`2007/0050515 A1
`2007/0083746 A1
`2007/0109154 A1
`2007/0109155 A1
`2007/0109156 A1
`2007/0174209 A1
`
`8/2006 Fallon
`8/2006 Fallon
`2/2007 Fallon et al.
`3/2007 Fallon
`3/2007 Fallon
`4/2007 Fallon et al.
`5/2007 Fallon
`5/2007 Fallon
`5/2007 Fallon
`7/2007 Fallon et al.
`
`FOREIGN PATENT DOCUMENTS
`
`EP
`EP
`EP
`EP
`EP
`EP
`EP
`EP
`GB
`JP
`JP
`JP
`W0
`W0
`W0
`W0
`
`0164677
`0185098
`0283798
`0405572
`0493130
`0587437
`0595406
`0718751
`2162025
`6051989
`9188009
`11149376
`W0 9414273
`W0 9429852
`W0 9502873
`W0 9748212
`
`12/1985
`6/1986
`9/1988
`1/1991
`7/1992
`3/1994
`5/1994
`6/1996
`1/1986
`2/1994
`7/1997
`6/1999
`6/1994
`12/1994
`1/1995
`12/1997
`
`OTHER PUBLICATIONS
`
`Anderson, J ., et al. “Codec squeezes color teleconferencing through
`digital telephone lines”, Electronics 1984, pp. 113-115.
`Venbrux, Jack, “A VLSI Chip Set for High-Speed Lossless Data
`Compression”, IEEE Trans. On Circuits and Systems forVideo Tech
`nology, vol. 2, No. 44, Dec. 1992, pp. 381-391.
`“Fast Dos Soft Boot”, IBM Technical Disclosure Bulletin, Feb. 1994,
`vol. 37, Issue No. 2B, pp. 185-186.
`“Operating System Platform Abstraction Method”, IBM Technical
`Disclosure Bulletin, Feb. 1995, vol. 38, Issue No. 2, pp. 343-344.
`
`Murashita, K., et al., “High-Speed Statistical Compression using
`Self-organized Rules and Predetermined Code Tables”, IEEE, 1996
`Data Compression Conference.
`Coene, W., et al. “A Fast Route For Application of Rate-distortion
`Optimal Quantization in an MPEG Video Encoder” Proceedings of
`the International Conference on Image Processing, Lausanne, Swit
`zerland, IEEE, Sep. 16, 1996, pp. 825-828.
`Rice, Robert, “Lossless Coding Standards for Space Data Systems”,
`IEEE 1058-6393/97, pp. 577-585.
`Yeh, Pen-Shu, “The CCSDS Lossless Data Compression Recom
`mendation for Space Applications”, Chapter 16, Lossless Compres
`sion Handbook, Elsevier Science (USA), 2003, pp. 311-326.
`Millman, Howard, “Image and video compression”, ComputerWorld,
`vol. 33, Issue No. 3, Jan. 18, 1999, pp. 78.
`“IBM boosts your memory”, Geekcom [online], Jun. 26, 2000
`[retrieved on Jul. 6, 2007], <URL: http://WWWgeek.com/ibm-boosts
`your-memory/> .
`“IBM Research Breakthrough Doubles Computer Memory Capac
`ity”, IBM Press Release [online], Jun. 26, 2000 [retrieved on Jul. 6,
`2007], <URL: http://WWW-03.ibm.com/press/us/en/pressrelease /
`1653.Wss>.
`“ServerWorks To Deliver IBM’s Memory eXpansion Technology in
`Next-Generation Core Logic for Servers”, ServerWorks Press
`Release [online], Jun. 27, 2000 [retrieved on Jul. 14, 2000], <URL:
`http://WWW.serverWorkscom/neWs/press/ 000627.html>.
`Abali, B., et al., “Memory Expansion Technology (MXT) Software
`support and performance”, IBM Journal of Research and Develop
`ment, vol. 45, Issue No. 2, Mar. 2001, pp. 287-301.
`Franaszek, P A., et al., “Algorithms and data structures for com
`pressed-memory machines”, IBM Journal of Research and Develop
`ment, vol. 45, Issue No.2, Mar. 2001, pp. 245-258.
`Franaszek, P. A., et al., “On internal organization in compressed
`random-access memories”, IBM Journal of Research and Develop
`ment, vol. 45, Issue No.2, Mar. 2001, pp. 259-270.
`Smith, T.B., et al., “Memory Expansion Technology (MXT) Com
`petitive impact”, IBM Journal of Research and Development, V0. 45,
`Issue No. 2, Mar. 2001, pp. 303-309.
`Tremaine, R. B., et al., “IBM Memory Expansion Technology
`(MXT)”, IBM Journal of Research and Development, vol. 45, Issue
`No. 2, Mar. 2001, pp. 271-285.
`* cited by examiner
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 004
`
`

`
`US. Patent
`
`Aug. 19, 2008
`
`Sheet 1 0f 20
`
`US 7,415,530 B2
`
`
`
`Ema 593G
`
`W 2695
`
`8 $ 8
`
`F mmDGE
`
`_m>wEwm A @9205 A wmEBw
`
`
`636x894 w2>w0 636684‘ \_
`Ema Ema Ema [I
`
`
`
`
`
`2825
`Ema Ens
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 005
`
`

`
`US. Patent
`
`Aug. 19, 2008
`
`Sheet 2 0f 20
`
`US 7,415,530 B2
`
`Receive InitiaI
`Data Block From
`Input Data
`Stream
`
`200
`
`I
`
`Compress Data
`Block with
`——->
`Encoder(s)
`
`202
`
`Store Data
`
`204
`
`More Data Blocks in
`Input Stream ?
`
`Terminate Storage
`Acceleration Process
`
`208
`
`YES
`
`I
`
`Receive Next Data
`Block From Input
`Stream
`
`210
`
`FIGURE 2
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 006
`
`

`
`US. Patent
`
`Aug. 19, 2008
`
`Sheet 3 0f 20
`
`US 7,415,530 B2
`
`Retrieve Initial
`Data Block
`From Storage
`Device
`
`300
`
`Decompress Data
`Block with
`Decoder(s)
`
`302
`
`Output Accelerated
`Data Block
`
`304
`
`More Data Blocks
`For Output Stream ?
`
`Terminate Retrieval
`Acceleration Process
`
`306
`
`308
`
`Yes
`
`Retrieve Next
`Data Block
`From Storage
`Device
`
`310
`
`FIGURE 3
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 007
`
`

`
`U.S. Patent
`
`Aug. 19,2008
`
`Sheet 4 of 20
`
`US 7,415,530 B2
`
`__.n_OI._.m__>_ _MH“n._____v_oo_m_Ema__vxoo_m_San._mv_oo_mEma_Nv_uo_mEma_:_oo_mEma_v_8_mEma_w>_mumm__“mzmomm__wzmomm_wzmomm_m>m_omm“mzmowm._______________._QPHHE"m.._.uE."E.__m2oE_mE_._.
`
`
`
`
`
`
`
`wmm.qEoowwmEEo0mmmEEo0mmm:aEoommmEEoommmasoo
`
`-__.—.-__._....——_.-.—_.—._—
`
`—.———-—.—.—-_—.—_..———__
`
`
`
`
`
`
`
`
`
`C_8_m_San_t_8_m_Ema?_8_m_EmaNx8_m38I85Emax8_m98
`
`
`
`
`
`umvoocm93wvmuoocm98wUwuoocmSSWvwuoocw98mcwuoocw92m882$22m
`
`C_oo_mEmavv_8_m98Nv_8_m98Nx8_mEma.x8_mEmav_8_m98
`
`T|I|l'
`
`_INolo_J.m.._>_.
`
`
`
`wmmaEoommmaEoommmafioomwmafioom$aEoo
`
`.——.—.—_..—_._.—._._——..———-
`
`.———.__.—....—_——._._—._——-
`
`—._—..———.._...._——_.——_—-
`
`
`
`
`
`
`
`
`
`
`
`3-;x8_m_EmaNx8_m38Nx8_m28Fx8_mflan.x8_m38
`
`uwnoocm99$
`
`
`
`AN-_Vv_8_mEma
`
`uwuoocm23m
`
`Nv_8_mEma
`
`umvoocm29$
`
`Fx8_msun.
`
`9»manor.
`
`uwuoocmm._9m
`
`V_8_m_Ema
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 008
`
`—_.—.——-_-._.—_....—_.—.—
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 008
`
`

`
`U.S. Patent
`
`g
`
`00
`
`Sheet 5 of 20
`
`5:5M
`
`2B
`
`_______.________
`
`0:
`
`wmo._aEoowmmEEoowmm::50 8+:3c@v_oo_m_98xoo_m_Emav_oo_m+m..mov_oo_mn__EmaU.mww.n_Eoo
`
`
`
`
`
`
`
`M TJij?:..._%m.2_HHHH_____u@“v_oo_m_c
`
`Ema“_v_oo_A%+%mn__xooA_m_+.%mOxoo_mEma“_%m>_momm__mzmomm_o>w_owm_“mzwomm
`
`____
`
`I-
`
`CE:_EHH
`
`
`
`_m>.m.E_mE_._.
`
`_________._____
`
`
`
`c:-53+;_v_oo_mEmaV_8_mEmaxoo_mEmav_oo_mEmaxoo_mEma
`
`
`mmmEEo0mwm:aEoOmwmasoommwEEoowmoEEoo
`
`
`
`
`
`c
`
`umuoocm905
`
`x8_m£8
`
`
`
`vmuoocmm._£m
`
`x8_mEma
`
`3+;
`
`:.+_V
`
`v_8_mEma
`
`vwuoocm905
`
`tmuoocm92m
`
`fio_m£8
`
`_NDO_._._..n.=>_
`
`
`
`
`
`Sv_8_mEmaxoo_mEmax8_m98xoo_mEmaxoo_m_Ema605EmaUuouoocmeemvwuoocw9.05umuoocm29momcoocw905umuoocwm._2wumuoocm9.05
`
`
`
`_______________
`
`
`
`
`
`
`
`
`
`N3mm:w_u_
`
`7,::-58-5_:-_.
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 009
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 009
`
`
`

`
`U.S. Patent
`
`Aug. 19,2008
`
`Sheet 6 of 20
`
`US 7,415,530 B2
`
`.....>o_.aow_
`
`_v_oo_m_98
`
`m>oEwm
`
`wv_8_mman.
`
`m>e_.:ow_
`
`w>o_=om_
`
`mx8_mEma
`
`NV_8_m9.3
`
`m>oEmm_
`
`wv_8_m$8
`
`mmmafioooo
`
`_v_oo_m98
`
`mmmEEoomn_
`
`vxoo_m_98
`
`umuoomo59:0
`
`_v_oo_m28
`
`nmfioomoS930
`
`vv_oo_mEma
`
`mmmaEoomn__mwmEEooon_".
`
`UOUO0@Q53:03UGUOOOD33:0_"mxoo_mEma_Nv_oo_m£8
`
`€_8_m_23“~;_8_m28
`
`__
`
`—_.—_._.—..—_..—.-—.__.—_.——
`
`mmwEEoomn_
`
`Vv_8_m_Ema
`
`.———.__._..._——.__.__.___.._
`
`umnoomo3930
`_.x8_m£8
`uwuoowoS930
`
`x8_m98
`
`
`
`_mZmE_®C..__._-
`
`o>m_=mm
`
`V_8_m98
`
`_.m_dI._..u.=>_
`
`mmm.aEoomQ
`
`x8_m£8
`
`mmmaEooon_
`
`
`
`2-;x8_mEma
`
`mmmaeoomn
`
`mv_8_mEma
`
`umcoomo59:0
`
`asv_8_mEma
`
`umuoomo59:0
`
`Nxoo_m.28
`
`m".L_8_mEma_
`
`mmmmnwz
`
`vmuoomn_S9.:O___~v_8.mEma_C_8_m£8
`mmmEEoomn__mmmEEoomo__
`
`_______NDOI._.m__>_
`
`.______.________
`
`mmmEEoomn_
`
`x8_m_Ema
`
`umnoomoS330
`
`x8_msac
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 010
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 010
`
`

`
`U.S. Patent
`
`Aug. 19,2008
`
`Sheet 7 of 20
`
`Us 7,415,530 B2
`
`_
`
`__.._._._._...
`
`_,.___.._.__._._.._—._.___....
`
`.._._._._._..._...__.._—__.._-
`
`C
`
`umnoomoS920
`
`x8_mman
`
`nmuoowo59:0
`
`xoo_m_Ema
`
`2-5
`
`C
`
`mmmaeoooo
`
`xoo_mEma
`
`____
`
`wmmaeoomo““mm2aEoomo
`
`v_oo_mEma__v_oo_m_QED
`
`
` uouoomo53:0__umuooooHDQHJO"___:-5u":+_V
`_m3.5uu_xosmEma""x8_mman.
`
`gmmanor.
`
`C
`
`mmm8_Eoooo
`
`x8_mEma
`
`mwm:aEoown_
`
`xoo_m_98
`
`GE
`
`:
`
`uwuoomo59:0
`
`V_8_mEma
`
`xoo_m_Ema
`
`5+;
`
`_.—._——_.—.._—.—_.—-——-—_ —._._-—._—_.—.____..__.__-
`
`nmuoowo5330
`cmvoomo3230
`umuoomo53:0
`
`fi+5.r
`
`CE?
`
`:._.
`
`3::
`
`:+_¥
`
`
`
`_m>.wE_mE_._.
`
`C
`
`m>mEom
`
`xoo_m98
`
`®>®_.5®W_
`
`v.8_m_man.
`
`Am+:
`
`_.—.——.—-—_-
`
`®>0_._“_.®W_
`
`v_8_mmam
`
`3+:
`
`mmmEEoowQ
`
`xoo_m9.8
`
`AEv
`
`m>m_:mm
`
`v_oo_mEma
`
`_\DOI._.m_>_
`
`mmmafioowo
`
`v_oo_m«fin.
`
`x8_mEma
`
`mmmaEoomo
`
`
`
`6o_m.28
`
`NDOI._.m=>_
`
`wmm._aEoown_
`
`v_8_m£3
`
`:.+_V
`
`v_8_m_Ema
`
`v_8_m£8
`
`2-;
`
`UmuoomnS930
`cmvoomoS930
`
`v_8_mEma
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 011
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 011
`
`

`
`US. Patent
`
`Aug. 19, 2008
`
`Sheet 8 0f 20
`
`US 7,415,530 B2
`
`Receive Initial
`Data Block From
`Input Data
`Stream
`
`600
`
`Time & Count
`Data Block
`
`602
`
`l
`
`Buffer
`Data Block
`
`604
`
`l
`
`Compress Data
`Block with
`Encoder(s)
`
`606
`
`i
`
`Time & Count
`Data Block
`
`608
`
`i
`
`A
`
`FiGURE 6a
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 012
`
`

`
`US. Patent
`
`Aug. 19, 2008
`
`Sheet 9 0f 20
`
`US 7,415,530 B2
`
`A i
`
`Buffer
`Data Block
`
`610
`
`Determine
`Compression Ratio
`and Bandwidths
`
`612
`
`Store Data
`
`614
`
`Receive Next Data
`Block From input
`Stream
`
`624
`
`ompression
`Ratio and Input
`Bandwidth
`Compatible
`
`Modify:
`No’ Input Bandwidth or
`Compression or
`Buffering
`
`.
`
`616
`
`618
`
`Yes *
`
`ore Data Blocks in
`input Stream ?
`
`No
`
`Terminate Storage
`Acceleration Process
`
`622
`
`FIGURE 6b
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 013
`
`

`
`US. Patent
`
`Aug. 19, 2008
`
`Sheet 10 0f 20
`
`US 7,415,530 B2
`
`700
`
`Retrieve Initial
`Data Block
`From Storage
`Device
`
`l
`
`Time & Count
`Data Block
`
`702
`
`i
`
`Buffer
`Data Block
`
`704
`
`1
`
`Decompress Data
`Btock with
`Decoder(s)
`
`706
`
`i
`
`Time & Count
`Data Block
`
`708
`
`l
`
`A
`
`FIGURE 7a
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 014
`
`

`
`US. Patent
`
`Aug. 19, 2008
`
`Sheet 11 0f 20
`
`US 7,415,530 B2
`
`Al
`
`Buffer
`Data Block
`
`1
`
`Determine
`Decompression
`Ratio and
`Bandwidths
`
`t
`
`710
`
`712
`
`Output Accelerated
`Data Block
`
`714
`
`[__
`
`Retrieve Next Data
`Block From
`Storage Device
`
`724
`
`Decompression
`Ratio and Output
`Bandwidth
`Compatible
`'2
`
`Yes 4
`
`Modify:
`Output Bandwidth
`No>
`or Decompression
`or Buffering
`
`716
`
`718
`
`More Data Blocks
`for Output Stream ?
`
`Terminate Retrieval
`Acceleration Process
`
`720
`
`722
`
`FIGURE 7b
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 015
`
`

`
`U.S. Patent
`
`Aug. 19,2008
`
`Sheet 12 of 20
`
`US 7,415,530 B2
`
`sunSnoocm
`
`xiE35
`
`..8m.=oww.u
`
`:o_mmoEEo0
`
`ma>._.
`
`cozatomwo
`
`
`
`ozmm:o_mmmaEoo
`
`Eo=m:_E..m.oo
`
`:om_._mqEoO
`
`r._Ec:on<._mt_._m_
`
`N._9c:oO\._wt:m_
`
`mEczootwtsm
`
`x8_mman
`
`._wE:oo
`
`sun
`
`Emuhw
`
`
`
`Emawafloum
`
`Awvmo_>wn_
`
`@oo_>momomtwE_
`mmmhoamEma
`
`39.
`
`mmanor.
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 016
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 016
`
`
`
`
`
`
`
`

`
`U.S. Patent
`
`Aug. 19,2008
`
`Sheet 13 of 20
`
`US 7,415,530 B2
`
`sun53:0
`
`Emobm
`
`EBuoowo
`
`NO350000
`
`
`
`u8Q.tumaQ=32\§Emu
`
`
`._ot:mxoo_m_Ema0San.53:08_%88.oE_._ommoEma5%.E.8_>mn_omm..w9w
`Etzmcozomzxm
`
`
`
`
`
`
`wmm.o..w#D
`
`co._ouoomn_
`
`S9.
`
`a.O_..._
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 017
`
`00wt0%.:
`
`Awvmu_>wn_
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 017
`
`
`
`
`
`
`
`
`

`
`U.S. Patent
`
`Aug. 19,2008
`
`Sheet 14 of 20
`
`US 7,415,530 B2
`
`59:09.3
`
`Emwbw
`
`wmm..o..m
`
`.99.w_moo<
`
`.ommmo8n_
`
`_s_m_n_9mo_m:<
`
`t®>r_OO
`
`O
`
`$59.582>
`
`3
`
`83
`
`9.2
`
`82
`
`owe.
`
`ox:
`
`Smmaor.
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 018
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 018
`
`
`
`

`
`U.S. Patent
`
`Aug. 19,2008
`
`Sheet 15 of 20
`
`US 7,415,530 B2
`
`
`
`>m_Qm_n_o._.
`
`mo_>mD
`
`>m_am_n_
`
`.m£mE.o.._
`
`END
`
`_m>mEm~_
`
`.Bm.m_moo<
`
`Ema3&5
`
`Emmbm
`
`om:
`
`ow:
`
`om:
`
`ow
`
`_%manor.
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 019
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 019
`
`
`
`

`
`U.S. Patent
`
`Aug. 19,2008
`
`Sheet 16 of 20
`
`US 7,415,530 B2
`
`59:03.8
`
`Emwbm
`
`mmmkzm
`
`..9m._m_moo<
`
`_£_m_o
`
`tm>:oo
`
`59..
`
`x:_>_
`
`OOO
`
`Emamo_m:<
`
`mow,
`
`
`
`_£_m_o_m__2mn_
`
`sun.
`
`2.8_m_.mw
`
`GONtWu:_
`
`000
`
`
`
`_m:m_D_m_5m
`
`E8
`
`Nem_m:o_.._
`
`mvN_.
`
`SN_.
`
`89
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 020
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 020
`
`
`
`

`
`U.S. Patent
`
`Aug. 19,2008
`
`Sheet 17 of 20
`
`US 7,415,530 B2
`
`Select Initial
`.
`.
`Parallel Digital
`Data With Input
`Mux
`
`
`.
`.
`.
`Select Initial Serail
`.
`Data
`Input
`
`
`1 12
`3
`
`1306
`
`1308
`
`Convert Serial
`D ta F
`t
`81
`
`Orma
`
`
`
`
`
`Buffer Serial
`Digital Data
`
`1310
`
`
`
`Latch Parallel
`D.
`.t
`'
`I
`tD t
`'9' 3 "PU 3 8
`
`
`
`Buffer Parallel
`Digital Data
`
`Select lnitial
`
`.
`Analog Data With
`Input Analog
`Mux
`
`1300
`
`Analog to Digital
`Convert lnput
`Signal
`
`1302
`
`Buffer Digitized
`Analog Data
`
`1304
`
`New Analog
`ata Availabl
`
`N°
`
`New Parallel
`ata Availabl
`
`
`
`N°
`
`
`
`
`
`1314
`
`1316
`
`A
`
`N°’
`
`New Serial
`ata Availabl
`
`
`
`1322
`
`
`
`1318
`
`1320
`
`Compress lnput Data Block
`
`1324
`
`Output Encoded
`Data Block
`
`1326
`
`FIGURE 13
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 021
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 021
`
`

`
`U
`
`
`
`S.San.mo_m:<
`
`aP
`
`0000
`
`hS
`
`1
`
`.m
`
`2
`
`mWLnlwo
`
`2101,33my_m._m_o
`_m__m._mn_A23
`
`OOO
`
`mo_m:<2_9_m_n_
`
`tw>coO
`
`OS;
`
`
`
`man._£_m_o
`
`
`
`0_E_m_o_m__mm
`
`28
`
`U0OO
`
`£8_m_.mm
`
`oomtmt:
`
`8O91.
`
`mm:
`
`om:
`
`4.}7S
`
`2B035,
`
`H#3
`
`O31.
`
`83
`
`3mm_:w_n_
`
`_m>mEm~.._
`
`._8m.m_woo<
`
`8
`
`Ema3%.
`
`Emmbw
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 022
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 022
`
`
`
`
`
`
`
`

`
`U.S. Patent
`
`Aug. 19,2008
`
`Sheet 19 of 20
`
`US 7,415,530 B2
`
`Receive lnitial
`
`Data Block
`
`1500
`
`
`
`Decompress Data
`Block
`
`1502
`
`No
`
` ls Data
`Digital Parallel
`Data ?
`
`
`
`
`
`1510
`
`No
`
` ls
`Data Serial
`Data
`
`1512
`
`
`
`?
`
`Yes
`
`
`
`ata Digitize
`Analog Data
`9
`
`
`
`
`
`1508
`
`Yes
`
`Yes
`
`Buffer Digitized
`Analog Data
`
`Buffer Parallel
`Digital Data
`
`Digital Data
`
`Buffer Serial
`
`FIGURE 15a
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 023
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 023
`
`

`
`U.S. Patent
`
`Aug. 19,2008
`
`Sheet 20 of 20
`
`US 7,415,530 B2
`
`
`
`1528
`
`Output Serial
`
`Digital Data
`
`1530
`
`1524
`
`1525
`
`No
`
`
`
`Output Parallel
`Digital Data
`
`Demux Digital
`Parallel Data
`
`1520
`
`1522
`
`Digital to Analog
`Convert Data
`
`Data
`
`Output Analog
`
` More Data
`Blocks in Input
`Stream ?
`
`
`
`1532
`
`Yes
`
`Receive Next
`
`Data Block
`
`1534
`
`FIGURE 15b
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 024
`
`Veritas Techs. LLC
`Exhibit 1001
`Page 024
`
`

`
`1
`SYSTEM AND METHODS FOR
`ACCELERATED DATA STORAGE AND
`RETRIEVAL
`
`US 7,415,530 B2
`
`2
`
`BACKGROUND
`
`This application is a continuation of U.S. patent applica-
`tion Ser. No. 10/628,795, filed on Jul. 28, 2003, now U.S. Pat.
`No. 7,130,913, which is a continuation of U.S. patent appli-
`cation Ser. No. 09/266,394 filed on Mar 11, 1999, now U.S.
`Pat. No. 6,601,104, both ofwhich are hereby incorporated by
`reference herein in their entirety.
`
`visual imagery might seek to delete information content in
`excess of the display resolution or contrast ratio of the target
`display device.
`On the other hand, lossless data compression techniques
`provide an exact representation of the original uncompressed
`data. Simply stated, the decoded (or reconstructed) data is
`identical to the original unencoded/uncompressed data. Loss-
`less data compression is also known as reversible or noiseless
`compression. Thus, lossless data compression has, as its cur-
`10 rent limit, a minimum representation defined by the negent-
`ropy of a given data set.
`It is well known within the current art that data compres-
`sion provides several unique benefits. First, data compression
`can reduce the time to transmit data by more efiiciently uti-
`1. Technical Field
`lizing lOW bandwidth data links. Second, data compression
`The present invention relates generally to data storage and 15
`economizes on data storage and allows more information to
`retrieval and, more particularly to systems and methods for
`be stored for a fixed memory size by representing information
`improving data storage and retrieval bandwidth utilizing loss-
`n10re efiiciently.
`less data compression and decompression.
`One problem with the current art is that existing memory
`2. Description of the Related Art
`lnformation may he represented in a Variety of manners. 20 storage devices severely limit the performance of consumer,
`Discrete information such as text and numbers are easily
`entertainment, office, workstation, servers, and mainframe
`represented in digital data. This type of data representation is
`eomPhters for aii disk ahd memory ihtehsiye oPeratiohs- For
`known as symbolic digital data. Symbolic digital data is thus
`eXamPies maghetie disk mass storage deyiees ehrrehtiy
`an absolute representation of data such as a letter, figure, 25 eml3ioyed iha yariety orhomes hhsihesss ahd seiehtihe eom'
`eharaeter, mark, machine code, or drawing.
`puting applications suffer from significant seek-time access
`Cennnnens information Sneh as Speech, nrnsiea audio,
`delays along with profound read/write data rate limitations.
`images and video frequently exists in the natural world as
`Currently the fastest Wattabte (tosooo) rpm dtsk drwes Sup‘
`analog information. As is well-known to those skilled in the
`Port ohiy a i7~i Megabyte Per seeohd data rate (MB/see)
`arr, reeenr advanees in Very large Seale inregranen (VLS1) 30 This is in stark contrast to the modern Personal .Computer’s
`digital computer technology have enabled both discrete and
`Peripherai Compoheht ihtereohheet (pci) Bus s ihPht/‘output
`analog information to be represented with digital data. Con-
`eapahihty or 264 MB/see ahd ihtemai ioeai hhs eaPahihty or
`tinuous information represented as digital data is often
`800 MB/sec-
`referred to as diffuse data. Diffuse digital data is thus a rep-
`An0ther pr0h1eIn Within the Current art is that emergent
`resentation of data that is of low information density and is 35 high performance disk interface standards such as the Small
`typically not easily recognizable to humans in its native form.
`COInp11ter Systems interface (SCSI-3) and Fibre Channel
`There are many advantages associated with digital data
`orrer ohiy the Promise or higher data trahsrer rates through
`representation. For instance, digital data is more readily pro-
`ihtermediate data hhrrerihg ih rahdom aeeess memory~ These
`cessed, stored, and transmitted due to its inherently high noise
`ihtereohheet strategies do hot address the hmdamehtai Proh'
`immunity. In addition, the inclusion of redundancy in digital 40 iem that aii moderh maghetie disk storage. deyiees for the
`data representation enables error detection and/or correction.
`Persohai eomPhter marketPiaee are stiii iimited hy the same
`Error deteetion and/or eorreetion eapahilities are dependent
`physical media restriction of 17.1 MB/sec. Faster disk access
`upon the amount and type of data redundancy, available error
`data rates are ohiy aehieyed hy the high eost sohitioh of
`detection and correction processing, and extent of data cor-
`simhitaheohsiyaeeessihg mhitiPie disk driVes With a teeh'
`rnption.
`45 nique known within the art as data striping.
`Qne onteome of digital data representation is the eontinn_
`Additional problems with bandwidth limitations similarly
`ing need for increased capacity in data processing, storage,
`oeehr Withih the art hy aii other forms or sedhehtiais Pseudo‘
`and transmittal. This is especially true for diffuse data where
`rahdoms ahd rahdom aeeess mass storage deViees- Typieaiiy
`increases in fidelity and resolution create exponentially
`mass storage deyiees ihehide maghetie ahd oPtieai taPes mag‘
`greater quantities of data. Data compressionis widely used to 50 hetie ahd oPtieai disks: ahd Various soiid'state mass storage
`rednee the amount of data required to proeess, transmit, or
`devices. It should be noted that the present invention applies
`store a given quantity ofinformation. In general, there are two
`to aii forms ahd mahhers or memory deyiees ihehidihg stor'
`types of data compression techniques that may be utilized
`age deyiees htiiizihg magheties oPtieais ahd ehemieai teeh'
`either separately or jointly to encode/decode data: lossy and
`hidhess or ahy eomhihatioh thereoh
`lossless data compression.
`Lossy data compression techniques provide for an ine