§
Luxuse
Patent Intelligence
Sign In
Patent US5544338A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5544338A Expired / Lapsed US ⏱️ 0.0 years remaining

Apparatus and method for raster generation from sparse area array output

Assignee: International Business Machines Corp
•
Filing: 1992-12-31
•
Granted: 1996-08-06
•
Expires: 2012-12-31
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A camera image data processor provides scan conversion at extremely high speed while allowing static and dynamic correction of image data particularly for a high data output rate CCD image transducer in a confocal imaging system for automated optical inspection in manufacturing processes. Scan conversion and data collation is accomplished at bit rates in excess of 1 Gigabyte by accessing a double buffer memory with different sequences of addresses covering a field of an image corresponding to a field in the memory during read and write operations. Highly parallel output is provided for confocal height data in a raster line by providing a delay equal to an integral multiple of the access time for a field for each confocally imaged height within a sample.

Inventors

  • 👤 Donald C. Forslund

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-06 13:55
CPC Classifications
H; H04; H04N; H04N25/00

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 156 words
A method of operating a memory to store and access data in a field thereof including the steps of: providing at least two sequences of numbers as partial addresses for said memory, the combination of said partial addresses forming an address sequence identifying all memory addresses in said field of said memory; and altering at least a portion of said address sequence to form an altered address sequence during one of write and read operations in said memory, said altered address sequence identifying all addresses in said field of said memory; at least one of said address sequence and said altered address sequence identifying all addresses in said field of said memory in a non-sequential order of numerical address, wherein said memory includes at least two independent buffers and wherein said method includes the further step of simultaneously writing to one of said independent buffers and reading from another of said at least two independent buffers.
Claim 2
Independent Claim 156 words
A method of operating a memory to store and access data in a field thereof including the steps of: providing at least two sequences of numbers as partial addresses for said memory, the combination of said partial addresses forming an address sequence identifying all memory addresses in said field of said memory; and altering at least a portion of said address sequence to form an altered address sequence during one of write and read operations in said memory, said altered address sequence identifying all addresses in said field of said memory; at least one of said address sequence and said altered address sequence identifying all addresses in said field of said memory in a non-sequential order of numerical address, wherein said memory includes at least two independent buffers and wherein said method includes the further step of simultaneously writing to one of said independent buffers and reading from another of said at least two independent buffers.
Claim 3
Independent Claim 145 words
A method of operating a memory to store and access data in a field thereof including the steps of: providing at least two sequences of numbers as partial addresses for said memory, the combination of said partial addresses forming an address sequence identifying all memory addresses in said field of said memory; altering at least a portion of said address sequence to form an altered address sequence during one of write and read operations in said memory, said altered address sequence identifying all addresses in said field of said memory; at least one of said address sequence and said altered address sequence identifying all addresses in said field of said memory in a non-sequential order of numerical address; and controlling the read and write operations of said memory in accordance with a least significant bit of one of said at least two sequences of numbers.
Claim 4
Independent Claim 145 words
A method of operating a memory to store and access data in a field thereof including the steps of: providing at least two sequences of numbers as partial addresses for said memory, the combination of said partial addresses forming an address sequence identifying all memory addresses in said field of said memory; altering at least a portion of said address sequence to form an altered address sequence during one of write and read operations in said memory, said altered address sequence identifying all addresses in said field of said memory; at least one of said address sequence and said altered address sequence identifying all addresses in said field of said memory in a non-sequential order of numerical address; and controlling the read and write operations of said memory in accordance with a least significant bit of one of said at least two sequences of numbers.
Claim 5
Dependent Claim 41 words
A method as recited in claim 1, including the further step of controlling the read and write operations of said at least two independent buffers in accordance with a least significant bit one of said at least two sequences of numbers.
Claim 6
Independent Claim 143 words
A method of operating a memory to store and access data in a field thereof including the steps of: providing at least two sequences of numbers as partial addresses for said memory, the combination of said partial addresses forming an address sequence identifying all memory addresses in said field of said memory; altering at least a portion of said address sequence to form an altered address sequence during one of write and read operations in said memory, said altered address sequence identifying all addresses in said field of said memory; at least one of said address sequence and said altered address sequence identifying all addresses in said field of said memory in a non-sequential order of numerical address; and merging at least two input data streams by alternately selecting a fixed plurality of data bits from each of said two input data streams.
Claim 7
Independent Claim 143 words
A method of operating a memory to store and access data in a field thereof including the steps of: providing at least two sequences of numbers as partial addresses for said memory, the combination of said partial addresses forming an address sequence identifying all memory addresses in said field of said memory; altering at least a portion of said address sequence to form an altered address sequence during one of write and read operations in said memory, said altered address sequence identifying all addresses in said field of said memory; at least one of said address sequence and said altered address sequence identifying all addresses in said field of said memory in a non-sequential order of numerical address; and merging at least two input data streams by alternately selecting a fixed plurality of data bits from each of said two input data streams.
Claim 8
Independent Claim 146 words
A method of operating a memory to store and access data in a field thereof including the steps of: providing at least two sequences of numbers as partial addresses for said memory, the combination of said partial addresses forming an address sequence identifying all memory addresses in said field of said memory; altering at least a portion of said address sequence to form an altered address sequence during one of write and read operations in said memory, said altered address sequence identifying all addresses in said field of said memory; at least one of said address sequence and said altered address sequence identifying all addresses in said field of said memory in a non-sequential order of numerical address; and wherein said method is performed on at least two memories and including the further step of: delaying the output of one of said at least two memories.
Claim 9
Independent Claim 146 words
A method of operating a memory to store and access data in a field thereof including the steps of: providing at least two sequences of numbers as partial addresses for said memory, the combination of said partial addresses forming an address sequence identifying all memory addresses in said field of said memory; altering at least a portion of said address sequence to form an altered address sequence during one of write and read operations in said memory, said altered address sequence identifying all addresses in said field of said memory; at least one of said address sequence and said altered address sequence identifying all addresses in said field of said memory in a non-sequential order of numerical address; and wherein said method is performed on at least two memories and including the further step of: delaying the output of one of said at least two memories.
Claim 10
Dependent Claim 40 words
A method as recited in claim 5, wherein said delay is for a time approximately equal to a duration of said address sequence for identifying of all said addresses in said field of one of said at least two memories.
Claim 11
Independent Claim 210 words
A method of operating a memory to store and access data in a field thereof including the steps of: providing at least two sequences of numbers as partial addresses for said memory, the combination of said partial addresses forming an address sequence identifying all memory addresses in said field of said memory; altering at least a portion of said address sequence to form an altered address sequence during one of write and read operations in said memory, said altered address sequence identifying all addresses in said field of said memory; at least one of said address sequence and said altered address sequence identifying all addresses in said field of said memory in a non-sequential order of numerical address; wherein said step of altering said at least a portion of said address sequence to form an altered address sequence includes the steps of: storing a pattern of addresses in a second memory, said pattern of addresses including all addresses in said field, applying at least selected bits of said address sequence to said second memory to access said stored pattern of addresses, in sequence, and applying said stored pattern of addresses to said memory during one of read and write operations of said memory to access all data in said field.
Claim 12
Independent Claim 210 words
A method of operating a memory to store and access data in a field thereof including the steps of: providing at least two sequences of numbers as partial addresses for said memory, the combination of said partial addresses forming an address sequence identifying all memory addresses in said field of said memory; altering at least a portion of said address sequence to form an altered address sequence during one of write and read operations in said memory, said altered address sequence identifying all addresses in said field of said memory; at least one of said address sequence and said altered address sequence identifying all addresses in said field of said memory in a non-sequential order of numerical address; wherein said step of altering said at least a portion of said address sequence to form an altered address sequence includes the steps of: storing a pattern of addresses in a second memory, said pattern of addresses including all addresses in said field, applying at least selected bits of said address sequence to said second memory to access said stored pattern of addresses, in sequence, and applying said stored pattern of addresses to said memory during one of read and write operations of said memory to access all data in said field.
Claim 13
Dependent Claim 161 words
A high speed scan converter comprising a memory including at least two buffers, a first counter for generating a first sequence of multi-bit digital addresses, a second counter for generating a second sequence of multi-bit digital addresses, said second counter operating synchronously with said first counter, means responsive to at least one selected bit of one of said first and second sequences of multi-bit digital addresses for causing a write operation in one of said at least two buffers simultaneously with a read operation in another of said at least two buffers and means for accessing a field of data in said memory in accordance with said first and second sequences of multi-bit addresses, said means for accessing a field of data including means for substituting an altered pattern of addresses for at least a portion of at least one of said first and second digital address sequences during one of read and write operations of said at least two buffers.
Claim 14
Dependent Claim 161 words
A high speed scan converter comprising a memory including at least two buffers, a first counter for generating a first sequence of multi-bit digital addresses, a second counter for generating a second sequence of multi-bit digital addresses, said second counter operating synchronously with said first counter, means responsive to at least one selected bit of one of said first and second sequences of multi-bit digital addresses for causing a write operation in one of said at least two buffers simultaneously with a read operation in another of said at least two buffers and means for accessing a field of data in said memory in accordance with said first and second sequences of multi-bit addresses, said means for accessing a field of data including means for substituting an altered pattern of addresses for at least a portion of at least one of said first and second digital address sequences during one of read and write operations of said at least two buffers.
Claim 15
Dependent Claim 25 words
A scan converter as recited in claim 8, wherein said first counter is a raster line counter and said second counter is a pixel counter.
Claim 16
Dependent Claim 33 words
A scan converter as recited in claim 8, further including means for merging at least two input data streams into a single data stream applied in parallel to said at least two buffers.
Claim 17
Dependent Claim 37 words
A scan converter as recited in claim 8, further including means for delaying data read from said memory by a time period equal to and integral multiple of a time period for accessing said field of data.

References Cited (Backward Citations)

US3774165A Cited
US4216533A Cited
US4394774A Cited
US4247920A Cited
US4424522A Cited
US4470142A Cited
US4462024A Cited
US4468688A Cited
US4587637A Cited
US4707610A Cited
US4692379A Cited
US4833657A Cited
US4703513A Cited
US5155829A Cited
US4893279A Cited
US5040149A Cited
US4800530A Cited
US4875157A Cited
US4875196A Cited
US4992955A Cited
US5067019A Cited
US5293623A Cited
US5261064A Cited
US5121360A Cited
US5296938A Cited
US5396607A Cited
US5359694A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-08-06 2000-02-05 2000-08-06 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-08-06 2004-02-05 2004-08-06 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-08-06 2008-02-05 2008-08-06 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag