[go: up one dir, main page]

WO2002012995A3 - Compteur parallele et circuit logique de multiplication - Google Patents

Compteur parallele et circuit logique de multiplication Download PDF

Info

Publication number
WO2002012995A3
WO2002012995A3 PCT/GB2001/003415 GB0103415W WO0212995A3 WO 2002012995 A3 WO2002012995 A3 WO 2002012995A3 GB 0103415 W GB0103415 W GB 0103415W WO 0212995 A3 WO0212995 A3 WO 0212995A3
Authority
WO
WIPO (PCT)
Prior art keywords
parallel counter
logic circuit
performing multiplication
bit
binary number
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.)
Ceased
Application number
PCT/GB2001/003415
Other languages
English (en)
Other versions
WO2002012995A2 (fr
Inventor
Peter Meulemans
Dmitriy Rumynin
Sunil Talwar
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.)
Automatic Parallel Designs Ltd
Original Assignee
Automatic Parallel Designs 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
Priority claimed from GB0019287A external-priority patent/GB2365636B/en
Application filed by Automatic Parallel Designs Ltd filed Critical Automatic Parallel Designs Ltd
Priority to JP2002517614A priority Critical patent/JP2004506260A/ja
Priority to EP01984499A priority patent/EP1307812A2/fr
Priority to KR10-2003-7001637A priority patent/KR20030045021A/ko
Priority to AU2002229155A priority patent/AU2002229155A1/en
Publication of WO2002012995A2 publication Critical patent/WO2002012995A2/fr
Anticipated expiration legal-status Critical
Publication of WO2002012995A3 publication Critical patent/WO2002012995A3/fr
Ceased 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/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/607—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers number-of-ones counters, i.e. devices for counting the number of input lines set to ONE among a plurality of input lines, also called bit counters or parallel counters

Landscapes

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

Abstract

L'invention concerne un circuit logique, par exemple un compteur parallèle, comprenant une logique servant à générer des bits de sortie comme fonctions symétriques élémentaires des bits d'entrée. Le compteur parallèle peut être utilisé dans un circuit de multiplication. L'invention concerne également un circuit de multiplication dans lequel un réseau de combinaisons de chaque bit d'un nombre binaire avec chaque bit d'un autre nombre binaire est généré, possédant une forme réduite de façon à réduire les étapes nécessaires de la réduction de réseau.
PCT/GB2001/003415 2000-08-04 2001-07-27 Compteur parallele et circuit logique de multiplication Ceased WO2002012995A2 (fr)

Priority Applications (4)

Application Number Priority Date Filing Date Title
JP2002517614A JP2004506260A (ja) 2000-08-04 2001-07-27 並列計数器と乗算を実行するための論理回路
EP01984499A EP1307812A2 (fr) 2000-08-04 2001-07-27 Compteur parallele et circuit logique de multiplication
KR10-2003-7001637A KR20030045021A (ko) 2000-08-04 2001-07-27 승산을 수행하기 위한 병렬 카운터 및 로직 회로
AU2002229155A AU2002229155A1 (en) 2000-08-04 2001-07-27 A parallel counter and a logic circuit for performing multiplication

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
GB0019287A GB2365636B (en) 2000-08-04 2000-08-04 A parallel counter and a multiplication logic circuit
GB0019287.2 2000-08-04
GB0101961.1 2001-01-25
GB0101961A GB2365637B (en) 2000-08-04 2001-01-25 A parallel counter and a multiplication logic circuit

Publications (2)

Publication Number Publication Date
WO2002012995A2 WO2002012995A2 (fr) 2002-02-14
WO2002012995A3 true WO2002012995A3 (fr) 2003-03-13

Family

ID=26244799

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/GB2001/003415 Ceased WO2002012995A2 (fr) 2000-08-04 2001-07-27 Compteur parallele et circuit logique de multiplication

Country Status (5)

Country Link
EP (1) EP1307812A2 (fr)
JP (1) JP2004506260A (fr)
CN (1) CN1468396A (fr)
AU (1) AU2002229155A1 (fr)
WO (1) WO2002012995A2 (fr)

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003034200A1 (fr) * 2000-08-11 2003-04-24 Arithmatica Limited Compteur parallele et circuit logique executant une multiplication
GB2365636B (en) 2000-08-04 2005-01-05 Automatic Parallel Designs Ltd A parallel counter and a multiplication logic circuit
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
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
WO2004104820A2 (fr) 2003-05-23 2004-12-02 Arithmatica Limited Circuit de generation d'un bit de somme
EP1831782A2 (fr) * 2004-07-12 2007-09-12 Halil Kilic Processeur numerique et procede de traitement de donnees numeriques
CN112068802B (zh) * 2020-08-14 2022-11-11 清华大学 计数器的设计方法、装置及计数器

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3634658A (en) * 1970-03-19 1972-01-11 Sperry Rand Corp Parallel bit counter
US3757098A (en) * 1972-05-12 1973-09-04 Rca Corp Carry generation means for multiple character adder
EP0168650A2 (fr) * 1984-07-16 1986-01-22 International Business Machines Corporation Méthode pour la conception de circuiterie logique
EP0309292A2 (fr) * 1987-09-25 1989-03-29 Matsushita Electric Industrial Co., Ltd. Système et méthode de transformation de circuit, méthode de génération de logique inversée et système de conception de logique
US5175862A (en) * 1989-12-29 1992-12-29 Supercomputer Systems Limited Partnership Method and apparatus for a special purpose arithmetic boolean unit
US5524082A (en) * 1991-06-28 1996-06-04 International Business Machines Corporation Redundancy removal using quasi-algebraic methods
US6023566A (en) * 1997-04-14 2000-02-08 Cadence Design Systems Cluster matching for circuit implementation

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3634658A (en) * 1970-03-19 1972-01-11 Sperry Rand Corp Parallel bit counter
US3757098A (en) * 1972-05-12 1973-09-04 Rca Corp Carry generation means for multiple character adder
EP0168650A2 (fr) * 1984-07-16 1986-01-22 International Business Machines Corporation Méthode pour la conception de circuiterie logique
EP0309292A2 (fr) * 1987-09-25 1989-03-29 Matsushita Electric Industrial Co., Ltd. Système et méthode de transformation de circuit, méthode de génération de logique inversée et système de conception de logique
US5175862A (en) * 1989-12-29 1992-12-29 Supercomputer Systems Limited Partnership Method and apparatus for a special purpose arithmetic boolean unit
US5524082A (en) * 1991-06-28 1996-06-04 International Business Machines Corporation Redundancy removal using quasi-algebraic methods
US6023566A (en) * 1997-04-14 2000-02-08 Cadence Design Systems Cluster matching for circuit implementation

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
CHAKRABORTY S ET AL: "Synthesis of symmetric functions for path-delay fault testability", VLSI DESIGN, 1999. PROCEEDINGS. TWELFTH INTERNATIONAL CONFERENCE ON GOA, INDIA 7-10 JAN. 1999, LOS ALAMITOS, CA, USA,IEEE COMPUT. SOC, US, 7 January 1999 (1999-01-07), pages 512 - 517, XP010320035, ISBN: 0-7695-0013-7 *
DEBNATH D ET AL: "MINIMIZATION OF AND-OR-EXOR THREE-LEVEL NETWORKS WITH AND GATE SHARING", IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, INSTITUTE OF ELECTRONICS INFORMATION AND COMM. ENG. TOKYO, JP, vol. E80-D, no. 10, 1 October 1997 (1997-10-01), pages 1001 - 1008, XP000730839, ISSN: 0916-8532 *
DRECHSLER R ET AL: "Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions", EUROPEAN DESIGN AND TEST CONFERENCE, 1995. ED&TC 1995, PROCEEDINGS. PARIS, FRANCE 6-9 MARCH 1995, LOS ALAMITOS, CA, USA,IEEE COMPUT. SOC, US, 6 March 1995 (1995-03-06), pages 91 - 97, XP010148035, ISBN: 0-8186-7039-8 *
DRECHSLER R ET AL: "Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions", IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, JAN. 1997, IEEE, USA, vol. 16, no. 1, pages 1 - 5, XP002217407, ISSN: 0278-0070 *
NIENHAUS H A: "Efficient multiplexer realizations of symmetric functions", IEEE SOUTHEASTCON 1981 CONFERENCE PROCEEDINGS, HUNTSVILLE, AL, USA, 5-8 APRIL 1981, 1981, New York, NY, USA, IEEE, USA, pages 522 - 525, XP010277476 *

Also Published As

Publication number Publication date
JP2004506260A (ja) 2004-02-26
CN1468396A (zh) 2004-01-14
WO2002012995A2 (fr) 2002-02-14
AU2002229155A1 (en) 2002-02-18
EP1307812A2 (fr) 2003-05-07

Similar Documents

Publication Publication Date Title
WO2002077792A3 (fr) Circuit logique de multiplication
WO2001093012A3 (fr) Exponentiation de montgomery acceleree utilisant plusieurs multiplicateurs
WO2002012995A3 (fr) Compteur parallele et circuit logique de multiplication
AU3306099A (en) Multi-level data through a single input/output pin
EP1199802A3 (fr) Module logique universelle et cellule comportant un tel module
Thenmozhi et al. Optimized low power full adder design
WO2004104820A3 (fr) Circuit de generation d'un bit de somme
EP0291963A3 (fr) Additionneur rapide à CMOS
WO2003096180A3 (fr) Circuits de multiplication rapide
WO2006001910A3 (fr) Dispositif memoire avec verrou de blocage de donnees
Lorenzo et al. Optimizing the 12T Hybrid 1-Bit Full Adder Circuit for Low Energy Applications
WO2003021494A3 (fr) Simulation de logique
EP1329803A3 (fr) Additionneur à somme conditionnelle
WO2007029166A3 (fr) Modules additionneurs complet et dispositifs multiplicateurs les utilisant
Chong et al. Low-voltage asynchronous adders for low power and high speed applications
US6981013B1 (en) Low power, minimal area tap multiplier
Lin A Regularly Structured Parallel Multiplier with Low‐power Non‐binary‐logic Counter Circuits
CN100524200C (zh) 一种补码乘法处理方法
WO2004057459A3 (fr) Circuit logique et procede de production de reports et de sommes ainsi que procede de conception d'un circuit logique de ce type
Lin et al. A novel approach for CMOS parallel counter design
TW200518461A (en) Pulse-based flip-flop
JPS59123930A (ja) 桁上げ信号発生器
RU1827671C (ru) Устройство дл сложени по модулю три
Fukuda Signed-digit CMOS (SD-CMOS) logic circuits with dynamic operation
Johan et al. The Design and Implementation of Low Power Digital FIR Filter In 90 nm CMOS Technology

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2002517614

Country of ref document: JP

WWE Wipo information: entry into national phase

Ref document number: 1020037001637

Country of ref document: KR

WWE Wipo information: entry into national phase

Ref document number: 2001984499

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 018169287

Country of ref document: CN

WWP Wipo information: published in national office

Ref document number: 2001984499

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 1020037001637

Country of ref document: KR

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWW Wipo information: withdrawn in national office

Ref document number: 2001984499

Country of ref document: EP