KR940009866A - Fast Multiplier Using Group Tree Structure Method (GTSM) - Google Patents

Fast Multiplier Using Group Tree Structure Method (GTSM) Download PDF

Info

Publication number
KR940009866A
KR940009866A KR1019920020237A KR920020237A KR940009866A KR 940009866 A KR940009866 A KR 940009866A KR 1019920020237 A KR1019920020237 A KR 1019920020237A KR 920020237 A KR920020237 A KR 920020237A KR 940009866 A KR940009866 A KR 940009866A
Authority
KR
South Korea
Prior art keywords
register
multiplier
gate
gtsm
initial partial
Prior art date
Application number
KR1019920020237A
Other languages
Korean (ko)
Other versions
KR950010451B1 (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 KR1019920020237A priority Critical patent/KR950010451B1/en
Publication of KR940009866A publication Critical patent/KR940009866A/en
Application granted granted Critical
Publication of KR950010451B1 publication Critical patent/KR950010451B1/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Data Mining & Analysis (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Computational Mathematics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Algebra (AREA)
  • Complex Calculations (AREA)

Abstract

본 발명은 디지틀 신호 처리 및 필터에 적용되는 GTSM(Group Tree Structure Method)알고리즘을 이용하여 구현한 고속 승산기에 관한 것이다. 본 발명은, 승수와 피승수의 데이타를 받아들이기 위한 레지스터X(1) 및 레지스터Y(2)와, 상기 승수 레지스터X(1)로부터 MB(Modifide Booth)알고리즘을 실현하기 위한 제어신호를 발생시키는 부트(Booth)엔코더(3)와의 제어신호에 의해 초기 부분적합 비트들을 발생시키는 초기 부분적합 발생수단(4)과, 상기 초기 부분적합 발생수단(4)에서 발생한 초기 부분적합 노드들의 승산을 위해 사용되는 GTSM(Group Tree Structure Method)알고리즘을 수행하는 GTSM수행수단(5)과, 상기 GTSM수행수단(5)에서 출력되는 최종승산결과를 저장하기 위한 출력 레지스터(6)를 구비한 것을 특징으로 한다.The present invention relates to a fast multiplier implemented using a Group Tree Structure Method (GTSM) algorithm applied to digital signal processing and filters. The present invention provides a boot for generating a control signal for realizing an MB (Modifide Booth) algorithm from the register X (1) and register Y (2) and the multiplier register X (1). (Booth) used for multiplying the initial partial fit generation means 4 for generating the initial partial fit bits by a control signal with the encoder 3 and the initial partial fit nodes generated by the initial partial fit generation means 4; GTSM performing means 5 for performing the Group Tree Structure Method (GTSM) algorithm, and an output register 6 for storing the final multiplication result outputted from the GTSM performing means 5.

Description

그룹 트리 구조 알고리즘(GTSM;Group Tree Structure Method)을 적용한 고속 승산기.Fast multiplier applying Group Tree Structure Method (GTSM).

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

제1도는 본 발명에 따른 GTSM(Group Tree Structure Method)알고리즘을 적용한 고속승산기의 구성도,1 is a block diagram of a high speed multiplier to which the Group Tree Structure Method (GTSM) algorithm according to the present invention is applied;

제2도는 GTSM알고리즘 방식의 흐름도,2 is a flow chart of the GTSM algorithm.

제3도는 부분적합 스테이지(PSS)의 비교도.3 is a comparison of partial conformation stages (PSS).

Claims (3)

승수와 피승수의 데이타를 받아들이기 위한 레지스터X(1) 및 레지스터Y(2)와, 상기 승수 레지스터X(1)로부터 MB(Modifide Booth)알고리즘을 실현하기 위한 제어신호를 발생시키는 부트(Booth)엔코더(3)와의 제어신호에 의해 초기 부분적합 비트들을 발생시키는 초기 부분적합 발생수단(4)과, 상기 초기 부분적합 발생수단(4)에서 발생한 초기 부분적합 노드들의 승산을 위해 사용되는 GTSM(Group Tree Structure Method)알고리즘을 수행하는 GTSM수행수단(5)과, 상기 GTSM수행수단(5)에서 출력되는 최종 승산결과를 저장하기 위한 출력 레지스터(6)를 구비한 것을 특으로 하는 고속 승산기.Boot encoder for generating register X (1) and register Y (2) for receiving multiplier and multiplicand data and control signal for realizing MB (Modifide Booth) algorithm from the multiplier register X (1) GTSM (Group Tree) used for multiplication of initial partial fit generation means 4 for generating initial partial fit bits by a control signal with (3) and initial partial fit nodes generated in the initial partial fit generation means 4; And a GTSM performing means (5) for performing the algorithm and an output register (6) for storing the final multiplication result output from the GTSM performing means (5). 제1항에 있어서, 상기 초기 부분적합 발생회로(4)는, 피승수 값을 저장하기 위한 레지스터(22)와, 승수값을 저장하기 위한 레지스터와 부트(Booth) 엔코더(3)를 포함한 승수제어 회로(23)와, 상기 승수제어 회로(23)로부터 전달받은 제어신호에 의해 상기 레지스터(22)로부터 전달받은 피승수 값을 가산하는 다수의 가산기(7)를 구비하는 것을 특징으로 하는 고속 승산기.2. The multiplier control circuit according to claim 1, wherein the initial partial conformance generation circuit (4) comprises a register (22) for storing a multiplier value, a register and a boot encoder (3) for storing a multiplier value. And a plurality of adders (7) for adding a multiplier value transmitted from the register (22) by a control signal received from the multiplier control circuit (23). 제2항에 있어서, 상기 부트 엔코더(3)는, 상기 승수를 입력하는 레지스터X(1)로부터 전달받은 3개의 입력비트 A, B, C를, /A, B, C로서 입력받는 제1앤드(AND) 게이트(8)와, 상기 3개의 입력비트 A, B, C를 A, /B, /C로서 입력받는 제2앤드(AND) 게이트(9)와, 상기 제1앤드게이트(8)와 제2앤드게이트(9)의 출력을 입력받아 피승수의 맨 우측 비트에 "0"을 삽입한 후 가산 연산을 수행한 다음 가산결과의 자리수를 MB(Modifide Booth)알고리즘에 따라 2자기 이동하기 위한 신호(D)를 출력하는 제1오아(OR)게이트(10)와, 상기 3개의 입력비트 A, B, C를 /A, /B, /C로서 입력받는 제3앤드게이트(11)와, 상기 3개의 입력비트 A, B, C를 입력받는 제4앤드게이트(12)와, 상기 제3앤드게이트(11)와 제4앤드게이트(12)의 출력을 입력받아 아무런 덧셈의 과정없이 자리수만 2자리 이동하도록 제어하는 신호(N)를 출력하는 제2오아게이트(13)와, 상기 3개의 입력비트중 최좌측 입력비트(A)를 취해 출력제어신호의 양/음 상태를 나타내는 제어신호(P)를 출력하는 버퍼(14)를 구비하는 것을 특징으로 하는 고속 승산기.The first encoder of claim 2, wherein the boot encoder 3 receives three input bits A, B, and C received from the register X (1) for inputting the multiplier as / A, B, and C. (AND) gate 8, a second AND gate 9 which receives the three input bits A, B, and C as A, / B, and / C, and the first and gate 8 After inputting the output of the second and gate 9 and inserting "0" into the rightmost bit of the multiplicand, perform the addition operation, and then move the number of digits of the addition result according to the MB (Modifide Booth) algorithm. A first OR gate 10 for outputting a signal D, a third gate 11 for receiving the three input bits A, B, and C as / A, / B, / C, The fourth and gate 12 receiving the three input bits A, B, and C, and the outputs of the third and gate 11 and the fourth and gate 12 are inputted with only digits without any addition process. Signal (N) to control two-digit movement A second orifice 13 for output and a buffer 14 for taking the leftmost input bit A of the three input bits and outputting a control signal P indicating a positive / negative state of the output control signal; High speed multiplier, characterized in that. ※ 참고사항 : 최초출원 내용에 의하여 공개하는 것임.※ Note: The disclosure is based on the initial application.
KR1019920020237A 1992-10-30 1992-10-30 A flight speed multiplier using group tree structure algorithm KR950010451B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1019920020237A KR950010451B1 (en) 1992-10-30 1992-10-30 A flight speed multiplier using group tree structure algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1019920020237A KR950010451B1 (en) 1992-10-30 1992-10-30 A flight speed multiplier using group tree structure algorithm

Publications (2)

Publication Number Publication Date
KR940009866A true KR940009866A (en) 1994-05-24
KR950010451B1 KR950010451B1 (en) 1995-09-18

Family

ID=19342154

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1019920020237A KR950010451B1 (en) 1992-10-30 1992-10-30 A flight speed multiplier using group tree structure algorithm

Country Status (1)

Country Link
KR (1) KR950010451B1 (en)

Also Published As

Publication number Publication date
KR950010451B1 (en) 1995-09-18

Similar Documents

Publication Publication Date Title
JPS6337741A (en) Digital heterodyne circuit
US5122982A (en) Carry generation method and apparatus
US3878985A (en) Serial-parallel multiplier using booth{3 s algorithm with combined carry-borrow feature
KR940009866A (en) Fast Multiplier Using Group Tree Structure Method (GTSM)
KR0147942B1 (en) Booths recording circuit in a multiplier
SU1667059A2 (en) Device for multiplying two numbers
KR100392370B1 (en) Apaaratus for calculating inversion of multi level structure in the finite field
RU2007032C1 (en) Device which produces members of multiplicative groups of galois fields gf(p)
KR910014805A (en) Digital Signal Processing Equipment
SU1386990A1 (en) Device for computing polynominals
RU2022337C1 (en) Parallel sign-digit code/additional binary code converter
RU2051406C1 (en) Device for generation of faber-schauder signals
JP3097081B2 (en) Variable stage m-sequence code generator
SU600554A1 (en) Matrix multiplying device
SU1381497A1 (en) Device for extracting square root
RU2045770C1 (en) Device for generation of modulo-three remainder
SU1012251A1 (en) Matrix calculator of logarithms
SU1631554A1 (en) Device for computing fourier-galoiz transform
Head Adherence equivalence is decidable for DOL languages
SU864340A1 (en) Information shifting device
SU1166104A1 (en) Device for calculating values of sine-cosine dependensies
RU1795455C (en) Device for counting non-zero bits in binary number
SU491129A1 (en) Device for raising binary numbers to the third degree
SU1264168A1 (en) Pseudorandom sequence generator
RU1791818C (en) Device for control of modulo three residual code

Legal Events

Date Code Title Description
A201 Request for examination
N231 Notification of change of applicant
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: 19980616

Year of fee payment: 4

LAPS Lapse due to unpaid annual fee