Exponentiation circuit utilizing shift means and method of using same

Claim 2

In an exponentiation circuit having an input signal x, a method for generating an exponential signal x g , the method comprising the following steps: (a) generating a binary log value having a plurality of bits by performing a logarithmic conversion on the input signal; (b) shifting the plurality of bits of the binary log value to generate an intermediate value; (c) arithmetically combining the intermediate value and a stored value to produce a combined value, wherein the step of combining is selected from the group consisting of: (i) adding the intermediate value to the stored value to produce the combined value; and (ii) subtracting the intermediate value from the stored value to produce the combined value; and (d) generating the exponential signal by performing an inverse-logarithmic conversion on the combined value.

Claim 3

The method of claim 1, wherein the step of subtracting includes the following sub-steps: representing the intermediate value in a signed two's complement form; and adding the signed two's complement form of the intermediate value to the stored value to produce the combined value.

Claim 4

The method of claim 1, further comprising the following steps inserted between steps (c) and (d) : determining whether the input signal has been raised to the power of a predetermined exponent: if so, proceeding to step (d); and if not, equating the stored value to the combined value; repeating steps (b) and (c); and returning to the step of determining.

Claim 5

The method of claim 1, wherein the stored value is initially set to zero.

Claim 6

The method of claim 1, wherein the stored value is initially set to a coefficient value.

Claim 7

In an exponentiation circuit having an input signal x, a method for generating an exponential signal x g , the method comprising the following steps: (a) generating a binary log value having a plurality of bits by performing a logarithmic conversion on the input signal; (b) decoding an exponent code to produce a first shift signal and a second shift signal; (c) applying the first shift signal to the binary log value to produce a first intermediate value, wherein the first intermediate value is produced according to a sub-step determined by the first shift signal and selected from the group consisting of: (i) shifting the plurality of bits of the binary log value to generate the first intermediate value; (ii) equating the first intermediate value to the binary log value; (d) applying the second shift signal to the binary log value to produce a second intermediate value, wherein the second intermediate value is produced according to a sub-step determined by the second shift signal and selected from the group consisting of: (i) shifting the plurality of bits of the binary log value to generate the second intermediate value; (ii) equating the second intermediate value to the binary log value; and (iii) setting the second intermediate value to zero; (e) arithmetically combining the first intermediate value and the second intermediate value to produce a combined value, wherein the step of combining includes a sub-step determined by the exponent code and selected from the group consisting of: (i) adding the first intermediate value to the second intermediate value to produce the combined value; and (ii) subtracting the first intermediate value from the second intermediate value to produce the combined value; and (f) generating the exponential signal by performing an inverse-logarithmic conversion on the combined value.

Claim 8

In an exponentiation circuit having an input signal x, a method for generating an exponential signal x g , the method comprising the following steps: (a) generating a binary log value having a plurality of bits by performing a logarithmic conversion on the input signal; (b) decoding an exponent code to produce a first shift signal and a second shift signal; (c) applying the first shift signal to the binary log value to produce a first intermediate value, wherein the first intermediate value is produced according to a sub-step determined by the first shift signal and selected from the group consisting of: (i) shifting the plurality of bits of the binary log value to generate the first intermediate value; (ii) equating the first intermediate value to the binary log value; (d) applying the second shift signal to the binary log value to produce a second intermediate value, wherein the second intermediate value is produced according to a sub-step determined by the second shift signal and selected from the group consisting of: (i) shifting the plurality of bits of the binary log value to generate the second intermediate value; (ii) equating the second intermediate value to the binary log value; and (iii) setting the second intermediate value to zero; (e) arithmetically combining the first intermediate value and the second intermediate value to produce a combined value, wherein the step of combining includes a sub-step determined by the exponent code and selected from the group consisting of: (i) adding the first intermediate value to the second intermediate value to produce the combined value; and (ii) subtracting the first intermediate value from the second intermediate value to produce the combined value; and (f) generating the exponential signal by performing an inverse-logarithmic conversion on the combined value.

Claim 9

The method of claim 6, further comprising the step of: adding a coefficient value to the combined value before performing the inverse-logarithmic conversion.

Claim 10

The method of claim 6, wherein the step of subtracting includes the following sub-steps: representing the first intermediate value in a signed two's complement form; and adding the signed two's complement form of the first intermediate value to the second intermediate value to produce the combined value.

Claim 11

The method of claim 6, further comprising the following steps inserted between steps (e) and (f): storing the combined value; repeating steps (b)-(e) to produce a second combined value; and adding the second combined value to the stored combined value to produce a further combined value, wherein the further combined value is substituted for the combined value in step (f).

Claim 12

The method of claim 6, wherein in steps (c), (d), and (e) the first intermediate value, the second intermediate value, and the combined value are respectively produced as follows: if the exponent code indicates that x -1 is to be generated, then the first intermediate value is equated to the binary log value, the second intermediate value is set to zero, and the combined value is produced by subtracting the first intermediate value from the second intermediate value; if the exponent code indicates that x 1 is to be generated, then the first intermediate value is equated to the binary log value, the second intermediate value is set to zero, and the combined value is produced by adding the first intermediate value to the second intermediate value; if the exponent code indicates that x 2 is to be generated, then the first intermediate value is generated by shifting the binary log value a distance of one bit, the second intermediate value is set to zero, and the combined value is produced by adding the first intermediate value to the second intermediate value; if the exponent code indicates that x 3 is to be generated, then the first intermediate value is generated by shifting the binary log value a distance of one bit, the second intermediate value equated to the binary log value, and the combined value is produced by adding the first intermediate value to the second intermediate value; if the exponent code indicates that x 4 is to be generated, then the first intermediate value is generated by shifting the binary log value a distance of one bit, the second intermediate value is set to zero, and the combined value is produced by adding the first intermediate value to the second intermediate value; if the exponent code indicates that x 5 is to be generated, then the first intermediate value is generated by shifting the binary log value a distance of two bits, the second intermediate value is equated to the binary log value, and the combined value is produced by adding the first intermediate value to the second intermediate value; if the exponent code indicates that x 6 is to be generated, then the first intermediate value is generated by shifting the binary log value a distance of two bits, the second intermediate value is generated by shifting the binary log value a distance of one bit, and the combined value is produced by adding the first intermediate value to the second intermediate value; and if the exponent code indicates that x 7 is to be generated, then the first intermediate value is equated to the binary log value, the second intermediate value is generated by shifting the binary log value a distance of three bits, and the combined value is produced by subtracting the first intermediate value from the second intermediate value.

Claim 13

In an exponentiation circuit receiving a sequence of input signals x i , a method for generating a term having a plurality of exponential signals X i gi , wherein i is an integer, the method comprising the following steps: (a) receiving one input signal of the sequence of input signals; (b) generating a binary log value having a plurality of bits by performing a logarithmic conversion on the one input signal; (c) decoding an exponent code to produce a first shift signal and a second shift signal; (d) applying the first shift signal to the binary log value to produce a first intermediate value, wherein the first intermediate value is produced according to a sub-step determined by the first shift signal and selected from the group consisting of: (i) shifting the plurality of bits of the binary log value to generate the first intermediate value; (ii) equating the first intermediate value to the binary log value; (e) applying the second shift signal to the binary log value to produce a second intermediate value, wherein the second intermediate value is produced according to a sub-step determined by the second shift signal and selected from the group consisting of: (i) shifting the plurality of bits of the binary log value to generate the second intermediate value; (ii) equating the second intermediate value to the binary log value; and (iii) setting the second intermediate value to zero; (f) arithmetically combining the first intermediate value and the second intermediate value to produce a combined value, wherein the step of combining includes a sub-step determined by the exponent code and selected from the group consisting of: (i) adding the first intermediate value to the second intermediate value to produce the combined value; and (ii) subtracting the first intermediate value from the second intermediate value to produce the combined value; (g) adding the combined value to a stored value to produce a sum; (h) determining whether all of the sequence of input signals have been received; (i) if so, proceeding to step (i); (ii) if not, receiving a next input signal from the sequence of input signals; equating the one input signal to the next input signal; equating the stored value to the sum; and repeating steps (b)-(h); and (i) generating the term by performing an inverse-logarithmic conversion on the sum.

Claim 14

In an exponentiation circuit receiving a sequence of input signals x i , a method for generating a term having a plurality of exponential signals X i gi , wherein i is an integer, the method comprising the following steps: (a) receiving one input signal of the sequence of input signals; (b) generating a binary log value having a plurality of bits by performing a logarithmic conversion on the one input signal; (c) decoding an exponent code to produce a first shift signal and a second shift signal; (d) applying the first shift signal to the binary log value to produce a first intermediate value, wherein the first intermediate value is produced according to a sub-step determined by the first shift signal and selected from the group consisting of: (i) shifting the plurality of bits of the binary log value to generate the first intermediate value; (ii) equating the first intermediate value to the binary log value; (e) applying the second shift signal to the binary log value to produce a second intermediate value, wherein the second intermediate value is produced according to a sub-step determined by the second shift signal and selected from the group consisting of: (i) shifting the plurality of bits of the binary log value to generate the second intermediate value; (ii) equating the second intermediate value to the binary log value; and (iii) setting the second intermediate value to zero; (f) arithmetically combining the first intermediate value and the second intermediate value to produce a combined value, wherein the step of combining includes a sub-step determined by the exponent code and selected from the group consisting of: (i) adding the first intermediate value to the second intermediate value to produce the combined value; and (ii) subtracting the first intermediate value from the second intermediate value to produce the combined value; (g) adding the combined value to a stored value to produce a sum; (h) determining whether all of the sequence of input signals have been received; (i) if so, proceeding to step (i); (ii) if not, receiving a next input signal from the sequence of input signals; equating the one input signal to the next input signal; equating the stored value to the sum; and repeating steps (b)-(h); and (i) generating the term by performing an inverse-logarithmic conversion on the sum.

Claim 15

The method of claim 11, further comprising the step of: adding a coefficient value to the sum before performing the inverse-logarithmic conversion.

Claim 16

The method of claim 11, wherein the sub-step of subtracting includes the following sub-steps: representing the first intermediate value in a signed two's complement form; and adding the signed two's complement form of the first intermediate value to the second intermediate value to produce the combined value.

Claim 17

The method of claim 11, further comprising the following steps inserted between steps (g) and (h) : for at least one of the sequence of input signals: equating the stored value to the sum; and repeating at least once the steps (b)-(g).

Claim 18

The method of claim 11, wherein in steps (d), (e), and (f) the first intermediate value, the second intermediate value, and the combined value are respectively produced as follows: if the exponent code indicates that x i -1 is to be generated, then the first intermediate value is equated to the binary log value, the second intermediate value is set to zero, and the combined value is produced by subtracting the first intermediate value from the second intermediate value; if the exponent code indicates that x i 1 is to be generated, then the first intermediate value is equated to the binary log value, the second intermediate value is set to zero, and the combined value is produced by adding the first intermediate value to the second intermediate value; if the exponent code indicates that x i 2 is to be generated, then the first intermediate value is generated by shifting the binary log value a distance of one bit, the second intermediate value is set to zero, and the combined value is produced by adding the first intermediate value to the second intermediate value; if the exponent code indicates that x i 3 is to be generated, then the first intermediate value is generated by shifting the binary log value a distance of one bit, the second intermediate value equated to the binary log value, and the combined value is produced by adding the first intermediate value to the second intermediate value; if the exponent code indicates that x i 4 is to be generated, then the first intermediate value is generated by shifting the binary log value a distance of one bit, the second intermediate value is set to zero, and the combined value is produced by adding the first intermediate value to the second intermediate value; if the exponent code indicates that x i 5 is to be generated, then the first intermediate value is generated by shifting the binary log value a distance of two bits, the second intermediate value is equated to the binary log value, and the combined value is produced by adding the first intermediate value to the second intermediate value; if the exponent code indicates that x i 6 is to be generated, then the first intermediate value is generated by shifting the binary log value a distance of two bits, the second intermediate value is generated by shifting the binary log value a distance of one bit, and the combined value is produced by adding the first intermediate value to the second intermediate value; and if the exponent code indicates that x i 7 is to be generated, then the first intermediate value is equated to the binary log value, the second intermediate value is generated by shifting the binary log value a distance of three bits, and the combined value is produced by subtracting the first intermediate value from the second intermediate value.

Claim 19

An exponentiation circuit having an input and an output, the circuit producing an exponential signal on the output in response to receiving an input signal on the input, the circuit comprising: a logarithm converter for performing logarithmic conversion on the input signal to produce a binary log value having a plurality of bits; shift means for receiving the binary log value and shifting the plurality of bits a distance of n-bits to generate an intermediate value as an output thereof, wherein n is an integer; means for arithmetically combining the intermediate value and a stored value to produce a combined value; and an inverse-logarithm converter for performing an inverse-logarithmic conversion on the combined value to produce the exponential signal, the inverse-logarithm converter generating the exponential signal on the output of the circuit.

Claim 20

An exponentiation circuit having an input and an output, the circuit producing an exponential signal on the output in response to receiving an input signal on the input, the circuit comprising: a logarithm converter for performing logarithmic conversion on the input signal to produce a binary log value having a plurality of bits; shift means for receiving the binary log value and shifting the plurality of bits a distance of n-bits to generate an intermediate value as an output thereof, wherein n is an integer; means for arithmetically combining the intermediate value and a stored value to produce a combined value; and an inverse-logarithm converter for performing an inverse-logarithmic conversion on the combined value to produce the exponential signal, the inverse-logarithm converter generating the exponential signal on the output of the circuit.

Claim 21

The exponentiation circuit of claim 16, wherein n is an integer in the range of 0 to 3.

Claim 22

The exponentiation circuit of claim 16, further comprising: means for storing the binary log value; a control unit, operatively coupled to the shift means, for applying an exponent code to the shift means; wherein the shift means generates a sequence of intermediate values in response to a stored binary log value, the shift means shifting the plurality of bits of each of the sequence of intermediate values a bit distance according to the exponent code; and wherein the combining means includes: an adder circuit for summing the sequence of intermediate values and the stored value to produce the combined value.

Claim 23

The exponentiation circuit of claim 18, wherein the control unit converts at least one of the sequence of intermediate values to a signed two's complement form before the at least one of the sequence of intermediate values is received by the adder circuit, the control unit performing the conversion by inverting the at least one of the sequence of intermediate values and providing a corresponding carry bit to the adder circuit.

Claim 24

The exponentiation circuit of claim 16, wherein the shift means includes a shift register.

Claim 25

The exponentiation circuit of claim 16, wherein the shift means includes a multiplexer.

Claim 26

An exponentiation circuit receiving a sequence of input signals and in response producing as output a term which includes a plurality of exponential signals, each of the exponential signals corresponding to one of the input signals, the circuit comprising: a logarithm converter for performing a logarithmic conversion on the sequence of input signals to produce a sequence of binary log values, each of the binary log values having a plurality of bits and corresponding to one of the input signals; a first shift register responsive to the sequence of binary log values and generating a sequence of first intermediate values as an output thereof, the first shift register receiving each of the binary log values and shifting the plurality of bits a distance of n-bits to generate a first intermediate value, wherein n is an integer; a second shift register responsive to the sequence of binary log values and generating a sequence of second intermediate values as an output thereof, the second shift register receiving each of the binary log values and shifting the plurality of bits a distance of n-bits to generate a second intermediate value, wherein n is an integer; a control unit, operatively coupled to the first shift register and the second shift register, the control unit storing a plurality of exponent codes, each of the plurality of exponent codes corresponding to one of the sequence of input signals, the control unit applying the plurality of exponent codes to the first shift register and the second shift register; wherein the first shift register and the second shift register shift the plurality of bits of each of the sequence of binary log values a bit distance according to the corresponding exponent code; and means for arithmetically combining the sequence of first intermediate values and the sequence of second intermediate values to produce a sum; and an inverse-logarithm converter for performing an inverse-logarithmic conversion on the sum to produce the term, the inverse-logarithm converter providing the term on an output of the exponentiation circuit.

Claim 27

An exponentiation circuit receiving a sequence of input signals and in response producing as output a term which includes a plurality of exponential signals, each of the exponential signals corresponding to one of the input signals, the circuit comprising: a logarithm converter for performing a logarithmic conversion on the sequence of input signals to produce a sequence of binary log values, each of the binary log values having a plurality of bits and corresponding to one of the input signals; a first shift register responsive to the sequence of binary log values and generating a sequence of first intermediate values as an output thereof, the first shift register receiving each of the binary log values and shifting the plurality of bits a distance of n-bits to generate a first intermediate value, wherein n is an integer; a second shift register responsive to the sequence of binary log values and generating a sequence of second intermediate values as an output thereof, the second shift register receiving each of the binary log values and shifting the plurality of bits a distance of n-bits to generate a second intermediate value, wherein n is an integer; a control unit, operatively coupled to the first shift register and the second shift register, the control unit storing a plurality of exponent codes, each of the plurality of exponent codes corresponding to one of the sequence of input signals, the control unit applying the plurality of exponent codes to the first shift register and the second shift register; wherein the first shift register and the second shift register shift the plurality of bits of each of the sequence of binary log values a bit distance according to the corresponding exponent code; and means for arithmetically combining the sequence of first intermediate values and the sequence of second intermediate values to produce a sum; and an inverse-logarithm converter for performing an inverse-logarithmic conversion on the sum to produce the term, the inverse-logarithm converter providing the term on an output of the exponentiation circuit.

Claim 28

The exponentiation circuit of claim 22, wherein n is an integer in the range of 0 to 3.

Claim 29

The exponentiation circuit of claim 22, wherein the combining means includes: a first register for providing the sum as an output thereof; a second register for providing a combined value as an output thereof; a first multiplexer for providing as output either the output of the first register or the output of the first shift register; a second multiplexer for providing as output either the output of the second register or the output of the second shift register; an adder circuit having a first input responsive to the output of the first multiplexer and a second input responsive to the output of the second multiplexer, the adder circuit generating an output; de-multiplexing means for providing the output of the adder circuit to either the first register or the second register; wherein the first multiplexer and the second multiplexer are responsive to a mux signal from the control unit and the de-multiplexing means is responsive to a de-mux signal from the control unit; the control unit asserting the mux signal during a first addition cycle so that the output of the first shift register and the output of the second shift register are provided to the adder circuit; the control unit asserting the de-mux signal during the first addition cycle so that the output of the adder circuit is provided to the second register; the control unit asserting the mux signal during a second addition cycle so that the output of the first register and the output of the second register are provided to the adder circuit; and the control unit asserting the de-mux signal during the second addition cycle so that the output of the adder circuit is provided to the first register.

Claim 30

The exponentiation circuit of claim 24, wherein the control unit converts at least one of the sequence of second intermediate values to a signed two's complement form before the at least one of the sequence of second intermediate values is received by the second multiplexer, the control unit performing the conversion by inverting the at least one of the sequence of second intermediate values and providing a corresponding carry bit to the adder circuit.

Claim 31

The exponentiation circuit of claim 24, wherein the sum is initially a coefficient value.

Claim 32

The exponentiation circuit of claim 22, wherein the combining means includes: a first register for providing the sum as an output thereof; a first adder circuit having a first input responsive to the output of the first shift register and a second input responsive to the output of the second shift register, the first adder circuit generating an output; a second adder circuit having a first input responsive to the output of the first adder circuit and a second input responsive to the output of the first register, the second adder circuit generating the sum an output and providing the sum to the first register; wherein the first adder circuit generates a combined value in response to receiving one of the sequence of first intermediate values and one of the sequence of second intermediate values corresponding to the same one of the sequence of input signals; and the second adder circuit generating the sum in response to receiving the Combined value from the first adder circuit.

Claim 33

The exponentiation circuit of claim 27, wherein the control unit converts at least one of the sequence of second intermediate values to a signed two's complement form before the at least one of the sequence of second intermediate values is received by the second multiplexer, the control unit performing the conversion by inverting the at least one of the sequence of second intermediate values and providing a corresponding carry bit to the first adder circuit.

Claim 34

The exponentiation circuit of claim 27, wherein the sum is initially a coefficient value.

Claim 35

An exponentiation circuit receiving a sequence of input signals and in response producing as output a term which includes a plurality of exponential signals, each of the exponential signals corresponding to one of the input signals, the circuit comprising: a logarithm converter for performing a logarithmic conversion on the sequence of input signals to produce a sequence of binary log values, each of the binary log values having a plurality of bits and corresponding to one of the input signals; a first multiplexer responsive to the sequence of binary log values and generating a sequence of first intermediate values as an output thereof, the first multiplexer selecting a first bit slice from each of the binary log values; a second multiplexer responsive to the sequence of binary log values and generating a sequence of second intermediate values as an output thereof, the second multiplexer selecting second bit slice from each of the binary log values; a control unit, operatively coupled to the first multiplexer and the second multiplexer, the control unit decoding a plurality of exponent codes, each of the plurality of exponent codes corresponding to one of the sequence of input signals, the control unit applying the plurality of exponent codes to the first multiplexer and the second multiplexer; wherein the first multiplexer and the second multiplexer select the first bit slice and the second bit slice according to the corresponding exponent code; and means for arithmetically combining the sequence of first intermediate values and the sequence of second intermediate values to produce a sum; and an inverse-logarithm converter for performing an inverse-logarithmic conversion on the sum to produce the term, the inverse-logarithm converter providing the term on an output of the exponentiation circuit.

Claim 36

An exponentiation circuit receiving a sequence of input signals and in response producing as output a term which includes a plurality of exponential signals, each of the exponential signals corresponding to one of the input signals, the circuit comprising: a logarithm converter for performing a logarithmic conversion on the sequence of input signals to produce a sequence of binary log values, each of the binary log values having a plurality of bits and corresponding to one of the input signals; a first multiplexer responsive to the sequence of binary log values and generating a sequence of first intermediate values as an output thereof, the first multiplexer selecting a first bit slice from each of the binary log values; a second multiplexer responsive to the sequence of binary log values and generating a sequence of second intermediate values as an output thereof, the second multiplexer selecting second bit slice from each of the binary log values; a control unit, operatively coupled to the first multiplexer and the second multiplexer, the control unit decoding a plurality of exponent codes, each of the plurality of exponent codes corresponding to one of the sequence of input signals, the control unit applying the plurality of exponent codes to the first multiplexer and the second multiplexer; wherein the first multiplexer and the second multiplexer select the first bit slice and the second bit slice according to the corresponding exponent code; and means for arithmetically combining the sequence of first intermediate values and the sequence of second intermediate values to produce a sum; and an inverse-logarithm converter for performing an inverse-logarithmic conversion on the sum to produce the term, the inverse-logarithm converter providing the term on an output of the exponentiation circuit.

Claim 37

The exponentiation circuit of claim 30, wherein the combining means includes: a register for providing the sum as an output thereof; a first adder circuit having a first input responsive to the output of the first multiplexer and a second input responsive to the output of the second multiplexer, the first adder circuit generating an output; a third multiplexer for selecting either the output of the first multiplexer, the second multiplexer, or the first adder circuit according to a third mux signal generated by the control unit; a second adder circuit having a first input responsive to the output of the third multiplexer and a second input responsive to the output of the register, the second adder circuit generating the sum as an output and providing the sum to the register; and wherein the output of the first adder circuit is generated according to an enable signal from the control unit.

Claim 38

The exponentiation circuit of claim 31, wherein the control unit converts at least one of the sequence of second intermediate values to a signed two's complement form by providing a corresponding carry bit to the first adder circuit.

Claim 39

The exponentiation circuit of claim 31, wherein the control unit converts at least one of the sequence of second intermediate values to a signed two's complement form by providing a corresponding carry bit to the second adder circuit.

Claim 40

A computer system, which comprises: a memory for storing a program; an exponentiation circuit having an input and an output, the exponentiation circuit producing an exponential signal on the output in response to receiving an input signal on the input, the exponentiation circuit including: a logarithm converter for performing a logarithmic conversion on the input signal to produce a binary log value having a plurality of bits; a shift register for receiving the binary log value and shifting the plurality of bits a distance of n-bits to generate an intermediate value as an output thereof, wherein n is an integer; means for arithmetically combining the intermediate value and a stored value to produce a combined value; and an inverse-logarithm converter for performing an inverse-logarithmic conversion on the combined value to produce the exponential signal, the inverse-logarithm converter providing the exponential signal on the output of the exponentiation circuit; and a processor, operatively coupled to the memory and to the input and the output of the exponentiation circuit, the processor retrieving the program from the memory and executing the program, and as a result of executing the program, the processor transmitting the input signal to the input of the exponentiation circuit and subsequently retrieving the exponential signal from the output of the exponentiation circuit.

Claim 41

A computer system, which comprises: a memory for storing a program; an exponentiation circuit having an input and an output, the exponentiation circuit producing an exponential signal on the output in response to receiving an input signal on the input, the exponentiation circuit including: a logarithm converter for performing a logarithmic conversion on the input signal to produce a binary log value having a plurality of bits; a shift register for receiving the binary log value and shifting the plurality of bits a distance of n-bits to generate an intermediate value as an output thereof, wherein n is an integer; means for arithmetically combining the intermediate value and a stored value to produce a combined value; and an inverse-logarithm converter for performing an inverse-logarithmic conversion on the combined value to produce the exponential signal, the inverse-logarithm converter providing the exponential signal on the output of the exponentiation circuit; and a processor, operatively coupled to the memory and to the input and the output of the exponentiation circuit, the processor retrieving the program from the memory and executing the program, and as a result of executing the program, the processor transmitting the input signal to the input of the exponentiation circuit and subsequently retrieving the exponential signal from the output of the exponentiation circuit.

Claim 42

The computer system of claim 34, wherein n is an integer in the range of 0 to 3.

Claim 43

The computer system of claim 34, wherein the exponentiation circuit further comprises: means for storing the binary log value; a control unit, operatively coupled to the shift register, for applying an exponent code to the shift register; wherein the shift register generates a sequence of intermediate values in response to a stored binary log value, the shift register shifting the plurality of bits of each of the sequence of intermediate values a bit distance according to the exponent code; and wherein the combining means includes: an adder circuit for summing the sequence of intermediate values and the stored value to produce the combined value.

Claim 44

The computer system of claim 36, wherein the control unit converts at least one of the sequence of intermediate values to a signed two's complement form before the at least one of the sequence of intermediate values is received by the adder circuit, the control unit performing the conversion by inverting the at least one of the sequence of intermediate values and providing a corresponding carry bit to the adder circuit.

Claim 45

The computer system of claim 36, wherein the control unit includes: storage means for storing the exponent code.

Claim 46

The computer system of claim 38, wherein the processor transmits the exponent code to the storage means of the control unit.