Patents by Inventor Ravi Kumar Kolagotla
Ravi Kumar Kolagotla has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 6529931Abstract: An n-bit prefix tree adder includes n prefix trees, each associated with a bit position of the adder and including a number of computation stages. In accordance with an illustrative embodiment of the invention, the prefix trees are interconnected such that carry signals are computed at least partially in parallel. For example, a carry signal computed in an initial stage of a given prefix tree is used in subsequent stages of the given prefix tree without introducing substantial additional delay in computation of other carry signals in other prefix trees associated with higher bit positions. Carries computed for lower bit positions are thus used to compute carries for higher bit positions, but generate, propagate and/or transmit signals may be generated in an initial stage of each of the prefix trees without utilizing a primary carry input signal in the computation. The resulting adder architecture provides reduced logic depth, delay and circuit area relative to conventional architectures.Type: GrantFiled: April 14, 1999Date of Patent: March 4, 2003Assignee: Agere Systems Inc.Inventors: Matthew Besz, Alexander Goldovsky, Ravi Kumar Kolagotla, Christopher John Nicol
-
Patent number: 6182105Abstract: A first adder-subtracter combines the first input with the largest positive number capable of being represented by the number of bits in the datapath. A second adder-subtracter operating in parallel with the first adder-subtracter combines the first input with the largest negative number capable of being represented by the number of bits in the datapath. A third adder-subtracter combines the first, second, and third inputs and operates in parallel with the first and second adder-subtracters. A carry/sign detector circuit operating in parallel with all three adder-subtracters determines the sign and the carry of the sum of the second and third inputs.Type: GrantFiled: August 27, 1998Date of Patent: January 30, 2001Assignee: Lucent Technologies Inc.Inventors: Ravi Kumar Kolagotla, Hosahalli R. Srinivas
-
Patent number: 6173304Abstract: A multiplier contains an array of partial product generators, at least one new modified-Booth encoder. Corresponding to each new modified-Booth encoder, the partial product generator array includes a new adder cell. The partial product generator array receives inputs Y0 . . . YN with the Y0 receiving partial product generator being a new partial product generator for generating a partial product PP*(0,j). The new modified-Booth encoder receives multiplier bits and a multiplicand input Y0, and generates control signals and a carry in signal. The new adder cell is connected to the new modified-Booth encoder, the Y0 receiving new partial product generator and the (j−2) row Y2 receiving partial product generator and generates a partial product and an intermediate carry out signal so as to reduce the number of gate delay stages in the critical path of the multiplier.Type: GrantFiled: August 20, 1998Date of Patent: January 9, 2001Assignee: Lucent Technologies, Inc.Inventors: Alexander Goldovsky, Ravi Kumar Kolagotla
-
Patent number: 6163563Abstract: A receiver for a spread spectrum communication system is disclosed in which a transmitter transmits a data signal to a receiver includes a memory for storing digital representation of the data signal received by the receiver. A memory input addressing unit defines a circulating data window. A first ring shift register circulates a first set of components of a spreading code. A second ring shift register circulates a second set of components of a spreading code. A selector selects one of the first set of components or the second set of components as selected components of the spreading code and an adder receives as inputs digital representations of the data signal from the circulating data window and the selected components of the spreading code. The adder provides an output that is the dot product of the inputs.Type: GrantFiled: December 23, 1997Date of Patent: December 19, 2000Assignee: Lucent Technologies Inc.Inventors: Thomas Wesley Baker, Richard Adam Cesari, Ravi Kumar Kolagotla
-
Patent number: 6122655Abstract: A multiplier generates an array of partial products. The partial products are reduced in a converter having cells defining rows and columns. Cells adjacent to adders alternate between a cell that provides non-inverted outputs and a cell that provides inverted outputs, such that alternate rows of cells operate on non-inverted data and the intervening rows of cells operate on inverted data. A multiplexer for receiving the outputs from a row of cells may be an inverting multiplexer or a non-inverting multiplexer depending on the cell arrangement.Type: GrantFiled: May 15, 1998Date of Patent: September 19, 2000Assignee: Lucent Technologies Inc.Inventors: Alexander Goldovsky, Ravi Kumar Kolagotla
-
Patent number: 6049858Abstract: In accordance with the present invention, an address arithmetic unit provides a modulo addressing technique for addressing memory locations in a circular buffer. The address arithmetic unit includes a sign detector adapted to determine whether a sum of an address pointer and a precomputed comparison term is of a first state or a second state. A first adder adds an address pointer and a precomputed correction term to generate a first potential next address pointer. A second adder, operating in parallel with the first adder, adds the address pointer and a displacement to generate a second potential next address pointer. A selector adapted to select the first potential next address pointer as an output when the sign detector output and a sign bit of the displacement are different, and to select the second potential next address pointer as an output when the sign detector output and a sign bit of the displacement are the same.Type: GrantFiled: August 27, 1997Date of Patent: April 11, 2000Assignee: Lucent Technologies Inc.Inventors: Ravi Kumar Kolagotla, Mohit Kishore Prasad
-
Patent number: 6047364Abstract: In accordance with the present invention, an address arithmetic unit provides a modulo addressing technique for addressing a circular buffer. The address arithmetic unit includes a first selector adapted to receive as a first input a value representative of one greater than an ending address, a second input that is a beginning address, and a select input that is the sign of a displacement for stepping through addresses in a circular buffer. The first selector is adapted to select one of its inputs as an output. A carry-save adder adapted to receive as inputs an inverted representation of the first selector output, an address pointer, and a displacement. The carry-save adder is adapted to add the inputs to produce sum bits and carry bits as outputs. A sign detector adapted to determine whether a sum of the sum bits and carry bits is greater than or equal to zero, or less than zero, and for providing an output indicative of whether the sum is greater than or equal to zero, or less than zero.Type: GrantFiled: August 27, 1997Date of Patent: April 4, 2000Assignee: Lucent Technologies Inc.Inventors: Ravi Kumar Kolagotla, Mohit Kishore Prasad
-
Patent number: 6044063Abstract: An unsigned integer comparator for use when comparing an n-bit received signal (such as an address) with an n-bit known signal ("comparison address"). The first stage of the comparator may be configured in advance, since the values of both a "comparison signal" and a "select signal" are known a priori. When the "current signal" arrives, the bits of this signal are then compared against the associated bits of the comparison signal. Subsequent stages of the comparator perform comparison operations of increasing length, dependent upon the outcome of the previous stage (i.e., a first set of 2-bit comparisons, then 4-bit, 8-bit, etc.), until the entire n-bit integers are ultimately compared and a final output is generated.Type: GrantFiled: November 21, 1997Date of Patent: March 28, 2000Assignee: Lucent Technologies, Inc.Inventors: Ravi Kumar Kolagotla, Santosh K. Misra, Jiancheng Mo, Hosahalli R. Srinivas
-
Patent number: 6031887Abstract: An integrated circuit includes an n-bit counter having a plurality of k subcounters where both n and k are integers. At least one of the subcounters includes a switchable device adapted to receive a carry-out signal from an adjacent subcounter as a first input, a test carry signal as a second input, and a control input, the switchable device being capable of providing one of its inputs as an output, the control input capable of controlling selection of the output which is a carry signal. The subcounter also includes an n/k-bit counter, the n/k-bit counter receiving the carry signal and providing n/k output bits, and logic for combining the n/k-bits output from the n/k bit counter with the carry-out signal from an adjacent subcounter to provide an output that is a carry-out signal from the subcounter. The logic introducing a single gate delay between the carry-out signal from the adjacent subcounter and the carry-out signal from the subcounter.Type: GrantFiled: July 30, 1997Date of Patent: February 29, 2000Assignee: Lucent Technolgies Inc.Inventors: Ravi Kumar Kolagotla, Santosh K. Misra, Jiancheng Mo, Hosahalli R. Srinivas
-
Patent number: 6018758Abstract: A squarer generates an array of partial products. A method of squaring a representation of a number includes generating an array of partial products, combining the partial product on one side of a diagonal of the array with partial products on the other side of the diagonal to form a folded array of partial products, and combining each of at least one more than half of the partial products in the diagonal of the array with a corresponding one of the partial products in the folded array to produce a new folded array of partial products. In an alternative embodiment, the present invention is a circuit for squaring an n-bit representation of a number.Type: GrantFiled: July 30, 1997Date of Patent: January 25, 2000Assignee: Lucent Technologies Inc.Inventors: William R. Griesbach, Ravi Kumar Kolagotla
-
Patent number: 5983333Abstract: In accordance with the present invention, an address arithmetic unit provides a modulo addressing technique for addressing memory locations in a circular buffer. The address arithmetic unit includes a first selector adapted to receive as a first input a value representative of one greater than an ending address, a second input that is a beginning address, and a select input that is the sign of a displacement for stepping through addresses in a circular buffer. The first selector is adapted to select one of its inputs as an output. A first adder combines an address pointer and displacement to produce a first potential next address pointer. A second adder combines the address pointer, the displacement, and a length modified by the sign of the displacement to produce a second potential next address pointer.Type: GrantFiled: August 27, 1997Date of Patent: November 9, 1999Assignee: Lucent Technologies Inc.Inventors: Ravi Kumar Kolagotla, Mohit Kishore Prasad
-
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
-
Patent number: 5977864Abstract: There is disclosed, a high speed comparator with bit-wise masking takes advantage of early availability of the reference word and mask word to generate conditional select signals, thereby minimizing the time required to generate a comparator output once the input word to be compared is available.Type: GrantFiled: May 15, 1998Date of Patent: November 2, 1999Assignee: Lucent Technologies Inc.Inventors: Michael S. Buonpane, Ravi Kumar Kolagotla, Jiancheng Mo
-
Patent number: 5958036Abstract: Apparatus for arbitrating the selection of an interrupt for servicing from a plurality of interrupts in which a priority level for each of the plurality of interrupts is programmed in a first register and each of the interrupts which is to be evaluated for selection for servicing is set as pending in a second register. Only a pending interrupt having a priority level above a pre-set current interrupt priority level is selected for servicing and where multiple pending interrupts of the same priority level occur, the one with the highest order bit position in the second register is used.Type: GrantFiled: September 8, 1997Date of Patent: September 28, 1999Assignee: Lucent Technologies Inc.Inventors: Geoffrey Francis Burns, Ravi Kumar Kolagotla, Douglas J. Rhodes, Marck E. Thierbach
-
Patent number: 5946369Abstract: An N-bit binary synchronous counter includes K counter stages, with each stage including N/K flip-flops or other suitable storage elements. A given one of the counter stages receives a carry-in signal generated by another counter stage or by a carry logic circuit. The given counter stage includes a selection circuit for selecting one of two precomputed values for application to an input of a storage element in that stage based on a value of the carry-in signal. The selection circuit may include a two-input multiplexer for each of the N/K storage elements of the given counter stage. The jth multiplexer includes a first input coupled to an output of the jth storage element, and a second input coupled to an output of a logic circuit. The logic circuit generates a logic function based on the output of the jth storage element and other lower significant storage elements in the stage.Type: GrantFiled: July 30, 1997Date of Patent: August 31, 1999Assignee: Lucent Technologies Inc.Inventors: Ravi Kumar Kolagotla, Santosh K. Misra, Jiancheng Mo, Hosahalli R. Srinivas
-
Patent number: 5928317Abstract: A multiplier generates an array of partial products. The partial products are reduced in the more significant side of the array assuming a carry-out from the less significant side of the array as taking on a first state to produce a first set of reduced products. The partial products are also reduced in the more significant side of the array assuming a carry-out from the less significant side of the array as taking on a second state to produce a second set of reduced products. Both sets of reduced partial products are generated in parallel with the carry-out from the least significant side. The first set of reduced products are selected as the reduced products of the more significant side of the array when the carry-out from the less significant side of the array takes on the first state. The second set of reduced products are selected as the reduced products of the more significant side of the array when the carry-out from the less significant side of the array takes on the second state.Type: GrantFiled: May 5, 1997Date of Patent: July 27, 1999Assignee: Lucent Technologies Inc.Inventors: Jalil Fadavi-Ardekani, Ravi Kumar Kolagotla, Hosahalli R. Srinivas
-
Patent number: 5925143Abstract: A scan architecture for testing integrated circuit chips containing scannable memory devices, such as register arrays, is operable in a bypass mode during which only a small portion of the memory cells in each device or array is inserted in the scan path to substantially reduce scan path length, test time and test data volume during testing of other logic components in the circuit chip. Additional decoder logic is employed to select a small number of words in the device or array during the scan-bypass mode, and multiplexor circuitry removes the bypassed words from the scan path. By leaving the small number of the register array words in the scan path, observability of logic upstream of the array, and controllability of logic downstream of the array, is preserved during the bypass mode without the need for additional shift register latches and other external logic components.Type: GrantFiled: May 16, 1997Date of Patent: July 20, 1999Assignee: International Business Machines CorporationInventors: Pamela Sue Gillis, Ravi Kumar Kolagotla, Dennis A. Miller, Maria Noack, Steven Frederick Oakland, Chris Joseph Rebeor, Thomas Gregory Sopchak, Jeanne Trinko-Mechler
-
Patent number: 5883825Abstract: There is disclosed a converter for summing inputs includes first, second, third and fourth adders. Each of the adders is adapted to receive a carry-in and to provide as outputs a carry-out and a sum output. Each adder has an associated partial product generated in proximity thereto. The adders are interconnected such that the associated partial product of the first and second adders provide additional inputs to the first adder. The associated partial products of the third and fourth adder provide additional inputs to the second adder. The sum output of the first and second adders provide additional input to the third adder. A sum input to the converter and the sum output of the third adder provide additional inputs to the fourth adder. The output of the fourth adder is the output of the converter.Type: GrantFiled: September 3, 1997Date of Patent: March 16, 1999Assignee: Lucent Technologies Inc.Inventor: Ravi Kumar Kolagotla
-
Patent number: 5719879Abstract: A scan architecture for testing integrated circuit chips containing scannable memory devices, such as register arrays, is operable in a bypass mode during which only a small portion of the memory cells in each device or array is inserted in the scan path to substantially reduce scan path length, test time and test data volume during testing of other logic components in the circuit chip. Additional decoder logic is employed to select a small number of words in the device or array during the scan-bypass mode, and multiplexor circuitry removes the bypassed words from the scan path. By leaving the small number of the register array words in the scan path, observability of logic upstream of the array, and controllability of logic downstream of the array, is preserved during the bypass mode without the need for additional shift register latches and other external logic components.Type: GrantFiled: December 21, 1995Date of Patent: February 17, 1998Assignee: International Business Machines CorporationInventors: Pamela Sue Gillis, Ravi Kumar Kolagotla, Dennis A. Miller, Maria Noack, Steven Frederick Oakland, Chris Joseph Rebeor, Thomas Gregory Sopchak, Jeanne Trinko-Mechler