← Back to Patent Explorer
US5128876A Expired / Lapsed US ⏱️ 0.0 years remaining

System for the real-time scheduling and loading of look-up tables for a patterning device

Assignee: Milliken and Co
•
Filing: 1990-03-02
•
Granted: 1992-07-07
•
Expires: 2010-03-02
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A control system for a patterning device which provides a method for sequentially loading look-up tables, representing pattern conversion values for different patterns to be printed in sequence, into a patterning device in real time. The system also provides a method for reloading a paricular look-up table or group of look-up tables in a prioritized sequence as necessary in order to change the characteristics of the pattern or patterns represented by the table or tables.

Inventors

  • 👤 Steven W. Cox

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 09:32
CPC Classifications
D; D06; D06B; D06B11/00; D06B11/0056; D06B11/0059

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 345 words
A method for processing digitally encoded pattern information for use in a patterning method wherein a plurality of arrays are spaced across the path of a moving substrate to be patterned, each of said arrays comprising a plurality of individually addressable dye applicators capable of selectively projecting a stream of dye onto a predetermined portion of the substrate corresponding to an individual pattern element comprising said pattern, said device capable of applying multiple pattern sets in sequence to a relatively moving substrate, each pattern set being comprised of at least one pattern having printing characteristics in association therewith, said method utilizing an electronic control system, said control system being comprised of an electronic computer having a first memory and a second memory, wherein data is transferred from said first memory to said second memory, said method further comprising: a. accessing the first pattern set; b. providing a second memory, said second memory comprised of a plurality of look-up tables, said look-up tables requiring loading for each of said patterns to be applied to said substrate; d. scheduling a pattern set by placing the pattern set into a scheduled queue; e. preparing said pattern set for printing by queuing each of said look-up tables for each pattern to be loaded from said first memory to said second memory such that each of said look-up tables are loaded in sequence before patterns associated with said respective look-up tables are applied to said substrate; f. generating and issuing direct memory access commands to transfer said pattern look-up tables from said first memory to said second memory during the process of applying previous patterns from those queued to run at a later time such that queued look-up tables are loaded in the correct sequence and prior to being needed; and g. re-queuing look-up tables to be transferred from said first memory to said second memory in a priority manner such as to load said look-up tables during running of their respective pattern to provide for the timely and efficient updating of said printing characteristics of said pattern as necessary.
Claim 2
Independent Claim 345 words
A method for processing digitally encoded pattern information for use in a patterning method wherein a plurality of arrays are spaced across the path of a moving substrate to be patterned, each of said arrays comprising a plurality of individually addressable dye applicators capable of selectively projecting a stream of dye onto a predetermined portion of the substrate corresponding to an individual pattern element comprising said pattern, said device capable of applying multiple pattern sets in sequence to a relatively moving substrate, each pattern set being comprised of at least one pattern having printing characteristics in association therewith, said method utilizing an electronic control system, said control system being comprised of an electronic computer having a first memory and a second memory, wherein data is transferred from said first memory to said second memory, said method further comprising: a. accessing the first pattern set; b. providing a second memory, said second memory comprised of a plurality of look-up tables, said look-up tables requiring loading for each of said patterns to be applied to said substrate; d. scheduling a pattern set by placing the pattern set into a scheduled queue; e. preparing said pattern set for printing by queuing each of said look-up tables for each pattern to be loaded from said first memory to said second memory such that each of said look-up tables are loaded in sequence before patterns associated with said respective look-up tables are applied to said substrate; f. generating and issuing direct memory access commands to transfer said pattern look-up tables from said first memory to said second memory during the process of applying previous patterns from those queued to run at a later time such that queued look-up tables are loaded in the correct sequence and prior to being needed; and g. re-queuing look-up tables to be transferred from said first memory to said second memory in a priority manner such as to load said look-up tables during running of their respective pattern to provide for the timely and efficient updating of said printing characteristics of said pattern as necessary.
Claim 3
Dependent Claim 33 words
A method according to claim 1, wherein said step of accessing the first pattern set is accomplished by means of utilizing a high speed disk connected to said first memory by a bus.
Claim 4
Dependent Claim 30 words
A method according to claim 2, wherein said step of accessing the first pattern set is accomplished by means of utilizing a pattern computer coupled to said high speed disk.
Claim 5
Dependent Claim 48 words
A method according to claim 1, wherein said step of scheduling a pattern set by placing the pattern set into a scheduled queue further comprises waiting for a pattern set, marking said pattern set as scheduled prior to the step of placing the pattern set into a queue.
Claim 6
Dependent Claim 35 words
A method according to claim 1, wherein said step of preparing said pattern set for printing by queuing further comprises indicating said pattern set as queued, not loaded, not loading and in need of loading.
Claim 7
Dependent Claim 46 words
A method according to claim 5, wherein said step of preparing said pattern set for printing by queuing and indicating said pattern set as queued, not loaded, not loading and in need of loading further comprises a later step of indicating said pattern set as loading.
Claim 8
Dependent Claim 78 words
A method according to claim 1, wherein said step of generating and issuing direct memory access commands to transfer said pattern look-up tables from said first memory to said second memory during the process of applying previous patterns from those queued to run at a later time such that queued look-up tables are loaded in the correct sequence and prior to being needed further comprises waiting for a transducer pulse prior to transferring a line of pattern data.
Claim 9
Dependent Claim 75 words
A method according to claim 1, wherein said step of generating and issuing direct memory access commands to transfer said pattern look-up tables from said first memory to said second memory during the process of applying previous patterns from those queued to run at a later time such that queued look-up tables are loaded in the correct sequence and prior to being needed further comprises a later step of indicating said pattern set as loaded.
Claim 10
Dependent Claim 82 words
A method according to claim 1, wherein said step of generating and issuing direct memory access commands to transfer said pattern look-up tables from said first memory to said second memory during the process of applying previous patterns from those queued to run at a later time such that queued look-up tables are loaded in the correct sequence and prior to being needed further comprises a later step of indicating said pattern set as loaded, loading and not in need of loading.
Claim 11
Dependent Claim 81 words
A method according to claim 1, wherein said step of generating and issuing direct memory access commands to transfer said pattern look-up tables from said first memory to said second memory during the process of applying previous patterns from those queued to run at a later time such that queued look-up tables are loaded in the correct sequence and prior to being needed further comprises a line of nulls being transferred if all pattern sets do not have a loaded indication.
Claim 12
Dependent Claim 72 words
A method according to claim 1, wherein said step of re-queuing look-up tables to be transferred from said first memory to said second memory in a priority manner such as to load said look-up tables during running of their respective pattern to provide for the timely and efficient updating of said pattern's printing characteristics as necessary further comprises a later step of determining whether said pattern set is indicating a loaded state.

References Cited (Backward Citations)

US3894413A Cited
US4033154A Cited
US4116626A Cited
US4170883A Cited
US4545086A Cited
US4923743A Cited
US5016308A Cited
US4984169A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-07-07 1996-01-06 1996-07-07 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-07-07 2000-01-06 2000-07-07 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-07-07 2004-01-06 2004-07-07 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag