JPS5856032A - Pipeline arithmetic device - Google Patents

Pipeline arithmetic device

Info

Publication number
JPS5856032A
JPS5856032A JP56154220A JP15422081A JPS5856032A JP S5856032 A JPS5856032 A JP S5856032A JP 56154220 A JP56154220 A JP 56154220A JP 15422081 A JP15422081 A JP 15422081A JP S5856032 A JPS5856032 A JP S5856032A
Authority
JP
Japan
Prior art keywords
overflow
adder
output
supplied
sum
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
JP56154220A
Other languages
Japanese (ja)
Inventor
Isao Fukushima
福島 功
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.)
Toshiba Corp
Original Assignee
Toshiba Corp
Tokyo Shibaura Electric Co 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 Toshiba Corp, Tokyo Shibaura Electric Co Ltd filed Critical Toshiba Corp
Priority to JP56154220A priority Critical patent/JPS5856032A/en
Publication of JPS5856032A publication Critical patent/JPS5856032A/en
Pending 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
    • G06F7/38Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2207/00Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/38Indexing scheme relating to groups G06F7/38 - G06F7/575
    • G06F2207/3804Details
    • G06F2207/386Special constructional features
    • G06F2207/3884Pipelining
    • 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
    • G06F7/38Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/499Denomination or exception handling, e.g. rounding or overflow
    • G06F7/49905Exception handling
    • G06F7/4991Overflow or underflow
    • G06F7/49921Saturation, i.e. clipping the result to a minimum or maximum value

Abstract

PURPOSE:To prevent the prolongation of operation time due to an overflow, by providing a selector which supplies either a maximum or a minimum, expressed by the number output bits of an adder, to a latch register as the sum in case of the overflow. CONSTITUTION:An adder 11 calculates the sum of data inputted to terminals A dnd B, and supplies the most significant digit bit to a digit overflow detecting circuit 13 through a line 16 while supplying the sum to a selector 14 through a line 15. This circuit 13 is further supplied with the most significant digit bit of input data through a line 17 and also supplied with the most significant digit bit of a latch register 12 which holds the sum output through a line 18. The output of the circuit 13 is supplied as a selection signal to the selector 14, which is further supplied with the normal addition result output of the adder 11 through a line 15. Constant data, i.e. a maximum value X'7FFF' and minimum value X'8000', expressed by the output bit width of the adder 11 are supplied through lines 19 and 20 respectively.

Description

【発明の詳細な説明】 本発明はパイプライン演算装置に関する。[Detailed description of the invention] The present invention relates to a pipeline arithmetic device.

論理回路レベルにおけるパイプライン”処理の概念は古
くから存在し、演算処理を高速化する場合にしばしばみ
うけられる。なかでも多数回の加算処理を含む乗算を高
速に、しかも経済的に処−する場合に適している。
The concept of "pipeline" processing at the logic circuit level has existed for a long time, and is often seen when speeding up arithmetic processing.In particular, it is used to speed up and economically process multiplications that involve multiple additions. suitable for

ところで、上記した様なパイプライン演算装置において
、固定小数点形式のデータを順次加算する場合、桁あふ
れという問題が起こる。これに対処するため、従来は以
下に示す方法が存在していた。
By the way, in the pipeline arithmetic device as described above, when fixed-point format data is sequentially added, a problem of overflow occurs. To deal with this, the following methods have conventionally existed.

(1)浮動小数点モードで計算を行う。(1) Perform calculations in floating point mode.

(2)演算途中で桁あふれが生じたらスティタスとして
配憶しておき、演算が終了した時点でスティタスをみて
、桁あふれであれば全ての被演算データを1ビツトシフ
トダウン(アリスメテイツクライトシフト)して再度演
算を実行する。
(2) If an overflow occurs during an operation, store it as a status, check the status when the operation is completed, and if there is an overflow, shift down all operand data by 1 bit (arithmetic write shift). ) and perform the calculation again.

桁あふれかなくなる迄この操作を行い、最終結果をシフ
トアップ(アリスメテイツクレフトシフト)する。
This operation is performed until there are no overflows, and the final result is shifted up (arithmetic left shift).

上記(2)の例につき、第1図に示したパイプライン演
算装置の従来の構成例を使用して簡単に説明する。図に
おいて、lは加算器、2はラッチレジスタ、3は桁あふ
れ検出回路を示すっ上記構成においてまず、演算に先が
けてラッチレジスタ2の内容をクリアする。
The above example (2) will be briefly explained using the conventional configuration example of the pipeline arithmetic device shown in FIG. In the figure, 1 is an adder, 2 is a latch register, and 3 is an overflow detection circuit. In the above configuration, first, the contents of latch register 2 are cleared prior to calculation.

入力データ(例えば乗算器出力)はラッチクロックLC
に同期して順次加算器lへ供給され加算される。ここで
け例として、第2図に示す様なデータフォーマットを扱
う。データは16ビツトで表現され、MSBのSは符号
、Δ拡小数点位置を示L7、また、負数は2の補数(て
表現されるものとする。桁あふれ検出回路3は、被加数
、加数及び和の各最上位ビットを入力として、この組合
せ罠より桁あふれ情報を出力するものである。
Input data (e.g. multiplier output) is latch clock LC
The signals are sequentially supplied to adder l in synchronization with , and are added. As an example here, we will deal with a data format as shown in Figure 2. The data is expressed in 16 bits, and the MSB S is a sign, L7 indicates the Δ-enlarged number point position, and negative numbers are expressed as two's complement (2's complement). By inputting the most significant bits of the number and the sum, this combination trap outputs overflow information.

上記演算装置はマイクロプログラムによりコントロール
されるものとして以下に説明を行う。
The above arithmetic unit will be described below as being controlled by a microprogram.

演算の終了時、マイクロプログラムに従い桁あふれ情報
が調べられる。ここで桁あふれがあったら演算のやシ直
しが指示され次に示す方法がとられる。即ち、入力デー
タを全て1ビット右終了後1桁あぶれが調べられ、桁あ
ふれがあれば再び入力データをシフトダウンする。この
様に桁あふれがなくなる迄演算を繰返し、ラッチレジス
タ2の出力を取出し、シフトダウン数分を逆に左へ算術
シフト(シフトアップ)シ、結果を求めていたものであ
る。
At the end of the calculation, overflow information is checked according to the microprogram. If there is an overflow, the calculation is instructed to be corrected and the following method is used. That is, after all input data has been processed by one bit to the right, one-digit overflow is checked, and if there is overflow, the input data is shifted down again. In this way, the operation was repeated until there was no overflow, the output of the latch register 2 was taken out, and the result was obtained by performing an arithmetic shift (upshift) to the left by the number of downshifts.

しかしながらこの方法によればあるピットが捨てられ精
度が落ち1桁あふれ時の演算時間が長くなる等の欠点が
あった。また、(1)の方法によってもハードウェアが
複雑になるといった欠点を有していた。
However, this method has drawbacks such as certain pits being discarded, resulting in lower accuracy and longer computation time when overflowing by one digit. Furthermore, method (1) also has the disadvantage of complicating the hardware.

本発明は上記事情に基づいてなされたものであシ、加算
器とラッチレジスタの間に、桁あふれ信号を選択信号と
して得、加算器の出力ビツト数で表わしうる最大値、最
小値のいずれかを桁あふれ時の和としてラッチレジスタ
へ供給す。
The present invention has been made based on the above-mentioned circumstances, and it obtains an overflow signal as a selection signal between an adder and a latch register, and selects either the maximum value or the minimum value that can be expressed by the number of output bits of the adder. is supplied to the latch register as the sum in case of overflow.

るセレクタを挿入することにより、固定小数点形式のデ
ータをパイプライン演算する際1桁あ“1 ふれによる演算時間の遅延を防止シ、たパイプ2イン演
算装置を提供することを目的とする。
An object of the present invention is to provide a pipe 2-in arithmetic device which prevents a delay in calculation time due to a one-digit shift when performing pipeline calculations on fixed-point format data by inserting a selector.

以下、第3図以降を使用して本発明に関し詳細に説明す
る。
Hereinafter, the present invention will be explained in detail using FIG. 3 and subsequent figures.

第3図は本発明の実施例を示すブロック図である1図に
おいて、11は加算器、12はラッチレジスタである。
FIG. 3 is a block diagram showing an embodiment of the present invention. In FIG. 1, 11 is an adder and 12 is a latch register.

加算器11はA、B端子に入力されるデータを加算した
結果、その値をライン15を介してセレクタ14へ、ま
たその最上位ピットをライン16f:介して桁あふれ検
出回路J3へ供給する。桁あふれ検出回路13へは他に
2イン17f介して入力データの最上位ビットが、更に
和出力が保持されるラッチレジスタ12の最上位ビット
がライン18を介して供給されている。この椿あふれ検
出回路13の出力はセレクタI4の選択信号として供給
される。上記セレクタ14へのデータ入力としては加算
器11による加算結果の通帛出力がライン15を介して
供給される他、加算器11の持つ出力ビツト幅で表現〔
7うる最大値(X’ 7 FFF’) 。
Adder 11 adds the data input to terminals A and B, and supplies the resulting value to selector 14 via line 15, and the most significant pit to overflow detection circuit J3 via line 16f. The overflow detection circuit 13 is also supplied with the most significant bit of the input data via the 2-in 17f, and further via the line 18 with the most significant bit of the latch register 12 in which the sum output is held. The output of the camellia overflow detection circuit 13 is supplied as a selection signal to the selector I4. As data input to the selector 14, the combined output of the addition result from the adder 11 is supplied via the line 15, and the data is expressed by the output bit width of the adder 11.
Maximum value of 7 (X' 7 FFF').

最小値(x’ 5ooo’ )の定数データがそれぞれ
ツインJ9.20を介して供給される。尚、ライン21
.22を伝播する信号はそれぞれ、ラッチクロックLC
,リセット信号RATである。
Constant data of the minimum value (x'5ooo' ) is supplied via the respective twin J9.20. Furthermore, line 21
.. Each signal propagating through the latch clock LC
, the reset signal RAT.

下記表はセレクタ14の選択信号と出力データの対応関
係を示す。
The table below shows the correspondence between the selection signal of the selector 14 and the output data.

表 第4図は桁あぶれの際の動作例を示す概念図であり、表
の組合せφ5の場合の動作例を示す。
Table 4 is a conceptual diagram showing an example of the operation when the digits are out of order, and shows an example of the operation in the case of combination φ5 in the table.

第5図は横軸に加算器A+Hの本来の値に対し、縦軸に
本発明装置による出力値(之ツチレ加算あるいは桁あふ
れの検出等、基本的動作は従来例とはげ同様であるため
、重複する部分の説明は省略し、セレクタ14による選
択動作を中心に説明を行う。
In FIG. 5, the horizontal axis shows the original value of the adder A+H, and the vertical axis shows the output value of the device of the present invention. The description of the overlapping parts will be omitted, and the description will focus on the selection operation by the selector 14.

本発明によれば、演算途中で桁あふれが生じたら、その
時の演算結果に最も近い値をセレクタ14から出力し、
ラッチレジスター2の入力として供給し、演算を続行さ
せる。第2図に示したデータフォーマットにおいて、小
数点位置を右端に設定した場合、表現しうる数値Nの範
囲は、2−1≧N≧−2である。
According to the present invention, if an overflow occurs during calculation, the value closest to the calculation result at that time is output from the selector 14,
It is supplied as an input to latch register 2 to continue the operation. In the data format shown in FIG. 2, when the decimal point position is set at the right end, the range of numerical values N that can be expressed is 2-1≧N≧-2.

第5図に示した対応グラフは、加算器(11;) A+B)の真値(横軸)とラッチレジスタ12人力デー
タ(縦軸)との対応関係を示したものであるということ
は上述し九とおりである。このグラフよシ明らかな如<
、2m”−1≧A+B≧−i“の時は加算器1ノ出力を
直接(スルーして)ラッチレジスター20入力として供
給し、桁あふれが生じる一1≦A十B又は、A+B≦−
21−1の時は各々“2−1.”−2”“をラッチレジ
スタ12の入力として供給することになる。即ち、上記
表に示される組合せす5.φ6の時、それぞれ最大値x
′7prp  (2−1)、最小値x’5ooo<(−
2” )  を出力することになる。
As mentioned above, the correspondence graph shown in Figure 5 shows the correspondence between the true value of the adder (11;) A+B) (horizontal axis) and the manual data of the latch register 12 (vertical axis). Nine things are true. This graph clearly shows
, 2m''-1≧A+B≧-i'', the output of the adder 1 is directly (through) supplied as the input to the latch register 20, and overflow occurs.
21-1, "2-1."-2"" are respectively supplied as inputs to the latch register 12. That is, the combinations shown in the table above5. When φ6, the maximum value x
'7prp (2-1), minimum value x'5ooo<(-
2”) will be output.

第4図にオーバフローした際の動作概念図が示されてい
る。ここで真の値は“211″である力ζこの場合“2
11−1” が出力される。パイプラインにより行う計
算では得られた結果群は相対的な大小関係が明確でさえ
あれば充分であることが多く、このことより本発明の実
施は有効である。
FIG. 4 shows a conceptual diagram of the operation when an overflow occurs. Here, the true value is “211” force ζ In this case “2
11-1" is output. In calculations performed by a pipeline, it is often sufficient that the relative magnitude relationship of the results obtained is clear, and from this, the implementation of the present invention is effective. .

以上訝1明の如く、本発明によれば演算時の桁あふれに
対し、ハードウェアを複雑多大にする必要がなくなり、
また、演算時間が桁あふれに左右されることなく一定と
なる。
As mentioned above, according to the present invention, there is no need to make the hardware complicated in order to deal with overflow during calculation.
Furthermore, the calculation time remains constant without being affected by overflow.

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

第1図は従来のパイプライン演算装置の構成例を示すブ
ロック図、第2図は本発、明において使用されするデー
タフォーマット例、第3図は本発明ゐ、よ」るパイプラ
イン演算装置の実施例を示すブロック図、第4図は桁あ
ぶれの際の動作を示す動作概念図、鋪5図は加算器の真
値とラッチレジスタの入力データとの対応関係を示すグ
ラフである。 11・・・加算器、12・・・ラッチレジスタ、13・
・・桁あふれ検出回路、74・・・セレクタ。 出胆人代理人  弁理士 錦 江 武 彦第1図 第3図
FIG. 1 is a block diagram showing a configuration example of a conventional pipeline arithmetic device, FIG. 2 is an example of a data format used in the present invention, and FIG. 3 is a block diagram of a pipeline arithmetic device according to the present invention. FIG. 4 is a block diagram showing the embodiment; FIG. 4 is a conceptual diagram showing the operation when the digits are out of order; and FIG. 5 is a graph showing the correspondence between the true value of the adder and the input data of the latch register. 11...Adder, 12...Latch register, 13.
... Overflow detection circuit, 74... Selector. Representative Patent Attorney Takehiko Nishikie Figure 1 Figure 3

Claims (1)

【特許請求の範囲】[Claims] 入力データがラッチクロックと同期して順次加算操作が
行なわれるものであって、加算器と、この加算器による
和出力が保持されるラッチレジスタと、上記入力データ
の最上位ビットの組合せによシ桁あふれ情報を出力する
桁あふれ検出回路と、上記加算器とラッチレジスタの間
に接続され、桁あふれが生じた時上記桁あふれ検出回路
により得られる桁あふれ検出信号を選択信号とし、上記
加算器の出力で表現しうる最大値又は最小値のいずれか
をその時の和として上記ラッチレジスタへ供給すること
を特徴とするパイプライン演算装置。
Input data is sequentially added in synchronization with a latch clock, and is a combination of an adder, a latch register that holds the sum output from this adder, and the most significant bit of the input data. An overflow detection circuit that outputs overflow information is connected between the adder and the latch register, and when an overflow occurs, the overflow detection signal obtained by the overflow detection circuit is used as a selection signal, and the overflow detection circuit outputs overflow information. A pipeline arithmetic device characterized in that either the maximum value or the minimum value that can be expressed by the output of is supplied to the latch register as a sum at that time.
JP56154220A 1981-09-29 1981-09-29 Pipeline arithmetic device Pending JPS5856032A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP56154220A JPS5856032A (en) 1981-09-29 1981-09-29 Pipeline arithmetic device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP56154220A JPS5856032A (en) 1981-09-29 1981-09-29 Pipeline arithmetic device

Publications (1)

Publication Number Publication Date
JPS5856032A true JPS5856032A (en) 1983-04-02

Family

ID=15579466

Family Applications (1)

Application Number Title Priority Date Filing Date
JP56154220A Pending JPS5856032A (en) 1981-09-29 1981-09-29 Pipeline arithmetic device

Country Status (1)

Country Link
JP (1) JPS5856032A (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6325491A (en) * 1986-07-02 1988-02-02 キャリア・コ−ポレイション Evaporator tube, heat transfer property of which is improved, and manufacture thereof
EP0345819A2 (en) * 1988-06-10 1989-12-13 Nec Corporation Overflow correction circuit
EP0508411A2 (en) * 1991-04-08 1992-10-14 Nec Corporation Redundant binary type digital operation unit
EP0517429A2 (en) * 1991-06-07 1992-12-09 National Semiconductor Corporation CPU with integrated multiply/accumulate unit
EP0766169A1 (en) * 1995-09-29 1997-04-02 Matsushita Electric Industrial Co., Ltd. Processor and control method for performing proper saturation operation
US5974540A (en) * 1996-11-29 1999-10-26 Matsushita Electric Industrial Co., Ltd. Processor which can favorably execute a rounding process composed of positive conversion and saturated calculation processing

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6325491A (en) * 1986-07-02 1988-02-02 キャリア・コ−ポレイション Evaporator tube, heat transfer property of which is improved, and manufacture thereof
EP0345819A2 (en) * 1988-06-10 1989-12-13 Nec Corporation Overflow correction circuit
EP0508411A2 (en) * 1991-04-08 1992-10-14 Nec Corporation Redundant binary type digital operation unit
EP0517429A2 (en) * 1991-06-07 1992-12-09 National Semiconductor Corporation CPU with integrated multiply/accumulate unit
US5442579A (en) * 1991-06-07 1995-08-15 National Semiconductor Corporation Combined multiplier and accumulator
US5444646A (en) * 1991-06-07 1995-08-22 National Semiconductor Corporation Fully static 32 bit alu with two stage carry bypass
US5473554A (en) * 1991-06-07 1995-12-05 National Semiconductor Corporation CMOS multiplexor
EP0766169A1 (en) * 1995-09-29 1997-04-02 Matsushita Electric Industrial Co., Ltd. Processor and control method for performing proper saturation operation
US5974540A (en) * 1996-11-29 1999-10-26 Matsushita Electric Industrial Co., Ltd. Processor which can favorably execute a rounding process composed of positive conversion and saturated calculation processing
US6237084B1 (en) 1996-11-29 2001-05-22 Matsushita Electric Industrial Co., Ltd. Processor which can favorably execute a rounding process composed of positive conversion and saturated calculation processing
USRE39121E1 (en) * 1996-11-29 2006-06-06 Matsushita Electric Industrial Co., Ltd. Processor which can favorably execute a rounding process composed of positive conversion and saturated calculation processing
USRE43145E1 (en) 1996-11-29 2012-01-24 Panasonic Corporation Processor which can favorably execute a rounding process composed of positive conversion and saturated calculation processing
USRE43729E1 (en) 1996-11-29 2012-10-09 Panasonic Corporation Processor which can favorably execute a rounding process composed of positive conversion and saturated calculation processing

Similar Documents

Publication Publication Date Title
EP0973089B1 (en) Method and apparatus for computing floating point data
US4562553A (en) Floating point arithmetic system and method with rounding anticipation
US4999803A (en) Floating point arithmetic system and method
JPH0235348B2 (en)
JPH05241792A (en) System and device for floating point addition and subtraction
JPS5856032A (en) Pipeline arithmetic device
JPS584369B2 (en) Digit Validity Tracker
JP2555577B2 (en) Arithmetic unit
JPS59154542A (en) Multiplying device
JP2856792B2 (en) Floating point arithmetic unit
JP3245884B2 (en) Shift adder / subtractor
JPS60167030A (en) System and circuit for shift flag generation
JP2752698B2 (en) Floating point addition / subtraction circuit
JP2801472B2 (en) Floating point arithmetic unit
JPH0427587B2 (en)
JPS60235241A (en) Floating point adding circuit
JPS5960637A (en) Arithmetic device for floating decimal point
JPS62249230A (en) Arithmetic processing device
JPH0797312B2 (en) Arithmetic unit
JP2931632B2 (en) Digit shifter and floating point arithmetic unit
JPH0426495B2 (en)
KR940008610B1 (en) Method and processor for high-speed convergence factor determination
JPH05204606A (en) Floating point arithmetic system and unit
JPH031228A (en) Floating point multiplier
JPS6077238A (en) Floating point arithmetic circuit