JPS62269267A - Drawing data preparing device - Google Patents
Drawing data preparing deviceInfo
- Publication number
- JPS62269267A JPS62269267A JP61112621A JP11262186A JPS62269267A JP S62269267 A JPS62269267 A JP S62269267A JP 61112621 A JP61112621 A JP 61112621A JP 11262186 A JP11262186 A JP 11262186A JP S62269267 A JPS62269267 A JP S62269267A
- Authority
- JP
- Japan
- Prior art keywords
- data
- processing
- cell
- cells
- plural
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000010894 electron beam technology Methods 0.000 claims 1
- 238000003491 array Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000000034 method Methods 0.000 description 2
- 239000003795 chemical substances by application Substances 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
Landscapes
- Electron Beam Exposure (AREA)
Abstract
Description
【発明の詳細な説明】
〔産業上の利用分野〕
本発明は、高速図形処理に係り、特に階層データの展開
に好適な図形処理装置に関する。DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to high-speed graphic processing, and particularly to a graphic processing device suitable for developing hierarchical data.
従来、多階層のデータを展開するためには、計算機に於
ける処理プログラムにて複雑な処理を行つている。即ち
、階層の深さだけ多重のD○ループをかさね処理を行っ
ている。Conventionally, in order to expand multi-layered data, complicated processing has been performed using a processing program in a computer. That is, processing is performed by repeating multiple D* loops for the depth of the hierarchy.
プログラム処理で行う場合、多重ループの繰返しとなる
ため、直列処理を行う計算機のみでは処理時間の増大を
まねき、ひいては高価な高速計算機を必要とする問題が
あった。When performing program processing, multiple loops are repeated, which leads to an increase in processing time if only a computer that performs serial processing is used, resulting in the problem of requiring an expensive high-speed computer.
本発明の目的は、実現しやすい、ピンチ積算等の回路を
用い、演算を並行処理することにより、処理の高速化を
する事にある。An object of the present invention is to speed up processing by processing operations in parallel using a pinch integration circuit that is easy to implement.
上記目的は、全処理を計算機にまかせるのでなく、比較
的単純な回路で実現できるハードウェア、特に同一回路
を多段に縦続接続するように構成で実現し負荷分散を図
り並行処理化する事で達成される。The above objective was achieved not by leaving all processing to a computer, but by using hardware that can be realized using relatively simple circuits, especially by cascading the same circuit in multiple stages to distribute the load and achieve parallel processing. be done.
第1図に実施例を示す。第2図に階層データの展開例を
示す。CというICは、セルB他のデータより構成され
、Bは複数個配置される。セルBは又セルA他のデータ
より構成され、セルAは複数個配置される。セルAの中
には基本バタンとして複数のデータが含まれる。セルA
に着目する場合、ホストCPUにより、階層データより
配列情報とセルAのデータが抽出され、セルAのデータ
は、第1図のセル要素座標データメモリ3に、例えば、
図形の辺を現わす座標データ、方向データ等定められた
形で設定される。(zt、yt、、・・・X21 y2
1・・・Xn、yn・・・終了指示データ、などの形式
で処理体系に合わせる。)配列情報は、第1図のn個縦
続接続された座標発生回路の設定値として与えられる。An example is shown in FIG. FIG. 2 shows an example of how hierarchical data is developed. An IC called C is composed of cells B and other data, and a plurality of Bs are arranged. Cell B is also composed of data other than cell A, and a plurality of cells A are arranged. Cell A contains a plurality of data as basic buttons. Cell A
When focusing on , the host CPU extracts the array information and the data of cell A from the hierarchical data, and the data of cell A is stored in the cell element coordinate data memory 3 in FIG. 1, for example.
Coordinate data and direction data representing the sides of the figure are set in a predetermined form. (zt, yt,...X21 y2
1... Xn, yn... Completion instruction data, etc., to suit the processing system. ) Array information is given as setting values of n cascaded coordinate generation circuits shown in FIG.
Aに接する最下位配列情報がn番目に、その上がn−1
番目に・・・と順次配列情報が設定され、設定データの
ない所は配列個数を1として設定する。配列情報として
は、配列ピンチ(P x 1+ P y s・= P
xn、P yn) +配列個数(n Xi l n y
t l・・・nxn、 Xyn)が、基本座標原点は、
X1+ ylとして設定される。起動されるとn番目の
座標発生回路の出力Xo、Yoと、セル要素座標データ
メモリ3から順次読み出される座標データの加算を行う
。The lowest array information adjacent to A is nth, and the one above it is n-1
Array information is set sequentially, and the number of arrays is set to 1 where there is no setting data. As array information, array pinch (P x 1+ P y s・= P
xn, P yn) + number of arrays (n Xi l ny
t l...nxn, Xyn), but the basic coordinate origin is
Set as X1+yl. When activated, the outputs Xo, Yo of the n-th coordinate generation circuit and the coordinate data sequentially read from the cell element coordinate data memory 3 are added.
xo+x+=x
yO+yI:y
その結果により、セルAの1ヶ分の展開データが発生し
バッファメモリ4に財えられる。セルAの全データにつ
いて完了すると、パルスOFoによりn番目座標発生回
路をたたき、X方向ピンチ分シフ1−データを作成する
。このようにnxnケ分シフトデータが作成されると次
に、y方向シフト量をピッチpy4だけ増分させると共
にX方向シフト景をクリアする。かくしてy方向nff
nケ分完了すると、xy両方向シフト量をクリアすると
共に上段にオーバフローパルス○Fn (図示なし)を
送り、n段目と同様の事をn−1段目で繰り返えす。xo+x+=x yO+yI:y As a result, one piece of expanded data for cell A is generated and stored in the buffer memory 4. When all the data in cell A is completed, the n-th coordinate generation circuit is hit by the pulse OFo to create shift 1-data for the pinch in the X direction. When the nxn shift data is created in this way, the y-direction shift amount is incremented by pitch py4, and the X-direction shift scene is cleared. Thus the y direction nff
When n steps are completed, the x and y direction shift amount is cleared and an overflow pulse ○Fn (not shown) is sent to the upper stage, and the same thing as the nth stage is repeated at the (n-1)th stage.
全設定繰返しを完了すると、1段目座標発生回路上より
オーバフローパルスOF lが得られ、ホストCPUに
割込みをかけ、展開が終了した事を知らせる。展開剤デ
ータをバッファ4より読み出せばよい。なお、全展開デ
ータをバッファメモリ4に貯える事は容量的に問題があ
り、2面バンファ構成し、満杯になり次第ホストCPU
へDMAて送り外部ファイルへ格納する方式が実際的で
ある。When all setting repetitions are completed, an overflow pulse OF1 is obtained from the first stage coordinate generation circuit, which interrupts the host CPU to notify that the expansion has ended. The developing agent data may be read from the buffer 4. Note that storing all expanded data in the buffer memory 4 has a capacity problem, so it is configured as a two-sided buffer, and as soon as it is full, the host CPU
A practical method is to send the data via DMA to an external file and store it in an external file.
以上、述べたような動作をさせる制御信号をコントロー
ラ5によって発生する。The controller 5 generates a control signal that causes the operations described above.
この結果、セルデータの伝聞はデータ的に行われ、xy
座標演算等並行して行われるため、はぼメモリー3から
データを読み出すサイクルで展開でき、その間ホストC
PUは次の準備ができるため、処理能力の向上をはかれ
る。As a result, cell data hearsay is done data-wise, xy
Since coordinate calculations etc. are performed in parallel, data can be expanded in the cycle of reading data from memory 3, and during that time the host C
Since the PU can prepare for the next step, the processing capacity can be improved.
本発明によれば、処理速度をきめるのは、作成された配
置データXn、ynと、セル要素座標データを、第1図
3より順次読み出しながら加算して行くため、基本的に
はセル要素データを読み出すメモリサイクル毎に、1座
標を処理する事ができ数M座標/秒の処理が可能となる
。According to the present invention, processing speed is determined by adding the created arrangement data Xn, yn and cell element coordinate data while sequentially reading them from FIG. One coordinate can be processed in each memory cycle for reading out the data, making it possible to process several M coordinates/second.
第1図は本発明の詳細な説明図、第2図はセルデータ展
開例を示す図である。FIG. 1 is a detailed explanatory diagram of the present invention, and FIG. 2 is a diagram showing an example of cell data expansion.
Claims (1)
るデータより作成する描画データ作成装置において、セ
ルデータの、配置基準位置と配列ピッチと配列固数より
、配置座標を算出する座標発生回路を多段に縦属接続し
複数階層により定められる基本セルの配置座標を求め、
基本セルの図形データとから、展開された図形データを
高速に作成する事を特徴とする描画データ作成装置。1. In a drawing data creation device such as an electron beam drawing device that creates drawing data from data having a hierarchical structure, a coordinate generation circuit that calculates arrangement coordinates from the arrangement reference position, arrangement pitch, and arrangement fixed number of cell data. Find the placement coordinates of basic cells defined by multiple layers by vertically connecting them in multiple layers,
A drawing data creation device characterized by rapidly creating expanded figure data from figure data of basic cells.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP61112621A JPS62269267A (en) | 1986-05-19 | 1986-05-19 | Drawing data preparing device |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP61112621A JPS62269267A (en) | 1986-05-19 | 1986-05-19 | Drawing data preparing device |
Publications (1)
Publication Number | Publication Date |
---|---|
JPS62269267A true JPS62269267A (en) | 1987-11-21 |
Family
ID=14591313
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP61112621A Pending JPS62269267A (en) | 1986-05-19 | 1986-05-19 | Drawing data preparing device |
Country Status (1)
Country | Link |
---|---|
JP (1) | JPS62269267A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH01196668A (en) * | 1988-02-01 | 1989-08-08 | Suzuki Motor Co Ltd | High speed three-dimensional cad system |
-
1986
- 1986-05-19 JP JP61112621A patent/JPS62269267A/en active Pending
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH01196668A (en) * | 1988-02-01 | 1989-08-08 | Suzuki Motor Co Ltd | High speed three-dimensional cad system |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0122048A2 (en) | Data processing cells and parallel data processors incorporating such cells | |
US4259724A (en) | Device comprising a circuit for making a beam exposure system effectively draw a repetitive pattern | |
JPS62264357A (en) | Simulation of processor addition for parallel processor array | |
JPS6234133B2 (en) | ||
US4553220A (en) | Matrix multiplier with normalized output | |
JP3999301B2 (en) | Exposure data creation method | |
US5493509A (en) | Method of and apparatus for generating mask layouts | |
JPH0357608B2 (en) | ||
JPS62269267A (en) | Drawing data preparing device | |
Belosloudtsev et al. | Programmable active memories in real-time tasks: implementing data-driven triggers for LHC experiments | |
JPH0622195B2 (en) | Charged beam drawing device | |
JPS61138335A (en) | Arithmetic circuit of storage element | |
JP3293640B2 (en) | Circuit data connection tracking system | |
JP2938601B2 (en) | Arrangement method | |
JP2887958B2 (en) | Test instruction sequence generation method | |
JP3408010B2 (en) | Pattern developing method and apparatus for charged particle beam exposure apparatus | |
JP2518912B2 (en) | Parallel data processor | |
JPH0375905B2 (en) | ||
JPH05342306A (en) | Mask pattern data compressing method | |
JPH0524552B2 (en) | ||
JP2839597B2 (en) | Device for creating charged beam drawing data | |
JPH05206275A (en) | Exposure data preparation method | |
JPH03196257A (en) | Vector processor | |
JPS58178532A (en) | Detecting device for wiring route | |
JP2697943B2 (en) | Processing method of writing data in charged particle beam writing |