KR950006588A - High Speed Computing Adder - Google Patents

High Speed Computing Adder Download PDF

Info

Publication number
KR950006588A
KR950006588A KR1019930016984A KR930016984A KR950006588A KR 950006588 A KR950006588 A KR 950006588A KR 1019930016984 A KR1019930016984 A KR 1019930016984A KR 930016984 A KR930016984 A KR 930016984A KR 950006588 A KR950006588 A KR 950006588A
Authority
KR
South Korea
Prior art keywords
carry
adding means
adder
bit group
mantissa
Prior art date
Application number
KR1019930016984A
Other languages
Korean (ko)
Other versions
KR950015180B1 (en
Inventor
김성정
Original Assignee
배순훈
대우전자 주식회사
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 배순훈, 대우전자 주식회사 filed Critical 배순훈
Priority to KR1019930016984A priority Critical patent/KR950015180B1/en
Publication of KR950006588A publication Critical patent/KR950006588A/en
Application granted granted Critical
Publication of KR950015180B1 publication Critical patent/KR950015180B1/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR 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/50Adding; Subtracting

Landscapes

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

Abstract

본 발명은 고속연산형 가산기에 관한 것으로, 가산될 가수의 복수비트군으로부터 임의로 분할된 제1비트군의 가산을 수행하여 가산결과와 캐리를 출력하는 제1가산수단(50)과, 상기 분할된 가수비트군의 제2비트군에 대해 캐리유무에 대한 연산을 동시에 수행하는 복수의 가산기(51, 52)로 구성된 제2가산수단과 상기 제1가산수단의 캐리에 의해 상기 제2가산수단의 출력을 선택출력하는 멀티플렉서(53), 상기 분할된 비트군의 제3비트군에 대해 캐리유무에 대한 연산을 동시에 수행하는 복수의 가산기(54, 55)로 구성된 제3가산수단과 상기 제2가산수단의 캐리에 따라 상기 제3가산수단의 가산결과치를 선택출력하는 멀티플렉서(56)를 구비하여 구성된 것이다.The present invention relates to a fast computing type adder, comprising: first adding means (50) for performing an addition of a first bit group arbitrarily divided from a plurality of bit groups of an adder to be added, and outputting an addition result and a carry; Output of the second adding means by a second adding means comprising a plurality of adders 51 and 52 which carry out a calculation on whether a carry is performed on the second bit group of the mantissa bit group and the first adding means A third adder and a second adder comprising a multiplexer 53 for selectively outputting a plurality of adders, and a plurality of adders 54 and 55 for simultaneously performing a carry operation on the third bit group of the divided bit group. And a multiplexer 56 for selectively outputting the addition result value of the third adding means according to the carry.

Description

고속연산형 가산기High Speed Computing Adder

본 내용은 요부공개 건이므로 전문내용을 수록하지 않았음Since this is an open matter, no full text was included.

제4도는 본 발명에 따른 고속연산형 가산기를 설명하는 도면.4 is a diagram for explaining a fast operation type adder according to the present invention.

제5도(a)는 제4도에 도시된 캐리“1”가산기와 캐리“0”가산기의 구성을 나타낸 도면이다.FIG. 5 (a) is a diagram showing the configuration of the carry “1” adder and carry “0” adder shown in FIG.

Claims (4)

가산될 가수의 복수비트군으로부터 임의로 분할된 제1비트군의 가산을 수행하여 가산결과와 캐리를 출력하는 제1가산수단(50)과, 상기 분할된 가수비트군의 제2비트군에 대해 캐리유무에 대한 연산을 동시에 수행하는 복수의 가산기(51,52)로 구성된 제2가산수단과 상기 제1가산수단의 캐리에 의해 상기 제2가산수단의 출력을 선택출력하는 멀티플렉서(53), 상기 분할된 비트군의 제3비트군에 대해 캐리유무에 대한 연산을 동시에 수행하는 복수의 가산기(54, 55)로 구성된 제3가산수단과 상기 제2가산수단의 캐리에 따라 상기 제3가산수단의 가산결과치를 선택출력하는 멀티플렉서(56)를 구비하여 구성된 것을 특징으로 하는 고속연산형 가산기.A first adding means (50) for performing an addition of the first bit group arbitrarily divided from the plurality of bit groups of the mantissa to be added and outputting an addition result and a carry; and a carry for the second bit group of the divided mantissa bit group A multiplexer 53 for selectively outputting the output of the second adding means by the second adding means composed of a plurality of adders 51 and 52 which simultaneously perform arithmetic operations on the presence or absence and the carry of the first adding means; The third adding means comprising a plurality of adders 54 and 55 which simultaneously perform a carry operation on the third bit group of the selected bit group and the third adding means according to the carry of the second adding means. A high speed computation type adder, comprising: a multiplexer 56 for selectively outputting result values. 제1항에 있어서, 상기 제2가산수단과 제3가산수단을 이루는 복수의 가산기중 하나는 일단이 하이레벨로 설정되는 캐리“1”가산기(51, 54)와 일단이 로우레벨로 설정된 캐리“0”가산기(52, 55)로 구성되어 할당된 비트열을 동시에 연산하도록 구성된 것을 특징으로 하는 고속연산형 가산기.The carry-on apparatus of claim 1, wherein one of the plurality of adders constituting the second adding means and the third adding means has a carry " 1 " adder 51 and 54 whose one end is set to a high level and a carry " A fast computing type adder, comprising: 0 ”adders (52, 55) configured to simultaneously calculate the assigned bit strings. 제2항에 있어서, 상기 캐리“1”가산기는 상기 가산될 가수의 가산치(Ci)를 AND처리하여 캐리(Ci+1)를 얻는 AND게이트(62)로 구성된 것을 특징으로 하는 고속연산형 가산기.3. The fast operation adder as set forth in claim 2, wherein the carry "1" adder is composed of an AND gate 62 which ANDs the addition value Ci of the mantissa to be added to obtain a carry Ci + 1. . 제2항에 있어서, 상기 캐리“0”가산기는 가수(Ai), (Bi)의 가산치(Pi)를 얻는 배타화 논리게이트(71)와, 이 배타화 논리게이트(71)의 출력(Pi)를 반전시켜 최종 정상치(Si)를 얻는 인버터(72), 상기 가수(Ai)와 피가수(Bi)를 AND처리하는 AND게이트(73)와, 이 AND게이트(73)에 의한 AND처리결과 (Gi)와 상기 출력(Pi)를 OR처리하여 캐리C(i+1)를 생성하는 OR게이트(74)로 구성된 것을 특징으로 하는 고속연산형 가산기.The carry "0" adder includes an exclusion logic gate 71 for obtaining addition values Pi of mantissa Ai and Bi, and an output Pi of the exclusion logic gate 71. Inverter 72 obtains the final normal value Si by inverting?, An AND gate 73 for ANDing the mantissa Ai and the surplus singer Bi, and an AND processing result (Gi) by the AND gate 73 And OR gate (74) for ORing the output (Pi) to generate carry C (i + 1). ※ 참고사항 : 최초출원 내용에 의하여 공개하는 것임.※ Note: The disclosure is based on the initial application.
KR1019930016984A 1993-08-30 1993-08-30 High speed adder KR950015180B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1019930016984A KR950015180B1 (en) 1993-08-30 1993-08-30 High speed adder

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1019930016984A KR950015180B1 (en) 1993-08-30 1993-08-30 High speed adder

Publications (2)

Publication Number Publication Date
KR950006588A true KR950006588A (en) 1995-03-21
KR950015180B1 KR950015180B1 (en) 1995-12-23

Family

ID=19362265

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1019930016984A KR950015180B1 (en) 1993-08-30 1993-08-30 High speed adder

Country Status (1)

Country Link
KR (1) KR950015180B1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100339245B1 (en) * 1998-12-22 2002-07-18 박종섭 Adder

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100339245B1 (en) * 1998-12-22 2002-07-18 박종섭 Adder

Also Published As

Publication number Publication date
KR950015180B1 (en) 1995-12-23

Similar Documents

Publication Publication Date Title
Nowick et al. Speculative completion for the design of high-performance asynchronous dynamic adders
US5508950A (en) Circuit and method for detecting if a sum of two multibit numbers equals a third multibit constant number prior to availability of the sum
US5477480A (en) Carry look ahead addition method and carry look ahead addition device
San et al. Reducing the hardware complexity of a parallel prefix adder
EP0227427A2 (en) Method of and circuit for generating bit-order modified binary signals
Yagain et al. Design of High‐Speed Adders for Efficient Digital Design Blocks
JPH0756712A (en) Process for execution of numerical computation and arithmetic unit for realization of said process
US5027311A (en) Carry select multiplexer
GB1312791A (en) Arithmetic and logical units
US20030120694A1 (en) Method and apparatus for use in booth-encoded multiplication
KR950006588A (en) High Speed Computing Adder
US6151616A (en) Method and circuit for detecting overflow in operand multiplication
KR970002596A (en) Carry-Up Adder Using Clock Phase
Furuya Design methodologies of comparators based on parallel hardware algorithms
KR960018871A (en) Multi-valued OR
US5798958A (en) Zero detect for binary sum
Shinde et al. Impact of VLSI design techniques on implementation of parallel prefix adders
KR890015511A (en) Logic circuit with self-raising select addition circuit
KR100256103B1 (en) Method and apparatus for generating carry out signals
KR940007722A (en) High Speed Microprocessor Branch Decision Circuit
Ganie et al. On some new generalized difference sequence space of fuzzy numbers and statistical convergence
KR950004223B1 (en) Binary complement generator
KR950024082A (en) Artificial neurons using addition circuits and methods of using them
KR970049455A (en) Adder with Odd / Even 1-Bit Adder Cells
KR980006907A (en) Parallel multiplier

Legal Events

Date Code Title Description
A201 Request for examination
E902 Notification of reason for refusal
G160 Decision to publish patent application
E701 Decision to grant or registration of patent right
GRNT Written decision to grant
FPAY Annual fee payment

Payment date: 19991130

Year of fee payment: 5

LAPS Lapse due to unpaid annual fee