Method and apparatus for compressing and storing pixels

Claim 2

A circuit comprising: processing means for providing a memory address and a data word of a first number of bits; storage means coupled to said processing means for storing said data word, said storage means having at least first and second address spaces; address decoding means coupled to said processing means to determine if said memory address provided by said processing means is found in said first or second address space; compression means coupled to said address decoding means, said processing means and to said storage means, said compression means for compressing said data word when said data word is written to said first address space.

Claim 3

The circuit of claim 1 wherein said compression means comprises: a matrix coupled to said processing means for receiving said memory address and for generating a threshold value based on said memory address; a compression block coupled to said processing means and said matrix, said compression block for receiving said threshold value and said data word and for providing an output value having a second number of bits less than said first number of bits.

Claim 4

The circuit of claim 2 wherein said compression block comprises: first converting means for receiving said data word and for generating a BASE value based on said data word; second converting means coupled to said first converting means for receiving said BASE value and said data word and for generating a DELTA value based on said BASE value and said data word; first summing means for combining said DELTA value with said threshold value and providing a first output; comparing means coupled to said first output and for generating a second output having a first value if said first output exceeds a reference value and a second value when said first output does not exceed said reference value; second summing means for combining said BASE value and said second output and providing said output value having said second number of bits.

Claim 5

The circuit of claim 1 wherein said data word comprises first, second, and third components.

Claim 6

The circuit of claim 4 wherein BASE and DELTA values are generated for each of said first, second, and third components.

Claim 7

The circuit of claim 4 wherein said first component is a red component, said second component is a green component and said third component is a blue component.

Claim 8

The circuit of claim 6 wherein further including means for comparing said red, green, and blue components of said data word and for generating said output value with equal red, green, and blue components when said red, green, and blue components of said data word are equal.

Claim 9

The circuit of claim 1 wherein said data word comprises first, second, third, and fourth components.

Claim 10

The circuit of claim 8 wherein BASE and DELTA values are generated for each of said first, second, third, and fourth components.

Claim 11

The circuit of claim 8 wherein said first component is a red component, said second component is a green component, said third component is a blue component, and said fourth component is an alpha component.

Claim 12

The circuit of claim 10 wherein further including means for comparing said red, green, and blue components of said data word and for generating said output value with equal red, green, and blue components when said red, green, and blue components of said data word are equal.

Claim 13

The circuit of claim 3 wherein said first converting means generates said BASE value as follows: BASE=(source data -(source data/16))/16), where source data represents an intensity level of said data word.

Claim 14

The circuit of claim 3 wherein said second converting means generates said DELTA value as follows: DELTA=(source data -(BASE×16) where source data represents an intensity level of said word.

Claim 15

The circuit of claim 2 wherein said compression block comprises: converting means for receiving said data word and for generating a BASE value and a DELTA value based on said data word; first summing means for combining said DELTA value with said threshold value and providing a first output; comparing means coupled to said first output and for generating a second output having a first value if said first output exceeds a reference value and a second value when said first output does not exceed said reference value; second summing means for combining said BASE value and said second output and providing said output value having said second number of bits.

Claim 16

The circuit of claim 14 wherein said first converting means generates said BASE value as follows: BASE=(source data-(source data/16))/16, where source data represents an intensity level of said data word.

Claim 17

The circuit of claim 14 wherein said second converting means generates said DELTA value as follows: DELTA=(source data-(source data/16)) modulo 16, where source data represents an intensity level of said data word.

Claim 18

A circuit comprising: processing means for providing a memory address and a data word of a first number of bits; storage means coupled to said processing means for storing said data word; compression means coupled to said processing means and to said storage means, said compression means for compressing said data word; said compression means comprising a matrix coupled to said processing means for receiving said memory address and for generating a threshold value based on said memory address, a compression block coupled to said processing means and said matrix, said compression block for receiving said threshold value and said data word and for providing an output value having a second number of bits less than said first number of bits.

Claim 19

A circuit comprising: processing means for providing a memory address and a data word of a first number of bits; storage means coupled to said processing means for storing said data word; compression means coupled to said processing means and to said storage means, said compression means for compressing said data word; said compression means comprising a matrix coupled to said processing means for receiving said memory address and for generating a threshold value based on said memory address, a compression block coupled to said processing means and said matrix, said compression block for receiving said threshold value and said data word and for providing an output value having a second number of bits less than said first number of bits.

Claim 20

The circuit of claim 17 wherein said compression block comprises: first converting means for receiving said data word and for generating a BASE value based on said data word; second converting means coupled to said first converting means for receiving said BASE value and said data word and for generating a DELTA value based on said BASE value and said data word; first summing means for combining said DELTA value with said threshold value and providing a first output; comparing means coupled to said first output and for generating a second output having a first value if said first output exceeds a reference value and a second value when said first output does not exceed said reference value; second summing means for combining said BASE value and said second output and providing said output value having said second number of bits.

Claim 21

The circuit of claim 17 wherein said data word comprises first, second, and third components.

Claim 22

The circuit of claim 19 wherein BASE and DELTA values are generated for each of said first, second, and third components.

Claim 23

The circuit of claim 19 wherein said first component is a red component, said second component is a green component and said third component is a blue component.

Claim 24

The circuit of claim 21 wherein further including means for comparing said red, green, and blue components of said data word and for generating said output value with equal red, green, and blue components when said red, green, and blue components of said data word are equal.

Claim 25

The circuit of claim 17 wherein said data word comprises first, second, third, and fourth components.

Claim 26

The circuit of claim 23 wherein BASE and DELTA values are generated for each of said first, second, third, and fourth components.

Claim 27

The circuit of claim 23 wherein said first component is a red component, said second component is a green component, said third component is a blue component, and said fourth component is an alpha component.

Claim 28

The circuit of claim 25 wherein further including means for comparing said red, green, and blue components of said data word and for generating said output value with equal red, green, and blue components when said red, green, and blue components of said data word are equal.

Claim 29

The circuit of claim 18 wherein said first converting means generates said BASE value as follows: BASE=(source data-(source data/16))/16), where source data represents an intensity level of said data word.

Claim 30

The circuit of claim 18 wherein said second converting means generates said DELTA value as follows: DELTA=(source data-(BASE×16)), where source data represents an intensity level of said data word.

Claim 31

The circuit of claim 17 wherein said compression block comprises: converting means for receiving said data word and for generating a BASE value and a DELTA value based on said data word; first summing means for combining said DELTA value with said threshold value and providing a first output; comparing means coupled to said first output and for generating a second output having a first value if said first output exceeds a reference value and a second value when said first output does not exceed said reference value; second summing means for combining said BASE value and said second output and providing said output value having said second number of bits.

Claim 32

The circuit of claim 29 wherein said first converting means generates said BASE value as follows: BASE=(source data-(source data/16))/16, where the source data represents an intensity level of said data word.

Claim 33

The circuit of claim 29 wherein said second converting means generates said DELTA value as follows: DELTA=(source data-(source data/16)) modulo 16, where the source data represents an intensity level of said data word.

Claim 34

The circuit of claim 17 wherein said storage means has a first address space and a second address space.

Claim 35

The circuit of claim 32 further including address decoding means coupled to said processing means to determine if said memory address provided by said processing means is found in said first or second address space; said compression means for compressing said data word only when said data word is written to said first address space.

Claim 36

A circuit comprising: processing means for providing a memory address and a data word of a first number of bits; storage means coupled to said processing means for storing said data word, said storage means having at least first and second address spaces; address decoding means coupled to said processing means to determine if said memory address provided by said processing means is found in said first or second address space; compression means coupled to said address decoding means, said processing means and to said storage means, said compression means for compressing said data word when said data word is written to said first address space, said compression means comprising: a matrix coupled to said processing means for receiving said memory address and for generating a threshold value based on said memory address; a compression block coupled to said processing means and said matrix, said compression block for receiving said threshold value and said data word and for providing an output value having a second number of bits less than said first number of bits, said compression block comprising: first converting means for receiving said data word and for generating a BASE value based on said data word; second converting means coupled to said first converting means for receiving said BASE value and said data word and for generating a DELTA value based on said BASE value and said data word; first summing means for combining said DELTA value with said threshold value and providing a first output; comparing means coupled to said first output and for generating a second output having a first value if said first output exceeds a reference value and a second value when said first output does not exceed said reference value; second summing means for combining said BASE value and said second output and providing said output value having said second number of bits.

Claim 37

A circuit comprising: processing means for providing a memory address and a data word of a first number of bits; storage means coupled to said processing means for storing said data word, said storage means having at least first and second address spaces; address decoding means coupled to said processing means to determine if said memory address provided by said processing means is found in said first or second address space; compression means coupled to said address decoding means, said processing means and to said storage means, said compression means for compressing said data word when said data word is written to said first address space, said compression means comprising: a matrix coupled to said processing means for receiving said memory address and for generating a threshold value based on said memory address; a compression block coupled to said processing means and said matrix, said compression block for receiving said threshold value and said data word and for providing an output value having a second number of bits less than said first number of bits, said compression block comprising: first converting means for receiving said data word and for generating a BASE value based on said data word; second converting means coupled to said first converting means for receiving said BASE value and said data word and for generating a DELTA value based on said BASE value and said data word; first summing means for combining said DELTA value with said threshold value and providing a first output; comparing means coupled to said first output and for generating a second output having a first value if said first output exceeds a reference value and a second value when said first output does not exceed said reference value; second summing means for combining said BASE value and said second output and providing said output value having said second number of bits.

Claim 38

The circuit of claim 34 wherein said data word comprises first, second, and third components.

Claim 39

The circuit of claim 35 wherein said BASE and DELTA values are generated for each of said first, second, and third components.

Claim 40

The circuit of claim 35 wherein said first component is a red component, said second component is a green component and said third component is a blue component.

Claim 41

The circuit of claim 37 wherein further including means for comparing said red, green, and blue components of said data word and for generating said output value with equal red, green, and blue components when said red, green, and blue components of said data word are equal.

Claim 42

The circuit of claim 34 wherein said data word comprises first, second, third, and fourth components.

Claim 43

The circuit of claim 39 wherein said BASE and DELTA values are generated for each of said first, second, third, and fourth components.

Claim 44

The circuit of claim 39 wherein said first component is a red component, said second component is a green component, said third component is a blue component, and said fourth component is an alpha component.

Claim 45

The circuit of claim 41 wherein further including means for comparing said red, green, and blue components of said data word and for generating said output value with equal red, green, and blue components when said red, green, and blue components of said data word are equal.

Claim 46

The circuit of claim 34 wherein said first converting means generates said BASE value as follows: BASE=(source data-(source data/16))/16, where source data represents an intensity level of said data word.

Claim 47

The circuit of claim 34 wherein said second converting means generates said DELTA value as follows: DELTA=(source data-(BASE X16)), where source data represents an intensity level of said data word.

Claim 48

The circuit of claim 34 wherein said compression block comprises: converting means for receiving said data word and for generating a BASE value and a DELTA value based on said data word; first summing means for combining said DELTA value with said threshold value and providing a first output; comparing means coupled to said first output and for generating a second output having a first value if said first output exceeds a reference value and a second value when said first output does not exceed said reference value; second summing means for combining said BASE value and said second output and providing said output value having said second number of bits.

Claim 49

The circuit of claim 45 wherein said first converting means generates said BASE value as follows: BASE=(source data-(source data/16))/16, where source data represents an intensity level of said data word.

Claim 50

The circuit of claim 45 wherein said second converting means generates said DELTA value as follows: DELTA=(source data-(source data/16)) modulo 16, where source data represents an intensity level of said data word.

Claim 51

A circuit comprising: processing means for providing a memory address and a data word of a first number of bits; storage means coupled to said processing means for storing said data word; compression means coupled to said processing means and to said storage means, said compression means for compressing said data word; said compression means comprising a matrix coupled to said processing means for receiving said memory address and for generating a threshold value based on said memory address, a compression block coupled to said processing means and said matrix, said compression block for receiving said threshold value and said data word and for providing an output value having a second number of bits less than said first number of bits, said compression block comprising: first converting means for receiving said data word and for generating a BASE value based on said data word; second converting means coupled to said first converting means for receiving said BASE value and said data word and for generating a DELTA value based on said BASE value and said data word; first summing means for combining said DELTA value with said threshold value and providing a first output; comparing means coupled to said first output and for generating a second output having a first value if said first output exceeds a reference value and a second value when said first output does not exceed said reference value; second summing means for combining said BASE value and said second output and providing said output value having said second number of bits.

Claim 52

A circuit comprising: processing means for providing a memory address and a data word of a first number of bits; storage means coupled to said processing means for storing said data word; compression means coupled to said processing means and to said storage means, said compression means for compressing said data word; said compression means comprising a matrix coupled to said processing means for receiving said memory address and for generating a threshold value based on said memory address, a compression block coupled to said processing means and said matrix, said compression block for receiving said threshold value and said data word and for providing an output value having a second number of bits less than said first number of bits, said compression block comprising: first converting means for receiving said data word and for generating a BASE value based on said data word; second converting means coupled to said first converting means for receiving said BASE value and said data word and for generating a DELTA value based on said BASE value and said data word; first summing means for combining said DELTA value with said threshold value and providing a first output; comparing means coupled to said first output and for generating a second output having a first value if said first output exceeds a reference value and a second value when said first output does not exceed said reference value; second summing means for combining said BASE value and said second output and providing said output value having said second number of bits.

Claim 53

The circuit of claim 48 wherein said data word comprises first, second, and third components.

Claim 54

The circuit of claim 49 wherein said BASE and DELTA values are generated for each of said first, second, and third components.

Claim 55

The circuit of claim 49 wherein said first component is a red component, said second component is a green component and said third component is a blue component.

Claim 56

The circuit of claim 51 wherein further including means for comparing said red, green, and blue components of said data word and for generating said output value with equal red, green, and blue components when said red, green, and blue components of said data word are equal.

Claim 57

The circuit of claim 48 wherein said data word comprises first, second, third, and fourth components.

Claim 58

The circuit of claim 53 wherein said BASE and DELTA values are generated for each of said first, second, third, and fourth components.

Claim 59

The circuit of claim 53 wherein said first component is a red component, said second component is a green component, said third component is a blue component, and said fourth component is an alpha component.

Claim 60

The circuit of claim 55 wherein further including means for comparing said red, green, and blue components of said data word and for generating said output value with equal red, green, and blue components when said red, green, and blue components of said data word are equal.

Claim 61

The circuit of claim 48 wherein said first converting means generates said BASE value as follows: BASE=(source data-(source data/16))/16, where source data represents an intensity level of said data word.

Claim 62

The circuit of claim 48 wherein said second converting means generates said DELTA value as follows: DELTA=(source data-(BASE X16)), where source data represents an intensity level of said data word.

Claim 63

The circuit of claim 48 wherein said compression block comprises: converting means for receiving said data word and for generating a BASE value and a DELTA value based on said data word; first summing means for combining said DELTA value with said threshold value and providing a first output; comparing means coupled to said first output and for generating a second output having a first value if said first output exceeds a reference value and a second value when said first output does not exceed said reference value; second summing means for combining said BASE value and said second output and providing said output value having said second number of bits.

Claim 64

The circuit of claim 59 wherein said first converting means generates said BASE value as follows: BASE=(source data-(source data/16))/16, where source data represents an intensity level of said data word.

Claim 65

The circuit of claim 59 wherein said second converting means generates said DELTA value as follows: DELTA=(source data-(source data/16)) modulo 16, where source data represents an intensity level of said data word.

Claim 66

The circuit of claim 48 wherein said storage means has a first address space and a second address space.

Claim 67

The circuit of claim 62 further including address decoding means coupled to said processing means to determine if said memory address provided by said processing means is found in said first or second address space; said compression means for compressing said data word only when said data word is written to said first address space.