JPS59139448A - Floating-point multiplying device - Google Patents

Floating-point multiplying device

Info

Publication number
JPS59139448A
JPS59139448A JP58013460A JP1346083A JPS59139448A JP S59139448 A JPS59139448 A JP S59139448A JP 58013460 A JP58013460 A JP 58013460A JP 1346083 A JP1346083 A JP 1346083A JP S59139448 A JPS59139448 A JP S59139448A
Authority
JP
Japan
Prior art keywords
adder
output
sum
exponent
exponent part
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
JP58013460A
Other languages
Japanese (ja)
Other versions
JPS6359170B2 (en
Inventor
Katsuyuki Kaneko
克幸 金子
Masaru Uya
宇屋 優
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.)
Panasonic Holdings Corp
Original Assignee
Matsushita Electric Industrial 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 Matsushita Electric Industrial Co Ltd filed Critical Matsushita Electric Industrial Co Ltd
Priority to JP58013460A priority Critical patent/JPS59139448A/en
Publication of JPS59139448A publication Critical patent/JPS59139448A/en
Publication of JPS6359170B2 publication Critical patent/JPS6359170B2/ja
Granted legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; 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/483Computations with numbers represented by a non-linear combination of denominational numbers, e.g. rational numbers, logarithmic number system or floating-point numbers
    • G06F7/487Multiplying; Dividing
    • G06F7/4876Multiplying
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; 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/49915Mantissa overflow or underflow in handling floating-point numbers
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; 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/49936Normalisation mentioned as feature only

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Computing Systems (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Nonlinear Science (AREA)
  • General Engineering & Computer Science (AREA)

Abstract

(57)【要約】本公報は電子出願前の出願データであるた
め要約のデータは記録されません。
(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

【発明の詳細な説明】 産業上の利用分野 本発明は浮動小数点乗算装置、特にIEEE標準フォー
マットに準拠する浮動小数点乗算における指数部分の演
算を高速に行ない、オーバーフロー及びアンダーフロー
検知信号を迅速に得るようにした浮動小数点乗算装置に
関するものである。
DETAILED DESCRIPTION OF THE INVENTION Field of Industrial Application The present invention is directed to a floating-point multiplication device, particularly to a floating-point multiplication device that performs high-speed calculations on the exponent part in floating-point multiplication that conforms to the IEEE standard format, and quickly obtains overflow and underflow detection signals. The present invention relates to a floating point multiplication device.

従来例の構成とその問題点 浮動小数点乗算装置の指数部演算においては、一般に指
数部分の加算を行ない、その後仮数部分演算によって生
成される正規化のためのシフト信号が到達してからさら
にこの加算を行ないこの後にオーバーフロー及びアンダ
ーフローの検出を行なっている1J 以下に従来の浮動小数点乗算装置の指数部演算器につい
て第1図とともに説明する。第1図において、1は乗数
の指数部Exと被乗数の指数部Eyとを加算する指数部
加算器、2は乗数の仮数部xと被乗数の仮数部MYとの
乗算によって生成される指数部分の正規化のための+1
加算信号線、3は+1加算信号線2の信号に応じて+1
もしくは+○を指数部加算器1の出力に加算する+1加
算器、4は+1加算器3の出力を所定の数値と比較して
乗算結果のオーバーフローもしくはアンダーフローを検
出する検出器であり、5,6は夫々検出器4から出力さ
れるアンダーフロー検出信号線、オーバーフロー検出信
号線である。第1図に示す如き従来の指数部演算器はE
xとE7との加算を行ないしかる後仮数部演算によって
得られる正規化のための+1加算信号の到来を待って指
数部演算を終了する。オーバーフロー及びアンダーフロ
ーの検出は指数部演算が完全に終了してから行なわれる
。一般に浮動小数点乗算においては、仮数部演算が終了
した後指数部演算を行なうため、指数部演算時間を短縮
することによって全体の乗算時間を短縮することができ
る。
Conventional configuration and its problems In the exponent part calculation of a floating point multiplier, the exponent part is generally added, and then this addition is performed again after the shift signal for normalization generated by the mantissa part calculation arrives. After that, overflow and underflow detection is performed.1J The exponent unit of a conventional floating point multiplication device will be described below with reference to FIG. In Fig. 1, 1 is an exponent adder that adds the exponent part Ex of the multiplicand to the exponent part Ey of the multiplicand, and 2 is the exponent part adder that is generated by multiplying the mantissa part x of the multiplicand by the mantissa part MY of the multiplicand. +1 for normalization
Addition signal line, 3 is +1 according to the signal of addition signal line 2
or +1 adder that adds +○ to the output of exponent part adder 1; 4 is a detector that compares the output of +1 adder 3 with a predetermined value to detect overflow or underflow of the multiplication result; 5 , 6 are an underflow detection signal line and an overflow detection signal line output from the detector 4, respectively. The conventional exponent part calculator as shown in Fig. 1 is E
After x and E7 are added, the exponent part calculation is completed after waiting for the arrival of a +1 addition signal for normalization obtained by the mantissa part calculation. Detection of overflow and underflow is performed after the exponent part calculation is completely completed. Generally, in floating point multiplication, the exponent part calculation is performed after the mantissa part calculation is completed, so that the overall multiplication time can be shortened by shortening the exponent part calculation time.

しかしながら上記の例では、指数部正規化信号(+1加
算信号に相当する)が到来してから+1加算を行ない、
この出力をもってオーバーフロー及びアンダーフロー検
出を行なうため、仮数部演算が終了してから全乗算結果
を得るまで比較的長い時間が必要であり、浮動小数点乗
算を高速に行なう上で好ましくなかった。
However, in the above example, the +1 addition is performed after the exponent part normalization signal (corresponding to the +1 addition signal) arrives,
Since overflow and underflow detection is performed using this output, a relatively long time is required from the end of the mantissa operation until the entire multiplication result is obtained, which is undesirable for performing floating point multiplication at high speed.

発明の目的 本発明はこのような従来の問題に鑑み、収部部演算によ
って得られる指数部正規化信号の到来から指数部処理を
終了するまでに要する時間を極力短かくすることのでき
る浮動小数点乗算装置を提供することを目的とする。
Purpose of the Invention In view of such conventional problems, the present invention provides a floating point system which can minimize the time required from the arrival of the exponent part normalized signal obtained by the exponent part calculation to the end of the exponent part processing. The purpose is to provide a multiplication device.

発明の構成 本発明は、乗数の指数部と被乗数の指数部と所定の定数
との第1の和と、この和にさらに1を加えた第2の和と
、前記2つの和の特定な値を検知する検出信号とを用意
することによって、指数部正規化信号の到来後直ちに指
数部演算結果を得るものである。
Structure of the Invention The present invention provides a first sum of an exponent part of a multiplier, an exponent part of a multiplicand, and a predetermined constant, a second sum obtained by adding 1 to this sum, and a specific value of the two sums. By preparing a detection signal for detecting the exponent part normalization signal, the exponent part calculation result can be obtained immediately after the arrival of the exponent part normalized signal.

実施例の説明 第2図は本発明の実施例におけるIEEE標準フォーマ
ットに基づく浮動小数点乗算を行う乗算器の指数部演算
器の構成を示す。指数部分は8ピツトのデータ巾を持つ
ものとする。第2図において11は乗数の指数部Exと
被乗数の指数部Eyと16進数表示で81(以下81H
と表わす)を加算する10ビツト中の加算器、12は加
算器11の出力に更に1を加える10ビツト巾の加算器
、13は仮数乗算の結果指数部正規化が必要な時高論理
レベル(以下”H”と略す)となる信号線14は信号線
13が低論理レベル(以下”L”と略す。)かつ加算器
11の出力が100Hか、もしくは上位2ビツトが00
である場合に信号線16にアンダーロー検出信号線出力
するアンダーロー検出器、15は加算器12の最上位ビ
ットが1であるが、もしくは信号線13が”H”かつ加
算器の下位9ビツトが1FFHである場合に信号線17
にオーバーフロー検出信号を出力するオーバーフロー検
出器、16はアンダーフロー検出信号線、17はオーバ
ーフロー検出信号線、18は信号線13がH1+の場合
に加算器12の出力をI、I+の場合に加算器11の出
力を出力するセレクタである。
DESCRIPTION OF EMBODIMENTS FIG. 2 shows the configuration of an exponent unit of a multiplier that performs floating point multiplication based on the IEEE standard format in an embodiment of the present invention. It is assumed that the exponent part has a data width of 8 pits. In Figure 2, 11 is the exponent part Ex of the multiplier, the exponent part Ey of the multiplicand, and 81 (hereinafter 81H) in hexadecimal notation.
12 is a 10-bit wide adder that adds 1 to the output of adder 11; 13 is a high logic level when exponent normalization is required as a result of mantissa multiplication; The signal line 14 is set to a low logic level (hereinafter abbreviated as "L") and the output of the adder 11 is 100H, or the upper two bits are 00.
The underlow detector 15 outputs an underlow detection signal line to the signal line 16 when is 1FFH, signal line 17
16 is an underflow detection signal line, 17 is an overflow detection signal line, 18 is an overflow detector that outputs an overflow detection signal to when the signal line 13 is H1+, and an adder when it is I+. This is a selector that outputs 11 outputs.

IEEE標準フォーマットに於ける単精度浮動小数点デ
ータは S  E−127 (−1)・2    ・(1・F)    ・・・・・
・(1)なる形式を持つ。この式に於いて、Sは符号ピ
ッ1、Eは1’ 27 (7F H)だけ正方向へ偏位
された8ビツト巾の指数データ、Fは23ビ、ントの仮
数部データであり、オーバーフローは、 128≦(E−127)         ・・・・・
剃アンダーフローは、 (E−127)≦−127・・・・・・(鴫の範囲と定
められている。ここで乗数x1被乗数Yを、 X=(−1)8x−2EX−127−(1、FX)−(
4)Y=(−1)8y・2 E y 127・(1,F
y)・・・(5)とすると乗算結果Pは次式の如く表わ
される。
Single precision floating point data in the IEEE standard format is SE-127 (-1)・2・(1・F)...
・It has the form (1). In this equation, S is sign pitch 1, E is 8-bit exponent data shifted in the positive direction by 1'27 (7F H), F is 23-bit mantissa data, and overflow occurs. is, 128≦(E-127)...
The underflow is defined as (E-127)≦-127... 1, FX) - (
4) Y=(-1)8y・2 E y 127・(1,F
y) (5), the multiplication result P is expressed as the following equation.

p=x@y =(−j )Sx+Sy 、2(Ex+Ey−127、
)−127,(1,FX)、(1、FyT=(−1)8
P・2EP−127・(1,FP)   ・・・・・・
(6)(@式において■は排他的論理和を表わすものと
する。仮数(1,F)は、1≦(1,F)<2の範囲に
あるためXとYの仮数の積は 1≦(1、Fx)、(1,Fy)<4 の範囲をとり 2≦(1,Fx)、(1,Fy)<4 の範囲においては正規化を行ない指数部に1を加える必
要がある。この信号を伝搬する信号線が信号線13であ
る。一方、EPの計算は−127を補数で表わして12
9(81H)をEx+Eyに加算することによって加算
器11に於いて得られる。仮数の乗算結果によっては前
述した如く更に1を加える必要があり、この結果は加算
器12に於いて得られる。指数部の演算結果は信号線1
3の信号が”Huの場合加算器12からL11の場合加
算器11からセレクタ18を経て出力される。
p=x@y=(-j)Sx+Sy, 2(Ex+Ey-127,
)-127, (1, FX), (1, FyT=(-1)8
P・2EP-127・(1,FP) ・・・・・・
(6) (In the @ expression, ■ represents exclusive OR. The mantissa (1, F) is in the range 1≦(1, F) < 2, so the product of the mantissas of X and Y is 1 ≦(1,Fx), (1,Fy)<4, and in the range 2≦(1,Fx), (1,Fy)<4, it is necessary to perform normalization and add 1 to the exponent part. The signal line that propagates this signal is the signal line 13. On the other hand, the calculation of EP is 12 by expressing -127 as a complement.
It is obtained in the adder 11 by adding 9 (81H) to Ex+Ey. Depending on the multiplication result of the mantissa, it is necessary to further add 1 as described above, and this result is obtained in the adder 12. The calculation result of the exponent part is on signal line 1
When the signal of No. 3 is "Hu", it is output from the adder 12, and when it is L11, it is output from the adder 11 via the selector 18.

オーバーフローは(功式及び(@式よりEp≧128+
2 、127+1291=511 (I F FH)・
・・・・・(力の範囲となる。すなわちEPを10ビツ
ト巾の数とすると、EPが1FFHかもしくはEpの最
上位ビットが1の場合にオーバーフローとなる。これは
次の2項目a、bと等価であり、 (a)信号線13の信号が“L”の場合加算器12の出
力が512 (200H)以上。すなわち加算器12の
出力の最上位ビットが1゜ (ゆ 信号線13の信号がH”の場合加算器12の出力
が511 (IFFH)以上。すなわち加算器12の出
力の最上位ビットが1であるかもしくは下位9ビツトが
1FFH0 検出器15によって検出される。
The overflow is Ep≧128+ from (Gong expression and (@ expression)
2, 127+1291=511 (I F FH)・
(This is the range of power. In other words, if EP is a number with a width of 10 bits, an overflow will occur if EP is 1FFH or the most significant bit of EP is 1. This is due to the following two items a, (a) When the signal on the signal line 13 is “L”, the output of the adder 12 is 512 (200H) or more. That is, the most significant bit of the output of the adder 12 is 1° (y). When the signal is "H", the output of the adder 12 is 511 (IFFH) or more. That is, the most significant bit of the output of the adder 12 is 1, or the lower 9 bits are detected by the 1FFH0 detector 15.

アンダーフローは(萄式及び(6式よりEP≦−127
+2.127+129=256(10C)H)の範囲と
なる。すなわちEpが100HかもしくはEpの上位2
ビツトがooの場合アンダーフローとなる。これは次の
2項目(C) 、 (d)と等価であり、<d)  信
号線13の信号が“HI+の場合加算器11の出力が2
56 (FFH)以下。すなわち加算器11の出力の上
位2ビツトが00゜ (→ 信号線14の信号が°I L l”の場合加算器
11の出力が256 (100H)以下。すなわち加算
器11の出力が100Hであるかもしくは上位2ビツト
が00゜ 検出器14によって検出される。検出器14及び検出器
15は例えば第2図に示した如き論理回路によって実現
することができる。
The underflow is EP≦−127 from the (grape formula and (6 formula)
+2.127+129=256(10C)H). In other words, Ep is 100H or the top 2 of Ep
If the bit is oo, an underflow occurs. This is equivalent to the following two items (C) and (d), and <d) When the signal on the signal line 13 is “HI+”, the output of the adder 11 is 2
56 (FFH) or less. In other words, if the high-order 2 bits of the output of the adder 11 are 00° (→ If the signal on the signal line 14 is "°I L l", the output of the adder 11 is 256 (100H) or less. In other words, the output of the adder 11 is 100H. Alternatively, the upper two bits are detected by the 00° detector 14. The detector 14 and the detector 15 can be realized by a logic circuit as shown in FIG. 2, for example.

以上のように、本実施例によれば加算器11及び加算器
12を夫々10ピツト巾で設は夫々の上位2ビツトの信
号を効果的に利用することにより、正規化信号が到来し
た後直ちに指数部データ及びオーバーフロー、アンダー
フローを検出することができる。
As described above, according to this embodiment, the adder 11 and the adder 12 are each set to have a width of 10 pits, and by effectively using the signals of the upper two bits of each adder 11 and adder 12, the normalized signal is immediately inputted. Exponent data, overflow, and underflow can be detected.

なお、本実施例においてはIEEE標準フォーマットの
乗算に関し所定の定数を81HとしたがIEEEフォー
マット外のフォーマットの乗算に関しても所定の定数を
定めることによって本実施例と同様な構成を実現し得る
ことは明らかである。
In this embodiment, the predetermined constant for multiplication in the IEEE standard format is 81H, but it is possible to realize a configuration similar to this embodiment by setting a predetermined constant for multiplication in formats other than the IEEE format. it is obvious.

また、本実施例においては、ExとEpと81 Hとを
加算する加算器とインクリメンタ−によって2つの和出
力を得ているが、ExとEVと82Hとを加算する加算
器とデクリメンタ−によっても同一な2つの和出力を得
ることが可能であるのは明らかである。
Furthermore, in this embodiment, two sum outputs are obtained by an adder and an incrementer that add Ex, Ep, and 81H, but two sum outputs are obtained by an adder and a decrementer that add Ex, EV, and 82H. It is clear that it is possible to obtain two identical sum outputs.

発明の効果 以上のように、本発明は浮動小数点乗算装置において乗
算結果の指数部分の解となり得る2つの出力を用意し、
夫々特定な値を検出する検出器を設けることにより、仮
数部演算の結果生ずる正規化信号の到来後速かに指数部
分出力及びオーバーフロー、アンダ−フロー検出信号を
得ることができる優れた浮動小数点乗算器を実現できる
ものである。
Effects of the Invention As described above, the present invention provides two outputs that can be solutions to the exponent part of the multiplication result in a floating-point multiplication device,
By providing a detector that detects each specific value, an excellent floating-point multiplication that can quickly obtain the exponential part output and overflow/underflow detection signal after the arrival of the normalized signal resulting from the mantissa operation. It is possible to realize a vessel.

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

第1図は従来の指数部演算器の構成図、第2図は本発明
の実施例における指数部演算器の構成図である。 11.12・・・・・・加算器、13・・・・・・正規
化信号線、14・・・・・・アンダーフロー検出器、1
6・・・・・・オーバーフロー検出器。 代理人の氏名 弁理士 中 尾 敏 男 ほか1名第1
図 ρVF (JDF
FIG. 1 is a block diagram of a conventional exponent part calculator, and FIG. 2 is a block diagram of an exponent part calculator in an embodiment of the present invention. 11.12...Adder, 13...Normalization signal line, 14...Underflow detector, 1
6... Overflow detector. Name of agent: Patent attorney Toshio Nakao and 1 other person No. 1
Figure ρVF (JDF

Claims (1)

【特許請求の範囲】[Claims] (1)乗数のnビット長の指数部分と、被乗数のnビッ
ト長の指数部分とを入力し、前記乗数の指数部分と前記
被乗数の指数部分と所定の定数との和であるn+2ビッ
トの第1の和と、前記第1の和より1大きいn + 2
ビツトの第2の和とを出力する第1の手段と、前記第1
の和出力の上位2ビツトが00であるか、もしくは前記
乗数及び前記被乗数の仮数部分の乗算結果の最上位ビッ
トが0であり前記第1の和出力の上位2ビツトが01で
あってかつ下位nピットが全て0である場合にアンダー
70−検出信号を発生する第1の検出器と、前記乗数及
び前記被乗数の仮数部分の乗算結果の最上位ビットが1
であってかつ前記第2の和出力の下位n −1−1ピツ
トが全て1であるか、もしくは前記第2の和出力の最上
位ビットが1である場合にオーバーフロー検出信号を発
生する第2の検出器と、前記乗数及び前記被乗数の仮数
部分の乗算結果の最上位ビットが0の時第1の和出力の
下位nビットを、1の時第2の和出力の下位nピットを
夫々指数部分の結果として出力するセレクタとを有する
ことを特徴とする浮動小数点乗算装置。 (功 第1の手段が加算器と、該加算器の出力を入力と
するインクリメ/りとで構成されていることを特徴とす
る特許請求の範囲第1項記載の浮動小数点乗算装置。 (鴫 第1の手段が加算器と、該加算器の出力を入力と
するデクリメンタとで構成されていることを特徴とする
特許請求の範囲第1項記載の浮動小数点乗算装置。 (4所定の定数が(2n−1+1)であることを特徴と
する特許請求の範囲第2項もしくは第3項に記載の浮動
小数点乗算装置。
(1) Input the n-bit length exponent part of the multiplier and the n-bit length exponent part of the multiplicand, and input the n+2-bit exponent part that is the sum of the exponent part of the multiplier, the exponent part of the multiplicand, and a predetermined constant. the sum of 1 and n + 2 which is 1 greater than the first sum
first means for outputting a second sum of bits;
The upper two bits of the sum output are 00, or the most significant bit of the multiplication result of the mantissa part of the multiplier and the multiplicand is 0, and the upper two bits of the first sum output are 01, and the lower a first detector that generates an under 70-detection signal when all n pits are 0, and the most significant bit of the multiplication result of the mantissa part of the multiplicand and the multiplicand is 1;
and when the lower n-1-1 pits of the second sum output are all 1, or when the most significant bit of the second sum output is 1, a second sum output signal generating an overflow detection signal; When the most significant bit of the multiplication result of the mantissa part of the multiplier and the multiplicand is 0, the lower n bits of the first sum output are used as the exponent, and when it is 1, the lower n pits of the second sum output are used as the exponent. and a selector that outputs a partial result. Floating point multiplication device according to claim 1, characterized in that the first means comprises an adder and an incrementer whose input is the output of the adder. 2. The floating point multiplication device according to claim 1, wherein the first means comprises an adder and a decrementer whose input is the output of the adder. (2n-1+1) The floating-point multiplication device according to claim 2 or 3, characterized in that the number is (2n-1+1).
JP58013460A 1983-01-28 1983-01-28 Floating-point multiplying device Granted JPS59139448A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP58013460A JPS59139448A (en) 1983-01-28 1983-01-28 Floating-point multiplying device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP58013460A JPS59139448A (en) 1983-01-28 1983-01-28 Floating-point multiplying device

Publications (2)

Publication Number Publication Date
JPS59139448A true JPS59139448A (en) 1984-08-10
JPS6359170B2 JPS6359170B2 (en) 1988-11-18

Family

ID=11833753

Family Applications (1)

Application Number Title Priority Date Filing Date
JP58013460A Granted JPS59139448A (en) 1983-01-28 1983-01-28 Floating-point multiplying device

Country Status (1)

Country Link
JP (1) JPS59139448A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0210427A (en) * 1988-02-29 1990-01-16 Mips Computer Syst Inc Method and apparatus for exception of precision floating point
JPH02201645A (en) * 1989-01-31 1990-08-09 Nec Corp Exception detecting circuit

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0210427A (en) * 1988-02-29 1990-01-16 Mips Computer Syst Inc Method and apparatus for exception of precision floating point
JPH02201645A (en) * 1989-01-31 1990-08-09 Nec Corp Exception detecting circuit

Also Published As

Publication number Publication date
JPS6359170B2 (en) 1988-11-18

Similar Documents

Publication Publication Date Title
US9639326B2 (en) Floating-point adder circuitry
JP3076046B2 (en) Exception detection circuit
US5993051A (en) Combined leading one and leading zero anticipator
US7188133B2 (en) Floating point number storage method and floating point arithmetic device
JPH02500551A (en) Apparatus and method for floating point normalized prediction
JPH02232723A (en) Pipeline type floating point adder/subtractor for digital computer
US5111421A (en) System for performing addition and subtraction of signed magnitude floating point binary numbers
CN113625990A (en) Floating point-to-fixed point conversion device, method, electronic equipment and storage medium
JPH0343645B2 (en)
JPH02294731A (en) Floating point arithmetic processor
JP2511527B2 (en) Floating point arithmetic unit
JPS59139448A (en) Floating-point multiplying device
JPH09204295A (en) Sticky bit detecting circuit
JP2919386B2 (en) Floating-point detector and floating-point detector
CN111290790A (en) Conversion device for converting fixed point into floating point
US5754458A (en) Trailing bit anticipator
US20120191955A1 (en) Method and system for floating point acceleration on fixed point digital signal processors
JP3137131B2 (en) Floating point multiplier and multiplication method
JP2801472B2 (en) Floating point arithmetic unit
US6996591B2 (en) System and method to efficiently approximate the term 2x
RU2642385C1 (en) DEVICE FOR CALCULATING arctg Y/X FUNCTION
JPH0527949A (en) Exponent arithmetic circuit in floating point multiplication
JPS59140560A (en) floating point multiplier
JPH01232430A (en) Arithmetic circuit
JPH0635676A (en) Divider circuit