DIGITAL ARITHMETIC CIRCUIT

Abstract: A digital arithmetic circuit (10) includes an inverting circuit (28) connected to a digital circuit (48) in which errors are to be detected. An operand input to the circuit (10) produces an output result in a first operation which is stored in a comparison circuit (82). The operand is inverted by the inverting circuit (28) on a second cycle of operation of the circuit (10) and the output result is compared by the comparison circuit (82) with that from the first operation. A non-zero result from the comparison indicates the occurrence of an error or errors in the operation of the circuit (10).

Description: DIGITAL ARITHMETIC CIRCUIT This invention relates to a digital arithmetic circuit and more particularly to such a circuit having error detection properties. Digital arithmetic circuits are widely used in many fields of activity. Electronic technology has progressed rapidly over the past decade, and integrated circuit and system technology has increased in complexity as a result. Increasing complexity presents a number of problems, but in particular it results in reduced reliability due to ageing, transient malfunctions in operation and production faults during manufacture. These problems increase as circuit and system complexity increases and device size continues to decrease. A further aspect of increasing circuit complexity is that it may not be economically possible to fully test all aspects of a complex circuit or system. Such a circuit or system may therefore be produced in a form giving rise to unidentified errors. Detecting circuit errors becomes increasingly important for safety- critical applications, such as aircraft systems. Methods of detecting errors are known, such as those employing Hamming codes as described in "Error Detecting and Error Correcting Codes", R W Hamming, Dell Systems Technical Journal, Vol 29 No 1 pp 147-160, January 1950. Hamming codes are parity check codes useful for checking data transmissions and storage. However, they have the important disadvantage that they are not preserved by arithmetic operations and cannot be used in arithmetic circuits. Codes which overcome the limitation regarding preservation in arithmetic operations are described in "Error Detecting Code, Self-Checking Circuits and Applications" , J Wakerly, Elsevier, North Holland Inc. 1978. A simple example is the so-called AN code. Here, input data words are multiplied by an applied multiplicand. Outputs which are not a multiple of the multiplicand can therefore be construed as containing errors. Arithmetic codes all require additional circuitry to carry out initial coding and error checking. Additionally, more hardware is needed to implement the arithmetic function because coded data words are longer than uncoded ones. Time redundant approaches to error detection have also been implemented. These methods require extra processing time compared with that normally required to perform the desired operation. Consequently, an operation which could be completed in one time unit-without error detection might take two time units or more if carried out in an error detecting system employing time redundancy. An example of time redundancy has been suggested by Patel and Fung ("Concurrent Error Detection in ALU's by Recomputing with Shifted Operands", J H Patel and L Y Fung, IEEE Trans, on Computers, Vol C-31, pp 589-595, July 1982). This involves calculating a given result twice whilst shifting the position of the bits of the operands between the first and second calculation. After realigning the two output results, any error introduced by the hardware will appear in a different position in the two output values, and will be detectable. This approach is applicable to circuits such as arithmetic logic units (ALUs) which are constructed in a modular fashion with little or no connectivity between modules. This has the disadvantage that extra hardware modules are needed to handle the shifted operand. The method of T H Chen et al ("Design of Concurrent Error-Detectable VLSI - Based Array Dividers", T H Chen, L 6 Chen, Y S Chang, Proc IEEE International Conference on Computer Design (ICCD), 1992) exploits circuit regularity to separate a circuit into two identical parts, each of which performs only half of the required calculation. Each part of the circuit is then used twice to generate two complete results which should be identical in the absence of errors. However, this approach is limited to circuits have regularity which enables separation for performing functions of calculations. It is an object of the invention to provide an alternative form of digital arithmetic circuit with error detection properties. The present invention provides a digital arithmetic circuit including means for supplying at least one input operand to the circuit characterised in that the circuit includes: (i) means for inverting at least one operand input to the circuit, and (ii) means for obtaining a comparison value from circuit outputs resulting from inverted and non-inverted operands to provide an indication of the occurrence or otherwise of an error in circuit operation. For the purpose of this specification the term "operand" is defined as a signed binary number on which an arithmetic operation is to be performed by the digital arithmetic circuit of the invention. The invention is appropriate for operands for which the sign of the operand is implicit in the bit representation of the number, ie there is not an additional bit indicating the sign. The invention is therefore appropriate for systems using complement representations of numbers such as 2*s-complement representation. The term "inverting" in relation to an operand means altering the sign of a number whilst retaining its magnitude. For a 2's complement number this involves changing all bits in the numbers from 0 or 1 to 1 or 0 respectively as appropriate, and adding 1 to the result. The terms "inverted" and "non-inverted" are to be construed accordingly. The invention has the advantage that it provides a means for error detection in arithmetic circuits which may be implemented simply compared to prior art circuits. Input operands are applied twice to the circuit and are inverted at the second application. The inversion enables errors to be detected when the two output results are compared by the comparison means. The invention provides the capability of detecting errors caused by circuit faults, both permanent and transient, which alter the logic value at a node of the circuit. It is also capable of detecting multiple errors. It is applicable to existing digital signal processing (DSP) circuits and may be used for self-testing Applications. The digital arithmetic circuit of the invention may provide an output value indicating the location of an error within the circuit. This facilitates error correction once the fault location has been determined. In a preferred embodiment the invention is arranged to produce a zero output from the comparing means when there is no fault in the circuit. A non-zero output indicates the occurrence of an error. In a further embodiment, the invention incorporates at least two like digital arithmetic circuits one of which is arranged to perform an operation on the operand and the other to perform a concurrent operation on the inverted operand. The invention will now be described in relation to the drawings in which: Figure 1 is a digital arithmetic circuit of the invention; Figure 2 is a timing diagram of the operation of the circuit of Figure 1; Figure 3 is a further embodiment of a digital arithmetic circuit of the invention in the form of a multiplier - accumulator; Figure A is a cell of the circuit of Figure 3; Figure 5 is a series of examples of the circuit of Figure 3 in error detection operation. Referring to Figure 1, there is shown a block diagram of a digital arithmetic circuit of the invention, the circuit being indicated generally by 10. The circuit 10 is arranged to receive two input numbers, A and B, not shown in Figure 1, which are both 2's complement numbers, and to add A and B to produce an output 2's complement sum S. A and B are four-bit numbers, with respective bits a 0 to a 3 andV b 0 to b 3 . Generally, A and B have bits a t and b j respectively (i ■ 0 to 3, j * 0 to 3) where i - 0 and j - 0 each represent a least significant bit (lsb) and i - 3 and j - 3 each represent a most significant bit (msb). Sum S is a five-bit number with respective bits s 0 to s 4 ; generally, S has bits s k where k - 0 and k - 4 respectively represent the lsb and msb of S. S has a fifth bit s 4 because addition of two four-bit numbers A and B may produce a carry bit. Numbers A and B are input to the circuit 10 on input lines marked 12, 14, 16, 18 and 20, 22, 24, 26 respectively, all of which are connected to an inverting circuit 28. Inverting circuit 28 has an enabling input 30. The inverting circuit 28 is arranged to generate outputs of -A and -B i.e, it inverts numbers A and B, when it receives an input signal on enabling input 30 which is high. The inversion of the signs of A and B is carried out by inverting each respective bit a and b and adding 1 to the respective resulting number. When the enabling input signal is low the output from the inverting circuit 28 is A and B; that is, the numbers A and B are transmitted through the inverting circuit 28 without any operation being performed on them. Output bits a 0 ,a 1 ,a 2 ,a 3t and b 0 ,b lf b 2 ,b 3 from the inverting circuit 28 are output on lines, 32, 34, 36, 38 and 40, 42, 44, 46 respectively. Lines 32 to 38 and 40 to 46 connect inverting circuit 28 to adder circuit 48. Adder circuit 48 is a binary ripple adder. It adds the 2's complement numbers A and B, or their inverted forms -A and -B, to produce a 2's complement result. Output bits s 0 , s- . , s 2 , s 3 and s 4 from adder circuit 48 are output on lines 50, 52, 54, 56 and 58 respectively. Output lines 50 to 58 connect adder circuit 48 to a group of clock-activated latches 60 in which one latch is allocated to each line. The latches 60 are arranged to pass their contents to output lines 62, 64, 66, 68 and 70 when the input clock signal is high and to retain these signal values on the respective latch outputs when the clock signal is low. A separate set of output lines 72, 74, 76, 78 and 80 are taken from output lines 50 to 58 respectively. These lines carry the output bits s 0 to s 4 from the adder circuit 48 when the inverter 28 has been enabled by enable input 30. Thus, when the circuit 48 outputs the sum of -A and -B the output on lines 50 to 58 are conveyed on lines 72 to 80 respectively. The output lines 62 to 70 and 72 to 80 are connected to a comparison circuit 82. The bits conveyed by these output lines are respectively the bits from the latches 60, and the bits from the adder circuit 48. The comparison circuit 82 compares the respective bits and produces a five-bit output, r 0 , r 1( r 2 , r 3 and r 4 . These bits are output on lines 84, 86, 88, 90 and 92. Output lines 84 to 92 are connected to a latch 94 which has an enabling input 96. The latch 94 has five output lines 98, 100, 102, 104 and 106. The latch 94 is arranged to receive bits on lines 84 to 92 and output them on lines 98 to 106 when enabling input 96 is high, and retain them when the enabling input is low. The operation of the circuit 10 will now be described with reference to the timing diagram of Figure 2. At the beginning of a cycle, at time t - 0, input numbers A and B are input on input lines 12 to 18 and 20 to 26. They are maintained on these lines for two clock cycles, ie. until time t - 4. The numbers A and B pass through inverting circuit 28 without inversion, as it is not enabled by input 30 at this time. Numbers A and B are thus input to adder circuit 48 on lines 32 to 38 and 40 to 46 respectively. Adder circuit 48 calculates the sum S : - A + B, and the result is output on lines 50 to 58. At the clock signal at t - 1 the value of sum S x on lines 50 to 58 is stored on latch 60. Thus the output from the latch 60 on lines 62 to 70 remains equal to the input S, on lines 50 to 58 until the next clock signal at t - 3. At time t - 2, the invert signal to enabling input 30 of inverter circuit 28 becomes high thereby enabling inverter circuit 28. Subsequently inverter circuit 28 generates numbers -A and -B which are output on Lines 32 to 38 and 40 to 46 respectively. Adder circuit 48 then calculates the sum S 2 - (-A) + (-B), which is output on lines 50 to 58, and consequently on lines 72 to 80 which are connected to lines 50 to 58. As a result, between times t - 2 and t - 3 the comparison circuit 82 has inputs equating to S x on lines 62 to 70, and S 2 on lines 72 to 80. The comparison circuit 82 compares the sums S j and S 2 by adding them ie it is an adder circuit, and the result is output on lines 84 to 92. Between times t - 2 and t - 3 the signal on enabling input 96 of latch 94 goes high. Subsequently the comparison of Sj and S 2 is output on lines 98 to 106 and remains on these lines between times t - 3 and t - 4. The circuit 10 detects errors in its operation in the following manner. If the circuit 10 is operating without errors then the output on each of lines 98 to 106 is zero. This is because the comparison circuit 82 adds S t and S 2 , which is equivalent to adding (A + B) to ((-A) + (-B)) which equals zero. However, if there is an error in the circuit 10 then one or more of the output bits from the comparison circuit 82 may be a 1. Generally, at the end of the first pass through the circuit 10, ie. at t » 2 before A and B have been inverted, the output from latch 60 is S, - A + B + e* (1) where e' is a value introduced by an error in the first pass. When there is no fault e' is zero. After the second pass, ie when A and B have been inverted, the output from the adder circuit 48 is S 2 - -A -B + e" (2) where e" is a value introduced by a fault in the second pass. When there is no fault e" is zero. The output from the latch 94 after t - 2 is then S 2 - (A + B + e') + (-A -B + e") e' + e" (3) If the value of (e' + e") is non-zero then an error is present in either S j or S 2 or both. It must be noted that the value of (e' + e") may also be zero if a fault is present. The following examples demonstrate the operation of the circuit 10 in detecting faults. In these examples the numbers A and B are 1011 and 0111 respectively. These are 2's complement representations of the numbers -5 and +7. Their inverted forms -A and -B are 0101 and 1001 respectively. In the absence of errors the results from the first and second passes through the circuit are S t - 00010 and S 2 - 11110. These are the 2's complement forms of +2 and -2 respectively. Example 1 - No faults 1st Pass 2nd Pass Comparison (output on lines 98 to 106) A - 11011 -A - 00101 Sj , - 00010 B - 00111 -B - 11001 S, - 11110 S ! - 00010 S, - 11110 00000 In this example the output from the circuit 10 is equal to zero, which implies that no errors have arisen in the circuit 10. Example 2 - Bit b l is stuck-at-1 1st Pass 2nd Pass Comparison A - 11011 -A - 00101 S t - 00010 B - 00111 -B - 11011 S 2 - 00000 S, - 00010 S, - 00000 00010 In this example one of the lines carrying bit b λ is stuck at 1. This results in an error being produced in the second pass through the circuit, but not during the first pass as b x already has value 1 in the first pass. The comparison of the results from the two passes produces a non-zero result, 00010, on output lines 98 to 106, indicating that a fault has occurred. Example 3 - Bit a 0 is stuck-at-0 1st Pass 2nd Pass Comparison A - 11010 -A - 0010.0 S x - 00001 B - 00111 -B - 11001 S 2 - 11101 S, - 00001 S, - 11101 11110 Example 2 shows the effects of the line carrying bit a 0 being stuck at 0. This produces an error during both passes through the circuit 10. The comparison of the results from the two passes again produces a non-zero output result, 11110, on output lines 98 to 106 which indicates the occurrence of a fault. Example 4 - Carry bit in Adder 48 is stuck-at-0 In this example a carry bit resulting from the addition of a j and b lt and any carry from the addition of a 0 and b 0 , is stuck-at-0. 1st Pass 2nd Pass Comparison A - 11011 -A - 00100 S j - 11110 B - 00111 -B - 11001 S 2 - 11110 S, - 11110 S 2 - 11110 11100 An error is caused in the first pass only. Again, the presence of an error is indicated by the non-zero comparison results . From the above it can be seen that all of the errors in the Examples 2, 3 and 4 produce different results in the comparison of S t and S 2 . Consequently, when a fault occurs the resulting comparison value may provide an indication of the location of the error within the circuit 10. Referring to Figure 3, there is shown a schematic diagram of a digital arithmetic circuit of the invention in the form of a 2*s complement multiplier-accumulator circuit, indicated generally by 210. The circuit 210 is arranged to receive as inputs 2's complement numbers X, Y and Z, and produce an output P where P - XY + Z. The numbers X,Y and Z are four- bit 2's complement numbers, with respective bits x 0 to x 3 , y 0 to y 3 and z 0 to z 3 . P is an eight-bit 2's complement number represented by bits p 0 to P7- The circuit 210 incorporates four rows of multiplier-adder cells 212 indicated by circles, each row having four such cells. The cells 212 are also arranged in four columns. The cells bear subscript indices i,j indicating column and row positions; ie. cell 212 tj is the j th cell in the i th column (i - 0 to 3, j ■ 0 to 3). The column index i increases in the right-to-left direction, so that cells 212 0j (j - 0 to 3) are the rightmost cells. Similarly, row index j increases in the top-to-bottom direction, so that cells 212 i0 (i - 0 to 3) are the topmost cells. The columns are skewed such that the cell 212^ is located below cell 212 i+1> ^ l ie a cell in row i is displaced from the cell in row (i-1) in the same column by one cell in the left direction. The cells 212 are connected to their respective column neighbours by connections such as x, and to their row neighbours by connections such as y. They are also connected to their neighbours in the next highest row by connections such as s. For example, cell 212 22 is connected to cell 212 31 by connection s 31 . Not all connections of the kind x, y and z are referenced to reduce illustrational complexity. A carry input, carry j is input to the right most cell 212 0j of each row. This input has the value 0 for each of rows j - 0, 1 and 2, and the value 1 for row j - 3. Each cell 212 in each row has a carry connection, such as c n , to its neighbouring cell 212 in the row. Additionally, cells 212 30 , 212 31 and 212 32 have carry connections c 30 , c 31 and c 32 to the next lower cell 212 in the same column i - 3; ie the connections are to cells 212 31 , 212 32 and 212 33 . Cell 212 33 has a carry connection c 33 to a half adder 214. The half adder 214 has an input 216 which is set at 1. The circuit 210 has eight outputs. Each output is a bit in the 2's complement output P. They are denoted by lines p 0 to p 7 . Lines p 0 to p 3 are outputs from cells 212 00 , 212 01 , 212 02 and 212 03 ; ie they are outputs from each cell in the column i - 0. The outputs p 4 to p 6 are outputs from the cells 212 13 , 212 23 and 212 33 ; ie. they are outputs from the cells 212 in the columns j - 1,2 and 3. Output p 7 is an output from the half adder 214. The cells 212 in the top row, j - 0 receive inputs corresponding to the 2's complement numbers X and Z is input to the cell 212 10 corresponding to the respective bit designation. For example, bits x 2 and z 2 are input to cell 212 20 . Similarly, bits t and aj are input to cell 212 10 . The cells in the rightmost column, i - 0, receive inputs corresponding to the 2's complement number Y. Each bit y 0 to y 3 is input to the cell 212 0j corresponding to the respective bit designation. For example, bits y ! and y 2 are input to cells 212 01 and 212 02 . Referring to Figure 4, there is shown a schematic diagram of the logic and connections of a cell such as 212^. Each cell 212^ has two components: an AND gate 300 and a full adder 302. Each AND gate such as 300 has two inputs: an input from a diagonal line x and a transverse input from line y. Line x forms a column through- interconnection to cell 212 tj from cell 212 i> i _ 1 through to cell 212 ltj+ ι. Similarly, line y forms a row through-interconnection to cell 212 ij , from cell 212 1 _ itj through to cell 212 i+1)j . Consequently bits on lines x and y are passed to all cells 212 in their respective columns and rows simultaneously. The adder 302 receives a sum input s from above and a second input consisting of the output of the AND gate 300. It also receives a carry bit input at c from the right and generates a carry bit output at c ' to the left. The lines x and y provide bits from numbers X and Y. Each AND gate 300 "ANDs" the bits on lines x and y connected to it. It produces a partial product of these bits providing an input to the full adder 302, which receives a second input from the line s and a third input from the carry line c. For cells 212 in rows for which j > 0, the input lines s are connected to cell 212 t ι and each provides a respective bit from its diagonally above neighbour cell 212 i+ ι tj _ι. The carry line c provides a carry bit from cell ∑l∑i.^ j in the same row. The full adder carry output c' provides a carry bit to the next cell 212 i+lιj in the row where available. Its sum output s* provides a partial sum for input to the next cell 212^^ j+1 . The input bit z 3 to cell 212 30 is inverted. This is because it is the most significant bit (msb) of the two's complement number Z and has a negative weight. Cells 212 30 , 212 3 ι, 212 32 , 212 23 , 212 13 and 212 03 have a NAND gate (not shown) replacing AND gate 300. This is because these cells 212 involve the interaction of sign bits such as x 3 with non-sign bits and produce partial products with negative weights. The replacement of AND gate 300 with a NAND gate inverts the partial product prior to summation by full adder 302. The operation of the circuit 210 will now be described. Bits x 0 to x 3 corresponding to number X are input to the circuit 210 via the respective cells 212 i0 at the top row, as previously described. Bits y 0 to y 3 are input via cells 212 0j on the right hand side of the circuit 210. The bits x 0 to x 3 are also passed to the remaining cells in the respective input column via cell 212 interconnections as previously described. Similarly, bits y 0 to y 3 are also passed to remaining cells in the respective input row, also as described. Consequently each bit of number X forms a partial product with each bit of number Y in the cells 212 of the input column. For example, bit x 2 forms partial products with y 0 in cell 212 20 ; with yj in cell 212 21 ; with y 2 in cell 212 22 ; and with y 3 in cell 212 23 . Bits z 0 to z 3 corresponding to number Z are also input to the circuit 210 via respective top row cells 212 10 , as previously described. In the cells 212 i0 each bit z 0 to z 3 is added in a full adder such as 302 to the partial product from the bits y 0 with o to x 3 . From the above it can be seen that the function of the circuit 210 is to multiply together numbers X and Y, forming partial products in cells 212, and add a third number Z. The various partial products are summed within the cells 212, flowing from top to bottom on output lines such as s*. The final product is the value P - XY + Z which appears at output lines p 0 to p 7 as previously described. Error detection in the circuit 210 will now be described. Figure 5 shows three examples of the operation of the circuit 210. For clarity, the cell designations have been removed. The number in each cell circle corresponds to the partial product calculated in that cell. The numbers on the horizontal output lines from the cells are respective cell carry output values; and the numbers on the vertical lines are the partial sum bit outputs corresponding to s'. The examples of Figure 5 illustrate the operation of the circuit with operands values as follows: X - 6 (0110), Y - -4 (1100) and Z - -7 (1001). The value of P output from the circuit is P - 11100001. For error detection the value of -P is generated. To achieve this the input operands X and Z are inverted, but not Y. Alternatively, Y and Z could be inverted leaving X unchanged. The operand values for the inversion of P are then as follows: -X - -6 (1010), Y - -4 (1100) and - C - 7 (0111). Example 1 illustrates the operation of the circuit 210 with no errors present. In this example the output -P is equal to 00011111. The addition of P and -P produces a sum of 00000000, indicating no fault has occurred. Example 2 illustrates the operation of the circuit 210 with an error in cell 212 π . Here the partial product is stuck-at-1. This results in the output P being 11100101. On the second pass through the circuit, with operands inverted, the output -P is 00100011. The sum of P and -P is therefore equal to 00001000. As the sum is non-zero there is an indication that a fault has occurred. Example 3 illustrates the effects of two errors occurring simultaneously. Here z 0 is stuck-at-0 on input and output p 6 is stuck-at-1. The error introduced by z 6 stuck-at-0 causes an error on both passes whereas p 6 stuck-at-1 causes an error only during the second pass. The result is that output P on the first pass is 11100000, and output -P on the second pass is 01011110. The sum of P and -P is 00111110, again indicating the occurrence of an error. As for the circuit 10, a non-zero summation of the outputs with operands unchanged and then inverted provides an indication that a fault has occurred. Additionally, the actual value of the summation may provide an indication of the location of the fault. As for circuit 10, the error detection is carried out by time redundancy, ie by making two passes through one circuit. It is also possible to achieve error detection using hardware redundancy, ie by having two or more circuits such as 210 arranged to calculate -P with inverted operands. This would enable error detection to be carried out without loss of processing time. The error detection scheme described may be operated on any circuit with multiple operands at least one of which may be inverted. The error detection scheme may also be operated on circuits using signed binary number representation (SBNR). The invention may also be used for providing a non-zero summation value in error-free operation. For example, a circuit output Y representing an incremental addition to an input operand X is given by Y - X+l. Inverting X on a second pass produces an output Y - -X+l. A comparison of outputs from first and second passes produces a summation S - (X+l) + (-X+1) which is equal to 2 for error-free operation. In this example an error in circuit operation is detected when the comparison value is a number other than 2.

Claims: CLAIMS 1. A digital arithmetic circuit including supplying means (12 to 18) for supplying at least one input operand to the circuit (10) characterised in that the circuit (10) includes: (i) means (28) for inverting at least one operand input to the circuit (10), and (ii) means (82) for obtaining a comparison value from circuit outputs (98 to 106) resulting from inverted and non-inverted operands to provide an indication of the occurrence or otherwise of an error in the circuit operation. 2. A digital arithmetic circuit including input means (12 to 18) for supplying at least one input operand thereto characterised in that the circuit (10) includes: (i) inverting means (28) for inverting at least one operand input to the circuit (10), and (ii) comparing means (82) for comparing circuit output signals corrsponding to inverted and non-inverted operands to provide an indication of the occurrence or otherwise of an error in circuit operation. 3. A circuit according to claim 1 or 2 characterised in that it is arranged to compute circuit output signals for inverted operands concurrently with the calculation of the circuit output with non- inverted operands by another like circuit. i. A circuit according to claim 1 or 2 characterised in that it is arranged to generate an output from inverted operands at a different time to generation of an output from non-inverted operands. 5. A circuit according to any preceding claim characterised in that it is arranged to provide a non-zero comparison value in response to occurrence of an error in circuit operation. 6. A circuit according to any one of claims 2 to 5 characterised in that the input means (12 to 26) is arranged to supply at least two input operands. 7. A circuit according to any preceding claim characterised in that the input operands are 2's complement numbers. 8. A circuit according to claim 7 characterised in that the circuit is arranged to add together the input operands. 9. A circuit according to claim 7 characterised in that it is arranged as a multiplier-accumulator circuit (212). 10. A circuit according to any one of claims 2 to 9 characterised in that the comparing means is arranged to provides an indication of location of a fault within the circuit. 11. A circuit according to any preceding claim, characterised in that it is arranged for signed binary number representation (SBNR) operation. 12. A method of detecting errors in operation of a digital arithmetic circuit (10) including the steps of: (i) supplying at least one input operand to the circuit (10); (ii) inverting the at least one input operand; and (iii) comparing circuit outputs resulting from inverted and non- inverted operands to provide a comparison value indicative of the occurrence or otherwise of an error or errors in circuit operation. 13. A digital arithmetic circuit for detecting errors in circuit operation.

Inventors: EVANS RICHARD ANTHONY, EVANS, RICHARD, ANTHONY
Applicants: EVANS RICHARD ANTHONY, SECR DEFENCE, EVANS, RICHARD, ANTHONY, THE SECRETARY OF STATE FOR DEFENCE
Application year: 1995
Main classification: G06F11
IPC codes: G06F7, G06F11