Double axis dot depletion for 600 DPI edge acuity with 300 DPI print cartridge

Claim 2

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, each row of the pixel data array being organized into a sequence of bits that starts at a start bit and ends with a last bit,a method for depleting a row of the pixel data array, comprising the steps of: (A) sequentially selecting the second through next to last in sequence bit of the row of raster data; and (B) setting the selected bit to 0 if (a) the adjacent prior in sequence bit of the row is a 1 and (b) the adjacent next in sequence bit of the row is at 1.

Claim 3

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, each row being organized into non-overlapping immediately adjacent K-bit words which are in a column sequence that starts at a start word and ends with a last word, a method for depleting a row of the pixel data array, comprising the steps of: (A) sequentially selecting the first through last in sequence K-bit word in the row; (B) forming an index of K+2 bits comprised of the selected K-bit word, a bit that is immediately adjacent the selected K-bit word and contained in an immediately prior in sequence K-bit word, and a second additional bit that is immediately adjacent the selected K-bit word and contained in an immediately next in sequence K-bit word, except for the first in sequence word in a row for which the first additional bit is a 0 and except for the last in sequence K-bit word for which the second additional bit is a 0; (C) accessing a depleter look-up table with the index for the selected K-bit word to obtain a replacement K-bit word; and (D) replacing the selected K-bit word with the replacement K-bit word, whereby all K-bit words in the pixel data array are replaced with K-bit words retrieved from the look-up table.

Claim 4

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, each row being organized into non-overlapping immediately adjacent K-bit words which are in a column sequence that starts at a start word and ends with a last word, a method for depleting a row of the pixel data array, comprising the steps of: (A) sequentially selecting the first through last in sequence K-bit word in the row; (B) forming an index of K+2 bits comprised of the selected K-bit word, a bit that is immediately adjacent the selected K-bit word and contained in an immediately prior in sequence K-bit word, and a second additional bit that is immediately adjacent the selected K-bit word and contained in an immediately next in sequence K-bit word, except for the first in sequence word in a row for which the first additional bit is a 0 and except for the last in sequence K-bit word for which the second additional bit is a 0; (C) accessing a depleter look-up table with the index for the selected K-bit word to obtain a replacement K-bit word; and (D) replacing the selected K-bit word with the replacement K-bit word, whereby all K-bit words in the pixel data array are replaced with K-bit words retrieved from the look-up table.

Claim 5

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for depleting a row of the pixel data array, comprising the steps of: (A) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is 0; (3) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is not 0; (B) for each word that contains at least the predetermined minimum number of 1's, bitwise binary ORing the binary 1's complement of the depletion mask associated therewith with a bit preserving mask to produce a modified depletion mask associated with the word; (C) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the modified depletion mask associated with the word to replace the word with a depleted word.

Claim 6

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for depleting a row of the pixel data array, comprising the steps of: (A) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is 0; (3) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is not 0; (B) for each word that contains at least the predetermined minimum number of 1's, bitwise binary ORing the binary 1's complement of the depletion mask associated therewith with a bit preserving mask to produce a modified depletion mask associated with the word; (C) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the modified depletion mask associated with the word to replace the word with a depleted word.

Claim 7

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for depleting a row of the pixel data array, comprising the steps of: (A) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is 0; (3) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is not 0; (B) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the binary 1's complement of the depletion mask associated with the word, so as to replace the word with a depleted word.

Claim 8

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for depleting a row of the pixel data array, comprising the steps of: (A) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is 0; (3) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is not 0; (B) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the binary 1's complement of the depletion mask associated with the word, so as to replace the word with a depleted word.

Claim 9

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for depleting a row of the pixel data array, comprising the steps of: (A) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the row being depleted is not the end row; (B) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the binary 1's complement of the depletion mask associated with the word so as to replace the word with a depleted word.

Claim 10

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for depleting a row of the pixel data array, comprising the steps of: (A) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the row being depleted is not the end row; (B) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the binary 1's complement of the depletion mask associated with the word so as to replace the word with a depleted word.

Claim 11

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for sequentially depleting each row of the pixel data array starting with the starting row, comprising the steps of: (A) horizontally depleting the row to provide a horizontally depleted row wherein bits at ends of a horizontal run of bits that are 1's are preserved while interior bits of a horizontal run are separated from each other by at least one bit that is 0, except as to a horizontal run having an even number of bits in which case a bit adjacent an end bit of the horizontal run remains 1; (B) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is 0; (3) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is not 0; (C) for each word that contains at least the predetermined minimum number of 1's, bitwise binary ORing the binary 1's complement of the depletion mask associated therewith with a bit preserving mask to produce a modified depletion mask associated with the word; (D) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the modified depletion mask associated with the word, so as to replace the word with a depleted word.

Claim 12

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for sequentially depleting each row of the pixel data array starting with the starting row, comprising the steps of: (A) horizontally depleting the row to provide a horizontally depleted row wherein bits at ends of a horizontal run of bits that are 1's are preserved while interior bits of a horizontal run are separated from each other by at least one bit that is 0, except as to a horizontal run having an even number of bits in which case a bit adjacent an end bit of the horizontal run remains 1; (B) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is 0; (3) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is not 0; (C) for each word that contains at least the predetermined minimum number of 1's, bitwise binary ORing the binary 1's complement of the depletion mask associated therewith with a bit preserving mask to produce a modified depletion mask associated with the word; (D) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the modified depletion mask associated with the word, so as to replace the word with a depleted word.

Claim 13

The method of claim 6 wherein different K-bit bit preserving masks are utilized for K-bit words that are adjacent in a same column.

Claim 14

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for sequentially depleting each row of the pixel data array starting with the starting row, comprising the steps of: (A) horizontally depleting the row to provide a horizontally depleted row wherein bits at ends of a horizontal run of bits that are 1's are preserved while interior bits of a horizontal run are separated from each other by at least one bit that is 0, except as to a horizontal run having an even number of bits in which case a bit adjacent an end bit of the horizontal run remains 1; (B) performing steps (C) through (E) only for alternating rows of the pixel data array; (C) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is 0; (3) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is not 0; (D) for each word that contains at least the predetermined minimum number of 1's, bitwise binary ORing the binary 1's complement of the depletion mask associated therewith with a bit preserving mask to produce a modified depletion mask associated with the word; and (E) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the modified depletion mask associated with the word, so as to replace the word with a depleted word.

Claim 15

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for sequentially depleting each row of the pixel data array starting with the starting row, comprising the steps of: (A) horizontally depleting the row to provide a horizontally depleted row wherein bits at ends of a horizontal run of bits that are 1's are preserved while interior bits of a horizontal run are separated from each other by at least one bit that is 0, except as to a horizontal run having an even number of bits in which case a bit adjacent an end bit of the horizontal run remains 1; (B) performing steps (C) through (E) only for alternating rows of the pixel data array; (C) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is 0; (3) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is not 0; (D) for each word that contains at least the predetermined minimum number of 1's, bitwise binary ORing the binary 1's complement of the depletion mask associated therewith with a bit preserving mask to produce a modified depletion mask associated with the word; and (E) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the modified depletion mask associated with the word, so as to replace the word with a depleted word.

Claim 16

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for sequentially depleting each row of the pixel data array starting with the starting row, comprising the steps of: (A) horizontally depleting the row to provide a horizontally depleted row wherein bits at ends of a horizontal run of bits that are 1's are preserved while interior bits of a horizontal run are separated from each other by at least one bit that is 0, except as to a horizontal run having an even number of bits in which case a bit adjacent an end bit of the horizontal run remains 1; (B) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is 0; (3) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is not 0; (C) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the binary 1's complement of the depletion mask associated with the word, so as to replace the word with a depleted word.

Claim 17

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for sequentially depleting each row of the pixel data array starting with the starting row, comprising the steps of: (A) horizontally depleting the row to provide a horizontally depleted row wherein bits at ends of a horizontal run of bits that are 1's are preserved while interior bits of a horizontal run are separated from each other by at least one bit that is 0, except as to a horizontal run having an even number of bits in which case a bit adjacent an end bit of the horizontal run remains 1; (B) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is 0; (3) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the binary 1's complement of the result of binary bitwise exclusive-ORing the word with an adjacent word in a prior in sequence row is not 0; (C) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the binary 1's complement of the depletion mask associated with the word, so as to replace the word with a depleted word.

Claim 18

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for sequentially depleting each row of the pixel data array starting with the starting row, comprising the steps of: (A) horizontally depleting the row to provide a horizontally depleted row wherein bits at ends of a horizontal run of bits that are 1's are preserved while interior bits of a horizontal run are separated from each other by at least one bit that is 0, except as to a horizontal run that having an even number of bits in which case a bit adjacent an end bit of the horizontal run is remains 1; (B) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the row being depleted is not the end row; (C) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the binary 1's complement of the depletion mask associated with the word, so as to replace the word with a depleted word.

Claim 19

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels each having an associated pixel data bit in a bit-mapped pixel data array which is logically organized in rows and columns to correspond to the printed pixel array, the rows being organized in a sequence that starts with a starting row and ends with an ending row, each row of the pixel data array being organized into non-overlapping immediately adjacent K-bit words, a method for sequentially depleting each row of the pixel data array starting with the starting row, comprising the steps of: (A) horizontally depleting the row to provide a horizontally depleted row wherein bits at ends of a horizontal run of bits that are 1's are preserved while interior bits of a horizontal run are separated from each other by at least one bit that is 0, except as to a horizontal run that having an even number of bits in which case a bit adjacent an end bit of the horizontal run is remains 1; (B) providing a depletion mask for each word having at least a predetermined number of 1's, wherein the depletion mask comprises one of the following: (1) the adjacent word in the immediately prior row if the row being depleted is the end row; (2) the result of bitwise binary ANDing of an adjacent word in the immediately prior row with an adjacent word in the immediately next row if the row being depleted is not the end row; (C) for each word that contains at least the predetermined minimum number of 1's, replacing the word with a result of bitwise binary ANDing the word with the binary 1's complement of the depletion mask associated with the word, so as to replace the word with a depleted word.

Claim 20

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels, a method for upscaling a first bit-mapped pixel data array logically organized in rows and columns to a second bit-mapped pixel data array logically arranged in rows and columns, wherein the resolution of the second bit-mapped pixel data array along each of the row and column axes is twice that of the first bit-mapped pixel data array, comprising the steps of: (A) allocating a four-bit cell in the second array for each bit in the first array, wherein the four-bit cell is comprised of four bits logically arranged in two rows and two columns, such that four-bit cells in the second array are logically organized in rows and columns in the same manner as corresponding bits in the first array; (B) for each four-bit cell, setting both bits at a predetermined column location within the cell that is the same for all four-bit cells to the contents of the corresponding bits in the first pixel array; and (C) for each four-bit cell, setting the bits in the other column of the bit cell to 0.

Claim 21

In a swath type printer having a movable carriage for supporting a plurality of print elements which are controlled to print dots on a rectilinear array of pixels, a method for upscaling a first bit-mapped pixel data array logically organized in rows and columns to a second bit-mapped pixel data array logically arranged in rows and columns, wherein the resolution of the second bit-mapped pixel data array along each of the row and column axes is twice that of the first bit-mapped pixel data array, comprising the steps of: (A) allocating a four-bit cell in the second array for each bit in the first array, wherein the four-bit cell is comprised of four bits logically arranged in two rows and two columns, such that four-bit cells in the second array are logically organized in rows and columns in the same manner as corresponding bits in the first array; (B) for each four-bit cell, setting both bits at a predetermined column location within the cell that is the same for all four-bit cells to the contents of the corresponding bits in the first pixel array; and (C) for each four-bit cell, setting the bits in the other column of the bit cell to 0.