JPH0214727B2 - - Google Patents

Info

Publication number
JPH0214727B2
JPH0214727B2 JP58247392A JP24739283A JPH0214727B2 JP H0214727 B2 JPH0214727 B2 JP H0214727B2 JP 58247392 A JP58247392 A JP 58247392A JP 24739283 A JP24739283 A JP 24739283A JP H0214727 B2 JPH0214727 B2 JP H0214727B2
Authority
JP
Japan
Prior art keywords
recipe
res
carry
residue
gate
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 - Lifetime
Application number
JP58247392A
Other languages
English (en)
Japanese (ja)
Other versions
JPS60136831A (ja
Inventor
Hideo Myanaga
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.)
Fujitsu Ltd
Original Assignee
Fujitsu 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 Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP58247392A priority Critical patent/JPS60136831A/ja
Priority to CA000469911A priority patent/CA1232072A/en
Priority to EP84402615A priority patent/EP0147296B1/en
Priority to DE8484402615T priority patent/DE3485535D1/de
Priority to AU36856/84A priority patent/AU550740B2/en
Priority to BR8406677A priority patent/BR8406677A/pt
Priority to US06/685,517 priority patent/US4727507A/en
Priority to KR8408288A priority patent/KR900000477B1/ko
Priority to ES539052A priority patent/ES539052A0/es
Publication of JPS60136831A publication Critical patent/JPS60136831A/ja
Publication of JPH0214727B2 publication Critical patent/JPH0214727B2/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/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
    • G06F7/5275—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 using carry save adders
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/0751—Error or fault detection not based on redundancy
    • G06F11/0763—Error or fault detection not based on redundancy by bit configuration check, e.g. of formats or tags

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Computing Systems (AREA)
  • Quality & Reliability (AREA)
JP58247392A 1983-12-26 1983-12-26 レシデユ−生成回路 Granted JPS60136831A (ja)

Priority Applications (9)

Application Number Priority Date Filing Date Title
JP58247392A JPS60136831A (ja) 1983-12-26 1983-12-26 レシデユ−生成回路
CA000469911A CA1232072A (en) 1983-12-26 1984-12-12 Multiplication circuit using a multiplier and a carry propagating adder
EP84402615A EP0147296B1 (en) 1983-12-26 1984-12-17 Multiplication circuit
DE8484402615T DE3485535D1 (de) 1983-12-26 1984-12-17 Multiplizierschaltung.
AU36856/84A AU550740B2 (en) 1983-12-26 1984-12-18 Multiplication circuit
BR8406677A BR8406677A (pt) 1983-12-26 1984-12-21 Circuito de multiplicacao
US06/685,517 US4727507A (en) 1983-12-26 1984-12-24 Multiplication circuit using a multiplier and a carry propagating adder
KR8408288A KR900000477B1 (en) 1983-12-26 1984-12-24 Multification circuits
ES539052A ES539052A0 (es) 1983-12-26 1984-12-26 Circuito de multiplicacion para multiplicadores de gran velocidad en el sistema de un ordenador

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP58247392A JPS60136831A (ja) 1983-12-26 1983-12-26 レシデユ−生成回路

Publications (2)

Publication Number Publication Date
JPS60136831A JPS60136831A (ja) 1985-07-20
JPH0214727B2 true JPH0214727B2 (enrdf_load_stackoverflow) 1990-04-09

Family

ID=17162740

Family Applications (1)

Application Number Title Priority Date Filing Date
JP58247392A Granted JPS60136831A (ja) 1983-12-26 1983-12-26 レシデユ−生成回路

Country Status (1)

Country Link
JP (1) JPS60136831A (enrdf_load_stackoverflow)

Also Published As

Publication number Publication date
JPS60136831A (ja) 1985-07-20

Similar Documents

Publication Publication Date Title
US4525797A (en) N-bit carry select adder circuit having only one full adder per bit
US9146707B2 (en) Generating a fast 3x multiplicand term for radix-8 booth multiplication
US3983382A (en) Adder with fast detection of sum equal to zeroes or radix minus one
US7308471B2 (en) Method and device for performing operations involving multiplication of selectively partitioned binary inputs using booth encoding
JPH01240927A (ja) 浮動小数点演算装置
JPH0447849B2 (enrdf_load_stackoverflow)
JPH01169531A (ja) 高速二進・十進算術論理演算装置および二進化十進数に対する演算方法
US6018758A (en) Squarer with diagonal row merged into folded partial product array
US9448767B2 (en) Three-term predictive adder and/or subtracter
JPH0545982B2 (enrdf_load_stackoverflow)
US4224680A (en) Parity prediction circuit for adder/counter
US4727507A (en) Multiplication circuit using a multiplier and a carry propagating adder
JPH04270415A (ja) 高性能加算器
US5677863A (en) Method of performing operand increment in a booth recoded multiply array
US6003059A (en) Carry select adder using two level selectors
US5268858A (en) Method and apparatus for negating an operand
JPH0214727B2 (enrdf_load_stackoverflow)
JPH0464091B2 (enrdf_load_stackoverflow)
US20030208519A1 (en) Power efficient booth recoded multiplier and method of multiplication
US6317772B1 (en) Split remainder divider
JPH01220528A (ja) パリテイ発生器
US5944777A (en) Method and apparatus for generating carries in an adder circuit
JP2556300B2 (ja) 乗算装置
JP3198795B2 (ja) 加算器及び加算方法
JPS6136250B2 (enrdf_load_stackoverflow)