Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
JPH0345419B2 - - Google Patents
[go: Go Back, main page]

JPH0345419B2 - - Google Patents

Info

Publication number
JPH0345419B2
JPH0345419B2 JP4546783A JP4546783A JPH0345419B2 JP H0345419 B2 JPH0345419 B2 JP H0345419B2 JP 4546783 A JP4546783 A JP 4546783A JP 4546783 A JP4546783 A JP 4546783A JP H0345419 B2 JPH0345419 B2 JP H0345419B2
Authority
JP
Japan
Prior art keywords
multiplier
bits
add
input
sub
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
Application number
JP4546783A
Other languages
Japanese (ja)
Other versions
JPS59170941A (en
Inventor
Yoshitaka Umeki
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.)
NEC Corp
Original Assignee
Nippon 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 Nippon Electric Co Ltd filed Critical Nippon Electric Co Ltd
Priority to JP4546783A priority Critical patent/JPS59170941A/en
Publication of JPS59170941A publication Critical patent/JPS59170941A/en
Publication of JPH0345419B2 publication Critical patent/JPH0345419B2/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/52Multiplying; Dividing
    • G06F7/523Multiplying only

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)
  • Complex Calculations (AREA)

Description

【発明の詳細な説明】 本発明は、乗算器、特に拡張機能を有する並列
乗算器に関する。
DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a multiplier, and more particularly to a parallel multiplier with extended functionality.

現在使用されている乗算器には、直列方式、並
列方式、ROM方式などが知られているが、コン
ピユータ、通信等におけるデイジタル信号処理の
分野においては高速性を要求されるため、並列乗
算方式を用いることが多い。
Multipliers currently in use include serial, parallel, and ROM types, but in the field of digital signal processing in computers, communications, etc., high speed is required, so parallel multipliers are used. Often used.

並列乗算器において乗数、被乗数のビツト数は
固定であるから、既存の乗算器を用いて規模の大
きい、すなわち、ビツト数の長い乗算器を容易に
得ることは重要であり、ビツト数の増加に対処す
る拡張性を備えた乗算器が要求されている。
Since the number of bits of the multiplier and multiplicand in a parallel multiplier is fixed, it is important to easily obtain a large scale multiplier with a long number of bits using existing multipliers. There is a need for a multiplier with scalability to accommodate this.

いま乗数nビツト、被乗数nビツトの乗算器を
用いて、N×N(ただし、N>n)ビツト乗算器
を構成する手法について考えてみる(ここでは説
明のためN/n=r、r:整数とする)。乗算機
能しか持たない乗算器においては、Nビツトの乗
数、被乗数として各部分積を求める。このときn
×nビツト乗算器はr2個用いる。N×Nビツトの
積はこの部分積の和となるので、そのための加算
器を必要とした。
Let's now consider a method of constructing an N×N (N>n) bit multiplier using a multiplier with an n-bit multiplier and an n-bit multiplicand (here, for explanation purposes, N/n=r, r: be an integer). In a multiplier that only has a multiplication function, each partial product is determined as an N-bit multiplier and multiplicand. At this time n
×n-bit multipliers use r 2 pieces. Since the product of N×N bits is the sum of these partial products, an adder for that purpose was required.

拡張機能を内蔵した乗算器においては、原則と
して加算器を用意しなくても、ビツト数を拡張し
た乗算器を作ることができる。拡張機能の内蔵と
いうことは部分積を加算する機能の内蔵を意味し
ており、拡張入力を持つている。その方法として
いくつか知られているが、ここでは被乗数X、乗
数Yと拡張入力Mを有する乗算器をとり上げてみ
る。出力Pは P=X・Y+M (1) (X、Yはnビツト、Mは2nビツト) で表わされる。
In multipliers with built-in expansion functions, it is possible to create a multiplier with an expanded number of bits, in principle, without providing an adder. The built-in extension function means the built-in function to add partial products, and it has an extension input. There are several known methods for this, but here we will take up a multiplier having a multiplicand X, a multiplier Y, and an extended input M. The output P is expressed as P=X・Y+M (1) (X, Y are n bits, M is 2n bits).

上記の機能を有する8×8ビツト乗算器を用い
て作つた16×16ビツト乗算器の実施例を第1図に
示す。
FIG. 1 shows an embodiment of a 16 x 16 bit multiplier made using an 8 x 8 bit multiplier having the above function.

ここで1〜4は各々8×8ビツト乗算器であ
り、乗算器単体としては第2図のような構成にな
つている。出力P32-1は被乗数X16-1、乗数X16-1
拡張入力M32-1に対して P32-1=X16-1・Y16-1+M32-1 (2) を得る。すなわち、(1)式の構成による乗算器を用
いれば、ビツト数の長い乗算器を得ることは容易
である。
Here, each of 1 to 4 is an 8.times.8 bit multiplier, and each multiplier has a configuration as shown in FIG. The output P 32-1 is the multiplicand X 16-1 , the multiplier X 16-1 ,
For the extended input M 32-1 , we obtain P 32-1 = X 16-1・Y 16-1 + M 32-1 (2). That is, by using a multiplier having the configuration of equation (1), it is easy to obtain a multiplier with a long number of bits.

ところで並列乗算器は各種演算における乗算回
路として幅広く使用されているが、(1)式構成では
不充分なことが多い。たとえばデイジタル信号処
理の分野における高速フーリエ変換などでは2つ
の積の和および差により解を求める。このような
演算を行なうとき、乗算器に減算機能を有してい
れば、外部に減算器を用意しなくてもよい。した
がつて最近の乗算器には拡張入力に対して加算の
他に減算機能を内蔵しているものも多く、(1)式に
対して P=X・Y±M (3) (X、Yはnビツト、Mは2nビツト) によつて実現している。その時の構成は第3図の
ようになり、あらたに加算、減算の制御端子
(ADD/SUB)が追加される。ここでADD/
SUBが“0”の時Mi,Mjは直接加算されるとす
ると“1”時はMi,Mjを反転して加算される形
をとる、さて前述と同じように(3)式構成によるn
×nビツト乗算器を用いてN×N(N2n)ビツト
乗算器を作る場合、拡張入力の減算はできないこ
とを以下に説明する。
By the way, parallel multipliers are widely used as multiplication circuits in various operations, but the configuration of equation (1) is often insufficient. For example, in fast Fourier transform in the field of digital signal processing, a solution is found by the sum and difference of two products. When performing such an operation, if the multiplier has a subtraction function, there is no need to provide an external subtracter. Therefore, many recent multipliers have a built-in subtraction function in addition to addition for extended inputs, and for equation (1), P=X・Y±M (3) (X, Y is realized using n bits and M is 2n bits). The configuration at that time will be as shown in Figure 3, with addition and subtraction control terminals (ADD/SUB) added. ADD here/
If SUB is "0", Mi and Mj are directly added, and when SUB is "1", Mi and Mj are inverted and added.Now, as mentioned above, by constructing equation (3), n
It will be explained below that when an N×N (N2n) bit multiplier is created using a ×n bit multiplier, the extended input cannot be subtracted.

まず第1図において、1〜4の8×8ビツト乗
算器は(3)式に示すような加算、減算機能を有す
る、つまり第3図構成の乗算器とする。第1図に
おけるaは乗算器2の下位4ビツトの出力であ
り、乗算器1の拡張入力上位4ビツト(第3図に
おけるMjに相当)に加算される。同様に乗算器
1の上位4ビツト出力bは乗算器3の下位4ビツ
ト(第3図におけるMiに相当)へ、乗算器2の
上位4ビツト出力Cは乗算器3の上位4ビツト
へ、乗算器3の上位4ビツト出力dは乗算器4の
下位4ビツトへそれぞれ加算される。ここで積
X16-1・Y16-1に対して拡張入力M32-1の加算、減
算のいずれにおいても、a〜dは次段の乗算器の
部分積に常に加算されなければならない。第1図
回路において問題となるのは拡張入力M32-1を減
算すべくADD/SUB端子を設定した時、上記a
〜dも減算されてしまうことである。したがつて
第3図のような拡張入力の加算、減算機能を有す
る乗算器を用いて(3)式を実現できるのは単体使用
時のみであり、拡張時においては減算は不可能で
あつた。このように(1)式および(3)式構成による乗
算器を用いて長いビツト数の積の減算(この場合
M32-1)を求めるには−M32-1を加算する方法し
かなく、仮にデータが2の補数表示形式のとき
は、もとの数をあらわす2進数の各ビツトを反転
し、かつ最下位ビツト(M1)に“1”を加える
ような機能の回路を外部に用意しなければならな
かつた。
First, in FIG. 1, the 8.times.8 bit multipliers 1 to 4 have addition and subtraction functions as shown in equation (3), that is, the multipliers have the configuration shown in FIG. In FIG. 1, a is the output of the lower 4 bits of multiplier 2, which is added to the upper 4 bits of the expansion input of multiplier 1 (corresponding to Mj in FIG. 3). Similarly, the upper 4 bits output b of multiplier 1 are sent to the lower 4 bits of multiplier 3 (corresponding to Mi in Fig. 3), and the upper 4 bits output C of multiplier 2 are sent to the upper 4 bits of multiplier 3. The upper four bits output d of the multiplier 3 are added to the lower four bits of the multiplier 4, respectively. Product here
In either addition or subtraction of the extended input M 32-1 to X 16-1 and Y 16-1 , a to d must always be added to the partial product of the next stage multiplier. The problem with the circuit in Figure 1 is that when the ADD/SUB terminal is set to subtract the expansion input M 32-1 ,
~d is also subtracted. Therefore, using a multiplier with addition and subtraction functions for expansion inputs as shown in Figure 3, equation (3) can only be realized when used alone; subtraction is not possible during expansion. . In this way, we can subtract the product of a long number of bits (in this case
The only way to find M 32-1 ) is to add -M 32-1 ; if the data is in two's complement format, each bit of the binary number representing the original number is inverted, and the It was necessary to provide an external circuit with the function of adding "1" to the lower bit (M 1 ).

本発明の目的は、従来の拡張入力の加算、減算
機能を有する乗算器において、拡張時においても
単体時の機能、すなわち、拡張入力の加算、減算
が可能な乗算器を提供することにある。
An object of the present invention is to provide a multiplier that is capable of adding and subtracting extended inputs even when extended, in a conventional multiplier having the functions of adding and subtracting extended inputs.

本発明による乗算器は、前記目的を達成するた
めに拡張入力を上記ビツト下位ビツトに2分割す
るとともに、加算、減算制御端子ADD/SUBの
ほかに拡張入力の制御端子をあらたに設け、この
端子と前記ADD/SUB端子により、2分割され
た拡張入力をそれぞれ独立に加算、減算すること
を特徴とするものである。
In order to achieve the above object, the multiplier according to the present invention divides the extension input into two into the lower bits, and also provides a new control terminal for the extension input in addition to the addition and subtraction control terminals ADD/SUB. and the ADD/SUB terminal are used to independently add and subtract the two divided expansion inputs.

以下実施例に従い、図面を用いて詳述する。 Embodiments will be described in detail below with reference to the drawings.

第4図は本発明による乗算器の実施例を示す構
成図であり、被乗数Xi、乗数Yi、拡張入力Mi,
Mj、加算、減算制御端子ADD/SUBのほかに、
拡張入力制御端子Kcを設けている。
FIG. 4 is a block diagram showing an embodiment of the multiplier according to the present invention, in which the multiplicand Xi, the multiplier Yi, the extended input Mi,
In addition to Mj, addition and subtraction control terminals ADD/SUB,
An expansion input control terminal Kc is provided.

拡張時に拡張入力の減算も可能とするには、基
本的にはADD/SUB、Kcの2入力により、拡張
入力Mi,Mjをそれぞれ独立に、そのままあるい
は反転して加算させるような論理を組めば良い。
To make it possible to subtract the expansion inputs during expansion, basically you need to create a logic that adds the expansion inputs Mi and Mj independently, either as they are or inverted, using the two inputs ADD/SUB and Kc. good.

ここで単体使用時においてKcに“0”を印加
し、ADD/SBU=“0”の時加算、すなわちMi,
Mjを直接入力し、ADD/SUB=“1”の時減算、
すなわちMi,Mjを反転して入力する構成の乗算
器とすると、拡張時にはMi,MjはADD/SUB
及びKcの値により、第5図に示すように直接、
もしくは反転されて積Xi,Yiに加算される。そ
の具体的な構成を第6図に示す。第6図において
11〜13はExclusive−ORゲート、14はXi,
Yiの乗算回路、15は加算回路であり、Pi,Pj
は出力をあらわしている。
Here, when using a single unit, apply “0” to Kc, add when ADD/SBU = “0”, that is, Mi,
Directly input Mj, subtract when ADD/SUB="1",
In other words, if we use a multiplier configured to invert Mi and Mj and input them, Mi and Mj will be ADD/SUB during expansion.
According to the values of and Kc, directly as shown in Figure 5,
Or it is inverted and added to the products Xi and Yi. Its specific configuration is shown in FIG. In Fig. 6, 11 to 13 are Exclusive-OR gates, 14 is Xi,
Yi multiplication circuit, 15 is addition circuit, Pi, Pj
represents the output.

第5図の論理をもつ第4図乗算器を第1図に適
用してみる、a〜dは前述の如く常に加算である
ので乗算器3にはADD/SUB,Kc共に“0”を
印加する。また乗算器2のKcに“0”を印加、
乗算器4のADD/SUBに“0”を印加し、乗算
器1のADD/SUB,Kc、乗算器2のADD/
SUB、乗算器4のKcを共通接続する。そして積
X16-1・Y16-1に対して前記共通接続された端子に
“0”を印加すれば拡張入力M32-1は加算され、
“1”を印加すれば減算されることになる。また
ビツト数を更に拡散する場合においてもADD/
SUB,Kcの条件は同じである。
Let's apply the multiplier in Figure 4 with the logic in Figure 5 to Figure 1. Since a to d are always additions as mentioned above, "0" is applied to both ADD/SUB and Kc in multiplier 3. do. Also, apply “0” to Kc of multiplier 2,
Apply “0” to ADD/SUB of multiplier 4, ADD/SUB of multiplier 1, Kc, ADD/SUB of multiplier 2
Connect SUB and Kc of multiplier 4 in common. and product
If “0” is applied to the commonly connected terminals for X 16-1 and Y 16-1 , the expansion input M 32-1 will be added,
If "1" is applied, it will be subtracted. Also, when further spreading the number of bits, ADD/
The conditions for SUB and Kc are the same.

なお、上記説明においては第5図の論理を持つ
乗算器での拡張例であつたが、ADD/SUB,Kc
の2入力で拡張入力Mi,Mjをそれぞれ独立に制
御できる論理であれば、第5図と一致しなくても
よく、その場合は各乗算器のADD/SUB,Kcの
値および接続を変更すれば良い。
In addition, in the above explanation, the example was an expansion using a multiplier with the logic shown in Figure 5, but ADD/SUB, Kc
If the logic is such that the expansion inputs Mi and Mj can be controlled independently with the two inputs of Good.

このように本発明による乗算器を使用すれば、
拡張時における拡張入力の減算を乗算器のみで容
易に実現でき、その効果は大きい。
If the multiplier according to the present invention is used in this way,
Subtraction of the expansion input during expansion can be easily achieved using only a multiplier, and the effect is significant.

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

第1図は従来の拡張機能付並列乗算器及び本発
明による拡張機能付並列乗算器における拡張時の
実施例、第2図は従来の並列乗算器の構成図、第
3図は従来の拡張機能付並列乗算器の構成図、第
4図は本発明による拡張機能付並列乗算器の構成
図、第5図は第4図における拡張入力の論理を示
す図、第6図は第5図の論理にもとづいた第4図
構成による乗算器の回路概要図である。 符号の説明、1,2,3,4……拡張機能付並
列乗算器、a,b,c,d……部分積、X8-1
X16-9,Xi……被乗数、Y8-1,Y16-9,Yi……乗
数、P8-1,P16-9,P24-17,P32-25,Pi,Pj……乗
算器出力、ADD/SUB……加算、減算制御端
子、Kc……拡張入力制御端子、M8-1,M16-9
M24-17,M32-25,Mi,Mj……拡張入力、Mi,
Mj……反転された拡張入力、11,12,13
……exclusive−ORゲート、14……乗算回路、
15……加算回路。
Fig. 1 is an example of a conventional parallel multiplier with extended function and an extended function parallel multiplier according to the present invention, Fig. 2 is a block diagram of a conventional parallel multiplier, and Fig. 3 is a conventional extended function. 4 is a block diagram of a parallel multiplier with extended function according to the present invention, FIG. 5 is a diagram showing the logic of the extended input in FIG. 4, and FIG. 6 is a diagram showing the logic of FIG. 5. FIG. 4 is a circuit schematic diagram of a multiplier having the configuration shown in FIG. 4 based on FIG. Explanation of symbols, 1, 2, 3, 4...Parallel multiplier with extended functions, a, b, c, d...Partial product, X 8-1 ,
X 16-9 , Xi... Multiplicand, Y 8-1 , Y 16-9 , Yi... Multiplier, P 8-1 , P 16-9 , P 24-17 , P 32-25 , Pi, Pj... Multiplier output, ADD/SUB...addition, subtraction control terminal, Kc...extension input control terminal, M8-1 , M16-9 ,
M 24-17 , M 32-25 , Mi, Mj...extended input, Mi,
Mj...Inverted extended input, 11, 12, 13
...exclusive-OR gate, 14...multiplication circuit,
15...Addition circuit.

Claims (1)

【特許請求の範囲】[Claims] 1 乗数、被乗数の積に対して、加算、減算制御
端子により拡張入力を加算または減算する並列乗
算器において、前記拡張入力を上位ビツト、下位
ビツトに2分割するとともに、あらたに設けられ
た拡張入力制御端子と前記加算、減算制御端子に
より、2分割された前記拡張入力をそれぞれ独立
して加算、減算する機能を有することを特徴とす
る並列乗算器。
1. In a parallel multiplier that adds or subtracts an extension input to the product of a multiplier and a multiplicand using addition and subtraction control terminals, the extension input is divided into two into upper bits and lower bits, and a newly provided extension input is used. A parallel multiplier having a function of independently adding and subtracting the expanded input divided into two using a control terminal and the addition and subtraction control terminals.
JP4546783A 1983-03-18 1983-03-18 Parallel multiplier Granted JPS59170941A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP4546783A JPS59170941A (en) 1983-03-18 1983-03-18 Parallel multiplier

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP4546783A JPS59170941A (en) 1983-03-18 1983-03-18 Parallel multiplier

Publications (2)

Publication Number Publication Date
JPS59170941A JPS59170941A (en) 1984-09-27
JPH0345419B2 true JPH0345419B2 (en) 1991-07-11

Family

ID=12720177

Family Applications (1)

Application Number Title Priority Date Filing Date
JP4546783A Granted JPS59170941A (en) 1983-03-18 1983-03-18 Parallel multiplier

Country Status (1)

Country Link
JP (1) JPS59170941A (en)

Also Published As

Publication number Publication date
JPS59170941A (en) 1984-09-27

Similar Documents

Publication Publication Date Title
US4953115A (en) Absolute value calculating circuit having a single adder
JPH0479013B2 (en)
US4761760A (en) Digital adder-subtracter with tentative result correction circuit
JPS6132437Y2 (en)
US4556948A (en) Multiplier speed improvement by skipping carry save adders
US4878192A (en) Arithmetic processor and divider using redundant signed digit arithmetic
US3970833A (en) High-speed adder
US5038315A (en) Multiplier circuit
JPH0331930A (en) Method and instrument of multiplication of complement code of real time 2'c in digital signal processing system
US3816734A (en) Apparatus and method for 2{40 s complement subtraction
US4873660A (en) Arithmetic processor using redundant signed digit arithmetic
US5870322A (en) Multiplier to selectively perform unsigned magnitude multiplication or signed magnitude multiplication
US3582634A (en) Electrical circuit for multiplying serial binary numbers by a parallel number
JPH0345419B2 (en)
JPS6027024A (en) computing device
Blair The equivalence of twos-complement addition and the conversion of redundant-binary to twos-complement numbers
JP3071607B2 (en) Multiplication circuit
JP3074958B2 (en) Serial multiplier with addition function
JP2000347834A (en) Arithmetic circuit by sw number system
JPS6265131A (en) Multiplier
JPH0253819B2 (en)
KR100196520B1 (en) Two's complement converter for area improvement
JPS6349835A (en) arithmetic processing unit
JP2890412B2 (en) Code conversion circuit
JPS61151739A (en) Dividing circuit