FR1283965A - Circuit de multiplication binaire - Google Patents

Circuit de multiplication binaire

Info

Publication number
FR1283965A
FR1283965A FR848276A FR848276A FR1283965A FR 1283965 A FR1283965 A FR 1283965A FR 848276 A FR848276 A FR 848276A FR 848276 A FR848276 A FR 848276A FR 1283965 A FR1283965 A FR 1283965A
Authority
FR
France
Prior art keywords
multiplication circuit
binary multiplication
binary
circuit
multiplication
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
FR848276A
Other languages
English (en)
Inventor
Pierre Jean Foursin
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.)
Laboratoire Central de Telecommunications SA
Original Assignee
Laboratoire Central de Telecommunications SA
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 Laboratoire Central de Telecommunications SA filed Critical Laboratoire Central de Telecommunications SA
Priority to FR848276A priority Critical patent/FR1283965A/fr
Priority to GB3573561A priority patent/GB945527A/en
Priority to DEJ21045A priority patent/DE1151398B/de
Priority to CH1512361A priority patent/CH395592A/fr
Application granted granted Critical
Publication of FR1283965A publication Critical patent/FR1283965A/fr
Expired legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR 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/491—Computations with decimal numbers radix 12 or 20.
    • G06F7/4915—Multiplying; Dividing

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computing Systems (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Complex Calculations (AREA)
FR848276A 1960-12-29 1960-12-29 Circuit de multiplication binaire Expired FR1283965A (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
FR848276A FR1283965A (fr) 1960-12-29 1960-12-29 Circuit de multiplication binaire
GB3573561A GB945527A (en) 1960-12-29 1961-10-04 Improvements in or relating to multipliers
DEJ21045A DE1151398B (de) 1960-12-29 1961-12-19 Verfahren und Einrichtung zur Multiplikation binaerer Zahlen
CH1512361A CH395592A (fr) 1960-12-29 1961-12-29 Circuit de multiplication binaire

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
FR848276A FR1283965A (fr) 1960-12-29 1960-12-29 Circuit de multiplication binaire

Publications (1)

Publication Number Publication Date
FR1283965A true FR1283965A (fr) 1962-02-09

Family

ID=8745697

Family Applications (1)

Application Number Title Priority Date Filing Date
FR848276A Expired FR1283965A (fr) 1960-12-29 1960-12-29 Circuit de multiplication binaire

Country Status (4)

Country Link
CH (1) CH395592A (fr)
DE (1) DE1151398B (fr)
FR (1) FR1283965A (fr)
GB (1) GB945527A (fr)

Also Published As

Publication number Publication date
CH395592A (fr) 1965-07-15
DE1151398B (de) 1963-07-11
GB945527A (en) 1964-01-02

Similar Documents

Publication Publication Date Title
FR1284106A (fr) Circuit onduleur
CH406431A (de) Festkörper-Schaltung
FR1320040A (fr) Basculeur binaire
BE592629A (fr) Elément de circuit.
CH369816A (fr) Disjoncteur
FR1304263A (fr) Circuit de convertisseur
FR1296302A (fr) Circuit bistable
CH394298A (de) Ringschaltung
CH390348A (de) Leistungsschalter
FR1281712A (fr) Circuit additionneur binaire
CH404723A (de) NOR-Schaltung
CH371279A (de) Additions- oder Subtraktionsschaltung
FR1283965A (fr) Circuit de multiplication binaire
FR1296221A (fr) Circuit logique
CH397292A (de) Binäre Zählschaltung
CH395238A (de) Leistungsschalter
FR82419E (fr) Circuit de multiplication binaire
FR1290764A (fr) Circuit discriminateur
CH419672A (fr) Circuit multiplicateur
FR1319846A (fr) Circuit redresseur-transformateur
FR1303416A (fr) Addeur binaire
FR1301248A (fr) Circuit de déviation
BE607364A (fr) Totalisateur binaire
BE609219A (fr) Totalisateur binaire
FR86479E (fr) Circuit de convertisseur