JPS54114941A - Binary multiplying circuit - Google Patents

Binary multiplying circuit

Info

Publication number
JPS54114941A
JPS54114941A JP1028079A JP1028079A JPS54114941A JP S54114941 A JPS54114941 A JP S54114941A JP 1028079 A JP1028079 A JP 1028079A JP 1028079 A JP1028079 A JP 1028079A JP S54114941 A JPS54114941 A JP S54114941A
Authority
JP
Japan
Prior art keywords
multiplying circuit
binary multiplying
binary
circuit
multiplying
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
JP1028079A
Other languages
English (en)
Japanese (ja)
Other versions
JPS6217770B2 (OSRAM
Inventor
Danko Gaisuki Danieru
Rateiraru Boo Chiyandorakaanto
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.)
Unisys Corp
Original Assignee
Burroughs Corp
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 Burroughs Corp filed Critical Burroughs Corp
Publication of JPS54114941A publication Critical patent/JPS54114941A/ja
Publication of JPS6217770B2 publication Critical patent/JPS6217770B2/ja
Granted legal-status Critical Current

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/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
    • G06F7/5318—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel with column wise addition of partial products, e.g. using Wallace tree, Dadda counters
    • 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/533—Reduction of the number of iteration steps or stages, e.g. using the Booth algorithm, log-sum, odd-even
    • G06F7/5334—Reduction of the number of iteration steps or stages, e.g. using the Booth algorithm, log-sum, odd-even by using multiple bit scanning, i.e. by decoding groups of successive multiplier bits in order to select an appropriate precalculated multiple of the multiplicand as a partial product
    • G06F7/5336—Reduction of the number of iteration steps or stages, e.g. using the Booth algorithm, log-sum, odd-even by using multiple bit scanning, i.e. by decoding groups of successive multiplier bits in order to select an appropriate precalculated multiple of the multiplicand as a partial product overlapped, i.e. with successive bitgroups sharing one or more bits being recoded into signed digit representation, e.g. using the Modified Booth Algorithm
    • G06F7/5338—Reduction of the number of iteration steps or stages, e.g. using the Booth algorithm, log-sum, odd-even by using multiple bit scanning, i.e. by decoding groups of successive multiplier bits in order to select an appropriate precalculated multiple of the multiplicand as a partial product overlapped, i.e. with successive bitgroups sharing one or more bits being recoded into signed digit representation, e.g. using the Modified Booth Algorithm each bitgroup having two new bits, e.g. 2nd order MBA

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)
JP1028079A 1978-02-13 1979-01-30 Binary multiplying circuit Granted JPS54114941A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US05/877,083 US4168530A (en) 1978-02-13 1978-02-13 Multiplication circuit using column compression

Publications (2)

Publication Number Publication Date
JPS54114941A true JPS54114941A (en) 1979-09-07
JPS6217770B2 JPS6217770B2 (OSRAM) 1987-04-20

Family

ID=25369216

Family Applications (1)

Application Number Title Priority Date Filing Date
JP1028079A Granted JPS54114941A (en) 1978-02-13 1979-01-30 Binary multiplying circuit

Country Status (3)

Country Link
US (1) US4168530A (OSRAM)
JP (1) JPS54114941A (OSRAM)
GB (1) GB2016181B (OSRAM)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS603744A (ja) * 1983-06-15 1985-01-10 インタ−ナショナル　ビジネス　マシ−ンズ　コ−ポレ−ション 乗算器
JPS61156433A (ja) * 1984-12-28 1986-07-16 Toshiba Corp 並列乗算器
JPS6456181A (en) * 1987-08-26 1989-03-03 Yamadagumi Kk Apparatus for removing foreign matters on the inner surface of pipe

Families Citing this family (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4238833A (en) * 1979-03-28 1980-12-09 Monolithic Memories, Inc. High-speed digital bus-organized multiplier/divider system
JPS5731042A (en) * 1980-07-31 1982-02-19 Toshiba Corp Multiplaying and dividing circuits
US4470125A (en) * 1981-11-09 1984-09-04 Rca Corporation Multiplier for digital video signals using a cascade of signal-selectable memories
US4538239A (en) * 1982-02-11 1985-08-27 Texas Instruments Incorporated High-speed multiplier for microcomputer used in digital signal processing system
US4577282A (en) * 1982-02-22 1986-03-18 Texas Instruments Incorporated Microcomputer system for digital signal processing
US4644488A (en) * 1983-10-12 1987-02-17 California Institute Of Technology Pipeline active filter utilizing a booth type multiplier
US4700325A (en) * 1984-02-08 1987-10-13 Hewlett-Packard Company Binary tree calculations on monolithic integrated circuits
JPS60237534A (ja) * 1984-05-09 1985-11-26 Toshiba Corp 並列乗算器
US4575812A (en) * 1984-05-31 1986-03-11 Motorola, Inc. X×Y Bit array multiplier/accumulator circuit
US4623982A (en) 1985-06-10 1986-11-18 Hewlett-Packard Company Conditional carry techniques for digital processors
JPH0831025B2 (ja) * 1986-03-29 1996-03-27 株式会社東芝 乗算回路
US4843585A (en) * 1987-09-14 1989-06-27 Motorola, Inc. Pipelineable structure for efficient multiplication and accumulation operations
KR920003908B1 (ko) * 1987-11-19 1992-05-18 미쓰비시뎅끼 가부시끼가이샤 승산기(乘算器)
US5144576A (en) * 1989-09-05 1992-09-01 Cyrix Corporation Signed digit multiplier
DE69130652T2 (de) * 1990-03-20 1999-05-06 Fujitsu Ltd., Kawasaki, Kanagawa Digitaler paralleler Hochgeschwindigkeitsmultiplizierer
US5101372A (en) * 1990-09-28 1992-03-31 International Business Machines Corporation Optimum performance standard cell array multiplier
US5187679A (en) * 1991-06-05 1993-02-16 International Business Machines Corporation Generalized 7/3 counters
US5333119A (en) * 1992-09-30 1994-07-26 Regents Of The University Of Minnesota Digital signal processor with delayed-evaluation array multipliers and low-power memory addressing
US5446651A (en) * 1993-11-30 1995-08-29 Texas Instruments Incorporated Split multiply operation
US5509129A (en) * 1993-11-30 1996-04-16 Guttag; Karl M. Long instruction word controlling plural independent processor operations
US5644522A (en) * 1993-11-30 1997-07-01 Texas Instruments Incorporated Method, apparatus and system for multiply rounding using redundant coded multiply result
US5974437A (en) * 1996-12-02 1999-10-26 Synopsys, Inc. Fast array multiplier
KR100477913B1 (ko) * 1997-12-30 2005-08-29 주식회사 하이닉스반도체 부스알고리즘을이용한멀티플라이어
US6215325B1 (en) 1999-03-29 2001-04-10 Synopsys, Inc. Implementing a priority function using ripple chain logic
US7136888B2 (en) 2000-08-04 2006-11-14 Arithmatica Limited Parallel counter and a logic circuit for performing multiplication
US6883011B2 (en) 2000-08-04 2005-04-19 Arithmatica Limited Parallel counter and a multiplication logic circuit
GB2365636B (en) 2000-08-04 2005-01-05 Automatic Parallel Designs Ltd A parallel counter and a multiplication logic circuit
GB2373602B (en) 2001-03-22 2004-11-17 Automatic Parallel Designs Ltd A multiplication logic circuit
GB2396718B (en) 2002-12-23 2005-07-13 Arithmatica Ltd A logic circuit and method for carry and sum generation and method of designing such a logic circuit
GB2398944B (en) 2003-01-14 2005-07-20 Arithmatica Ltd A logic circuit
US7042246B2 (en) 2003-02-11 2006-05-09 Arithmatica Limited Logic circuits for performing threshold functions
US7308471B2 (en) 2003-03-28 2007-12-11 Arithmatica Limited Method and device for performing operations involving multiplication of selectively partitioned binary inputs using booth encoding
GB2401962B (en) 2003-05-23 2005-05-18 Arithmatica Ltd A sum bit generation circuit

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3515344A (en) * 1966-08-31 1970-06-02 Ibm Apparatus for accumulating the sum of a plurality of operands
US3691359A (en) * 1970-07-28 1972-09-12 Singer General Precision Asynchronous binary multiplier employing carry-save addition
US3761698A (en) * 1972-04-24 1973-09-25 Texas Instruments Inc Combined digital multiplication summation
US3795880A (en) * 1972-06-19 1974-03-05 Ibm Partial product array multiplier
US4041292A (en) * 1975-12-22 1977-08-09 Honeywell Information Systems Inc. High speed binary multiplication system employing a plurality of multiple generator circuits

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
IEE TRANSACTIONS ON ELECTRONIC COMPUTERS=1964M2 *
IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS=1964M2 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS603744A (ja) * 1983-06-15 1985-01-10 インタ−ナショナル　ビジネス　マシ−ンズ　コ−ポレ−ション 乗算器
JPS61156433A (ja) * 1984-12-28 1986-07-16 Toshiba Corp 並列乗算器
JPS6456181A (en) * 1987-08-26 1989-03-03 Yamadagumi Kk Apparatus for removing foreign matters on the inner surface of pipe

Also Published As

Publication number Publication date
JPS6217770B2 (OSRAM) 1987-04-20
US4168530A (en) 1979-09-18
GB2016181A (en) 1979-09-19
GB2016181B (en) 1982-03-10

Similar Documents

Publication Publication Date Title
JPS54114941A (en) Binary multiplying circuit
JPS54164255A (en) Small circuit component
JPS54125887A (en) Digitallscanning converting circuit
JPS54128233A (en) Logic circuit
GB2021346B (en) Threshold circuit
GB2033668B (en) Circuit assemblies
GB2012137B (en) Logic circuit
JPS54117629A (en) Threshold value selecting circuit
JPS554700A (en) Power circuit
JPS5571312A (en) Attenuator circuit
JPS5558895A (en) Fetros circuit
JPS5583475A (en) Commutating circuit
GB2025740B (en) Noiseeliminating circuit
JPS54113283A (en) Multiifunction circuit
GB2031680B (en) Moss-logic circuit
GB2039179B (en) Demodulator circuit
JPS54140434A (en) Binary multiplying circuit including encoder circuit
JPS54120850A (en) Power circuit
GB2019620B (en) Binary adder circuits
GB2019621B (en) Binary adder circuits
JPS54109746A (en) Muutuning circuit
JPS5526583A (en) Ciphor circuit
GB2032210B (en) Logic circuit
JPS5578945A (en) Ultrasoniccwave receiving circuit
JPS5541156A (en) Power circuit