[go: up one dir, main page]

JPS58114235A - Two-dimensional data converting and operating circuit - Google Patents

Two-dimensional data converting and operating circuit

Info

Publication number
JPS58114235A
JPS58114235A JP56211231A JP21123181A JPS58114235A JP S58114235 A JPS58114235 A JP S58114235A JP 56211231 A JP56211231 A JP 56211231A JP 21123181 A JP21123181 A JP 21123181A JP S58114235 A JPS58114235 A JP S58114235A
Authority
JP
Japan
Prior art keywords
data
memory
bus
code
dimensional
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.)
Granted
Application number
JP56211231A
Other languages
Japanese (ja)
Other versions
JPH029364B2 (en
Inventor
Takeshi Masui
桝井 猛
Toshio Matsuura
松浦 俊夫
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP56211231A priority Critical patent/JPS58114235A/en
Publication of JPS58114235A publication Critical patent/JPS58114235A/en
Publication of JPH029364B2 publication Critical patent/JPH029364B2/ja
Granted legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Advance Control (AREA)
  • Image Input (AREA)
  • Digital Computer Display Output (AREA)

Abstract

PURPOSE:To constitute a code converting circuit for executing plural pieces of code information stored in one memory, by simultaneously accessing data of plural two-dimensional arrays, through a bus connected to a memory with a pipeline. CONSTITUTION:One memory unit is provided, and an address bus and a data bus are provided only one each. By one memory, a two-dimensional code operation is executed at a high speed, reading and writing an input data and an output data by a data converting circuit. The data converting circuit generates 4 modes by a counter CT40 by making a fundamental clock CLK its base, sets an address of counters CT1-CT4 to addresses AD1-AD4 in time division in accordance with each mode, and reads an input code data in buffers BR1-BR3. Also, the result of operation stored in a two-dimensional buffer BF4 is sent to the memory and the operation is executed. In this way, it is possible to constitute a converting circuit whose memory and bus are simple.

Description

【発明の詳細な説明】 (1)  発明の技術分野 本発明の対象はlIi像処m%図形処理などを処理する
ために行なう画像データ%図形データの2次元配列のコ
ード情報に対するコード変換の演算回11に関する。
DETAILED DESCRIPTION OF THE INVENTION (1) Technical Field of the Invention The subject of the present invention is a code conversion operation for code information of a two-dimensional array of image data% graphic data, which is performed for processing lIi image processing, m% graphic processing, etc. Regarding episode 11.

(2)  従来技術と間喝点 従来のハードウェアで構成されていたコード変換回路は
1回路構成を簡単にするために%コード情報が格納され
ているメモリがパイプラインのバスを通じて1つの2次
元配列のデータしかアクセスできないので入力のバスと
出力のバスを別々に構成して、各々のバスにメモリt−
接続している演算を行なっている。□この場合、複数の
入力コードの間で相互に演算を行なう場合、入力コード
の数たけメモリモジ凰−ルが必要となシ、1つのコード
情報に対して1つのメモリモジ為−ルとバスが各々演算
回路に対して接続しなければならない欠点が生ずる。
(2) Disadvantages between the conventional technology and the code conversion circuit, which was constructed using conventional hardware, is one in which the memory in which code information is stored is connected to one two-dimensional circuit through a pipeline bus to simplify the circuit configuration. Since only array data can be accessed, the input bus and output bus are configured separately, and each bus has a memory t-
A connected operation is being performed. □In this case, when performing operations between multiple input codes, it is not necessary to have as many memory modules as there are input codes, and one memory module and bus are required for each code information. A drawback arises in that it must be connected to an arithmetic circuit.

以下、これを図を用いて詳細に説明する。This will be explained in detail below using figures.

従来、デー・夕変換の演算をハードウェアで行なう場合
には1.−第1図に示し九構成となる。入力データ、出
力データを格納するメモリモジエールMM1〜MM4が
必要とな9、各々メモリモジ、−ルはアドレスバスムD
i〜ムD4.データバスDム1−DA4が接続′してお
り、データ変換回路DCから発生したアドレスに対応し
たデータ(コード情報)がそれぞれ独自にアクセスでき
るようになっている。このデータ変換回路の欠点は、入
力とするa次元データの種類が多くなるKっれて。
Conventionally, when performing data/event conversion calculations using hardware, 1. - It has nine configurations as shown in Figure 1. Memory modules MM1 to MM4 are required to store input data and output data.9 Each memory module has an address bus D.
i~mu D4. Data buses Dm1-DA4 are connected, so that data (code information) corresponding to the address generated from the data conversion circuit DC can be accessed independently. The disadvantage of this data conversion circuit is that there are many types of a-dimensional data that can be input.

メモリモジ凰−ルの数が多くなシ、それにつれてアドレ
スバス、データバスも多くなり、メモリ容量の割にはバ
スが多くなる傾向がある〇この構成はデータ変換を高速
に処理するために第2図に示すように、変換回路内にそ
れぞれアドレスバス^Di〜ムD4に対応するだけカウ
ンタCTI〜O’r4をもち、パラレルにデータ転送が
行なわれる。
As the number of memory modules increases, the number of address buses and data buses also increases, and there is a tendency for the number of buses to increase relative to the memory capacity. This configuration uses a second module to process data conversion at high speed. As shown in the figure, the conversion circuit has counters CTI to O'r4 corresponding to address buses ^Di to D4, respectively, and data transfer is performed in parallel.

陶、BFI 〜BF4は2次元バy 77 s OCは
コード変換回@OLKはクロックである。
Sue, BFI ~ BF4 is a two-dimensional by 77s OC is a code conversion time @OLK is a clock.

(3)  発明O目的 本発明の目的は、メモリにパイプラインで接続し九バス
を通して、複数の2次元配列のデータを同時にアクセス
するととくより%1つのメモリに格納されている複数の
コード情報の演算が行なえるコード変換回路を提供する
ことKToる。
(3) Purpose of the Invention The purpose of the present invention is to simultaneously access data in a plurality of two-dimensional arrays by connecting the memory with a pipeline and through a bus, and in particular to access data in a plurality of code information stored in one memory. It is an object of the present invention to provide a code conversion circuit that can perform calculations.

(4)  発明の構成 本発明は、メモリアクセスにおける時分割のデータ転送
の速度と;−ド変換における2次元演算の速度を同期式
にすることによって、コード変換回路の入出力データの
パイプライン処理を可能にしたものである。
(4) Structure of the Invention The present invention improves the pipeline processing of input/output data of the code conversion circuit by making the speed of time-division data transfer in memory access and the speed of two-dimensional calculation in code conversion synchronous. This is what made it possible.

(5)発明の実施例 第3図は本発明の一実施例を示す図である。(5) Examples of the invention FIG. 3 is a diagram showing an embodiment of the present invention.

この構成は、メモリユニットMσを一つ設け、またアド
レスバスA D、、データバスシム。を夫々1つにして
1つのメモリで入力データより1〜ID3および出力デ
ータODt読書きしながら高速に′2次元コード演算を
行なうようにしたものである0第4図はデータ変換回路
Doの構成を示す図である。
This configuration includes one memory unit Mσ, address bus AD, and data bus shim. Figure 4 shows the configuration of the data conversion circuit Do. FIG.

本回路は基本クロックcLxをペースにして、カウンタ
OT、OKよって4つのモードを発生させる。各モード
に対応して、カウンタOT、〜CT、のアドレスの値を
時分割でアドレスバスムD1〜AD。
This circuit uses the basic clock cLx as a pace and generates four modes using the counters OT and OK. Corresponding to each mode, the address values of counters OT, ~CT, are time-divided into address buses D1~AD.

Kセットして入力コードデータをバッファBR1〜BR
魯に読み込む。
Set K and input code data to buffers BR1 to BR.
Load into Lu.

又、2次元バッファB IF41c格納されている演算
結果をメモリに送る。そしてモード番の状態で、従来の
データ変換回路と同じタイミングで演算を行なうことが
できる。
Also, the two-dimensional buffer B IF 41c sends the stored calculation results to the memory. In the state of the mode number, calculations can be performed at the same timing as conventional data conversion circuits.

本回Ili!を採用することによって、コードデータを
格納するメモリ及び、バスが闇、単になり、汎用のメモ
リボードを用いて構成することができた。
This time Ili! By adopting this, the memory for storing code data and the bus became simple and could be constructed using a general-purpose memory board.

尚、DECはデコーダ、DRは相方向ドライバ・レシー
バ、MPXはマルチプレフナである。
Note that DEC is a decoder, DR is a phase driver/receiver, and MPX is a multiplier.

第6図は第4FjAo2次元バッファ回路BFI〜BF
4の構成を示す図である。
Figure 6 shows the 4th FjAo two-dimensional buffer circuit BFI to BF.
4 is a diagram showing the configuration of No. 4. FIG.

CNT、。はカラ/り、COMはコンパレータ、RAM
はメモリ、LTI NLT3はラッチである。
C.N.T. is empty/re, COM is comparator, RAM
is a memory, and LTI NLT3 is a latch.

第6図は第4図の3人力の3X3の一コード変換回路C
Cのブロック図である。
Figure 6 shows the three-man powered 3X3 code conversion circuit C shown in Figure 4.
It is a block diagram of C.

図中LT、、 〜LT、、はラッチ、()1〜G、はゲ
ート、RAMはメモリである。
In the figure, LT, ... ~LT, are latches, ()1 to G are gates, and RAM is memory.

(6)  発明の効果 本発明によれば、コード変換に必要なコード情報を格納
するメモリt−1つにすることができるので、データ転
送に必要なバスを簡単にすることができ、又メモリユニ
ットも簡単にできる効果がある。
(6) Effects of the Invention According to the present invention, since it is possible to reduce the number of memories (t-1) to store code information necessary for code conversion, the bus necessary for data transfer can be simplified, and the memory The unit also has an effect that can be easily achieved.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図は従来のデータ変換回路の接続を示す図。 第2図は従来のデータ変換回路を示す図、第3図は本発
明の一実施例を示す図、第4図は本発明のデータ変換回
路を一実施例を委す図、第5図は第4図の2次元バッフ
ァの構成図、第6図は第4図の;−ド変換回@を示す図
である。
FIG. 1 is a diagram showing connections of a conventional data conversion circuit. FIG. 2 is a diagram showing a conventional data conversion circuit, FIG. 3 is a diagram showing an embodiment of the present invention, FIG. 4 is a diagram showing an embodiment of the data conversion circuit of the present invention, and FIG. 5 is a diagram showing an embodiment of the data conversion circuit of the present invention. FIG. 4 is a block diagram of the two-dimensional buffer, and FIG. 6 is a diagram showing the ;-code conversion circuit in FIG. 4.

Claims (1)

【特許請求の範囲】[Claims] 2次データを格納し九メモリより、同時に複数の2次元
データを読み出し、1つの入力データにおける2次元演
算および、11つ以上の入力データ間の相互演算を行な
い、そO演算結果を同時に同じメモリに格納することを
特徴とする2次元データ変換演算回路◎
It stores secondary data and simultaneously reads multiple two-dimensional data from the same memory, performs two-dimensional operations on one input data and mutual operations between 11 or more input data, and stores the operation results simultaneously in the same memory. A two-dimensional data conversion calculation circuit that stores data in ◎
JP56211231A 1981-12-28 1981-12-28 Two-dimensional data converting and operating circuit Granted JPS58114235A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP56211231A JPS58114235A (en) 1981-12-28 1981-12-28 Two-dimensional data converting and operating circuit

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP56211231A JPS58114235A (en) 1981-12-28 1981-12-28 Two-dimensional data converting and operating circuit

Publications (2)

Publication Number Publication Date
JPS58114235A true JPS58114235A (en) 1983-07-07
JPH029364B2 JPH029364B2 (en) 1990-03-01

Family

ID=16602451

Family Applications (1)

Application Number Title Priority Date Filing Date
JP56211231A Granted JPS58114235A (en) 1981-12-28 1981-12-28 Two-dimensional data converting and operating circuit

Country Status (1)

Country Link
JP (1) JPS58114235A (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5099653A (en) * 1973-12-29 1975-08-07
JPS5481045A (en) * 1977-12-12 1979-06-28 Hitachi Ltd Data processor

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5099653A (en) * 1973-12-29 1975-08-07
JPS5481045A (en) * 1977-12-12 1979-06-28 Hitachi Ltd Data processor

Also Published As

Publication number Publication date
JPH029364B2 (en) 1990-03-01

Similar Documents

Publication Publication Date Title
US5079693A (en) Bidirectional FIFO buffer having reread and rewrite means
US4110823A (en) Soft display word processing system with multiple autonomous processors
US6912626B1 (en) Method and apparatus for connecting a massively parallel processor array to a memory array in a bit serial manner
JPH11353225A (en) Memory that processor addressing gray code system in sequential execution style accesses and method for storing code and data in memory
US7284113B2 (en) Synchronous periodical orthogonal data converter
JPS58114235A (en) Two-dimensional data converting and operating circuit
US3526759A (en) Parallel binary to parallel binary coded decimal converter
JP3305406B2 (en) Program-controlled processor
CN112395009A (en) Operation method, operation device, computer equipment and storage medium
JPS61252714A (en) Programmable logical array
CN112396170B (en) Operation method, device, computer equipment and storage medium
JPS59101089A (en) Memory circuit
JP2722662B2 (en) Information conversion circuit
JP2690146B2 (en) Interrupt notification method
JP2975638B2 (en) Semiconductor integrated circuit
JPS59205665A (en) Picture processor
JP2504500B2 (en) Address translation device
JPS59132483A (en) Address converting device
SU1092484A1 (en) Information input device
JPH0235551A (en) Address conversion system for channel device
JP3018332B2 (en) Multi-channel analyzer
SU1196949A1 (en) Storage
JPH06175819A (en) Swap information storage format
JPS63118965A (en) DMA word transfer method
JPS6366661A (en) Storage control system