Carry-ripple Patents (Class 708/707)
-
Patent number: 11842999Abstract: A semiconductor device includes a first active region, a second active region, a first gate line disposed to overlap the first and second active regions, a second gate line disposed to overlap the first and second active regions, a first metal line electrically connecting the first and second gate lines and providing a first signal to both the first and second gate lines, a first contact structure electrically connected to part of the first active region between the first and second gate lines, a second contact structure electrically connected to part of the second active region between the first and second gate lines, and a second metal line electrically connected to the first and second contact structures and transmitting a second signal, wherein an overlapped region that is overlapped by the second metal line does not include a break region.Type: GrantFiled: February 8, 2022Date of Patent: December 12, 2023Assignee: Samsung Electronics Co., Ltd.Inventors: Dae Seong Lee, Min Su Kim
-
Patent number: 11581894Abstract: Alternative data selector, a full adder, and a ripple carry adder are disclosed. The alternative data selector includes: a NOR logic circuit configured to receive a selection signal and an inverted first input and generate an intermediate result; and an AND-OR-NOT logic circuit configured to receive the selection signal, a second input, and the intermediate result of the NOR logic circuit and generate an inverted output.Type: GrantFiled: May 24, 2021Date of Patent: February 14, 2023Assignee: SHENZHEN MICROBT ELECTRONICS TECHNOLOGY CO., LTD.Inventors: Zhijun Fan, Weixin Kong, Dong Yu, Zuoxing Yang
-
Patent number: 11366637Abstract: A circuit for use in a processor includes a first processing channel having a first logic unit, a second processing channel having a second logic unit, and multiplexing circuitry. The multiplexing circuitry includes an input multiplexer arranged to switch between a first state in which an input of the first logic unit is coupled to an input line of the first processing channel, and a respective second state in which the input of the first logic unit is instead coupled to an input line of the second processing channel; and an output multiplexer arranged to switch between a first state in which an output line of the second processing channel is coupled to an output of the second logic unit, and a second state in which the output line of the second processing channel is instead coupled to an output of the first logic unit.Type: GrantFiled: June 18, 2021Date of Patent: June 21, 2022Assignee: Imagination Technologies LimitedInventor: Kenneth C. Rovers
-
Patent number: 11302694Abstract: A semiconductor device includes a first active region, a second active region, a first gate line disposed to overlap the first and second active regions, a second gate line disposed to overlap the first and second active regions, a first metal line electrically connecting the first and second gate lines and providing a first signal to both the first and second gate lines, a first contact structure electrically connected to part of the first active region between the first and second gate lines, a second contact structure electrically connected to part of the second active region between the first and second gate lines, and a second metal line electrically connected to the first and second contact structures and transmitting a second signal, wherein an overlapped region that is overlapped by the second metal line does not include a break region.Type: GrantFiled: January 3, 2020Date of Patent: April 12, 2022Assignee: Samsung Electronics Co., Ltd.Inventors: Dae Seong Lee, Min Su Kim
-
Patent number: 10831446Abstract: A memory device that includes a plurality subarrays of memory cells to store static weights and a plurality of digital full-adder circuits between subarrays of memory cells is provided. The digital full-adder circuit in the memory device eliminates the need to move data from a memory device to a processor to perform machine learning calculations. Rows of full-adder circuits are distributed between sub-arrays of memory cells to increase the effective memory bandwidth and reduce the time to perform matrix-vector multiplications in the memory device by performing bit-serial dot-product primitives in the form of accumulating m 1-bit×n-bit multiplications.Type: GrantFiled: September 28, 2018Date of Patent: November 10, 2020Assignee: Intel CorporationInventors: Gregory K. Chen, Raghavan Kumar, Huseyin Ekin Sumbul, Phil Knag, Ram Krishnamurthy, Sasikanth Manipatruni, Amrita Mathuriya, Abhishek Sharma, Ian A. Young
-
Patent number: 10726350Abstract: Ripple-carry and carry look-ahead adders for ternary addition and other operations include circuits that produce carry values or carry status indicators that can be stored on qutrit registers associated with input values to be processed. Inverse carry circuits are situated to reverse operations associated with the production of carry values or carry status indicators, and restored values are summed with corresponding carry values to produce ternary sums.Type: GrantFiled: November 18, 2016Date of Patent: July 28, 2020Assignee: Microsoft Technology Licensing, LLCInventors: Xingshan Cui, Alexei Bocharov, Martin Roetteler, Krysta Svore
-
Patent number: 10553585Abstract: A semiconductor device includes a first active region, a second active region, a first gate line disposed to overlap the first and second active regions, a second gate line disposed to overlap the first and second active regions, a first metal line electrically connecting the first and second gate lines and providing a first signal to both the first and second gate lines, a first contact structure electrically connected to part of the first active region between the first and second gate lines, a second contact structure electrically connected to part of the second active region between the first and second gate lines, and a second metal line electrically connected to the first and second contact structures and transmitting a second signal, wherein an overlapped region that is overlapped by the second metal line does not include a break region.Type: GrantFiled: August 9, 2018Date of Patent: February 4, 2020Assignee: Samsung Electronics Co., Ltd.Inventors: Dae Seong Lee, Min Su Kim
-
Publication number: 20140181165Abstract: A predictive adder produces the result of incrementing and/or decrementing a sum of A and B by a one-bit constant of the form of the form 2k, where k is a bit position at which the sum is to be incremented or decremented. The predictive adder predicts the ripple portion of bits in the potential sum of the first operand A and the second operand B that would be toggled by incrementing or decrementing the sum A+B by the one-bit constant to generate and indication of the ripple portion of bits in the potential sum. The predictive adder uses the indication of the ripple portion of bits in the potential sum and the carry output generated by evaluating A+B to produce the results of at least one of A+B+2k and A+B?2k.Type: ApplicationFiled: February 27, 2014Publication date: June 26, 2014Applicant: Texas Instruments IncorporatedInventors: Timothy D. Anderson, Mujibur Rahman, Kai Chirca
-
Patent number: 8606842Abstract: Provided are N-digit addition and subtraction units and N-digit addition and subtraction modules in which borrowing and carrying are not propagated in modules having basic digits. In the units and modules, an output pattern of results of addition and subtraction is predicted based on a relation between an augend and an addend and a relation between a minuend and a subtrahend, respectively, thereby preventing borrowing and carrying from being propagated in modules having basic digits.Type: GrantFiled: August 21, 2008Date of Patent: December 10, 2013Assignee: Tokyo Denki UniversityInventors: Hiroshi Kasahara, Tsugio Nakamura, Jin Sato
-
Patent number: 8073830Abstract: A system provides a list of search results, where one of the search results in the list of search results includes a snippet from a corresponding search result document. The system receives selection of the snippet and provides an expanded snippet based on the selection of the snippet. The expanded snippet includes the snippet and other text from a subset of the search result document.Type: GrantFiled: March 31, 2006Date of Patent: December 6, 2011Assignee: Google Inc.Inventors: Paul Fontes, Alexis Battle, Corin Anderson
-
Patent number: 7991814Abstract: The invention includes a novel differentiator cell, a novel resample unit cell, and precision synchronization circuitry to ensure proper timing of the circuits and systems at the anticipated ultra-high speed of operation. The novel differentiator cell includes circuitry for combining a carry input signal, a data bit signal and the output signal of a NOT cell and applying the signals as distinct and separate pulses to the input of a toggle flip-flop (TFF) for producing an asynchronous carry output and a clocked data output. The novel differentiator cells can be interconnected to form a multi-bit differentiator circuit using appropriate delay and synchronization circuitry to compensate for delays in producing the carry output of each cell which is applied to a succeeding cell.Type: GrantFiled: August 24, 2007Date of Patent: August 2, 2011Assignee: Hypres, IncInventors: Timur V. Filippov, Oleg A. Mukhanov
-
Patent number: 7716270Abstract: A carry-ripple adder has four summing inputs for receiving four input bits having the significance w that are to be summed, three carry inputs for receiving three input carry bits having the significance w, a summation output for outputting an output summation bit having the significance w, and three carry outputs for outputting three output carry bits having the significance 2w.Type: GrantFiled: March 13, 2006Date of Patent: May 11, 2010Assignee: Infineon Technologies AGInventors: Joel Hatsch, Winfried Kamp
-
Patent number: 7707237Abstract: A macrocell including an adder block with a plurality of bit-slice adders, a bypass path and a control unit adapted to receive a carry of a first neighboring macrocell, and to output a carry by generation within the adder block or by passage of the carry of the first neighboring macrocell through the bypass path to a second neighboring macrocell. The control unit is adapted to signal a validity of the carry output of the macrocell depending on a logical combination of states of the two carry output lines. The control unit is further adapted, depending on a validity signal of the first neighboring macrocell indicating a validity of the carry, to prevent forwarding the carry.Type: GrantFiled: August 1, 2008Date of Patent: April 27, 2010Assignee: Infineon Technologies AGInventor: Thomas Kuenemund
-
Publication number: 20090327388Abstract: In general, in one aspect, the disclosure describes a prefix tree adder. The adder may be used to add two strings of bits or multiply a string of bits by 3. First group carry generate and propagate signals are calculated directly from inputs to the adder using Ling equations and static logic. The previously calculated group carry generate and propagate signals are propagated through the adder to calculate additional group carry generate and propagate signals. A conditional summer receives a plurality of inputs for the bits and calculates multiple sums for the bits. The conditional summer selects an appropriate sum for the bits based on carry signals utilized as control signals. The number of delay stages required to calculate the sum is LOGXN+1, wherein N is number of bits in the adder and X is number of bits in a group.Type: ApplicationFiled: June 25, 2008Publication date: December 31, 2009Inventors: Ruby Antony, Brian Werst
-
Publication number: 20090265411Abstract: Apparatus, systems, and methods send an interrogation command from an interrogation and timing apparatus to a timed identification (TID) apparatus. The TID apparatus receives the interrogation command, performs a series of logical operations to calculate a response, and returns the response within a maximum length of time established by the interrogation and timing apparatus. The interrogation and timing apparatus confirms that the length of time between sending the interrogation command and receiving the response is within the maximum length of time and that the response is correct. If so, the TID apparatus is authenticated. Additional embodiments are disclosed and claimed.Type: ApplicationFiled: April 17, 2008Publication date: October 22, 2009Applicant: Atmel CorporationInventor: Kerry Maletsky
-
Patent number: 7191205Abstract: A function block allows a multiplier and a multi-input multiplexer to be realized with a small number of blocks. A logical function generator generates a logical output signal from first to fourth logical inputs thereof according to a logical function selected from a plurality of 4-input/1-output logical functions depending on configuration data. A 4-2 carry block generates a 4-2 carry output from the second to fourth logical inputs. A first signal is generated from at least the logical output, a second signal from at least the first logical input, a third signal from at least a 4-2 carry input signal, and a fourth signal from at least the 4-2 carry input signal. A multiplexer selects one of the second and third signals depending on the first signal to produce a carry output signal. An exclusive OR circuit produce an exclusive-ORed result from the logical output and the fourth signal.Type: GrantFiled: October 18, 2004Date of Patent: March 13, 2007Assignee: NEC CorporationInventor: Shogo Nakaya
-
Patent number: 7058678Abstract: An apparatus and method for performing fast arithmetic operations, including addition, in a pipelined circuit is described. The apparatus and method operating on a first binary number and a second binary number comprise: a first arithmetic logic unit (ALU) operating on a first lower portion of the first binary number and a second lower portion of the second binary number to produce a first result and a carry out signal; and a second ALU operating on a first upper portion of the first binary number and a second upper portion of the second binary number to produce a second result; wherein at least a portion of the pipelined circuit stalls in response to the carry out signal. Another embodiment includes memory comprising a plurality of words, each word comprising data bits and a flag bit indicating a predetermined number of the most significant data bits are all zero.Type: GrantFiled: January 2, 2002Date of Patent: June 6, 2006Assignee: International Business Machines CorporationInventor: David Arnold Luick
-
Patent number: 6990509Abstract: An ultra low power adder with sum synchronization which provides a power reduction method in the binary carry propagate adders by using a carry skip technique. The invention eliminates glitches at the adder outputs by preventing signal transitions at the sum outputs until the corresponding carry signals have reached their final values, which is achieved by adding a synchronization circuitry to the sum calculation path.Type: GrantFiled: March 8, 2002Date of Patent: January 24, 2006Assignee: International Business Machines CorporationInventors: Erdem Hokenek, Eko Lisuwandi, David Meltzer, Mayan Moudgill, Victor V. Zyuban
-
Patent number: 6989843Abstract: A sample-to-pixel calculation unit in a graphics system may comprise an adder tree. The adder tree includes a plurality of adder cells coupled in a tree configuration. Input values are presented to a first layer of adder cells. Each input value may have two associated control signals: a data valid signal and a winner-take-all signal. The final output of the adder tree equals (a) a sum of those input values whose data valid signals are asserted provided that none of the winner-take-all signals are asserted, or (b) a selected one of the input values if one of the winner-take-all bits is asserted. The selected input value is the one whose winner-take-all bit is set. The adder tree may be used to perform sums of weighted sample attributes and/or sums of coefficients values as part of pixel value computations.Type: GrantFiled: June 28, 2001Date of Patent: January 24, 2006Assignee: Sun Microsystems, Inc.Inventors: N. David Naegle, Scott R. Nelson
-
Patent number: 6990508Abstract: A programmable logic block in an integrated circuit comprising a plurality of macrocells, an AND-array, an OR-array, and a logic circuit. The plurality of macrocells may comprise logic that may be configured to (i) generate and propagate an inverted carry-input signal and (ii) generate a sum bit. The AND-array may comprise at least two product terms per macrocell. The OR-array may be configured to generate a sum-of-products term for each macrocell in response to the two product terms. The logic circuit may be configured to (a) receive (i) the product terms and (ii) the carry-input signal generated by a first macrocell of the plurality of macrocells and (b) generate (i) a block carry-propagate signal, (ii) a block carry-generate signal, and (iii) a block carry-output signal.Type: GrantFiled: September 11, 2001Date of Patent: January 24, 2006Assignee: Cypress Semiconductor Corp.Inventors: Haneef D. Mohammed, Rochan Sankar
-
Patent number: 6915323Abstract: A programmable logic device includes a plurality of logic blocks. Each logic block includes a plurality of macrocells, with each macrocell being configurable to register a sum of product term output. In addition, the macrocells within each logic block are arranged from a first macrocell to a last macrocell. Each macrocell is associated with a carry-in and a carry-out signal. The macrocells are configured to support a carry cascade such that the carry-out signal from the first macrocell becomes the carry-in signal for the second macrocell, and so on.Type: GrantFiled: February 13, 2003Date of Patent: July 5, 2005Assignee: Lattice Semiconductor CorporationInventors: Jason Chang, Satwant Singh, Ju Shen
-
Publication number: 20030172102Abstract: An ultra low power adder with sum synchronization which provides a power reduction method in the binary carry propagate adders by using a carry skip technique. The invention eliminates glitches at the adder outputs by preventing signal transitions at the sum outputs until the corresponding carry signals have reached their final values, which is achieved by adding a synchronization circuitry to the sum calculation path.Type: ApplicationFiled: March 8, 2002Publication date: September 11, 2003Applicant: International Business Machines CorporationInventors: Erdem Hokenek, Eko Lisuwandi, David Meltzer, Mayan Moudgill, Victor V. Zyuban
-
Patent number: 6505226Abstract: A parallel adder of the present invention operates at high speed and is reduced in size. The parallel adder outputs a carry signal from an inverter and a NAND-gate/NOR-gate to more rapidly generate the carry signal and selects a pass transistor after being passed through the NAND-gate/NOR-gate to reduce a layout surface. The parallel adder includes first and second full adders, each having a logic combination unit, a buffer, a carry output unit, an output controller unit and a sum output unit. The logic combination unit performs logical operations between input signals to generate a first control signal. The buffer inverts a carry input signal in accordance with the control of the logic combination unit, and the carry output unit generates a carry signal in accordance with the control of the logic combination unit to output the output signal from the buffer as a carry signal. The output controller logically combines the output signal from the logic combination unit and generates a second control signal.Type: GrantFiled: September 2, 1997Date of Patent: January 7, 2003Assignee: Hyundai Electronics Industries Co., Ltd.Inventor: Young-Jun Ahn
-
Publication number: 20020147756Abstract: A carry ripple adder contains five first inputs for accepting five input bits having equal significance w that are to be summed and two second inputs for accepting two carry bits having the significance w. It also contains an output for a sum bit having the significance w and two outputs for two carry bits having the significances 2w and 4w.Type: ApplicationFiled: April 5, 2002Publication date: October 10, 2002Inventors: Joel Hatsch, Winfried Kamp, Siegmar Koppe, Ronald Kunemund, Eva Lackerschmid, Heinz Soldner
-
Patent number: 6446107Abstract: Circuitry for adding a first binary number (A) having a plurality of bits (a0, a1, . . . ) to a second binary number (B) having a plurality of bits (b0, b1, . . . ) to produce a third binary number (A+B) having a plurality of bits (s0, s1, . . . ) and/or a fourth binary number (A+B+1) having a plurality of bits (s0′, s1′, . . . ) and corresponding to the addition of the third binary number and one.Type: GrantFiled: June 18, 1999Date of Patent: September 3, 2002Assignee: STMicroelectronics LimitedInventor: Simon Knowles
-
Patent number: 6438571Abstract: An adder circuit can perform of two integers respective consisted of n=k m bits at high speed with a smaller scale circuit than that of an adder circuit employing a carry look ahead circuit. The adder circuit includes m in number of k-bit adding circuits connected in serial connection in such a manner that an carry output in a preceding digit is supplied to a carry input in a following digit, m in number of carry propagation alarm circuits provided corresponding to respective of m in number of k-bit adding means, for outputting carry propagation alarm signal only when carry input of corresponding adding means is propagated to a carry output, and OR circuit for performing OR for performing OR operation of the m in number of carry propagation alarm signals for generating a carry alarm signal, for leading a fixed result of addition from a final digit of the adding means in serial connection after extinction of generation of the carry alarm signal.Type: GrantFiled: October 28, 1999Date of Patent: August 20, 2002Assignee: NEC CorporationInventors: Michio Shimada, Sachio Nakaigawa
-
Patent number: 6330581Abstract: The present invention provides an apparatus and a method for address generation. In one embodiment, an apparatus for an address generation unit of an ALU (Arithmetic Logic Unit) of a microprocessor includes a first carry-propagate adder that adds a lower 16 bits of a constant or displacement and a lower 16 bits of a segment base, and a second carry-propagate adder connected to the first carry-propagate adder, wherein the second carry-propagate adder adds a lower 16 bits of a base and an output of the first 16-bit carry-propagate adder to generate a lower 16 bits of an address. In one embodiment, the first carry-propagate adder and the second carry-propagate adder are each 16-bit carry-propagate adders.Type: GrantFiled: September 8, 1998Date of Patent: December 11, 2001Assignee: ATI International SRLInventor: Stephen C. Hale
-
Patent number: 6199090Abstract: A double incrementing adder includes an AND gate configured to receive bits of the two input values of a common weight (“first weight”). The AND gate has an output terminal configured to carry the AND'ed bit. A three input XOR gate is configured to receive bits of the two input values of a common weight (“second weight”) one bit more significant than the first weight. The three input XOR gate is configured to XOR these values with the AND'ed bit to generate a three input XOR'ed bit.Type: GrantFiled: June 19, 1998Date of Patent: March 6, 2001Assignee: ATI International SRLInventors: Sanjay Mansingh, Stephen Clark Purcell
-
Patent number: 6188240Abstract: A programmable function block comprises a core logic circuit having a first argument input group consisting of first through fourth argument input terminals, a second argument input group consisting of first through fourth argument input terminals, first through third configuration input terminals, a core logic carry output terminal, a core logic carry generation output terminal, a core logic carry propagation output terminal, a ripple-core logic carry input terminal, and a sum output terminal. Connected to interconnection wires and the first and the second argument input groups, an input block includes eighth input selection units for selecting, as eight input selected signals, eight ones of signals on the interconnection wires, a fixed logic value of “1”, and a fixed logic value of “0”. Connected to the first through the third configuration input terminals, respectively, first through third memory circuits stores, as first through third stored logic values, a logic value of one bit.Type: GrantFiled: June 4, 1999Date of Patent: February 13, 2001Assignees: NEC Corporation, Real World Computing PartnershipInventor: Shogo Nakaya
-
Patent number: 6119141Abstract: The function selection signal of an ALU is resistively decoupled or serially coupled to the input multiplexers of the ALU. By producing delayed function selection signals and decoupling the delayed function signals from the input multiplexers, the input multiplexers are serially activated. This need not impact the overall speed of the ALUs, since the adders are also serially activated by virtue of the carry signal ripple. However, by resistively decoupling the function selection signal from the input multiplexers, the load seen by the input driver that drives the function selection signal inputs of the multiplexer may be reduced, thereby allowing the least significant bit input multiplexer to be activated more rapidly. Moreover, resistive decoupling may be implemented by polysilicon resistors, thereby allowing metal interconnect layers in the integrated circuit to be used for other purposes.Type: GrantFiled: May 6, 1998Date of Patent: September 12, 2000Assignee: Integrated Device Technology, Inc.Inventors: Yew Keong Chong, Prashant Shamarao
-
Patent number: 5978826Abstract: An integrated circuit including an adder that is a series of one-bit cascaded adder cells. The circuits that implement the adder cells are not all alike. The adder cells are of two types: an even adder cell and an odd adder cell. The even adder cells receive all inputs as noninverted inputs, provide as outputs a noninverted sum bit output and the inverse of the carry-out bit. The odd adder cells receive as inputs the inverse of the carry-in bit, all other inputs are noninverted, and provides as outputs a noninverted sum bit and a noninverted carry-out bit.Type: GrantFiled: November 26, 1996Date of Patent: November 2, 1999Assignee: Lucent Techologies Inc.Inventor: Ravi Kumar Kolagotla