JPH03105615A - Composite arithmetic circuit of multiplication and addition provided with maximum value or minimum value detecting function - Google Patents

Composite arithmetic circuit of multiplication and addition provided with maximum value or minimum value detecting function

Info

Publication number
JPH03105615A
JPH03105615A JP24447389A JP24447389A JPH03105615A JP H03105615 A JPH03105615 A JP H03105615A JP 24447389 A JP24447389 A JP 24447389A JP 24447389 A JP24447389 A JP 24447389A JP H03105615 A JPH03105615 A JP H03105615A
Authority
JP
Japan
Prior art keywords
circuit
adder
multiplication
adders
primary
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
Application number
JP24447389A
Other languages
Japanese (ja)
Inventor
Tetsuya Mihashi
哲也 三橋
Satoru Kawai
哲 河合
Hiroaki Atsumi
宏昭 渥美
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 JP24447389A priority Critical patent/JPH03105615A/en
Publication of JPH03105615A publication Critical patent/JPH03105615A/en
Pending legal-status Critical Current

Links

Abstract

PURPOSE:To eliminate the unbalance of a load between adders at the time of FIND instruction processing by placing separately a selector circuit and a comparing circuit in primary and secondary adders, respectively. CONSTITUTION:A selector circuit 18 is provided in a primary adder 14, and a comparing circuit 19 is provided in a secondary adder 15. In the adder 15, input data (ai), (bi) are brought to large/small comparison by the comparing circuit 19 of the inside, and a selecting signal 20 for showing whether (ai) is selected or (bi) is selected is outputted, and sent out to the selector circuit 18 of the adder 14. In the selector circuit 18, one of the input data (ai), (bi) determined by the selecting signal 20 is selected, and it is outputted as output data (ci). Accordingly, when respect to each adder 14, 15, a load is dispersed to both of them at the time of executing a FIND instruction. In such a way, the unbalance of the load between primary and secondary adders can be obviated.

Description

【発明の詳細な説明】 (1!t W) 一連のデータの中の最大値または最小値を求めるFIN
D命令の高速処理機能をもつ乗算および加算複合演算回
路に関し. FIND命令処理時のプライマリとセカンダリの加算器
の間の負荷のアンバランスを解消することを目的とし. 乗算器とプライマリおよびセカンダリの2つの加算器と
を含む乗算および加算複合演算回路において.上記2つ
の加算器の一方には,入力された2つのデータの大小比
較を行って結果を出力する比較回路を設け.また上記2
つの加算器の他方には.入力された2つのデータの一方
を上記比較回路の出力によって選択し出力するセレクタ
回路を設け.一連のデータの中の最大値または最小値を
検出する命令の処理を行う場合,上記2つの加算器に設
けられている比較回路およびセレクタ回路を機能化する
よう構威した. び加算復合演算回路の改良を行うものである.〔産業上
の利用分野〕 本発明は.情報処理装置に用いられるベクトル演算回路
に関し.特に一連のデータの中の最大値また最小債を求
めるFIND命令の高速処理機能をもつ乗算および加算
複合演算回路に関する.ある一連のデータの中の最大値
あるいは最小値を求める処理は.ソフトウェアで実現し
ようとするとかなり時間を要するものとなり効率的でな
い.一方.この処理を専用ハードウエア回路で実現し.
高速化を図るには,この処理が行われる頻度がそれほど
高いとは言えないためコストパフォーマンスが悪くなり
.問題がある.そこで乗算.加算.乗算および加算の混
合演算を高速で処理するために情報処理装置にそなえら
れている乗算および加算複合演算回路のパイプライン機
構を利用して,これにFIND命令処理上必要となる最
小限の回路を付加し.必要時にそれらを機能化できるよ
うにしたものである.本発明はこのような乗算およ〔従
来の技術〕 第3図に.本発明が対象としているFIND命令処理機
能をもつパイプライン横戒の乗算および加算複合演算回
路の従来例を示す. 第3図において,1は乗算および加算複合演算同路.2
はベクトルレジスタである.ベクトルレジスタ2のデー
タは.レジスタ2M,  レジスタ3M,  レジスタ
2Aの各ボートから並列に読み出されて乗算および加算
複合演算回路lに入力される. 乗算および加3¥複合演算回路1(7)基本的な演算J
a能は,データをポートレジスタ各2M,3M,2Aで
表せば.2M*3M,2M (3M)+2A,2M13
M+2Aなどの演算を行うことにあるが,さらにFIN
D命令処理用のa能が付加されている. 乗算および加算複合演算回路1は.乗算器3と.プライ
マリの加算器を構威する桁上げ先見加算器(CPAで表
す)4と.セカングリの加算器を構成する桁上げ先見加
′JT.器(CPAで表す)5と.通常型の加算器(S
UMで表す)6とにより構成されている.ここで乗剪器
l個に対してプライマリとセカンダリの加算器が2個設
けられているのは.加算段階を並列動作させて高速化を
図るためである. 乗算器3の2つの人力はそれぞれレジスタ2M,3Mに
接続され.出力はC I3 A 4とCPA5の各一方
の人力に共通に接続されている.またCPA4.5の各
他方の入力は,共通にレジスタ2Aに接続されている.
さらにCPA4.5の各出力からベクトルレジスタ2に
パスが設けられ,CPAの出力を書き込みできるように
している.なおCPA4の出力はSUM6の入力へも接
続されている. このような構戒により,乗算および加算の複合演算を行
う場合.レジスタ2Mと3Mのデータについて乗算器3
で乗算し.その結果(2M*3M)をハーフクロック(
τ/2)でCPA4とC I) A5の各人力に交互に
転送し,またこれと同期させ゛ζ5 レジスタ2八から
のデークCPA4とCPA5の芥他方の人力に交互に供
給することにより,Cl)A,1.5でそれぞれクロッ
クτで並行して加算を行い,複合演算(2M*3M+2
人)を高速に次行することができる. 次にF I N +)命令を処理する場合の回路と機能
動作について説明する. CPA4の加算を行うための基本回路構或は,周知のも
のであるので説明を省略するが.その内部のアダー8に
.2つの入力データai,biの大小を比較する比較回
路9と,2つの入力データ;>i,biの一方を比較回
路9の出力によって選択するセレクク回路lOとが付加
されている.FIND命令実行時には,ベクトルレジス
タ2から,2つのベクトルデータ(a61a++ ・・
・air m,all),  (be,bl+ +++
,bl+ +・b,l)がレジスク2M,3Mの一方と
レジスタ2Aとから.それぞれ乗算および加算複合演算
回路1に入力される. 乗算器3は一方のベクトルデータa@+al+・・・.
a1.・・・,anをCPA4にスルーバスにし.他方
のベクトルデータbe,b+,・・・,bi,・・・b
nはCPA4に直接入力される.各ベクトルデークは.
それぞれ比較回路9とセレクタ回路lOに並列に入力さ
れる. 比較回路9は.各エレメントの対(as.b.).(a
,,bl  )+ ・・・+  (a i+  b i
).”・(an,bn)同士を比較し,たとえばFIN
D命令が最大{直を求めることを指定している場合.a
lとbiのうち大きい方を指示する選択信号をセレクタ
回路10に送る. セレクタ回路10は,比較回路9から与えられた選択信
号にしたがって.入力デークaiとblのいずれか一方
を選択し.これをciとしてSUMGへ出力する.これ
によりSUMG入力へは.ベクトルデータC@+CI+
 ・・・,ci,・・・cnが順次入力される. SLJM6は.これらのベクトルデータのエレメントが
先頭から逐次入力されるたびに,以前に入力されたエレ
メントと比較し.常に大きい方のエレメントを残してゆ
く方法で最大の値をもつ1つのエレメントを選択し.結
果として出力する.〔発明が解決しようとする!!I題
〕 第3図に示されている従来回路では,FIND命令実行
の際.プライマリの加算器にのみ負荷がかかり,セカン
ダリの加x器は遊んでおり,また各加算器をLSIで実
現する場合,セカンダリの加37.器にくらべてプライ
マリの加算器の構成が複雑になるため.集積度や回路パ
ターンが変わり,設計上不都合があった. 本発明は.FIND命令処理時のプライマリとセカンダ
リの加′IF.器間の負荷のアンバランスを解消するこ
とを目的としている. 〔!!!題を解決するための手段〕 本発明は.第3図の従来回路におけるプライマリの加算
器内の比較回路とセレクタ回路のうち,比較回路をセカ
ンダリの加算器内に移し,2つの加算器が共働してFI
ND命令の処理を行うようにしたものである. 第1図は本発明の原理横或図であり.11は乗算および
加算複合演算回路.12はベクトルレジスタ,13は乗
算器.14はプライマリの加算器.l5はセカンダリの
加算器,18は加算2314内に設けられたセレクタ回
路,19は加算器15内に設けられた比較回路.20は
比較回路19が大小を比較した結果の選択すべき一方の
入力データを指示する選υく信号である. 〔作 用〕 第1図に示されている本発明の原理によれば.プライマ
リとセカンダリの各加算i1114.15には,FIN
D命令実行時に負荷を双方に分散されることができ,ま
た両加算器のハード回路量の片寄りも改善される. 〔実施例〕 第2図に本発明の乗算および加算複合演算回路のl実施
例について要部構威を示す.図は,第1図中のプライマ
リおよびセカンダリの加算器部分のみを示している.ま
た.その他の回路部分の横成と動作は,第3図の従来例
回路で説明したものがそのまま適用できる. 第2図において.14はプライマリの加算器,l5はセ
カンダリの加算器.16および17はアダー.18はセ
レクタ回路.19は比較回路,20は比較回路l9から
セレクタ回路1Bへ送られる選択信号.21ないし30
はラッチ,ai,blは2つの入力データである(1−
1.2.・・・i,・・・,n).なお加算器14.1
5には.それぞれ第3図の加′II.器4,5と同様に
.高速動作可能な桁上げ先見加′n器CPAが使用され
る.FIND命令の処理を行うとき,入力データat,
b目よ2つの加算器14.15に並列に入力される.こ
の場合al,blのうち最大値を求めるものとする. 加算器14では,入力データalはアダー16とセレク
タ回路l8の各一方の入力に加えられるが.アダーl6
には取り込まれず,ここでは0人力の状態となる.また
入力データblはアダー1Gの他方の入力に加えられ,
上記した0人力と加罪されて,結果つまり入力データb
iがそのままアダー16から出力されて,セレクタ回路
1Bの他方の入力に加えられる. これに対して加算器!5では,入力データal,blは
アダーl7にそれぞれ入力され,内部の比較回路l9で
大小比較され,al≧b1かal<b1かにしたがって
alを選択するかb1を選択するかを示す選択信号20
を出力し.加算器l4のセレクタ回路18へ送出する. セレクタ回路l8では,選択信号20により定まる入力
データai,bIの一方を選択し,これをCIとして出
力する(1−1.2,・・・I  t,・・・n).こ
の出力データclは.第3図の従来回路中のSUM6で
説明したように.逐次先行する出力データと大小比較さ
れ,常に大きい方(II大値を求める場合)を残して次
の出力データとの比較にそなえるようにして最終的に最
大値をもつ出力データを残し結果として出力する. 上述した説明は,最大値を求める場合のものであるが.
J!小値を求める場合は,大小比較結果によるデータ選
択が逆になるだけで本質的には同じような動作が行われ
る. (発明の効果) 本発明による最大値または最小値検出機能をもつ乗算お
よび加算複合演算回路では,プライマリとセカンダリの
加算器内にセレクタ回路と比較回路とがそれぞれ分けて
配置されるため,負荷の分散が図られ,またセレクタ回
路の一方の入力をアグーの出力からとり.アダーをスル
ーパスとして川いることができるため,比較回路をもつ
方のアダーと回路パターンや信号タイミングの共通部分
が増え,LSI設計上有利となる.
[Detailed description of the invention] (1!t W) FIN to find the maximum or minimum value in a series of data
Concerning multiplication and addition complex arithmetic circuits with high-speed processing functions for D instructions. The purpose is to eliminate the load imbalance between the primary and secondary adders during FIND instruction processing. In a multiplication and addition complex operation circuit including a multiplier and two adders, primary and secondary. One of the two adders mentioned above is equipped with a comparison circuit that compares the magnitude of the two input data and outputs the result. Also, above 2
In the other of the two adders. A selector circuit is provided that selects and outputs one of the two input data based on the output of the comparison circuit. When processing an instruction to detect the maximum or minimum value in a series of data, we designed the comparison circuit and selector circuit provided in the two adders mentioned above to be functionalized. The purpose is to improve the addition and decomposition calculation circuit. [Industrial Application Field] The present invention... Regarding vector arithmetic circuits used in information processing devices. In particular, it relates to multiplication and addition complex arithmetic circuits capable of high-speed processing of the FIND command to find the maximum or minimum value in a series of data. The process of finding the maximum or minimum value in a series of data is. Attempting to implement this using software would take a considerable amount of time and would be inefficient. on the other hand. This processing is realized using a dedicated hardware circuit.
In order to increase the speed, this processing is not performed very often, so the cost performance is poor. There's a problem. Multiply there. Addition. In order to process mixed operations of multiplication and addition at high speed, the pipeline mechanism of the multiplication and addition complex operation circuit provided in the information processing device is utilized, and the minimum circuit required for processing the FIND instruction is added to this pipeline mechanism. Add. This allows them to be functionalized when necessary. The present invention solves such multiplication and [prior art] as shown in FIG. A conventional example of a pipeline horizontal multiplication and addition complex arithmetic circuit with a FIND instruction processing function, which is the object of the present invention, is shown below. In Figure 3, 1 is the same circuit for multiplication and addition compound operations. 2
is a vector register. The data in vector register 2 is . The data is read out in parallel from each port of register 2M, register 3M, and register 2A and input to the multiplication and addition complex operation circuit l. Multiplication and addition 3¥Compound operation circuit 1 (7) Basic operation J
If the data is represented by port registers of 2M, 3M, and 2A, the a function will be as follows. 2M*3M, 2M (3M)+2A, 2M13
The purpose is to perform operations such as M+2A, but in addition, FIN
A function for processing D instructions is added. The multiplication and addition complex operation circuit 1 is . Multiplier 3 and . A carry lookahead adder (denoted as CPA) 4, which constitutes the primary adder, and . Carry look-ahead addition that constitutes the secondary adder'JT. vessel (represented by CPA) 5 and. Normal type adder (S
It is composed of 6 (represented by UM). Here, two primary and secondary adders are provided for l multipliers. This is to increase the speed by operating the addition stage in parallel. The two inputs of multiplier 3 are connected to registers 2M and 3M, respectively. The output is commonly connected to the human power of each of CI3A4 and CPA5. In addition, each other input of CPA4.5 is commonly connected to register 2A.
Furthermore, a path is provided from each output of CPA4.5 to vector register 2, allowing the output of CPA to be written. Note that the output of CPA4 is also connected to the input of SUM6. When performing complex operations such as multiplication and addition using these rules. Multiplier 3 for data in registers 2M and 3M
Multiply by The result (2M*3M) is half clock (
By alternately transmitting data from CPA4 and CPA5 (τ/2) to each human power of CPA4 and CI) A5 and synchronizing with this, data from register 28 of ζ5 is alternately supplied to the other human power of CPA4 and CPA5. )A, 1.5 are added in parallel with each clock τ, and the compound operation (2M*3M+2
person) can be moved to the next line at high speed. Next, we will explain the circuit and functional operation when processing the F I N +) command. The basic circuit structure for performing addition in CPA4 is well known, so a description thereof will be omitted. Inside adder 8. A comparison circuit 9 that compares the magnitude of two input data ai and bi, and a select circuit lO that selects one of the two input data; >i and bi according to the output of the comparison circuit 9 are added. When executing the FIND instruction, two vector data (a61a++...
・air m, all), (be, bl+ +++
, bl+ +・b, l) from one of registers 2M and 3M and register 2A. Each is input to the multiplication and addition complex operation circuit 1. Multiplier 3 receives one vector data a@+al+...
a1. ..., make an through bus to CPA4. The other vector data be, b+,..., bi,...b
n is input directly to CPA4. Each vector data is .
They are respectively input in parallel to the comparison circuit 9 and the selector circuit IO. The comparison circuit 9 is. Each pair of elements (as.b.). (a
,,bl )+ ...+ (a i+ b i
). ”・Compare (an, bn) with each other, for example, FIN
When the D command specifies that the maximum value is to be found. a
A selection signal indicating the larger of l and bi is sent to the selector circuit 10. The selector circuit 10 operates according to the selection signal given from the comparison circuit 9. Select either input data ai or bl. Output this to SUMG as ci. This allows the SUMG input. Vector data C@+CI+
..., ci, ...cn are input sequentially. SLJM6 is. Each time these vector data elements are input sequentially from the beginning, they are compared with the previously input elements. Select the one element with the largest value, always leaving the largest element. Output as the result. [Invention tries to solve it! ! Problem I] In the conventional circuit shown in Fig. 3, when executing the FIND instruction. Only the primary adder is loaded, the secondary adder is idle, and if each adder is implemented with an LSI, the secondary adder 37. This is because the configuration of the primary adder is more complex than that of the adder. The degree of integration and circuit pattern changed, which caused design problems. The present invention is. Addition of primary and secondary IF during FIND instruction processing. The purpose is to eliminate the load imbalance between devices. [! ! ! Means for Solving the Problems] The present invention is as follows. Of the comparison circuit and selector circuit in the primary adder in the conventional circuit shown in Figure 3, the comparison circuit is moved to the secondary adder, and the two adders work together to create an FI.
It is designed to process ND instructions. Figure 1 is a horizontal diagram of the principle of the present invention. 11 is a multiplication and addition complex operation circuit. 12 is a vector register, 13 is a multiplier. 14 is the primary adder. l5 is a secondary adder, 18 is a selector circuit provided in the adder 2314, and 19 is a comparison circuit provided in the adder 15. Reference numeral 20 denotes a selection signal which instructs one of the input data to be selected as a result of the comparison circuit 19 in terms of magnitude. [Operation] According to the principle of the present invention shown in FIG. Each primary and secondary addition i1114.15 includes FIN
When executing the D instruction, the load can be distributed to both sides, and the unevenness of the amount of hardware circuitry in both adders is also improved. [Embodiment] Figure 2 shows the main part structure of an embodiment of the multiplication and addition complex operation circuit of the present invention. The figure shows only the primary and secondary adder parts in Figure 1. Also. The construction and operation of other circuit parts can be applied as is as explained in the conventional circuit shown in Figure 3. In Fig. 2. 14 is a primary adder, l5 is a secondary adder. 16 and 17 are Adder. 18 is a selector circuit. 19 is a comparison circuit, and 20 is a selection signal sent from comparison circuit 19 to selector circuit 1B. 21 to 30
is a latch, ai, bl are two input data (1-
1.2. ...i, ..., n). Note that adder 14.1
In 5. Addition II. of FIG. 3, respectively. Same as vessels 4 and 5. A carry look-ahead adder CPA capable of high-speed operation is used. When processing the FIND command, input data at,
The b-th signal is input in parallel to two adders 14 and 15. In this case, the maximum value of al and bl is determined. In the adder 14, the input data al is applied to one input of the adder 16 and the selector circuit l8. adder l6
It is not incorporated into the system, and there is no manpower required here. Also, input data bl is added to the other input of adder 1G,
Added to the above 0 manpower, the result is input data b
i is output as is from the adder 16 and added to the other input of the selector circuit 1B. Adder for this! In No. 5, input data al and bl are each input to an adder l7, and compared in magnitude by an internal comparison circuit l9, and a selection signal indicating whether to select al or b1 according to whether al≧b1 or al<b1 is generated. 20
Output. It is sent to the selector circuit 18 of adder l4. The selector circuit l8 selects one of the input data ai and bI determined by the selection signal 20 and outputs it as CI (1-1.2, . . . It, . . n). This output data cl is. As explained with SUM6 in the conventional circuit in Figure 3. The output data is successively compared in size with the preceding output data, and the larger one is always retained (when determining the II largest value) to prepare for comparison with the next output data, and finally the output data with the maximum value is left and output as the result. do. The above explanation is for finding the maximum value.
J! When finding the smallest value, essentially the same operation is performed, except that the data selection based on the size comparison result is reversed. (Effects of the Invention) In the multiplication and addition complex arithmetic circuit having a maximum value or minimum value detection function according to the present invention, the selector circuit and the comparison circuit are arranged separately in the primary and secondary adders, so that the load is reduced. Distribution is achieved, and one input of the selector circuit is taken from the Agoo output. Since the adder can be used as a through path, the number of circuit patterns and signal timings in common with the adder with the comparison circuit increases, which is advantageous in LSI design.

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

第1図は本発明の原理構或図.第2図は本発明の!実施
例回路の要部構成図.第3図は従来回路の構成図である
. 第1図中 11:乗算および加算複合演算回路 l2:ベクトルレジスタ 131乗′IE器 14;プライマリの加算器 15:セカンダリの加算器 l8:セレクタ回路 19+比較回路 20:選択信号
Figure 1 shows the basic structure of the present invention. Figure 2 shows the present invention! Main part configuration diagram of the example circuit. Figure 3 shows the configuration of the conventional circuit. 11 in Figure 1: Multiplication and addition complex arithmetic circuit l2: Vector register 131 multiplication 'IE unit 14; Primary adder 15: Secondary adder l8: Selector circuit 19 + comparison circuit 20: Selection signal

Claims (1)

【特許請求の範囲】 乗算器とプライマリおよびセカンダリの2つの加算器と
を含む乗算および加算複合演算回路において、 上記2つの加算器の一方には、入力された2つのデータ
の大小比較を行って結果を出力する比較回路を設け、 また上記2つの加算器の他方には、入力された2つのデ
ータの一方を上記比較回路の出力によって選択し出力す
るセレクタ回路を設け、 一連のデータの中の最大値または最小値を検出する命令
の処理を行う場合、上記2つの加算器に設けられている
比較回路およびセレクタ回路を機能化することを特徴と
する最大値または最小値検出機能をそなえた乗算および
加算複合演算回路。
[Claims] In a multiplication and addition complex arithmetic circuit including a multiplier and two adders, primary and secondary, one of the two adders is configured to compare the magnitude of two input data. A comparison circuit is provided to output the result, and the other of the two adders is provided with a selector circuit that selects and outputs one of the two input data based on the output of the comparison circuit, and selects and outputs one of the two input data. A multiplication device equipped with a maximum value or minimum value detection function, characterized in that when processing an instruction to detect a maximum value or minimum value, the comparison circuit and selector circuit provided in the two adders are functionalized. and addition complex arithmetic circuit.
JP24447389A 1989-09-20 1989-09-20 Composite arithmetic circuit of multiplication and addition provided with maximum value or minimum value detecting function Pending JPH03105615A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP24447389A JPH03105615A (en) 1989-09-20 1989-09-20 Composite arithmetic circuit of multiplication and addition provided with maximum value or minimum value detecting function

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP24447389A JPH03105615A (en) 1989-09-20 1989-09-20 Composite arithmetic circuit of multiplication and addition provided with maximum value or minimum value detecting function

Publications (1)

Publication Number Publication Date
JPH03105615A true JPH03105615A (en) 1991-05-02

Family

ID=17119184

Family Applications (1)

Application Number Title Priority Date Filing Date
JP24447389A Pending JPH03105615A (en) 1989-09-20 1989-09-20 Composite arithmetic circuit of multiplication and addition provided with maximum value or minimum value detecting function

Country Status (1)

Country Link
JP (1) JPH03105615A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2020144479A (en) * 2019-03-04 2020-09-10 パナソニックIpマネジメント株式会社 Control method of processor and processor

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2020144479A (en) * 2019-03-04 2020-09-10 パナソニックIpマネジメント株式会社 Control method of processor and processor
WO2020179144A1 (en) * 2019-03-04 2020-09-10 パナソニックIpマネジメント株式会社 Processor and control method for processor
CN113316763A (en) * 2019-03-04 2021-08-27 松下知识产权经营株式会社 Processor and control method of processor
DE112019006261T5 (en) 2019-03-04 2021-09-30 Panasonic Intellectual Property Management Co., Ltd. PROCESSOR AND METHOD OF CONTROLLING THE PROCESSOR
US11941404B2 (en) 2019-03-04 2024-03-26 Panasonic Intellectual Property Management Co., Ltd. Processor and method for controlling the processor

Similar Documents

Publication Publication Date Title
US5325320A (en) Area efficient multiplier for use in an integrated circuit
US4748580A (en) Multi-precision fixed/floating-point processor
JPH0628178A (en) Apparatus and method for optimization of simplifying of arithmetic operation
JPH07210368A (en) Efficient handling method by hardware of positive and negative overflows generated as result of arithmetic operation
JPH02294820A (en) Floating point arithmetic processor and arithmetic processing
US4775952A (en) Parallel processing system apparatus
US6519621B1 (en) Arithmetic circuit for accumulative operation
JPH03105615A (en) Composite arithmetic circuit of multiplication and addition provided with maximum value or minimum value detecting function
US5257217A (en) Area-efficient multiplier for use in an integrated circuit
JP3469645B2 (en) Data-driven information processor
US4878193A (en) Method and apparatus for accelerated addition of sliced addends
EP0704793B1 (en) Method and circuit to compare the sum of two numbers to a third number
US5644521A (en) Comparator scheme
JP2507473B2 (en) Processing equipment
JPH0658671B2 (en) Vector processor
JPH0266625A (en) Data processor
JPH0439094B2 (en)
JP2556904B2 (en) High-speed adder / subtractor
JPH04330519A (en) Multiplier
JPS6120131A (en) Processing unit
JPH0562388B2 (en)
JPH01229322A (en) Micro processor with decimal multiplier
JPH01255032A (en) Arithmetic processing unit
JPS61296435A (en) Microprogram control system
JPH03149656A (en) Arithmetic circuit