JPS6326899B2 - - Google Patents
Info
- Publication number
- JPS6326899B2 JPS6326899B2 JP57153002A JP15300282A JPS6326899B2 JP S6326899 B2 JPS6326899 B2 JP S6326899B2 JP 57153002 A JP57153002 A JP 57153002A JP 15300282 A JP15300282 A JP 15300282A JP S6326899 B2 JPS6326899 B2 JP S6326899B2
- Authority
- JP
- Japan
- Prior art keywords
- circuit means
- parallel
- output
- multiplier
- value
- 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.)
- Expired
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods 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/52—Multiplying; Dividing
- G06F7/523—Multiplying only
- G06F7/527—Multiplying only in serial-parallel fashion, i.e. one operand being entered serially and the other in parallel
- G06F7/5272—Multiplying only in serial-parallel fashion, i.e. one operand being entered serially and the other in parallel with row wise addition of partial products
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
Description
【発明の詳細な説明】
産業上の利用分野
本発明は、デイジタル信号処理回路のハードウ
エア化の実現において重要な役割を果たすデイジ
タル乗算器に関するものである。DETAILED DESCRIPTION OF THE INVENTION Field of Industrial Application The present invention relates to a digital multiplier that plays an important role in realizing a digital signal processing circuit in hardware.
従来例の構成とその問題点
デイジタルデータ同志の乗算を行なうデイジタ
ル乗算器については、従来より数多くの方式が提
案されてきており、それらを大別すると、並列乗
算器、直列乗算器、ROM(Read Only
Memory)乗算器が知られている。Conventional configurations and their problems Many systems have been proposed for digital multipliers that multiply digital data, and these can be roughly divided into parallel multipliers, serial multipliers, and ROM (read-only) multipliers. Only
Memory) multipliers are known.
各々の乗算器はハードウエア量、演算符号形
式、演算速度、演算精度等においてそれぞれ特徴
を有しており、それぞれ一長一短がある。並列乗
算器では演算精度、速度においてはすぐれている
が、ハードウエア量が多い。直列乗算器はハード
ウエア量は少ないが、演算形式、速度の点で制限
を受ける。ROM乗算器は演算速度の点では比較
的すぐれているが、高精度要求の場合はROM容
量、即ちハードウエア量が増す。また、デイジタ
ル乗算器では入力A、B、出力Cに対してA×B
=Cという演算を行なうが、この入出力のデータ
形式も種々異なつている。つまりROM乗算器で
は任意に構成出来るが、並列乗算器では入力A、
B、出力C共に並列であり、直列乗算器では入力
A、Bのうち1方は並列、他方は直列であり、そ
して出力は直列となる。そのため、乗算器を含む
回路を構成する場合、その仕様に応じて乗算器を
種々選択せねばならない。したがつて今、回路系
全体が並列処理されている場合、用いる乗算器と
しては並列型となるが、並列型はハードウエアが
多いため、価格的にも高く、高速性を必要としな
い用途には不向きとなるという問題があつた。 Each multiplier has its own characteristics in terms of hardware amount, arithmetic code format, arithmetic speed, arithmetic accuracy, etc., and each has advantages and disadvantages. Parallel multipliers are superior in calculation accuracy and speed, but require a large amount of hardware. Although serial multipliers require less hardware, they are limited in terms of calculation format and speed. ROM multipliers are relatively superior in terms of calculation speed, but if high precision is required, the ROM capacity, ie, the amount of hardware, increases. In addition, in a digital multiplier, for inputs A, B, and output C, A×B
The calculation =C is performed, but the input/output data formats also vary. In other words, a ROM multiplier can be configured arbitrarily, but a parallel multiplier has input A,
Both inputs A and C are parallel, and in a serial multiplier, one of the inputs A and B is parallel, the other is serial, and the output is serial. Therefore, when configuring a circuit including multipliers, various multipliers must be selected depending on the specifications. Therefore, if the entire circuit system is processed in parallel, the multiplier used will be a parallel type, but the parallel type requires more hardware, is more expensive, and is not suitable for applications that do not require high speed. There was a problem that it was not suitable.
発明の目的
本発明の目的は、直列乗算器と同等の演算速度
で、かつ並列乗算器に比較して少ないハードウエ
ア量で構成することができるデイジタル乗算器を
提供することにある。OBJECTS OF THE INVENTION It is an object of the present invention to provide a digital multiplier that has an operation speed equivalent to that of a serial multiplier and can be configured with a smaller amount of hardware than a parallel multiplier.
発明の構成
本発明のデイジタル乗算器は、一方の入力とし
ての2の補数表示の並列形被乗数Aに対し、正負
を反転および2のべき乗数を乗ずる符号反転およ
びビツトシフト回路手段と、この符号反転および
ビツトシフト回路手段の出力を時分割多重するマ
ルチプレクス回路手段と、このマルチプレクス回
路手段の出力を他方の入力としての
−bO・20+o-1
〓j-1
bj・2-j(b、n、jは整数)で表わ
される2の補数表示の直列形乗数Bのうち、bjの
値が1であれば通過させ、bjの値がOであれば停
止の制御を行いbjの値が1の場合のみbj・1/2j・
Aの演算を行う切替回路手段と、前記切替回路手
段の出力を順次累積する全加算器およびD型フリ
ツプフロツプより成るアキユムレータ回路手段
と、最終の乗算結果を抜き出すD型フリツプフロ
ツプ回路とを備え、上記2つの入力A、Bを制御
クロツクに同期してA・Bの乗算を行い、並列の
デイジタル乗算結果
bO(−A)+o-1
〓j=1
bj(2-jA)を出力するように構成し
たものである。かかる構成によれば、並列乗算器
と直列乗算器の特徴を合せもつことができ、演算
速度は直列乗算器と同等で、ハードウエア量は並
列乗算器に比較して少ない利点を有しており、特
に高速性は要求されない並列処理のために好適で
ある。Structure of the Invention The digital multiplier of the present invention includes sign inversion and bit shift circuit means for inverting the sign and multiplying a parallel multiplicand A in two's complement representation as one input by a power of two; -b O・2 0 + o-1 〓 j-1 b j・2 -j ( b, n, j are integers), if the value of b j is 1, it is passed, and if the value of b j is O, it is controlled to stop b Only when the value of j is 1, b j・1/2 j・
A switching circuit means for performing the calculation A, an accumulator circuit means consisting of a full adder and a D-type flip-flop that sequentially accumulates the output of the switching circuit means, and a D-type flip-flop circuit for extracting the final multiplication result, Two inputs A and B are multiplied by A and B in synchronization with the control clock, and the parallel digital multiplication result b O (-A) + o-1 〓 j=1 b j (2 -j A) is output. It is configured as follows. According to this configuration, it is possible to have the characteristics of a parallel multiplier and a serial multiplier, and the calculation speed is equivalent to that of a serial multiplier, and the hardware amount has the advantage of being smaller than that of a parallel multiplier. It is especially suitable for parallel processing where high speed is not required.
実施例の説明
第1図は本発明のデイジタル乗算器の一実施例
を示す。第1図において、1は乗算器本体、2,
3は並列入力A、Bの入力端であり、それら並列
入力A、Bは各々m、nビツトの符号長を持つ。
4は並列出力Cの出力端であり、その出力Cの符
号長は(m+n−1)ビツトとなる。ここで、上
記乗算器本体1の構成法は入出力の符号形式によ
り若干異なるが、例として2の補数形式を考え、
振幅を1×1≦1で正規化する。この時入出力
A、B、Cは次のように表される。DESCRIPTION OF THE EMBODIMENTS FIG. 1 shows an embodiment of the digital multiplier of the present invention. In FIG. 1, 1 is the multiplier body, 2,
3 is an input terminal for parallel inputs A and B, and these parallel inputs A and B have code lengths of m and n bits, respectively.
4 is the output end of the parallel output C, and the code length of the output C is (m+n-1) bits. Here, the construction method of the multiplier main body 1 differs slightly depending on the input/output code format, but as an example, consider a two's complement format,
The amplitude is normalized to 1×1≦1. At this time, input/output A, B, and C are expressed as follows.
A=−a0・20+n-1 〓i=1 ai2-i (1) B=−b0・20+o-1 〓j=1 bj2-j (2) C=−c0・20+n+o-1 〓k=1 ck2-k (3) 従つて、出力Cは次のようになる。 A=-a 0・2 0 + n-1 〓 i=1 a i 2 -i (1) B=-b 0・2 0 + o-1 〓 j=1 b j 2 -j (2) C= −c 0・2 0 + n+o-1 〓 k=1 c k 2 -k (3) Therefore, the output C is as follows.
C=A×B
=A×(−b0・20+o-1
〓j=1
bj・2-j)
=b0{(−20)・A}+o-1
〓j=1
bj{2-j・A}
b0・(−A)+b1(1/2・A)+b2(1/22・A
)+………+bo-1(1/2n-1・A)(4)
二進数において、各成分ai、bj、ckは0または
1であり、また2のべき乗の乗算はビツトシフト
により容易に行なえる。従つて、式(4)より明らか
なように、乗数Aに−1および2のべき乗数を乗
じ、被乗数Bの成分bjが1の項のみを加算してゆ
くことにより、乗算は実行出来る。第2図は乗算
器本体1の具体構成を示し、第3図はその動作タ
イミングチヤートを示す。第2図において、乗数
としての並列データAは入力端5より第3図aに
示す動作タイミングで入り、被乗数として並列デ
ータBは入力端8より同様に入る。但し、第3図
aは並列入力データAのうち時定の1ビツトのみ
を示している。入力Aは符号反転およびビツトシ
フト回路手段6により各々所定の演算を受け、次
にマルチプレクス回路手段7により第3図bに示
すデータ形式に時分割多重される。この時、デー
タは(m+n−1)ビツトになる。 C=A×B =A×(-b 0・2 0 + o-1 〓 j=1 b j・2 -j ) =b 0 {(−2 0 )・A}+ o-1 〓 j=1 b j {2 -j・A} b 0・(−A)+b 1 (1/2・A)+b 2 (1/2 2・A
)+......+b o-1 (1/2 n-1・A) (4) In binary numbers, each component a i , b j , c k is 0 or 1, and multiplication by a power of 2 is This can be easily done by bit shifting. Therefore, as is clear from equation (4), multiplication can be performed by multiplying the multiplier A by powers of -1 and 2, and adding only the terms in which the component b j of the multiplicand B is 1. FIG. 2 shows the specific structure of the multiplier main body 1, and FIG. 3 shows its operation timing chart. In FIG. 2, parallel data A as a multiplier enters from input terminal 5 at the operation timing shown in FIG. 3a, and parallel data B as a multiplicand enters from input terminal 8 in the same manner. However, FIG. 3a shows only one fixed bit of the parallel input data A. The input A is subjected to predetermined operations by the sign inversion and bit shift circuit means 6, and then time-division multiplexed by the multiplex circuit means 7 into the data format shown in FIG. 3b. At this time, the data becomes (m+n-1) bits.
一方、入力端8から入つた被乗数Bは並列−直
列変換回路手段9により時分割多重データと同期
した第3図cに示すデータ形式に変換される。1
0はマルチプレクス手段7の出力信号を、それと
同期した並列−直列変換回路9の出力の成分bjが
1の場合のみ通過させる切替回路手段であり、
AND回路によつて構成される。すなわち、第3
図において、並列−直列変換回路9の出力cのbj
の値が1であれば、それに同期した時分割多重デ
ータbの信号を通過させ、Oであればストツプさ
せて零信号を送り、(bj・1/2j・A)の演算を行
なう。11は全加算器、12は単位遅延器として
のD型フリツプフロツプであり、これら全加算器
11とD型フリツプフロツプ12によりアキユム
レータ回路手段を構成し、切替回路手段10の出
力の多重データを順次累積してゆく。すなわち、
b0(−A)+o-1
〓j=1
bj(2-jA)の演算を行なう。D型フ
リツプフロツプ12の動作クロツクを第3図dに
示す。また、1回の乗算が終り、次の乗算を行な
う場合にはアキユムレータ回路手段に累積された
データを消さねばならず、そのためのD型フリツ
プフロツプへのリセツト信号を第3図eに示す。
13は最終乗算結果を抜き出すためのD型フリツ
プフロツプであり、その動作クロツクを第3図f
に示す。そして14が出力端である。 On the other hand, the multiplicand B input from the input terminal 8 is converted by the parallel-to-serial conversion circuit means 9 into the data format shown in FIG. 3c, which is synchronized with the time division multiplexed data. 1
0 is a switching circuit means that allows the output signal of the multiplexing means 7 to pass only when component b j of the output of the parallel-to-serial conversion circuit 9 synchronized therewith is 1;
Consists of an AND circuit. That is, the third
In the figure, b j of the output c of the parallel-serial conversion circuit 9
If the value of is 1, the signal of time division multiplexed data b synchronized with it is passed, and if it is 0, it is stopped and a zero signal is sent, and the calculation (b j 1/2 j A) is performed. 11 is a full adder, and 12 is a D-type flip-flop as a unit delay device.These full adder 11 and D-type flip-flop 12 constitute an accumulator circuit means, which sequentially accumulates the multiplexed data output from the switching circuit means 10. I'm going to go. That is,
Perform the calculation b 0 (-A) + o-1 〓 j=1 b j (2 -j A). The operating clock of the D-type flip-flop 12 is shown in FIG. 3d. Further, when one multiplication is completed and the next multiplication is to be performed, the data accumulated in the accumulator circuit means must be erased, and the reset signal to the D-type flip-flop for this purpose is shown in FIG. 3e.
13 is a D-type flip-flop for extracting the final multiplication result, and its operating clock is shown in FIG.
Shown below. And 14 is an output end.
なお、符号反転回路手段6において、2の補数
形式で(−1)の乗算を行なう場合、全データを
反転させているが、これでは真の値より1LSBだ
け少ない結果となるので、この補正をb0が1の場
合のみアキユムレーシヨンの最初のステツプにお
いて全加算器11の下位からの桁上げ入力Zを用
いて行なう。 In addition, in the sign inversion circuit means 6, when performing multiplication by (-1) in two's complement format, all data is inverted, but since this results in a result that is 1LSB less than the true value, this correction is necessary. Only when b0 is 1, the carry input Z from the lower order of the full adder 11 is used in the first step of the accumulation.
また、被乗数入力Bが最初から第3図cに示す
直列デイジタルデータのタイミングで来ておれば
並列−直列交換回路9は不要であり、この場合は
直列並列入力、並列出力の乗算器としても使え
る。 Furthermore, if the multiplicand input B comes at the timing of the serial digital data shown in FIG. .
また、m=nの場合すなわち両入力データの語
長が等しい場合、構成は唯一に決まるが、m≠n
の場合、構成は2通り考えられる。この場合、語
長の長い方を入力Aに設定した方が演算速度的に
は有利である。 In addition, when m=n, that is, when the word lengths of both input data are equal, the configuration is uniquely determined, but m≠n
In this case, there are two possible configurations. In this case, it is advantageous in terms of calculation speed to set the longer word length as input A.
発明の効果
以上、詳述したように本発明によれば、一方の
入力としての2の補数表示の並列形被乗数Aに対
し、正負を反転および2のべき乗数を乗ずる符号
反転およびビツトシフト回路手段の出力をマルチ
プレクス回路手段で時分割多重し、このマルチプ
レクス回路手段の出力を他方の入力としての
−bO・20+o-1
〓j-1
bj・2-j(b、n、jは整数)で表わ
される2の補数表示の直列形乗数Bのうち、bjの
値が1であれば通過させ、bjの値が0であれば停
止の制御を行いbjの値が1の場合のみbj・1/2j・
Aの演算を行い、この演算結果をアキユムレータ
回路手段で順次累積し、並列のデイジタル乗算結
果
bO(−A)+o-1
〓j=1
bj(2-jA)を出力するように構成し
たので、比較的に少ないハードウエア量で構成で
き、直列乗算器と同等の演算速度を有する利点が
ある。また、回路構成が簡単であるためにIC化
しやすい利点がある。Effects of the Invention As described above in detail, according to the present invention, the sign inversion and bit shift circuit means for inverting the positive/negative and multiplying the positive/negative of the parallel multiplicand A in two's complement representation as one input by a power of two. The outputs are time-division multiplexed by multiplexing circuit means , and the output of this multiplexing circuit means is used as the other input . If the value of b j is 1, it is passed, and if the value of b j is 0, it is stopped and the value of b j is Only in case of 1 b j・1/2 j・
A is calculated, and the results of this calculation are sequentially accumulated by the accumulator circuit means, so that the parallel digital multiplication result b O (-A) + o-1 〓 j=1 b j (2 -j A) is output. Because of this configuration, it can be configured with a relatively small amount of hardware, and has the advantage of having an operation speed equivalent to that of a serial multiplier. Additionally, the circuit configuration is simple, so it has the advantage of being easy to integrate into an IC.
第1図は本発明のデイジタル乗算器の一実施例
を示すブロツク図、第2図は同乗算器の具体回路
構成図、第3図はその動作タイミングチヤートで
ある。
6……符号反転兼ビツトシフト回路、7……マ
ルチプレクス回路、9……並列−直列変換回路、
10……切替回路、11……全加算器、12,1
3……D型フリツプフロツプ。
FIG. 1 is a block diagram showing an embodiment of the digital multiplier of the present invention, FIG. 2 is a specific circuit configuration diagram of the multiplier, and FIG. 3 is an operation timing chart thereof. 6...Sign inversion and bit shift circuit, 7...Multiplex circuit, 9...Parallel-serial conversion circuit,
10...Switching circuit, 11...Full adder, 12,1
3...D type flip-flop.
Claims (1)
乗数Aに対し、正負を反転および2のべき乗数を
乗ずる符号反転およびビツトシフト回路手段と、
この符号反転およびビツトシフト回路手段の出力
を時分割多重するマルチプレクス回路手段と、こ
のマルチプレクス回路手段の出力を他方の入力と
しての −bO・20+o-1 〓j=1 bj・2-j(b、n、jは整数)で表わ
される2の補数表示の直列形乗数Bのうち、bjの
値が1であれば通過させ、bjの値がOであれば停
止の制御を行いbjの値が1の場合のみbj・1/2j・
Aの演算を行う切替回路手段と、前記切替回路手
段の出力を順次累積する全加算器およびD型フリ
ツプフロツプより成るアキユムレータ回路手段
と、最終の乗算結果を抜き出すD型フリツプフロ
ツプ回路とを備え、上記2つの入力A、Bを制御
クロツクに同期してA・Bの乗算を行い、並列の
デイジタル乗算結果 bO(−A)+o-1 〓j=1 bj(2-jA)を出力するように構成し
たことを特徴とするデイジタル乗算器。[Scope of Claims] 1. Sign inversion and bit shift circuit means for inverting the positive/negative and multiplying by a power of 2 a parallel multiplicand A in two's complement representation as one input;
A multiplex circuit means for time-division multiplexing the output of this sign inversion and bit shift circuit means, and -b O・2 0 + o-1 〓 j=1 b j・2 -j (b, n, j are integers) of the serial multiplier B in two's complement representation, if the value of b j is 1, it is passed, and if the value of b j is O, it is stopped. Control is performed and only when the value of b j is 1, b j・1/2 j・
A switching circuit means for performing the calculation A, an accumulator circuit means consisting of a full adder and a D-type flip-flop that sequentially accumulates the output of the switching circuit means, and a D-type flip-flop circuit for extracting the final multiplication result, Two inputs A and B are multiplied by A and B in synchronization with the control clock, and the parallel digital multiplication result b O (-A) + o-1 〓 j=1 b j (2 -j A) is output. A digital multiplier characterized in that it is configured as follows.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP57153002A JPS5943442A (en) | 1982-09-02 | 1982-09-02 | Digital multiplier |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP57153002A JPS5943442A (en) | 1982-09-02 | 1982-09-02 | Digital multiplier |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPS5943442A JPS5943442A (en) | 1984-03-10 |
| JPS6326899B2 true JPS6326899B2 (en) | 1988-06-01 |
Family
ID=15552794
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP57153002A Granted JPS5943442A (en) | 1982-09-02 | 1982-09-02 | Digital multiplier |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPS5943442A (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5390135A (en) * | 1993-11-29 | 1995-02-14 | Hewlett-Packard | Parallel shift and add circuit and method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS5447539A (en) * | 1977-09-22 | 1979-04-14 | Nippon Telegr & Teleph Corp <Ntt> | Digital binary multiplier circuit |
-
1982
- 1982-09-02 JP JP57153002A patent/JPS5943442A/en active Granted
Also Published As
| Publication number | Publication date |
|---|---|
| JPS5943442A (en) | 1984-03-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US4366549A (en) | Multiplier with index transforms modulo a prime or modulo a fermat prime and the fermat prime less one | |
| JPH09325955A (en) | Square root arithmetic circuit for sum of squares | |
| JPS6326899B2 (en) | ||
| SU1667059A2 (en) | Device for multiplying two numbers | |
| RU2837596C1 (en) | Multichannel accumulator by arbitrary modules | |
| RU2785032C1 (en) | Adder-accumulator for frequency synthesisers | |
| US4141077A (en) | Method for dividing two numbers and device for effecting same | |
| EP0213854A2 (en) | Fixed-Coefficient serial multiplication and digital circuits therefor | |
| SU734669A1 (en) | Converter of proper binary fraction into binary-decimal fraction and integer binary-decimal numbers into binary numbers | |
| JPS6361706B2 (en) | ||
| SU1057942A1 (en) | Device for computing values of function y=2@@x | |
| SU763897A1 (en) | Multiplier | |
| SU1086428A1 (en) | Digital scaler | |
| SU1174921A1 (en) | Adder-accumulator | |
| SU1179322A1 (en) | Device for multiplying two numbers | |
| SU1465882A1 (en) | Inverse value computing device | |
| CN121433610A (en) | A Posit matrix multiplication device for edge AI chips | |
| SU1432510A1 (en) | Computing apparatus | |
| RU2022340C1 (en) | Vector modulus computer | |
| SU1115045A1 (en) | P-ary position code-to-binary code translator | |
| SU1262480A1 (en) | Dividing device | |
| SU1171784A1 (en) | Multiplier | |
| SU911519A1 (en) | Device for computing elementary functions | |
| SU809153A1 (en) | Device for bcd-to-binary conversion | |
| RU1786484C (en) | Universal adder |