Patent US5596684A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5596684A Expired / Lapsed US ⏱️ 0.0 years remaining

Anti-aliasing apparatus and method using fast scan-line memory mapping for sampling pixel patterns

Assignee: Hewlett Packard Development Co LP
•
Filing: 1994-11-23
•
Granted: 1997-01-21
•
Expires: 2014-11-23
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method processes a plurality of bits stored in a first memory and representing an image to be printed by reproducing the bits in a fast scan direction. The method includes the step of reading a plurality of groups from the first memory into a second memory, wherein each of the groups comprises a number of bits greater than one bit and is stored in the second memory in the fast scan direction, and wherein each group is read one group at a time. Further, the method includes copying a predetermined number of bits from each of the plurality of groups to a sample storage area. After the copying step, the method samples the bits of the copied groups wherein the sampled bits form a pattern having a center bit having a binary state. Finally, after the sampling step, the method outputs a print signal representative of the binary state if the pattern does not match a predetermined pattern, or outputs a print signal different than the binary state if the pattern matches a predetermined pattern.

Inventors

  • 👤 Thomas M. Ogletree
  • 👤 Michael J. Dougherty

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-06 12:59
CPC Classifications
G; G06; G06T; G06T11/00; G06T11/10; G06K; G06K15/00; G06K2215/00; G06K2215/0002; G06K2215/004; G06K2215/006

Claims Analysis

Total Claims: 21
Claim 1
Independent Claim 167 words
A method of processing a plurality of bits stored in a first memory and representing an image to be printed by reproducing said bits in a fast scan direction, the method comprising: reading a plurality of groups from said first memory into a second memory, wherein each of said groups comprises a number of bits greater than one bit and is stored in said second memory in said fast scan direction, and wherein each said group is read one group at a time; copying a predetermined number of bits from each of said plurality of groups to a sample storage area; after said copying step, sampling said bits of said copied groups wherein said sampled bits form a pattern having a center bit having a binary state; and after said sampling step: outputting a print signal representative of said binary state if said pattern does not match a predetermined pattern; and outputting a print signal different than said binary state if said pattern matches a predetermined pattern.
Claim 2
Independent Claim 167 words
A method of processing a plurality of bits stored in a first memory and representing an image to be printed by reproducing said bits in a fast scan direction, the method comprising: reading a plurality of groups from said first memory into a second memory, wherein each of said groups comprises a number of bits greater than one bit and is stored in said second memory in said fast scan direction, and wherein each said group is read one group at a time; copying a predetermined number of bits from each of said plurality of groups to a sample storage area; after said copying step, sampling said bits of said copied groups wherein said sampled bits form a pattern having a center bit having a binary state; and after said sampling step: outputting a print signal representative of said binary state if said pattern does not match a predetermined pattern; and outputting a print signal different than said binary state if said pattern matches a predetermined pattern.
Claim 3
Dependent Claim 80 words
The method of claim 1 wherein said copying step comprises: copying, one at a time, each of said plurality of groups to a working storage area, wherein said working storage area comprises a first number of bit registers arranged in rows and columns, and wherein said groups of bits are copied into said rows in said fast scan direction; and copying, at one time, all of said plurality of groups from said working storage area to a holding storage area.
Claim 4
Dependent Claim 14 words
The method of claim 2 wherein said first number of bits is forty bits.
Claim 5
Dependent Claim 73 words
The method of claim 2 wherein said holding storage area comprises said first number of bit registers arranged in rows and columns, and wherein said sample storage area comprises a second number of bit registers arranged in rows and columns, wherein said copying step further comprises copying, at one time, a column of said bit registers of said holding storage area to a column of said bit registers of said sample storage area.
Claim 6
Dependent Claim 24 words
The method of claim 4 wherein said first number of bits is forty bits and wherein said second number of bits is twenty-five bits.
Claim 7
Dependent Claim 38 words
The method of claim 1 wherein said step of copying a predetermined number of bits from each of said plurality of groups to a sample storage area comprises copying five bits from each of said plurality of groups.
Claim 8
Dependent Claim 14 words
The method of claim 1 wherein each of said groups consists of eight bits.
Claim 9
Dependent Claim 71 words
The method of claim 1 wherein said step of outputting a print signal different than said binary state comprises outputting, over a period equal to one bit time, a series of binary bits such that a pixel is printed in response to any of said binary bits representing a first state and such that a pixel is not printed in response to any of said binary bits representing a second state.
Claim 10
Dependent Claim 34 words
The method of claim 8 wherein said outputting step comprises addressing a register in response to said pattern, and wherein said outputting step comprises outputting said series of binary bits from said addressed register.
Claim 11
Dependent Claim 181 words
Apparatus for processing a plurality of bits stored in a first memory and representing an image to be printed by reproducing said bits in a fast scan direction, said apparatus comprising: a second memory for storing a plurality of groups from said first memory, wherein each of said groups comprises a number of bits greater than one bit and is stored in said second memory in said fast scan direction, and wherein each said group is stored from said first memory to said second memory one group at a time; a sample storage area for copying a predetermined number of bits from each of said plurality of groups to said sample storage area; control circuitry for sampling said bits of said copied groups wherein said sampled bits form a pattern having a center bit having a binary state, wherein said control circuitry is further operable for: outputting a print signal representative of said binary state if said pattern does not match a predetermined pattern; and outputting a print signal different than said binary state if said pattern matches a predetermined pattern.
Claim 12
Dependent Claim 181 words
Apparatus for processing a plurality of bits stored in a first memory and representing an image to be printed by reproducing said bits in a fast scan direction, said apparatus comprising: a second memory for storing a plurality of groups from said first memory, wherein each of said groups comprises a number of bits greater than one bit and is stored in said second memory in said fast scan direction, and wherein each said group is stored from said first memory to said second memory one group at a time; a sample storage area for copying a predetermined number of bits from each of said plurality of groups to said sample storage area; control circuitry for sampling said bits of said copied groups wherein said sampled bits form a pattern having a center bit having a binary state, wherein said control circuitry is further operable for: outputting a print signal representative of said binary state if said pattern does not match a predetermined pattern; and outputting a print signal different than said binary state if said pattern matches a predetermined pattern.
Claim 13
Dependent Claim 85 words
The apparatus of claim 10 and further comprising: a working storage area for copying, one at a time, each of said plurality of groups to said working storage area, wherein said working storage area comprises a first number of bit registers arranged in rows and columns, and wherein said groups of bits are copied into said rows in said fast scan direction; and circuitry for copying, at one time, all of said plurality of groups from said working storage area to a holding storage area.
Claim 14
Dependent Claim 72 words
The apparatus of claim 11 wherein said holding storage area comprises said first number of bit registers arranged in rows and columns, and wherein said sample storage area comprises a second number of bit registers arranged in rows and columns, and further comprising circuitry for copying, at one time, a column of said bit registers of said holding storage area to a column of said bit registers of said sample storage area.
Claim 15
Dependent Claim 74 words
The apparatus of claim 10 wherein said control circuitry is operable for outputting a print signal different than said binary state by outputting, over a period equal to one bit time, a series of binary bits such that a pixel is printed in response to any of said binary bits representing a first state and such that a pixel is not printed in response to any of said binary bits representing a second state.
Claim 16
Dependent Claim 206 words
A chip for coupling between a bitmap memory and a print engine, said bitmap memory storing a plurality of bits representing an image to be printed by reproducing said bits in a fast scan direction to said print engine, said chip comprising: a first interface for coupling to a buffer memory for storing a plurality of groups from said bitmap memory, wherein each of said groups comprises a number of bits greater than one bit and is stored in said buffer memory in said fast scan direction, and wherein each said group is stored from said bitmap memory to said buffer memory one group at a time; a sample storage area for copying a predetermined number of bits from each of said plurality of groups to said sample storage area; control circuitry for sampling said bits of said copied groups wherein said sampled bits form a pattern having a center bit having a binary state, wherein said control circuitry is further operable for: outputting a print signal to said print engine representative of said binary state if said pattern does not match a predetermined pattern; and outputting a print signal to said print engine different than said binary state if said pattern matches a predetermined pattern.
Claim 17
Dependent Claim 206 words
A chip for coupling between a bitmap memory and a print engine, said bitmap memory storing a plurality of bits representing an image to be printed by reproducing said bits in a fast scan direction to said print engine, said chip comprising: a first interface for coupling to a buffer memory for storing a plurality of groups from said bitmap memory, wherein each of said groups comprises a number of bits greater than one bit and is stored in said buffer memory in said fast scan direction, and wherein each said group is stored from said bitmap memory to said buffer memory one group at a time; a sample storage area for copying a predetermined number of bits from each of said plurality of groups to said sample storage area; control circuitry for sampling said bits of said copied groups wherein said sampled bits form a pattern having a center bit having a binary state, wherein said control circuitry is further operable for: outputting a print signal to said print engine representative of said binary state if said pattern does not match a predetermined pattern; and outputting a print signal to said print engine different than said binary state if said pattern matches a predetermined pattern.
Claim 18
Dependent Claim 51 words
The chip of claim 14 and further comprising a second interface for coupling to a pattern memory, wherein said control circuitry couples an address to said pattern memory, said address representative of said pattern, and wherein said pattern memory outputs data in response to said address to initiate said print signal.
Claim 19
Dependent Claim 88 words
The chip of claim 14 and further comprising: a working storage area for copying, one at a time, each of said plurality of groups to said working storage area, wherein said working storage area comprises a first number of bit registers arranged in rows and columns, and wherein said groups of bits are copied into said rows in said fast scan direction; and a holding storage area for copying, at one time, all of said plurality of groups from said working storage area to said holding storage area.
Claim 20
Dependent Claim 72 words
The chip of claim 14 wherein said holding storage area comprises said first number of bit registers arranged in rows and columns, and wherein said sample storage area comprises a second number of bit registers arranged in rows and columns, and further comprising circuitry for copying, at one time, a column of said bit registers of said holding storage area to a column of said bit registers of said sample storage area.
Claim 21
Dependent Claim 74 words
The chip of claim 14 wherein said control circuitry is operable for outputting a print signal different than said binary state by outputting, over a period equal to one bit time, a series of binary bits such that a pixel is printed in response to any of said binary bits representing a first state and such that a pixel is not printed in response to any of said binary bits representing a second state.

References Cited (Backward Citations)

US4847641A Cited
US5005139A Cited
US5222214A Cited
US5327260A Cited
US5249242A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2000-01-21 2000-07-22 2001-01-21 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2004-01-21 2004-07-22 2005-01-21 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2008-01-21 2008-07-22 2009-01-21 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag