-33..
`
`providing no error protection. This unique error
`_
`protection shall result in a reduction of storage
`requirements or a reduction in transmission bandwidth
`because the use of a lower level of error protection or
`
`no error protection will reduce the introduction of
`redundant data into the data link or storage medium
`while still providing error resiliency.
`As known to those skilled in the art, a
`
`variety of proposed codes can be separated into_a
`
`See, for
`prefix and suffix fields as described above.
`I
`example, E. R. Fiala and D. H. Greene,
`"Data
`Compression with Finite Windows," Communications of the
`ACE; Vol. 32, No. 4, pp. 490-505 (1989). However,
`the ‘
`
`proposed codes have not previously been separated_in
`order to provide error resiliency as provided by the
`
`method and apparatus of the present invention.
`It will be apparent to those skilled in the
`
`art that split field coding can be applied to data sets
`which are not characterized by a well-behaved
`
`5
`
`10
`
`15
`
`20
`
`distribution. This application can be accomplished by
`
`initially sorting the data set to produce a re-ordered
`monotonic distribution. This approach will result in
`error resilience in the sense that a bit error in the"
`suffix field will not result in a loss of code word
`
`the resulting error in the
`synchronization. However,
`decoded value will not be constrained to a particular
`
`*
`
`range since the sorting of the data set will destroy
`the contiguity of the superbins associated with
`
`specific prefix field values.
`'
`The relative positions of the significant
`
`coefficients can also be encoded in a variety of
`manners, such as run length coding as described above.
`
`The resulting run length values can,
`
`in turn, also be
`
`entropy encoded using an approach such as Huffman
`
`coding or the split field coding method described
`above. Alternatively,
`the positions of the significant
`
`coefficients can be encoded by other methods known to
`
`25
`
`30
`
`35
`
`Page 63 of 437
`
`Page 63 of 437
`
`

`
`-34-
`
`I
`
`,_
`
`those skilled in the art, such as tree structures or
`coefficient maps. without departing from the spirit and
`scope of the present
`invention.
`
`Once the plurality of code words
`
`5
`
`representative of the quantized coefficients and the
`
`10
`
`15
`
`20
`
`25
`
`30
`
`the run length
`encoded run lengths have been generated.
`code words and the prefix fields of the quantized
`
`coefficient code words are preferably error protected
`
`at an appropriately high level of error protection, as
`shown in block 38.. The run length code words are
`preferably afforded protection because a misdecoded run
`length value can potentially introduce catastrophic
`distortion into the reconstructed image. However,
`
`the
`
`suffix fields of the quantized coefficient code_words
`are preferably error protected at a relatively lower
`level of error protection, if at all.
`As shown
`
`schematically in Figure 1,
`
`the data encoder 16 can
`
`therefore include unequal error protection means 29 for
`
`providing appropriate levels of error protection to the
`encoded data as described above.
`
`~
`
`Regardless of the error protection means,
`
`error protection adds redundancy to the encoded data
`and increases the storage and transmission
`
`'
`
`requirements. Accordingly, by providing a reduced
`level of error protection or no error protection to the
`suffix fields of the quantized coefficient code words,
`
`the storage and transmission requirements can be
`
`reduced by the method and apparatus of the present
`
`invention while limiting the effects of bit errors
`incident upon the suffix fields of the quantized
`coefficient code words.
`
`Following the data compression process
`
`described above,
`
`the encoded data can be efficiently
`
`stored.
`
`For example,
`
`the run length code words and the.
`
`35
`
`prefix fields of the quantized coefficient code words
`can be stored in a first data block 66 defined by a
`
`storage medium 18, such as avmagnetic disk storage
`
`"7
`
`Page 64 of 437
`
`Page 64 of 437
`
`

`
`-35-
`
`_
`
`_
`
`-
`
`which isxerrcr protected as shown in Figure 6.
`
`In
`
`_
`
`addition,
`
`the respective suffix fields of the quantized
`
`coefficient code words can_be stored in a second data
`
`i
`
`5
`
`10
`
`15
`
`block 63 defined by a storage medium which includes a
`reduced level of error protection or no error
`protection. Thus.
`the suffix fields can be more
`
`efficiently stored within the second data block.
`
`Likewise,
`
`the compressed and encoded data can
`
`be efficiently transmitted, such as via first and
`
`-In particular the error resilient
`second data links.
`'
`method and apparatus of the present invention can
`include a transmitter 20 which transmits the respective
`
`run length code words and the prefix fields of the
`
`quantized coefficient code words via a first data link
`22 which is error protected, and which transmits the
`
`respective suffix fields of the quantized coefficient.
`code words via a second data link 24 which is not error
`
`protected or is error protected to a lesser degree than
`the first data link. Thus,
`the suffix fields can be
`
`20
`
`more efficiently transmitted {with reduced or no
`
`redundancy) using the second data link.
`
`Upon reception of the compressed data,
`
`the
`
`prefix fields of the quantised coefficient code words‘
`can be decoded (as shown in Figure '7} and the lengths
`of the suffix fields can be determined based'on the
`
`decoded prefix fields.
`
`If one or more bit errors are
`
`incident upon the suffix field of a quantized
`
`coefficient code word,
`
`the code word synchronization is
`
`not lost because the length of the suffix field is
`known. As a result,
`the resulting error in the decoded
`
`coefficient value will be constrained to the range of
`
`coefficient values for the superbin corresponding to
`
`the associated prefix field. Accordingly,
`
`the effects
`
`of the error on the reconstructed image will be limited_
`
`and will not be catastrophic. Following the
`transmission of the encoded data and the possible
`
`detection and correction of any storage and
`
`25
`
`30
`
`35
`
`Page 65 of 437
`
`Page 65 of 437
`
`

`
`-36-
`
`_
`
`._
`
`'
`
`transmission errors by means of channel decoding known
`
`to those skilled in the art,
`
`the compressed data,
`
`including both the quantized values for the significant
`coefficients and the relative positions of the
`
`5
`
`is decoded, de-quantized, and
`significant coefficients,
`inverse transformed, as known to those skilled in the
`
`art, so as to provide a reconstructed image based upon-
`
`the original image as shown in Figure 7.
`
`10
`
`compressing data,
`
`including the data transformer 12,
`
`The error resilient method and apparatus for"
`
`the data quantizer 14,
`the data encoder 16 and the
`unequal error protection means 29, are preferably
`implemented by a combination of hardware and software.
`
`the method and apparatus for compressing
`For example,
`data can be implemented by a computer having one or
`
`15
`
`more controllers which operate under the Qontrol of
`
`software to provide the data transformation,
`
`quantization and encoding processes described above.
`
`In the drawings and the specification,
`
`there
`
`20
`
`has been set forth a preferred embodiment of the
`
`invention and, although specific terms are employed,
`the terms are used in a generic and descriptive sense
`
`only and not for purpose of limitation.
`
`the scope of '
`
`the invention being set forth in the following claims.
`
`2'7
`
`Page 66 of 43.7
`
`Page 66 of 437
`
`

`
`-37-
`
`THAT WHICH IS CLAIMED IS:
`
`
`
`1
`
`
`data compris
`
`gene ating a plurality of code words
`
`An error resilient method of encoding
`
`g the steps of:
`
`5
`
`10
`
`15
`
`fprespective portions of the data,
`representative
`wherein each cod word comprises a first portion and an
`associated second ortion, and wherein said code word
`
`generating step co
`
`'
`
`rises the steps of:
`
`ting the first portion of each _
`gene
`the first orticn including information
`
`representative of a pr determined characteristic of the
`
`code word,
`
`associated second porti n; and
`
`generatin the second portion of_each
`
`code word,
`
`the second por ion including information
`
`representative of the resp ctive portion of the data;.
`and
`
`
`providing error pr tection to at least one of
`
`the first portions of the plu ality of code words while
`
`maintaining any error protecti n provided to the
`respective second portion assoc ated with the at least
`
`20
`
`one first portion at a lower lev 1 than the error -
`
`protection provided to the respec ive first portion.
`
`An error resilient method of encoding
`
`2.
`
`‘
`
`data according to Claim 1 wherein said step of
`
`generating a plurality of code words comprises the step
`
`of entropy coding the data to thereby reduce the size
`
`5
`
`of the resulting code words.
`
`3.
`
`An error resilient method of encoding
`
`data according to Claim 1 wherein said step of
`
`generating the second portion of each code word
`comprises the step of generating second portions having
`
`5
`
`predetermined numbers of characters, and wherein said
`step of generating the first portion of each code word
`
`comprises the step of generating first portions which
`
`Page 67 of 437
`
`Page 67 of 437
`
`

`
`~33»
`
`_
`
`“
`
`include information representative of the predetermined
`
`number of characters which comprise the associated
`second portion.
`
`10
`
`4.
`
`An error resilient method of encoding
`
`data according to Claim 3 further comprising the step
`of determining the probability with which respective
`ones of the plurality of code words are generated,
`
`5
`
`wherein said step of generating second portions having”
`
`predetermined number: of characters comprises the step
`of generating a plurality of second portions having the
`same predetermined number of characters, and wherein
`
`the plurality of second portions which have the same
`
`10
`
`predetermined number of characters comprise portions of
`
`respective code words which have corresponding
`probabilities of generation within a predetermined
`
`range of probabilities.
`
`5.
`
`An error resilient method of encoding
`
`data according to Claim 1 wherein said step of
`
`providing error protection comprises the steps of:
`
`storing the at least one first portion of the
`
`5
`
`plurality of code words in a first data block of a
`
`storage medium, wherein the first data block is error
`
`protected; and
`
`‘storing the respective second portion
`
`associated with the at least one first portion in a
`second data block of the storage medium, wherein any
`
`10
`
`error protection provided by the second data block is
`at a lower level than the error protection provided by
`the first data block.
`
`5.
`
`an error resilient method of encoding
`
`data according to Claim 1 wherein said step of
`
`providing error protection comprises the steps of:
`
`Page68of437
`
`Page 68 of 437
`
`

`
`-39-
`
`I
`
`*
`
`transmitting the at least one first portion
`\
`of the plurality of code words via a first data link,
`
`5
`
`wherein the first data link is error protected; and
`
`transmitting the respective second portion
`
`associated with the at least one first portion via a
`
`second data link, wherein any error protection provided
`
`10
`
`by the second data link is at a lower level than the
`error protection provided by the first data link.
`
`
`
`A data encoding apparatus comprising:
`7
`code wb d generating means for generating a
`plurality of code
`ords representative of respective
`
`
`portions of the dat
`
`, wherein each code word comprises
`
`(}y
`
`n associated second portion, and
`generating means comprises:
`
`nerating means for generating
`
`
`
`5
`
`a first portion and
`wherein said code wo
`
`first
`
`the first portion of ea h code word,
`
`the first portion
`
`resentative of a predetermined
`including information r
`characteristic of the as ciated second portion; and
`
`ating means for generating'
`second gen
`the second portion of each ode word,
`the second
`
`portion including informatio representative of the
`
`; and
`respective portion of the dat
`error protection mea s for providing error
`protection to at least one of t e first portions of the
`
`plurality of code words while ma'ntaining any error
`
`protection provided to the respec ive-second portion
`associated with the at least one
`'rst portion at a
`
`
`lower level than the error_protect' n provided to the
`
`respective first portion.
`
`
`
`10
`
`15
`
`20
`
`A data encoding apparatus according to
`8.
`Claim 7 wherein said code word generating means
`
`comprises entropy coding means for entropy coding the
`
`data to thereby reduce the size of the resulting code
`words.
`
`5
`
`Lm
`
`Page 69 of 437
`
`Page 69 of 437
`
`

`
`-40-
`
`A data encoding apparatus according to
`9.
`\
`Claim 7 wherein said second generating means generates
`
`second portions having predetermined numbers of
`characters, and wherein said first generating means
`
`generates first portions which include information
`representative of the predetermined number of
`characters which comprise the associated second
`portion.
`
`10.
`
`A data encoding apparatus according to
`
`Claim 7 wherein said error protection means comprises a
`
`storage medium for storing the plurality of code words,
`
`said storage medium being partitioned into a first data
`
`block which is error protected and a second data block,
`wherein any error protection provided by the second
`data block is at a lower level than the error
`
`protection provided by the first data block, wherein
`the at least first portion of the plurality of code
`words is stored in the first data block of the storage
`
`medium. and wherein the respective second portion
`
`associated with the at least one first portion is
`
`stored in the second data block of the storage medium.
`
`11.
`
`A data encoding apparatus according to
`
`Claim 7 wherein said error protection means comprises:
`first data link transmitting means for
`
`transmitting the at least one first portion of the
`plurality of code words via a first data link, wherein
`the first data link is error protected; and
`
`second data link transmitting means for
`
`transmitting the respective second portion associated
`
`with the at least one first portion via a second data
`
`link, wherein any error protection provided by said
`second data link is at a lower level than the error
`
`protection provided by said first data link.
`
`5
`
`5
`
`5
`
`10
`
`ml
`
`Page 70 of 437
`
`Page 70 of 437
`
`

`
`-41-
`
`x_
`
`12
`
`An error resilient method of compressing
`
`data oomprisi g the steps of:
`
`()\
`
`tran forming the data based upon a
`
`predetermined t ansformation function;
`
`5
`
`10
`
`15
`
`quanti ing the transformed data such that the
`_
`.
`quantized data
`fewer unique coefficients than the
`
`transformed data; and
`
`encoding the quantized data, said encoding
`step comprising the steps of:
`gene
`ting a plurality of code words,
`representative of re
`ective portions of the data.
`which have respective
`irst and second portions,
`
`I
`
`wherein the first porti n includes information
`
`_
`
`representative of a pre
`associated second portio
`
`termined characteristic of the
`and wherein the second
`
`portion includes informati n representative of a
`respective portion of the
`ta; and
`
`providing er or protection to at least
`
`one of the first portions of the plurality of code
`
`20
`
`words while maintaining any e ror protection provided"
`
`to the respective second porti n associated with the at
`
`least one first portion at a 1
`
`er level than the error
`
`protection provided to the resp ctive first portion.
`
`'
`
`13.
`
`An error resilient method of compressing
`
`data according to Claim 12 wherein said step of
`
`encoding the quantized data comprises the step of
`
`entropy coding the quantized data to thereby reduce the
`size of the resulting code words.
`
`14.
`
`An error resilient method of compressing
`
`data according to Claim 12 wherein said step of
`
`generating a plurality of code words comprises the
`steps of:
`
`generating second portions having
`predetermined numbers of characters; and
`
`5
`
`5
`
`1|]/""\
`
`Page 71 of 437
`
`Page 71 of 437
`
`

`
`-42-
`
`I
`
`‘
`
`3
`generating first portions which include
`information representative of the predetermined number
`of characters which comprise the associated second
`portion.
`
`15. An_error resilient method of compressing
`
`data according to Claim 14 further comprising the step
`
`of determining the probability of occurrence of
`
`respective ones of the quantized data values, wherein’
`
`said step of generating second portions having
`predetermined numbers of characters comprises the step
`of generating a plurality of second portions having the
`same predetermined number of characters, and wherein
`
`the plurality of second portions which have the same
`predetermined number of characters comprise portions of
`respective code words which represent quantized data
`
`values having corresponding probabilities of generation
`
`within a predetermined range of probabilities.
`
`10
`
`5
`
`10
`
`16. An error resilient method of compressing
`
`data according to Claim 12 wherein said step of
`providing error protection comprises the steps of:
`
`storing the at least one first portion of the
`plurality of code words in a first data block of a
`
`5
`
`storage medium, wherein the first data block is error
`
`protected; and
`
`storing the respective second portion
`associated with the at least one first portion in a
`
`10
`
`second data block of the storage medium, wherein any
`error protection provided by the second data block is
`
`at a lower level than the error protection provided by
`the first data block.
`\
`
`17.
`
`An error resilient method of compressing.
`
`data according to Claim 12 wherein said step of
`providing error protection comprises the steps of:
`
`/--—a.
`
`Page 72 of 437
`
`Page 72 of 437
`
`

`
`-43-
`
`.
`
`«
`
`5
`
`10
`
`transmitting the at least one first portion
`of the plurality of code words via a first data link,
`wherein the first data link is error protected; and
`transmitting the respective second portion
`associated with the at least one first portion via a
`
`second data link. wherein any error protection provided
`by the second data link is at a lower level than the
`error protection provided by the first data link.
`
`18. An error resilient method of_compressing '
`data according to Claim 12 wherein said transforming"
`I
`step comprises the step of transforming the-data based
`upon a wavelet transform.
`
`19. An error resilient method of compressing
`
`data according to Claim 18 wherein said transforming _-
`
`step comprises the step of transforming the data based
`
`upon a biorthogonal wavelet transform.
`
`20.
`
`An error resilient method of compressing
`
`data according to Claim 12 wherein the transformed data
`
`includes a plurality of transformed coefficients. and
`
`wherein said quantizing step comprises the step of
`
`5
`
`detecting transformed coefficients below a
`
`predetermined clipping threshold.
`
`21.
`
`An error resilient method of compressing
`
`data according to Claim 20 further comprising the step
`of establishing a clipping threshold such that the
`
`ratio of the number of detected coefficients to the
`number of transformed coefficients which are not
`
`5
`
`detected is at least as great as a predetermined
`clipping ratio.
`‘
`
`22.
`-An erro resilient data compression
`apparatus comprising:
`
`Q}
`
`‘Hm
`
`Page 73 of 437
`
`Page 73 of 437
`
`

`
`
`a d ta transformer for transforming the data
`
`\
`
`-44-
`
`based upon a p edetermined transformation function;
`a da
`I
`quantize: for qnantizing the
`transformed dat
`
`
`
`such that the quantized data has fewer
`
`unique coefficie ts than the transformed data; and
`a data lncoder for encoding the quantized
`
`data, said data en oder comprising:
`
`code word generating means for
`
`
`
`generating a plurali y of code words, representative of
`respective portions
`the data, which have respective
`first and second porti ns, wherein the first portion
`includes information r
`resentative of a predetermined
`characteristic of the a sociated second portion, and
`wherein the second porti
`includes information_
`
`representative of a respe tive portion of the data; and
`
`-
`
`error prote tion means for providing
`
`error protection to at leas
`
`
`of the plurality of code wor s while maintaining any
`
`one of the first portions
`
`error protection provided to he respective second
`portion associated with the at least one first portion
`at a lower level than the erro protection provided to
`
`the respective first portion“
`
`
`
`23.
`
`An error resilient data compression
`
`apparatus according to Claim 22 wherein said data
`
`encoder comprises entropy coding means for entropy
`
`Coding the quantized data to thereby reduce the size of
`the resulting code words.
`
`24.
`
`An error resilient data compression
`
`apparatus according to Claim 22 wherein said code word
`
`generating means comprises:
`
`second generating means for generating second
`
`portions having predetermined numbers of characters;
`and
`
`first/generating means for generating first
`portions w ' h include information representative_of
`
`Page 74 of 437
`
`10
`
`15
`
`20
`
`25
`
`30
`
`5
`
`5
`
`H
`
`Page 74 of 437
`
`

`
`-45-
`
`the predetermined number of characters which comprise
`the associated second portion.
`
`10
`
`25. An error resilient data compression
`apparatus according to Claim 22 wherein said error
`
`protection means comprises a storage medium for storing
`
`the plurality of code words, said storage medium being
`partitioned into a first error protected data block and
`
`5
`
`'
`a second data block, wherein any error pfotection
`provided by said second data block is at a lower level
`than the error protection provided by said first data
`
`_
`
`block, wherein the at least first portion of the
`plurality of code words is stored in the first data
`
`block of the storage-medium, and wherein‘the respective
`second portion associated with the at least one first
`
`portion is stored in the second data block of the
`
`storage medium.
`
`An error resilient data compression
`26.
`apparatus according to Claim 22 wherein said error
`
`protection means comprises:
`
`5
`
`transmitting the at least one first portion of the
`
`first data link transmitting means for
`
`plurality of code words via a first data link, wherein
`the first data link is error protected; and
`
`second data link transmitting means for
`
`transmitting the respective second portion associated
`
`10
`
`with the at least one first portion via a second data
`
`link, wherein any error protection provided by the
`
`second data link is at a lower level than the error
`protection provided by the first data link.
`
`An error resilient data compression
`27.
`apparatus according to Claim 22 wherein said data
`
`transformer comprises a wavelet transformer for
`
`transforming the data based upon the wavelet
`
`5
`
`transformer.
`
`_
`
`‘
`
`Page 75 of 437
`
`Page 75 of 437
`
`

`
`-46-
`
`c.
`
`A computer readable memory for storing
`
`
`
`28.
`
`error resilien encoded data.
`
`the computer readable
`
`memory comprisi g:
`
`a sto age medium for storing the error
`data, said storage medium being
`
`resilient encode
`partitioned into
`first error protected data block and
`a second data blo k, wherein any error protection
`
`
`
`provided by said s cond data block is at a lower level
`than the error pro ection provided by said first data.
`
`1
`block; and
`a pluralit of code words, representative of
`'
`respective portions
`f the original data, which have
`
`respective first and
`
`econd portions, wherein the first
`
`portion includes info ation representative of a
`predetermined characte istic of the associated second
`portion, and wherein th second portion includes
`information representat ve of a respective portion of
`
`_
`
`
`
`the original data,
`wherein at leas
`
`
`
`the plurality of code wor
`
`one of the first portions of
`is stored in the first data
`
`such that the at least one
`
`block of said storage medi
`
`
`
`first portion is error prot cted. and wherein the
`
`respective second portion as ociated with the at least
`one first portion is stored i
`the second data block of
`said storage medium such that
`ny error protection
`
`d pgrtion associated
`provided to the respective sec
`with the at least one first por ‘on is at a lower level
`
`
`
`5
`
`10
`
`15
`
`20
`
`25
`
`than the error protection provid d to the respective
`first portion.
`
`
`
`A computer readable memory'for storing
`29.
`error resilient encoded data according to Claim 21
`
`wherein the second portion of each code word has a
`
`predetermined number of characters, and wherein the
`
`5
`
`first portion of each code word includes information
`representative of the predetermined number of
`
`LV7
`
`Page 76 of 437
`
`Page 76 of 437
`
`

`
`...4'}'..
`
`characters which comprise the associated second
`
`portion:
`
`A computer readable memory for storing
`30.
`error resilient encoded data according to Claim 29
`wherein each of the plurality of code words occurs
`according to a predetermined probability, wherein a
`plurality of second portions of code words have the
`same predetermined number of characters, and wherein _
`
`the plurality of second portions which have the same
`predetermined number of characters comprise portions of
`respective code words which have corresponding"
`probabilities of occurrence within a predetermined
`
`range of probabilities.
`
`S
`
`10
`
`Page 77 of 437
`
`Page 77 of 437
`
`

`
`....|
`
`-43-
`
`cffl?EfiRfifiTfi9-FEH-ENHHfi3P¥-{EH9$NGL_—
`
`\
`
`TRA
`
`F
`
`E
`
`The error resilient method and apparatus for
`
`encoding data includes an encoder including a code word
`generator for generating a plurality of code words
`
`representative of respective portions of the data.
`
`The
`
`code word generator encodes data pursuant to split
`
`'
`
`field coding in which each code word includes a prefix
`field and an associated suffix field.
`The prefix field
`includes information representative of a predetermined
`characteristic of the associated suffix field,
`such as_
`
`the predetermined number of characters which form the
`associated suffix field.
`In addition,
`the suffix
`
`fields include information representative of at least
`
`if the prefix
`some of the original data. Consequently,
`field of a code word-is decoded correctly, i.e, without
`the occurrence of bit error,
`the error resilient method
`
`and apparatus can correctly determine the length of the
`associated suffix field and the range of coefficient
`
`values to be represented by the associated suffix field
`such that the associated suffix field is resilient to'
`
`errors.
`
`In order to increase the probability that the
`
`prefix field will be correctly decoded,
`
`the method and
`
`apparatus protects the prefix and suffix fields of the
`encoded data to greater and lesser degrees,
`respectively, such that the data can be more
`
`efficiently compressed.
`
`—-3'99-1-EOH
`
`10
`
`15
`
`20
`
`25
`
`91'
`Sin-711$
`
`Page 78 of 437 "
`
`Page 78 of 437
`
`

`
`Pmmrornnmwmcs T
`A5 omcmmv man _
`
`.
`
`28
`
`
`
`CODE WORD
`GENERATOR
`
`
`
`FIG. 1.
`
`~27
`
`
`UNEOUAL
`29
`ERROR
`RROTEOROR
`MEANS
`
`
`
`COk4PRESSED DATA
`8
`
`MEDIUM
`
`‘lfiflflfib
`
`.
`so
`PERFORM A WAVELET TRANSFORM ON THE ORKNNALIMAGE
`31
`.
`~
`
`COLLECT COEHWCENT STAHSROS m ERSTOORAM
`
`32
`
`DETERMINE CLIPPIN
`INTERVAL ‘BASED
`
`q_U NTIZATION
`TA I1S_?g|CS AND
`
`'
`
`
`
`Page 79 of 437
`
`Page 79 of 437
`
`

`
`.,mmmMs %.
`
`AS ORIGINALLY FILED
`
`%
`
`%
`
`%
`
`=38/63.3396 1
`
`72.
`
`
`
`% Page 80 of 437
`
`Page 80 of 437
`
`

`
`mm-r or DRAWINGS
`_A.S ORIGINALLY nun
`
`FIG. 4.-
`
`Page 81 of 437
`
`Page 81 of 437
`
`

`
`PRINT or muwmcs
`AS omcmaux run
`
`" _‘ ' '
`
`mmoummao
`
`mwmsmm
`
`
`
`..mu3.q>
`
`.~.zm_or_nm_oo
`
`000
`
`nomumzzz
`
`mu.__ozmmm:8_o.
`.00_o_
`
`.HHH_
`
`'
`
`Page 82 of 437
`
`Page 82 of 437
`
`
`
`

`
`rmmornmwmcs "
`
`ASORIGIZNALLY nun '
`
`-”"'
`
`I
`
`-
`
`I
`
`-
`
`x’
`
`STORAGE MEWUM
`
`'
`
`13
`
`DATA BLOCK 1
`
`66
`
`68
`
`_ ‘
`
`
`
`DATA B LOCK 2
`
`FIG. 6.
`
`vi‘-
`
`Page 83 of 437
`
`Page 83 of 437
`
`

`
`‘PRINTOI-‘DR_AWl.NGS
`AS ORIGINALLY FEED
`
`I
`
`....n-1
`
`QUANTIZED
`(USING SPLI
`T0 REC
`
`EXPAND RUN LENGTHS TO
`RUNS OF ZEROEO COEFFICIENTS
`AND INSERT RECONSTRUCTED
`COEFFFCIENT VALUES BETWEEN
`THESE RUNS
`
`5-19-
`
`Page 84 o'f437
`
`Page 84 of 437
`
`

`
` 26
`
`
`
`CODE WORD
`GENERATOR .
`
`28
`
`TRANSFORMER
`
`27
`
`29
`
`
`
`UNEQUAL
`ERROR
`PROTECTION -
`
`
`
`
`
`
`RUN LENGTH ENCODE
`INSIGNIFICANT COEFFICIENTS
`TO REPRESENT POSITIONS
`OF SIGNIFICANT COEFFICIENTS
`
`
`35'
`ENTROPY ENCODE Q ANTIZED
`COEFFICIENTS USIN
`FIELD CODIN
`
`
`
`
`38
`
`
`
`APPLY UNE
`ROTECTION TO ENCODED DATA
`
`
`TION FOR ENCODEID RUN LENGTHS
`USING HIGHER
`
`OF ENCODE-D COEFFICIENTS
`AND FIR?
`AND LOWE
`ECTION ‘OR NO ERROR PROTECTION?-x
`
`
`FOR
`UFFIX FIELDS OF ENCODED COEFFICIENTS
`.
`
`'
`
`t
`FIG. 2.
`Page85of437
`
`R S
`
`Page 85 of 437
`
`

`
`03/633896
`
`72
`
`I
`'
`
`(-25‘
`_>_‘..I
`'|:_‘
`
`,
`
`
`
`II
`III
`..J
`
`
`
`Page 86 of 437
`
`Page 86 of 437
`
`

`
`=w%@&i@&&@@@
`
`FIG. 4.
`
`Page 87 of437
`
`Page 87 of 437
`
`

`
`
`
`698.....
`
`...
`
`._
`
`1 Q Q 0
`
`0
`
`no
`
`<1-
`
`N
`
`"0
`
`‘P
`V:
`
`_'‘P'
`
`°.°
`
`-.9
`
`5.3
`
`--$
`
`Page 88 of 437
`
`mm>m._..Zm_U_|._@U
`_H
`
`
`
`
`
` .oH:.z§om*NKI..I|n|j3jj,_..mm0_n_m_Hflm_MM______MW80m.8m_o___o__oo_
`
`310$
`
`.mm34>
`
`._.zm_o_..Emoo
`
`mmo2m$58o
`
`mommmssz
`
`
`
`maoommo.$_*mmE
`
`Page 88 of 437
`
`
`

`
`File History Content Report
`
`The following content is missing fi'om the original file history record obtained from the
`
`United States Patent and Trademark Office. No additional infonnation is available.
`
`Document Date -
`
`I996-04-17
`
`Document Title -
`
`Drawings
`
`Page(s) -
`
`FIG 6
`
`It has been determined that content
`This page is not part of the official USPTO record.
`identified on this document is missing from the original file history record.
`Page 89 of 437
`
`Page 89 of 437
`
`

`
`
`
`
`EXPAND RUN LENGTHS TO
`RUNS OF ZEROED COEFFICIENTS
`AND INSERT RECONSTRUCTED
`COEFFICIENT VALUES BETWEEN
`THESE RUNS
`
`
`
`
`
`
`
`TO RECOVER RECONSTRUCTED IMAGE
`
`PERFORM INVERSE WAVELET TRANSFORM
`
`FIG. 7;‘
`
`Page 90 of 437
`
`Page 90 of 437
`
`

`
`.008/633896;
`
`ATENT
`
`IN THE UNITED STATES PATENT AND TRADEMADK OFFICE
`\.
`
`
`
`C ristopher J. Martens
`Serial No. To Be Assigned
`Filed: Concurrently Herewith
`For:
`ERROR RESILIENT METHOD AND
`
`APPARATUS FOR ENTHOPY CODING
`
`April 17, 1996
`
`Assistant Commissioner
`of Patents and Trademarks-
`Washington, DC
`20231
`
`APPLICATION FILED UNDER 3'? CFR l.41(C}
`
`_SiI:
`
`The above-identified application is being filed on behalf
`
`of the inventors, residents of Des Peres, St. Louis County,
`Missouri; and Creve Coeur, St. Louis County, Missouri,
`
`A
`respectively, under the provisions of 37 CFR 1.41(c).
`Declaration and Power of Attorney from the inventors will
`follow, 37 CFR 1.63.
`
`Respectfully submitte ,
`
` osne11
`
`Regi tration No. 34,610
`
`Bell, Seltzer, Park & Gibson
`Post Office Drawer 34009
`Charlotte, North Carolina 23234
`Telephone:
`[704] 331-6000
`'
`Our File NO. 3190-43
`204?E0
`
`"Express Mail’ mailing label number
`
`TBB173§gn2og§
`
`Date of Deposit
`
`agxil g?, 1236
`
`I hereby certify that this paper or fee is being deposited with the United
`states Postal Service “Express Mail Post Office to addressee“ service under 37-
`CFR 1.10 on the date indicated above and is addressed to the Commissioner of
`Patents and Trademarks. Washington, DC 10231.
`
`...,...
`V‘
`Gwen Fr ckhoef er
`
`_
`
`Page 91 of 437
`
`Page 91 of 437
`
`

`
`‘
`
`.
`
`g
`
`l
`
`'
`
`.
`
`-
`
`‘
`
`-'
`.
`
`.
`
`'
`
`p
`
`-
`
`~ BEST copv
`'
`.
`I
`'
`.
`-
`'
`IiHflEU'5T'ITEB:_flEFAI'fMIfIlT-DFUDMMERGE
`. PetenIend_:Tm'.lemerl¢.0|‘flee_
`--
`_
`._
`'
`-
`Moreen; oouueaaman OF PATENTS mo Tnmemmxe
`.-
`_- K I
`Wflfihflnfl. "DE. EUES1
`-
`.
`'
`‘Hm!
`
`“'
`
`.
`
`_
`
`e
`
`5
`
`W‘-‘P-‘“°“"'-"°‘"' '
`
`""°""**E“”"‘-“WT
`
`oaxe.:33.a9e
`
`04x17/sis
`
`memw
`
`'
`
`'
`
`I
`
`1
`
`J
`
`‘ 3199-43-
`
`0:252/oeoe
`,
`-
`BELL SELTZER PARK AND meson
`POST OFFICE oRAuaEn__ 34009
`CHARLOTTE no 23294
`
`u.
`-- onremuo:
`_
`_
`-
`;
`T NOT1C\E TO FILE MISSING PARTS OF APPLICATION
`,
`1 - FII.lNGDA'l‘EGll_ANTED
`-
`i
`
`soon
`
`.
`
`-
`
`.
`
`I.
`*
`
`_
`
`,
`
`-.«.
`
`I
`06-705/95
`
`AnApplicetlnI1NI.tmbar1IZ,nd Flljngflete have been assigned tothie application. However, the items indicated
`. below are mieeing. Therequired item! Andfeel identifiedbelow must he
`.eubmittedALONG WITH
`1- _YMEI!l'r.OF..A-SUR.CHa\RGEforitems‘1end3-8on1yof
`—-*-"- mnugeenas.-.m
`3
`zhrfur-npuflqififlawhoheveflledeveuflednateuwotcleuuieg-mchwama. Thelurchargeisseifonhin
`37
`1.1
`.
`Hellroqulrediieimonilliiforfiuefiledniithinllle
`'_ ueL~below.Iho'lntele:oouoIowedbyu.pplicanleae
`-
`entity. U-uwauu(maumm5w).u .
`'
`-
`. Appliclnltzia git-on ONl1'MON'l'li BIOM THE DATE 0FTlllS'l..ETI‘ER, DITWD MONTHS FROM '__l'll]§
`
`
`FIIJNG DA'l'-Enfthiu eppliI:s|ion;..W_IllCIIl!VEll]B ;l.A'I'EIl,urill:1n which to filenll reqoiredimmu andpey eojrfooe
` enemion fee undertheplovlslon-I'ef3?'C.F'R 1.136111).
`Iequued ehoveto‘evold.Ih|n'ch|unent. Extension: oftimemeybeohminedbyfillngepelitioneeconrpeniedhy Illa
`1. U The etetutory
`fee is: Clmiiasing Dilleuflioient. -Applicant an a El large entity Elemell
`.
`entity, must submit 3
`—'
`to complain the basic filing fee.
`
`I
`
`‘
`
`-
`en a El large entity, D small entity. including any
`-
`'2. El Additional cleimleee ofl
`‘
`multiple dependent claim tea, are required. Applicant must auhmitathe additional claim
`or cancel the eddllionsl claims for which fees are clue.
`'
`
`f
`
`a.
`
`um dsclerefion:
`
`'11:
`.
`is
`Cl duet! not cover itemtomltted at time ofexecutiun.
`
`_
`
`‘
`
`An net]: or declaration in eompllenea with an cm 1.53, identifyiuj the epplicefion by the above‘ '
`Application Number and FllinxDete is required.
`.
`"
`
`4. U The oath or declaration does not idenfilfythe application to which it eppliee. An-oath or declaration
`in uomplienee with 87 GER 1.68, idenflifying the application by the ehove Applimtion Numher and
`Filing Date, is required.
`
`5. U The e:lgneturB(n) In the oath or declaration infers: I] missing; El by 9. person other than the inventor
`- or a pereono qualified under 37 CF11 1.42, 1.43. or 1.47. A properly signed net]: or declaration in .
`coroplienoe wi