← Back to Patent Explorer
US4734876A Expired / Lapsed US ⏱️ 0.0 years remaining

Circuit for selecting one of a plurality of exponential values to a predetermined base to provide a maximum value

Assignee: Motorola Solutions Inc
•
Filing: 1985-12-18
•
Granted: 1988-03-29
•
Expires: 2005-12-18
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A circuit for receiving a plurality of signed operands which each represent an exponential value to a predetermined base and for selecting one of the operands which results in a maximum value is taught. The circuit has a rank ordered plurality of logic circuits which each receives a predetermined bit of each operand and provides an output bit of the maximum value. The output of the logic circuits is a transcoded output which is a translation value of the maximum value. A sign control circuit receives a sign bit of each signed operand and controls the operation of the logic circuits in response to the values of the input operands.

Inventors

  • 👤 Tim A. Williams

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-31 14:56
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/30003; G06F9/30007; G06F9/30021; G06F7/00; G06F7/38; G06F7/48; G06F7/544; G06F7/556

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 191 words
A circuit for receiving a plurality of input operands representing exponential values relative to a predetermined base value which is less than one and selecting the operand which when used as an exponent of the base value represents a maximum value, comprising: first transcoder means for sequentially receiving each of the input operands and providing a first intermediate operand in response to each received operand, each of the first intermediate operands indicating the bit position of a most significant bit of the respective input operand; logic means coupled to the first transcoder means for selectively receiving the first intermediate operands and comparing a most recently received first intermediate operand with a previous maximum value first intermediate operand to provide a second intermediate operand which represents the maximum valued operand of all of the previously received first intermediate operands including the most recently received first intermediate operand; and second transcoder means coupled to the logic means for selectively receiving the second intermediate operands and transcoding each received second intermediate operand to provide an output indicating the one of the plurality of input operands which raises the base value to the maximum value.
Claim 2
Dependent Claim 191 words
A circuit for receiving a plurality of input operands representing exponential values relative to a predetermined base value which is less than one and selecting the operand which when used as an exponent of the base value represents a maximum value, comprising: first transcoder means for sequentially receiving each of the input operands and providing a first intermediate operand in response to each received operand, each of the first intermediate operands indicating the bit position of a most significant bit of the respective input operand; logic means coupled to the first transcoder means for selectively receiving the first intermediate operands and comparing a most recently received first intermediate operand with a previous maximum value first intermediate operand to provide a second intermediate operand which represents the maximum valued operand of all of the previously received first intermediate operands including the most recently received first intermediate operand; and second transcoder means coupled to the logic means for selectively receiving the second intermediate operands and transcoding each received second intermediate operand to provide an output indicating the one of the plurality of input operands which raises the base value to the maximum value.
Claim 3
Dependent Claim 64 words
The circuit of claim 1 wherein the input operands are signed operands and the circuit further comprises: sign control means for receiving a sign bit of each signed input operand and providing an output sign bit of the maximum value, said sign control means further providing control signals to the first and second transcoder means and to the logic means to control said circuit.
Claim 4
Dependent Claim 35 words
The circuit of claim 1 wherein the logic means further comprises a logic coupled to a latch circuit, said logic gate receiving the first intermediate operand and said latch circuit providing the second intermediate operand.
Claim 5
Dependent Claim 224 words
A circuit for receiving a plurality of input operands representing exponential values relative to a predetermined base less than one and providing the operand which when used as an exponent of the base value represents a maximum value, comprising: first logic means for sequentially receiving each of the input operands and providing a first intermediate operand in response to each operand, each of said first intermediate operands indicating the bit position of a most significant bit of the respective input operand; second logic means having a first input for receiving the first intermediate operand, a second input and an output, said second logic means performing a predetermined logic function with said first and second inputs; storage means having an input coupled to the output of the second logic means, and an output coupled to the second input of the second logic means for storing and providing a second intermediate operand which represents the one of all of the previously received first intermediate operands including the most recently received first intermediate operand which raises the base value to the maximum value; and third logic means coupled to the storage means for selectively receiving the second intermediate operands and transcoding the second intermediate operands to provide an output indicating the one of the plurality of input operands which raises the base value to the maximum value.
Claim 6
Dependent Claim 224 words
A circuit for receiving a plurality of input operands representing exponential values relative to a predetermined base less than one and providing the operand which when used as an exponent of the base value represents a maximum value, comprising: first logic means for sequentially receiving each of the input operands and providing a first intermediate operand in response to each operand, each of said first intermediate operands indicating the bit position of a most significant bit of the respective input operand; second logic means having a first input for receiving the first intermediate operand, a second input and an output, said second logic means performing a predetermined logic function with said first and second inputs; storage means having an input coupled to the output of the second logic means, and an output coupled to the second input of the second logic means for storing and providing a second intermediate operand which represents the one of all of the previously received first intermediate operands including the most recently received first intermediate operand which raises the base value to the maximum value; and third logic means coupled to the storage means for selectively receiving the second intermediate operands and transcoding the second intermediate operands to provide an output indicating the one of the plurality of input operands which raises the base value to the maximum value.
Claim 7
Dependent Claim 14 words
The circuit of claim 4 wherein the second logic means is an AND gate.
Claim 8
Dependent Claim 14 words
The circuit of claim 4 wherein the storage means is a D-type flip flop.
Claim 9
Dependent Claim 65 words
The circuit of claim 4 wherein the input operands are signed operands and the circuit further comprises: sign control means for receiving a sign bit of each signed input operand and providing an output sign bit of the maximum value, said sign control means further providing control signals to the first and third logic means and storage means to control the operation of said circuit.
Claim 10
Independent Claim 147 words
A method for receiving a plurality of input operands representing exponential values relative to a predetermined base less than one and providing the operand which when used as an exponent represents a maximum value, comprising the steps of: sequentially receiving each of the input operands and providing a first intermediate operand in response to each operand, each of the first intermediate operands indicating bit position of a most significant bit of the respective input operand; comparing a most recently generated first intermediate operand with a previous maximum valued first intermediate operand to provide a second intermediate operand representing a maximum valued operand of all of the previously received first intermediate operands including the most recently received first intermediate operand; and transcoding each second intermediate operand to provide an output indicating the one of the plurality of input operands which raises the base value to the maximum value.
Claim 11
Independent Claim 147 words
A method for receiving a plurality of input operands representing exponential values relative to a predetermined base less than one and providing the operand which when used as an exponent represents a maximum value, comprising the steps of: sequentially receiving each of the input operands and providing a first intermediate operand in response to each operand, each of the first intermediate operands indicating bit position of a most significant bit of the respective input operand; comparing a most recently generated first intermediate operand with a previous maximum valued first intermediate operand to provide a second intermediate operand representing a maximum valued operand of all of the previously received first intermediate operands including the most recently received first intermediate operand; and transcoding each second intermediate operand to provide an output indicating the one of the plurality of input operands which raises the base value to the maximum value.

References Cited (Backward Citations)

US4446452A Cited
US4539549A Cited
US4597053A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1991-03-29 1991-09-28 1992-03-29 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1995-03-29 1995-09-28 1996-03-29 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1999-03-29 1999-09-28 2000-03-29 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag