EP1593035A2 - Carry-ripple addierer - Google Patents
Carry-ripple addiererInfo
- Publication number
- EP1593035A2 EP1593035A2 EP04706161A EP04706161A EP1593035A2 EP 1593035 A2 EP1593035 A2 EP 1593035A2 EP 04706161 A EP04706161 A EP 04706161A EP 04706161 A EP04706161 A EP 04706161A EP 1593035 A2 EP1593035 A2 EP 1593035A2
- Authority
- EP
- European Patent Office
- Prior art keywords
- carry
- adder
- node
- ripple
- ripple adder
- 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.)
- Withdrawn
Links
- 241001442055 Vipera berus Species 0.000 claims description 78
- 238000011161 development Methods 0.000 description 9
- 230000018109 developmental process Effects 0.000 description 9
- 230000005669 field effect Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 7
- 230000000295 complement effect Effects 0.000 description 5
- 239000000969 carrier Substances 0.000 description 3
- 238000013459 approach Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 239000000758 substrate Substances 0.000 description 2
- 238000013519 translation Methods 0.000 description 2
- 238000011144 upstream manufacturing Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
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/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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F2207/38—Indexing scheme relating to groups G06F7/38 - G06F7/575
- G06F2207/3804—Details
- G06F2207/386—Special constructional features
- G06F2207/3872—Precharge of output to prevent leakage
-
- 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/50—Adding; Subtracting
- G06F7/505—Adding; Subtracting in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination
- G06F7/509—Adding; Subtracting in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination for multiple operands, e.g. digital integrators
-
- 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/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
Definitions
- the present invention relates to a carry-ripple adder, and in particular a "3 2 to 3 carry ripple Addie ⁇ rer".
- Carry-ripple adders are known as adders with sequential carry logic. Similar to a carry-save adder, they have several inputs of the same value and sum up the bits applied to these inputs during operation. The sum of the bits is output at outputs of different values, for example in binary coded digits (BCD).
- BCD binary coded digits
- a fast addition chain (carry ripple adder) is known from the translation of the European patent specification DE 692 06 604, which is provided for adding together a plurality of N digital words from n bits, N being a natural number greater than 2, comprising a plurality of cascaded addition blocks with a header that receives the first two digital words and an end block that forms the sum of all the words.
- a combination of a full adder with two input words each comprising 2 bits and a carry from a previous sum, for example the carry from a previous stage, is also known from this.
- a "4 and 1 to 3" carry ripple adder is thus disclosed in this translation of the European patent.
- the idea on which the present invention is based essentially consists in generating two carry or carry bits of equal value in a carry-ripple adder, which is fed directly into the next stage of a multi-stage carry-ripple adder and evaluated there.
- the problem mentioned at the outset is solved in particular by providing a carry-ripple adder with: three first inputs for feeding three input bits of equal value 2 n to be summed; two second inputs for feeding two carry / carry bits of the same value 2 n , which are also to be summed; an output for outputting a calculated sum bit of significance 2 n ; and two outputs for outputting two calculated carry / carry bits of the same significance 2 n + 1 , which is higher than the significance 2 n of the sum bit.
- a carry-ripple adder according to the present invention thus already allows a final carry-ripple stage VMA (vector merging adder) to be used from a reduction to three bits.
- VMA vector merging adder
- a carry save stage can be saved, which has an advantageous effect on the processing speed and in the substrate area of the overall circuit, or the third input bit of each carry-ripple adder can be used for the efficient implementation of accumulators, e.g. in MAC structures.
- a dynamic implementation of the carry or carry paths and their logical implementation within the carry-ripple adder enables, as follows in an execution for example explained in more detail, an additional optimization bezüg ⁇ Lich the surface and the speed compared to the complementary or differential CMOS solutions. Due to the simultaneous generation of two carriers or carry bits of the same value, which are evaluated in each stage of the carry-ripple adder, the circuitry and internal wiring are less than with multi-stage complementary CMOS solutions, for example composed of 3-bit carry -Save adders and 2 bit carry-ripple adders are. This also applies to dynamic carry-ripple adders with three inputs.
- the carry-ripple adder according to the invention provides an area and loss power-optimized adder, which is used in particular as a final adder in multipliers, adder trees, filter structures, accumulators and arithmetic units can be used.
- the carry-ripple adder has at least one precharge input for controlling an integrated precharge logic stage.
- the carry-ripple adder has a carry stage and a summation stage.
- the carry stage has two carry addition blocks, by means of which the carry output signals can be calculated independently of one another and in parallel in time.
- at least one carry addition block has an n-channel FET between a node and a node, which is connected on the gate side to the carry input ci2, and a series connection of two n between the node and a reference potential Channel FETS is located, one being connected on the gate side to il and the other being connected to i2, and parallel to this is a parallel connection of two n-channel FETS between the node and another node, one being connected to il on the gate side, the second gate is connected to 12 and both drains are brought together in the further node, which can be connected to the reference potential via an n-channel FET to which gate can be applied.
- At least one carry addition block has an n-channel FET connected on the gate side to the carry input ci2 between a node and the reference potential, the node preferably being connected to a precharge input via a gate side -
- a p-channel FET can be supplied with a supply voltage.
- the summation level has a 5-fold XOR combination.
- a bit addition device consists of a parallel connection of a plurality of carry ripple adders, 3 input bits of equal value 2 n being provided for each carry ripple adder.
- the carry-ripple adder is provided as a final adder in a multiplier, adder tree, accumulator, a filter structure or an arithmetic unit.
- Fig. 1 is a schematic representation of a "3 & 2 to 3
- Figure 2 is a truth table for a "3 & 2 to 3 carry ripple adder"
- FIG. 3 shows a schematic illustration of the internal structure of a “3 & 2 to 3 carry-ripple adder” to explain an embodiment of the present invention
- FIG. 5 shows a schematic illustration of a carry stage of a carry-ripple adder to explain a
- Fig. 6 is a schematic diagram of a block of
- FIG. 7 shows a schematic circuit diagram of the second block of the carry stage according to FIG. 5 to explain an embodiment of the present invention
- FIG. 8 shows a schematic illustration of a sum block of a carry-ripple adder to explain an embodiment of the present invention
- FIG. 9 is a schematic circuit diagram of a 5-fold XOR stage of the sum block to explain an embodiment of the present invention.
- FIG. 10 shows a schematic block diagram to explain a known carry-ripple adder.
- FIG. 1 shows a schematic representation of a “3 & 2 to 3 carry ripple adder” 10, which has three bit inputs 10, il and 12 and two equivalent carry inputs rap, ci2 and carry outputs col, co2 and a sum output s.
- the optionally supplied signals prech_l and prechq_l preferably control an integrated precharge logic stage if a dynamic implementation is provided.
- the three input bits 10, il, i2 and the two carry input bits eil and ci2 are each supplied to both blocks 11 and 12, as is a supply voltage vdd and a reference potential vss.
- the carry outputs col and co2 are operated via the carry block 11.
- the precharge signals prech_l and prechq_l are applied to two complementary inputs of the carry block 11.
- the summation block 12 has the sum output s and, in a dynamic implementation, is only supplied with the precharge signal prechq_l at an inverting input.
- the nth stage adds two carry- to the three input bits i0 ⁇ n>, il ⁇ n> and i2 ⁇ n> with the value 2 n
- Input signals cil ⁇ n> and ci2 ⁇ n> which also have the value 2 n , and generate a sum signal s__n of the same value 2 n and two carry output signals col ⁇ n + l>, co2 ⁇ n + l> der next higher significance 2 n + 1 , which correspond to the carry input signals cil ⁇ n + l>, ci2 ⁇ n + l> of the n + l-th stage, n in the present example according to FIG. 4 being an integer between 0 and 4 is included.
- FIG. 4 being an integer between 0 and 4 is included.
- FIG. 5 schematically shows a carry stage 11 of a carry ripple adder according to FIG. 3 and / or FIG. 4.
- the carry stage 11 has two blocks 13 and 14, which each calculate a carry output signal co2 and col independently of one another and thus in parallel in time.
- Both the block 13 for calculating the carry output signal co2 and the block 14 for calculating the carry output signal col are connected to the inputs iO, il, 12, eil and ci2 of the supply voltage vdd and the reference potential vss.
- both blocks 13 and 14 are preferably connected to the precharge signals prech and prechq, which are supplied inverted to one another.
- FIG. 6 shows a schematic circuit diagram of a dynamic implementation of the block 13 according to FIG. 5 for generating the carry output signal co2 as a function of the signals at the three bit inputs iO, il, i2, the two carry inputs eil and ci2 and also Precharge signals prech and prechq.
- a p-channel field effect transistor P is connected between the supply voltage vdd and a node 17 and is controlled on the gate side by the precharge signal prechq. Between the node 17 and a node 18, an n-channel FET on the N gate side is connected to the carry input in a rapid manner.
- the node 18 can be connected to the supply voltage vdd via an n-FET N, which is controlled on the gate side with the precharge signal prech. Between the node 18 and the reference potential vss there is a series connection of three n-channel FETS N, one of which is connected to iO on the gate side, the next on i gate side and the third i2 side on the gate side.
- An n-channel FET is connected between the node 17 and a node 19 and is connected on the gate side to the carry input ci2.
- Between the node 19 and the reference potential vss is a series connection of two n-channel FETS N, one of which is connected on the gate side with il and the other with 12 is bound.
- the node 19 can be connected to the supply voltage vdd via an n-channel FET, to which the precharge signal prech can be applied at its gate.
- the precharge signal prech can be applied at its gate.
- the supply voltage vdd and the reference potential vss there is also a series connection of a p- and an n-channel FET P, N in a further parallel line, the p-channel FET P being connected on the gate side to the node 17, and the precharge signal prech can be applied to the n-channel FET N gate.
- the carry output co2 is tapped between the p-channel field effect transistor P and the n-channel FET N.
- FIG. 7 embodies a schematic circuit for the dynamic implementation of the block 14 according to FIG. 5.
- a p-channel FET P is connected between a supply voltage vdd and a circuit node 21 and is supplied with the precharge signal prechq at its gate. Between the node 21 and a reference potential vss, a series connection of two n-channel FETS N is provided, one of which carries the carry input hurriedly on the gate side and 12 on the second gate side.
- node 21 and node 22 there is a parallel connection of two n-channel FETS N, one of which is connected to i2 on the gate side, the other is quickly connected to the carry input, and node 22 is in turn connected a parallel connection of two n-channel FETS N can be connected to the reference potential vss as a function of the OK or IL applied to the gate.
- the circuit according to FIG. 7 also has the option of prech using the circuit node 22 via an n-channel FET N as a function of the precharge signal to connect the supply voltage vdd.
- a series connection of two n-channel FETs N is provided as further parallel strands between the circuit node 21 and the reference potential vss, one of which is acted upon with il on the gate side and OK with the other on the gate side.
- FIG. 8 shows a schematic illustration of the sum block 12 according to FIG. 3 and / or FIG. 4.
- FIG. 8 (left part) shows a possible implementation of the input stage.
- a supply voltage vdd and a reference potential vss there is a series connection of a p-channel field effect transistor P and an n-channel field effect transistor N
- the p-channel field effect transistor P on the gate side with the precharge signal prechq and the n -Channel field effect transistor on the N gate side can be acted upon quickly with the signal at the carry input.
- the circuit node 23 at which the signal ilq is tapped.
- the signal ilq at node 23 is converted into a signal il via an inverter I, which is connected both to the reference potential vss and to the supply voltage vdd.
- an inverter I For each input signal eil, ci2 and xl, which corresponds to 10, x2, which corresponds to il, and x3, which corresponds to i2 (see FIG. 4), an identical input stage is provided.
- Signals i2q and i2 are generated from carry input ci2, signals i3 and i3q from input signal xl, signals i4 and i4q from input signal x2, and signals i5 and i5q for the sum block are generated from input signal x3 , Fig. 8 (right part).
- FIG. 8 shows a schematic representation of the total block, with a re-sorting also being carried out here, since i3 according to FIG. 8 (left part) becomes xl, i3q becomes xlq, i4 becomes x2, i4q becomes x2q, i5 becomes x3, i5q becomes x3q, i2 becomes x4, i2q becomes x4q, il becomes x5, and ilq becomes x5q.
- the summation device according to FIG. 8 (right part) has a precharge access with the signal prechq, an enable input EN, the signal prechq also at the
- Enable input EN is present, a sum output s and a connection to the reference potential vss and the supply voltage vdd.
- the input stage according to FIG. 8 (left part) is used to synchronize the summation stage with dynamic circuit parts of the overall circuit.
- FIG. 9 shows a schematic circuit diagram of an exemplary 5-fold XOR combination as a sum block according to FIG. 8.
- the two time-critical carrier signals are urgent, which are converted into il or ilq and thus x5 and x5q (see FIG. 8), and the carry input signal ci2, which is i2 or i2q and thus x4 or x4q is converted to the n-channel field effect transistors N closest to the output Z or ZQ of the XOR circuit.
- the 5-fold XOR stage 15 according to FIG. 9 is connected upstream
- the 24 can be connected to the supply voltage vdd as a function of the precharge signal prechq and can also be connected to the reference potential vss via an enable signal EN at the gate of an n-channel field effect transistor N.
- This enable signal EN is supplied via the enable input according to FIG. 8 (right part).
- circuit principle of the carry path which is based on the calculation and forwarding of two carriers of the same value, can also be used for two carry signals that are interchangeable.
- the blocks that are used to generate the two carry signals are not necessarily independent of one another. In the case of an implementation with complementary CMOS gates, it is possible to use subblocks together. However, separation is advantageous for a high-performance application.
- n-channel transistors N which are located in the evaluation part of the carry gates (see FIGS. 6 and 7) and at whose gate the precharge signal prech is present, are for a basic implementation of the logic function not mandatory. They only reduce the charge sharing or charge sharing problem, which can occur depending on the technology and layout implementation. These are therefore only optional, can also be designed as p-channel FETS with inverted control and represent an advantageous optimization. Finally, in principle, any static or dynamic 5-fold XOR gate can be used.
- prechq precharge / precharge inputs prech__l prechq_l precharge / precharge inputs vdd supply voltage vss reference potential
- carry-ripple adder / bit summation device 11 carry stage (carry summation)
- Bl, B2, B2 carry-ripple adders according to the St.D.T with unequal values of the output carry bits P, N p-channel FET, n-channel FET and enable signal
Landscapes
- Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Mathematical Optimization (AREA)
- Mathematical Analysis (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Pure & Applied Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Computational Mathematics (AREA)
- Logic Circuits (AREA)
- Analogue/Digital Conversion (AREA)
Abstract
Description
Claims
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE10305849 | 2003-02-12 | ||
DE10305849A DE10305849B3 (de) | 2003-02-12 | 2003-02-12 | Carry-Ripple Addierer |
PCT/EP2004/000796 WO2004073171A2 (de) | 2003-02-12 | 2004-01-29 | Carry-ripple addierer |
Publications (1)
Publication Number | Publication Date |
---|---|
EP1593035A2 true EP1593035A2 (de) | 2005-11-09 |
Family
ID=32520140
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP04706161A Withdrawn EP1593035A2 (de) | 2003-02-12 | 2004-01-29 | Carry-ripple addierer |
Country Status (6)
Country | Link |
---|---|
US (1) | US20060294178A1 (de) |
EP (1) | EP1593035A2 (de) |
JP (1) | JP4157141B2 (de) |
CN (1) | CN100541417C (de) |
DE (1) | DE10305849B3 (de) |
WO (1) | WO2004073171A2 (de) |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE102005011666B3 (de) * | 2005-03-14 | 2006-06-29 | Infineon Technologies Ag | Carry-Ripple-Addierer |
RU2469381C1 (ru) * | 2011-11-08 | 2012-12-10 | Общество с ограниченной ответственностью "СибИС" | Сумматор |
CN103345378B (zh) * | 2013-07-03 | 2016-08-24 | 刘杰 | 三加数二进制并行同步加法器 |
US10073677B2 (en) * | 2015-06-16 | 2018-09-11 | Microsoft Technology Licensing, Llc | Mixed-radix carry-lookahead adder architecture |
CN109154944A (zh) * | 2016-04-29 | 2019-01-04 | 微软技术许可有限责任公司 | 集合预测器 |
US10402165B2 (en) * | 2017-08-30 | 2019-09-03 | Gsi Technology Inc. | Concurrent multi-bit adder |
CN110597485B (zh) * | 2019-09-10 | 2022-04-22 | 北京嘉楠捷思信息技术有限公司 | 模块化多位加法器及计算*** |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5805491A (en) * | 1997-07-11 | 1998-09-08 | International Business Machines Corporation | Fast 4-2 carry save adder using multiplexer logic |
US20020070781A1 (en) * | 2000-12-08 | 2002-06-13 | Intel Corporation | Pipelined compressor circuit |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3535502A (en) * | 1967-11-15 | 1970-10-20 | Ibm | Multiple input binary adder |
EP0571694B1 (de) * | 1992-05-27 | 1995-12-06 | STMicroelectronics S.r.l. | Schnelle Addierkette |
US5493524A (en) * | 1993-11-30 | 1996-02-20 | Texas Instruments Incorporated | Three input arithmetic logic unit employing carry propagate logic |
DE19521089C1 (de) * | 1995-06-09 | 1996-08-08 | Siemens Ag | Schaltungsanordnung zur Realisierung von durch Schwellenwertgleichungen darstellbaren Logikelementen |
US6065033A (en) * | 1997-02-28 | 2000-05-16 | Digital Equipment Corporation | Wallace-tree multipliers using half and full adders |
US6345286B1 (en) * | 1998-10-30 | 2002-02-05 | International Business Machines Corporation | 6-to-3 carry-save adder |
US6515534B2 (en) * | 1999-12-30 | 2003-02-04 | Intel Corporation | Enhanced conductivity body biased PMOS driver |
US6584485B1 (en) * | 2000-04-14 | 2003-06-24 | International Business Machines Corporation | 4 to 2 adder |
US7085796B1 (en) * | 2000-06-08 | 2006-08-01 | International Business Machines Corporation | Dynamic adder with reduced logic |
DE60031109D1 (de) * | 2000-08-01 | 2006-11-16 | St Microelectronics Sa | Übertragsicherstellungsaddierer |
DE10117041C1 (de) * | 2001-04-05 | 2002-07-25 | Infineon Technologies Ag | Carry-Ripple Addierer |
DE10139099C2 (de) * | 2001-08-09 | 2003-06-18 | Infineon Technologies Ag | Carry-Ripple Addierer |
-
2003
- 2003-02-12 DE DE10305849A patent/DE10305849B3/de not_active Expired - Fee Related
-
2004
- 2004-01-29 EP EP04706161A patent/EP1593035A2/de not_active Withdrawn
- 2004-01-29 WO PCT/EP2004/000796 patent/WO2004073171A2/de not_active Application Discontinuation
- 2004-01-29 CN CNB2004800035787A patent/CN100541417C/zh not_active Expired - Fee Related
- 2004-01-29 JP JP2006500019A patent/JP4157141B2/ja not_active Expired - Fee Related
-
2005
- 2005-08-12 US US11/203,445 patent/US20060294178A1/en not_active Abandoned
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5805491A (en) * | 1997-07-11 | 1998-09-08 | International Business Machines Corporation | Fast 4-2 carry save adder using multiplexer logic |
US20020070781A1 (en) * | 2000-12-08 | 2002-06-13 | Intel Corporation | Pipelined compressor circuit |
Also Published As
Publication number | Publication date |
---|---|
WO2004073171A2 (de) | 2004-08-26 |
DE10305849B3 (de) | 2004-07-15 |
CN100541417C (zh) | 2009-09-16 |
US20060294178A1 (en) | 2006-12-28 |
JP2006517700A (ja) | 2006-07-27 |
CN1748200A (zh) | 2006-03-15 |
WO2004073171A3 (de) | 2005-03-10 |
JP4157141B2 (ja) | 2008-09-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0123921B1 (de) | Parallelverknüpfungsschaltung mit verkürztem Übertragsdurchlauf | |
DE3901995C2 (de) | ||
DE2707451C2 (de) | Paralleladdierwerk mit durchlaufendem Übertrag zum Addieren von wenigstens zwei aus mehreren Bits bestehenden Summanden | |
DE4101004A1 (de) | Paralleler multiplizierer mit sprungfeld und modifiziertem wallac-baum | |
DE3940897C2 (de) | Schaltungsanordnung und Verfahren zur Berechnung digitaler Summen in einem Halbleiteraddierer mit Parallelübertrag | |
DE1549508C3 (de) | Anordnung zur Übertragsberechnung mit kurzer Signallaufzeit | |
DE10305849B3 (de) | Carry-Ripple Addierer | |
DE2758130A1 (de) | Binaerer und dezimaler hochgeschwindigkeitsaddierer | |
EP0352549B1 (de) | Carry-select-Addierer | |
EP0257362A1 (de) | Addierer | |
DE10244738B3 (de) | Vorrichtung und Verfahren zum Umsetzen und Addierer | |
DE69726248T2 (de) | Addierer mit bedingter Summe unter Benutzung von Durchlasstransistor-Logik | |
EP0130397B1 (de) | Digitales Rechenwerk | |
DE2742035A1 (de) | Rechnersystem | |
EP0224656B1 (de) | Mehrstelliger Carry-Ripple-Addierer in CMOS-Technik mit zwei Typen von Addiererzellen | |
DE10117041C1 (de) | Carry-Ripple Addierer | |
EP0453600B1 (de) | Paralleladdierwerk | |
DE10324049B4 (de) | Integrierte Schaltung und Verfahren zum Betreiben der integrierten Schaltung | |
DE1241159B (de) | UEbertragschaltung fuer ein Schnelladdierwerk | |
DE2017132B2 (de) | Binärer Parallel-Addierer | |
DE2913729C2 (de) | Schaltungsanordnung zur bitparallelen Binäraddition oder zum Shiften von Binärzahlen | |
DE10206830B4 (de) | Verfahren und Anordnung zur Zusammenführung von Daten aus parallelen Datenpfaden | |
DE19630435C1 (de) | Schaltungsanordnung zur Multiplikation einer ersten komplexen Eingangsgröße mit einer zweiten komplexen Eingangsgröße | |
DE10130484B4 (de) | 7-zu-3 Bit Carry-Save Addierer und Addierer damit | |
DE10347077B4 (de) | Multibit-Bit-Addierer |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20050721 |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR |
|
AX | Request for extension of the european patent |
Extension state: AL LT LV MK |
|
DAX | Request for extension of the european patent (deleted) | ||
RBV | Designated contracting states (corrected) |
Designated state(s): DE FR GB |
|
17Q | First examination report despatched |
Effective date: 20051128 |
|
17Q | First examination report despatched |
Effective date: 20051128 |
|
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: KOEPPE, SIEGMAR Inventor name: KAMP, WINFRIED Inventor name: HATSCH, JOEL Inventor name: BERNHARDT, MARC |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: G06F 7/509 20060101AFI20070725BHEP |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20080110 |