A METHOD FOR PERFORMING ARITHMETIC, LOGICAL AND RELATED OPERATIONS AND A NUMERICAL ARITHMETIC UNIT

Abstract: The invention relates to a method and a device to perform arithmetical, logical and related operations on numerical value elements. An input list is provided including the numerical value elements to be processed, and instruction information. An operation on the numerical value elements on the input list is directly controlled and performed using the instruction information. Each numerical value element providing a word has a predetermined bit length. The maximum number of words is the same as the maximum providable number of elements in the input list. A calculation is performed by rewriting the elements in the input list. The result is presented as an output list.

Description: A method for performing arithmetic, logical and related operations and a numerical arithmetic unit This invention relates to a method for performing arithmetic, logical and related operations on numerical value elements and a numerical arithmetic unit (ALU) in a processor. BACKGROUND OF THE INVENTION The arithmetic logic unit in a computer is the unit in which arithmetical, logical, and related operations are performed on elements of information. The operations are provided in accordance with arithmetic instructions given to the ALU. Most conventional ALUs cooperate with accumulators and/or buffer registers or other kinds of registers for temporary storing of values. OBJECTS OF THE INVENTION The main object of the invention is to provide a method or an ALU which reduces numerical expressions in an easy way. Another object of the invention is to provide an ALU that functions without cooperation with a temporary storage during its operation. Still another object of the invention is to provide an ALU which uses arithmetic instructions in the information given to it for its operation. A further object of the invention is to provide an ALU being able to handle floating-point values as operands having a controllably variable partition between mantissa and exponent. A further object of the invention is to provide an ALU being able to handle bit information on buses having floating-point values as operands and a code field giving information on partition between mantissa and exponent. A still further object of the invention is to provide an ALU being able to handle arithmetic instructions given for its operands on buses which instructions are provided in a code field of variable code length. A further object of the invention is to provide an ALU having co-variation between interpretation as floating-point number and as integer. A density of the code is also wanted. SUMMARY OF THE INVENTION In order to implement at least the main object mentioned above the invention contemplates generally a method to perform arithmetical, logical and related operations on numerical value elements, including the following steps: a) providing an input list including the numerical value elements to be processed, and instruction information, b) directly controlling and performing an operation on the numerical value elements on the input list using the instruction information, c) each numerical value element providing a word having a predetermined bit length, the maximum number of words being the same as the maximum providable number of elements in the input list, d) the processing device performing a calculation by rewriting the elements in the input list, e) presenting the result output list from the processing device. Preferably the maximum number of elements in the input list and output list are four. One list element could then be provided with an instruction word representation, two list elements could be provided with each one of two numerical value representations and one could be used to be provided with an intermediate calculation result during a calculation made by recycling the rewriting of the input elements several times. The list preferably includes a function application in which one of its elements is an instruction code and the rest are arguments to the instruction. An instruction is performed by rewriting and recycling the instruction code from the result output list to the input list until an eventual result is reached. At each rewriting, the list could be rewritten to include a revised instruction code word, if appropriate for the actual calculation, followed by value words if appropriate. It is appropriate to have the numerical value words provided in a coded form before actual processing. Preferably, the words representing numerical value words are provided with a coding setting the numerical values into a dense representation, i.e. every coded representation of a value corresponds to only one interpreted value. A first coding could be provided on a binary word representing an integer value. A second coding could be provided on a binary word representing a floating-point value. The codings are preferably such that after coding floating-point value representations are provided in the same order as integer value representations. In this way neither of the representations need be in binary digit form. A hardware could be provided to make computation on the transformed bit patterns just implicitely by following given rules, i.e. without knowing how the inter¬ pretation has been made. An easy way to accomplish a floating-point value representation having a variable exponent width is to let the binary coded floating-point value representation include a code field, an exponent field and a mantissa field, the code field having an indication on a division position between the exponent field and the mantissa field, such that the exponent and mantissa fields have variable lengths. The dense representation could be provided by including a virtual "1", i.e. a "1" not provided physically in the representation, in front of a field of the word for the mantissa part of the floating-point value representation. Below follows a list on expressions used in this specification and their reserved meanings: closure a hierarchically structured entity which defines a process. All closures have a root which uniquely defines the closure. The reduction work in a reduction machine is made on closures. The whole state of the machine is transformed by the reductions. goal a closure to be executed, i.e. reduced. group a group consists of four binary digits. Each word consists of a number of groups. slice a piece of one or of several words. A slice containing two bits can for example consist of the least significant bit from two words. align to make sure that the bits to be used are positioned correctly in a word. redundancy data or bits that are added for error detection purposes. normalized code a floating point value that is represented in such a way that the most significant bit of the mantissa is a virtual "1 H for positive values and a virtual H 0 M for negative values. binary representation a combination of "0" and/or "1" representing a number in any numerical system or code. binary digit form the numerical system with base 2. H-code a specific code, used in the ALU according to the invention, for representing numbers. Also called H- value. integer H-value a specific code for representing integer values. floating point H-value a specific code for representing floating point values. dense representation every binary combination (bit pattern) corresponds to one unique numerical value. BRIEF DESCRIPTION OF THE DRAWINGS For a more complete understanding of the present invention and for further objects and advantages thereof, reference is now made to the following description taken in conjunction with the accompanying drawings, in which: FIG. 1A is a schematic diagram of the ALU according to the invention, FIG. IB is a diagram of clock signals and some basic control signals for the ALU shown in FIG. 1A, FIG.2 is a schematic block diagram of an embodiment of the ALU according to the invention, FIG. 3 is a schematic representation of the bit field partition in an arithmetic representation, FIG. 4A is a graphical representation of a code for integers, FIG. 4B is a graphical representation of a code for floatingpoint values, FIG. 4C is a schematic representation for explaining the set up of an arithmetic representation provided on a 7 bit bus, FIGs 5A to 5D shows a data list provided in accordance with FIG. 4, FIG. 6 is a circuit diagram of an embodiment of the ALU according to the invention, FIG. 7A to C show an embodiment of an input/output buffer of the numerical ALU according to the invention in different clocking sequences FIG. 8 shows exemplifying diagrams of output combinations from an SUBSTITUTE SHEET operand unit included in the circuit shown in FIG. 6 together with mnemonics used for the control of an element included in the operand unit for providing the different output combinations, FIG. 9 shows the outputs from a precision decoder included in the circuit shown in FIG. 6 for a word on one of the input buses given as an example, FIG. 10 shows an example of different interpretations of a binary mantissa bit combination given as an example, FIG. 11 and 12 show diagrams supporting the description of an example of an addition of two floating-point numbers, FIG. 13 is a circuit diagram of an embodiment of a precision decoder included in the circuit shown in FIG. 6, FIG. 14A shows a block diagram of an embodiment of a full word adder in the circuit shown in FIG. 6, FIG. 14B shows a block diagram of a precision slice in the adder in FIG. 14A, FIG. 14C shows a block diagram of a bit slice in the precision slice in FIG. 14B, FIG. 15 shows an embodiment of a precision slice in an incrementer in the circuit shown in FIG. 6, and FIG. 16 shows a circuit diagram of an embodiment of a basic selector bit slice included in the selectors in the operand circuits in the circuit shown in FIG. 6. DETAILED DESCRIPTION OF THE INVENTION FIG 1A The numerical arithmetic logic unit ALU, schematically shown in FIG. 1A, includes a control drive unit la and an arithmetic unit array 2a performing the arithmetic on particular in/outputs V Q , v l' v 2 anc v 3' eacn being a bus having multiple (M) transmission lines, transmitting a M bit value, M being for instance 32. The ALU is preferably a part of a central processing unit (CPU) and is externally controlled by a control unit CU. The ALU communicates with the external control unit CU with the following signals: a clock signal input C- j g jjr a busy output BUSγ , a control input -A fl L' a state output Ag^^g, and a decoded instruction output A INS . The bus in/outputs V Q , *^, V2, V3 could be connected to particular registers, called goal registers or G-registers, in a structural arithmetic unit (not shown) , below called core processor, in which instructions of reduction type are processed. However, the bus in/output signals could also be provided by means of another kind of arrangement cooperating with a computing device, preferably of reduction type, but other types of computing devices are also quite possible. Also, even though the number of in/output busses V Q , V^, V2, V3 is shown to be four in FIG. 1A the number could be chosen arbitrary. However, the complexity of the ALU increases substantially with the number of in/output buses V Q , V-^, V2, V3. The in/output buses V Q , V-^, V2, V3 transport a list of words. A word is a numerical value or an instruction. All buses might not be in use everytime. A word on a bus not in use may be disregarded. The input and/or output list has a maximal length, i.e. includes a maximum number of words, for instance four, i.e. one list element per in/output bus. A numerical value is a word, which is transported on several wires. Also, an instruction on a bus is a word. It is the input list on the in/outputs Q , V*^, V2, V that is used for controlling and performing a computation, i.e. the list includes an information about the kind of computation to be provided and features of the value to be computed, and the control drive la derives this information from the list while controlling the different components in the array 2a. A computation is provided by rewriting the contents in an input list in a bit or bit group wise way, i.e. for the bits having the same position in a word separately or for groups of bits provided "slice wise" in a word, and to provide the result as an output list. It is to be noted that it is possible to have a recycling of the values several times through the internal circuits before a final output list is presented on the output. During recycling a momentary output list is presented at the output but only to be inserted as a momentary input list. The list may include a function application together with values to be processed or other type of list, such as a list only including at least one integer value, or floating-point value. When it includes a function application the first list element provided on the in/output VQ includes the instruction code, i.e. information of the kind of processing that should be made, and the rest of the list elements are arguments to the instruction, as will be described in further detail below. An instruction is performed by rewriting the instruction in one or several steps in order to obtain the result eventually. Microinstructions and state signals are used inside the ALU. These are used by the separate control drive la inside the ALU to control the array 2a. When a rewriting directly leads to the result, the value is placed in the output list. When a stepwise rewriting is made, the list is rewritten to keep the same instruction code, or to have a new or slightly changed instruction code, and to have the instruction code in most cases followed by a value or values. It is to be noted that the best mode of making the rewriting operation in several cycles is to keep the instruction code intact during the whole operation, because the control unit will be less complicated in such a case. However, it could also be convenient to have one kind of instruction code at the start of a multi cycle operation and to have this instruction code slightly changed during the rest of the cycles or the like. Returning to FIG. 1A, the clock signal is used to give clock pulses to the arithmetic logic unit ALU, and the ALU specifies when it is ready to accept clock pulses with a signal ready on the output A BUS y. The bus in/outputs Q , V*^, V2, V are connected to the main register cells in a goal register, the in/outputs having instruction or numerical content. The numerical content is preferably given to the ALU in a coded form, being different depending upon if the numerical content represents a floating-point value or an integer. Each goal register cell contains as many bits as each in/output (i.e. 32 bits in the example shown) of numerical value, but also several bits, for instance 6, in which tags are set. These tags are not included in the information provided on the bus in/outputs in the embodiment to be regarded as the best mode of invention. Instead, the tag information is fed to the external control unit CU, and the unit CU controls in turn the ALU control unit la. However, it is within the scope of invention to have the tags included in the information provided on the in/output such that the tag information is fed directly to the control drive unit or ALU control. This could also be the best way to drive the ALU according to the invention when it is used as a unit cooperating with a processor of conventional *type. The control input A NTL is used to control the numerical operation of the ALU. The operation may take several clock cycles . An output Ag TATE is returned to the control unit €U after each operation. The instruction code on the output A INS is a compaction of the instruction code in the goal core cell to which the bus Q is connected. FIG IB Referring to FIG. IB, the basic clock provided by the control unit CU for the processor is C lfQ , for instance having a period of 10 ns. An ALU operation is performed in one or several such clock cycles. The core processor that is connected to the ALU could be controlled with a period which is longer than, for instance twice, the period for the ALU, i.e. with the clock signal C 2Q having a period 20 ns if C 10 has the period 10 ns. However, instead it is also possible to have it controlled with a period which is shorter. The basic control signal C j -^y for the device having the shorter period (i.e. the ALU in the embodiment shown, or otherwise the core processor) is therefore stretched at the end of an instruction in order to synchronise with the clock signal C 2 Q having the longer period. The ALU returns a high signal BUgγ as long as it needs more clock cycles of the type C-^ Q to perform an instruction. The stretching is provided after that the signal A BUSγ has become low, as apparent from FIG. IB. FIG 2 The embodiment of the invention shown in FIG. 2 includes an ALU control circuit 10 as a central element making conversions and combinations of signals at its inputs suitable for circuits to provide the output list elements. The ALU control circuit 10 includes a kind of boolean gate array. FIG 2 corresponds to the right hand side of FIG 1A. The in/output buses Q , V^ V2, V3, each being a multi-wire bus having for instance 32 wires, are connected to the inputs of an input buffer circuit 11. The buffer circuit 11 is clocked by a clock signal on its clock input to transmit its input signals to the internal input buses An output buffer 16 is clocked by an inverse clock signal on its clock input for transmitting the information on output buses QQut , lout , v 2out , v 3out to tιe in/output buses V Q , V-^, V2, V . Even though the buffer arrangement 11 and 16 is shown to include two separate buffers in FIG 2 the buffer arrangement 11 and 16 is preferably a combined input/output buffer circuit. A number of computing circuits 12A to 12N, N being the number of circuits, are connected to at least two of the internal input buses each making an individual kind of simple computing, such as addition or subtraction in different constellations, of the information on the internal input buses v 0i' v li' v 2i' v 3i to wn i cn they are connected. The computing circuits 12A to 12N are quite time saving, because they could be chosen such that every possible simple computing to be needed for the application in which the ALU according to the invention is a part could be provided stand by at once. The ALU control circuit 10 could then just chose to directly take the output from the suitable one(s) among the computing circuits for each particular kind of operation for further processing purposes. The size of each computing circuit is small and it is not particularly power consuming. Thus, it does not matter to have several circuits making parallel computing even though the output of only one of them is used at the time. The outputs of the computing circuits are fed to operand units OP^ and OP2 as will be described below. Also, the signals from the units 12A to 12N could in some cases be used for control. Each computing circuit 12A to 12N has a second output, on which a carry signal is provided which is used to indicate overflow. This second output is fed to an individual input of the ALU control circuit 10. The units 12A to 12N are controlled by the ALU control circuit 10 and by other circuits in the ALU giving information of the kind of word which is represented on its inputs, i.e. for example if the word represents a number, and if so, if the number is an integer or a floating-point number, and, if it is a floating-point value, information regarding the properties of this number, as will be described further below. A number of monitoring circuits 13A to 13M, M being the number of circuits, are each connected to at least one individual among the input buses The monitoring circuits could for instance monitor the significance of the information of the buses or compare the information of the buses. Some of the montoring circuits could be provided with the same controlling information as the circuits 12A to 12N, as illustrated only for the circuit 13A. The outputs of the monitoring circuits 13A to 13M are fed to inputs of the ALU control circuit 10. Three to four property giving circuits 14A to 14D are connected to at least the buses and and derives information from a part of the buses giving information regarding the properties of the rest of the information on the buses. The property giving circuit 14D connected to the bus derives at least the least significant binary digit on the bus v 3i for the multiplication case, as will be described further below. A property giving circuit 14A could be connected also to the bus v Qi to derive some predetermined information in the case an information on an external control bus EXT to the ALU control drive circuit indicates that the information on the bus VQ A represents a number. For instance, if the information on a bus is a floating-point value, the property giving circuit connected to the bus gives the information regarding the sign of the value, the sign of the exponent and some mantissa bits, for example the most significant. It is to be noted that, when a property giving circuit 14D is provided, the kind of properties delivered from and fed to one input of the circuit ALU control circuit 10 need not be the same as from it could for instance be less complicated. The same reasoning could also be due for the property giving circuit 14A for the bus Q ^. The ALU control circuit 10 provides an output Ag TATE to the external control unit CU (see FIG. 1A) essentially of its inputs from the units 12A to 12N and 13A to 13M. An instruction circuit 15 is provided for monitoring the total information on the bus V Q J in order to give decoded instructions regarding operations to be made to the ALU control drive circuit 10. As shown in FIG. 2, the information on the bus V Q ^ could be fed directly to an output bus Qout connected to the output buffer 16, preferably in the form of a bus connection in a combined input/output buffer 11, 16, inversely clocked by the clock signal, as mentioned above. It is convenient to let this bus have the instruction list element and not to change this instruction list element. Other output buses v lout , 2 0ut , v 3 0u ^ rom tne ALU are also connected to the buffer 16, and the information on all the output buses are clocked out to the in/output buses V , V^, v 2' v 3 simultaneously. The ALU control circuit 10 provides control signals cl, c2, c3, c5 to the other circuits in the ALU. However, it is also possible to have at least a part of the bus V Q ^ connected to the ALU control 10, which could make some changes in the dependence of the actual cycle in a multiple cycle operation and to feed the changed instruction list element to the bus V QQut (not shown) . Two operand units OP j and OP 2 of essentially the same kind provide the outputs lout and v 2out , respectively. It is not necessary, but practical, to have two operand units as in the embodiment shown in FIG. 2. Different numbers of operand units, from only one to several, could be used for different applications of the ALU according to the invention. However, only one operand unit is needed in order to make an addition or a subtraction, because this kind of operation is accomplished in one of the circuits 12A to 12N and is provided on one of the inputs of the operand unit and can be provided on the output of the operand unit at control from the ALU control circuit 10. Several operand units could be used in order to make several different kinds of addition and subtraction operations simultaneously. It is to be noted that each operand unit has an output bus out , where i stands for an arbitrary number, and that therefore the number of in/output, input and output buses is dependent of the number of operand units in the ALU. An operand unit OP3 of another kind could be provided to be used in connection with multiplication or division operations and feeds its output on the output bus V3 Qut . The multiplication and division operations are executed in several cyclic steps. The output of the operand unit OP3 is 3 Qut . It is to be noted that there could be a different number of operand units OP3 than one as well. Regarding floating-point arithmetic, as mentioned above and will be discussed further in detail below, the length of the exponent is chosable, at least in steps, at least in one embodiment of the invention. Therefore, a precision decoder PD*^ and PD 2 , respectively, is provided for each one of the operand units OP^ and OP 2 . The precision decoder provides control signals to the operand unit to which it belongs regarding the length of the exponent part. This may be derived from a particular code field in the binary word as will be explained further below. It may also provide control signals to other parts of the ALU circuit, as mentioned above. The information to the ALU regarding if a value is an integer or a floating-point value is preferably provided on a control input EXT of the ALU control circuit 10 by the external control unit CU (see FIG. 1A), but could alternatively be derived from the buses v 0i to v 3i' As apparent from the above it is convenient to let the input buses have different but welldefined tasks in arithmetic computation. Therefore, either the input buses are provided with information having the stated defined tasks directly from the feeding arrangement, such as the goal register mentioned above, which is to be preferred, or the ALU will itself change the information on the input buses to be the appropriate by an internal cycle and then using information on the bus V Q ^ regarding the information on the other buses. The bus v Qi could have a data field having the information regarding the kind of information on the list provided on the in/output buses V Q , V-^, v 2 , V3. However, this information could also be provided from the external control unit CU. As apparent from the above the ALU according to the invention has no internal memory. This leads to that the result of each cycle of a multicycle operation is influenced only by the output of the result of the next preceding cycle, which is the input adapted to be processed. As mentioned above one purpose to be desired for the ALU according to the invention is to have a varying division between the exponent and the mantissa in a floating-point representing system. Then, on the first hand it is possible to have many bits in the mantissa for small numbers, which gives the advantage of having a high precision. On the other hand extremely high numbers could be handled. EXAMPLE REGARDING MULTIPLICATION OF INTEGERS In order to give briefly an understanding of the operation of the ALU according the invention an example is given here regarding a multiplication of two integers. Further on examples will be given regarding the operation of the ALU when calculating floating-point values. A multiplication of integers could for instance be provided in the following way. During the first cycle the two figures to be multiplied are provided the one on the input bus 2 and the other on the bus v 3 . The bus v has the information "0". One of the operand units of the first kind, for instance OP lr is controlled to transfer the information on V2 directly to its output. The other of the operand units, OP2 is controlled to displace the information on V2 one step to the left and present the displaced result on its output. During the next cycle the first mentioned of the operand units, OP lr is controlled to transfer the information from the one of its inputs connected to one of the circuits 12A to 12N making an addition of the figures on the buses j ^ and 2 ^. The other operand unit, 0P 2/ is controlled to take the information on the bus V2 and displace it one step to the left, and present it to its output. For each cycle thereafter, the first mentioned operand unit, 0P lf is controlled to transfer the output of the circuit making addition of the information on the buses v-^ and v 2 if the last binary figure on the information on the bus is a "1" or else take the information on the bus ^. This information for the ALU control circuit 10 is provided on the output of the circuit 14D. The figure information on the bus provided at the input of the operand unit OP3 is controlled to displace it one step to the right such that the least significant binary digit is taken away. At least the operand circuits OP^ and OP2 may have the ability to provide a return signal (not shown in FIG. 2) back to the ALU control circuit 10 indicating that an internal shift may have caused a carry. Each cycle is executed in two steps, of which the first is made during the first half period of the clock signal and the other during the second. FIG 3 As shown schematically in FIG. 3, each bit pattern on a bus having a numerical value is therefore preferably provided with a short bitfield in the most significant bits of the bit string having an information of the sign of the value, the sign of the exponent and a code regarding the dividing position (see the right arrow in FIG. 3) between the exponent and the mantissa parts of the numerical value. It is to be noted that also the length of the code part of the bitfield could vary, and that the place of the dividing position between the code field and the exponent field is determined by the code field, as illustrated by the left arrow in FIG. 3. Three ways of representing decimal numbers will be discussed in the following: I Binary digit form: The numerical system with base 2. II Integer H-value: A binary code for representing integers. Ill Floating-point H-value: A binary code for representing floating-point values. Another purpose to be desired for the ALU according to the invention is to provide the floating-point representation of the number in the same order as the integer interpretation of the same number. Thus the floating-point value and the integer value of the same bit pattern are totally different. However, this purpose could be fulfilled by having a first interpretation formula for the bitstring if the representation is to be interpreted as a floating-point value and a second interpretation formula for the bitstring if the representation is to be interpreted as an integer value. Thus neither of the representations need be in binary digit form, instead at least one of them, preferably both, is in a coded form. The bit pattern transformation is made automatically, and the hardware in the machine makes the computation on the transformed bit patterns just implicitely by following given rules, i.e. without knowing how the interpretation has been made. According to a preferable embodiment of the invention an effort is made to provide a dense representation of the floating-point values, i. e. there shall not be two bit patterns which could be interpreted as the same number. The term "close representation" means that every decimal number corresponds to a unique binary combination. FIG 4A, INTEGER REPRESENTATION FIG 4A shows a graphical representation of the code for integer values according to the invention, called integer H values. The binary representation is provided along the horizontal axis, and the H values along the vertical axis. The most significant bit represents the sign of the value, whether it is negative or positive. As apparent from FIG 4A the H value has its most negative value when the binary representation is all "0", has its zero at the middle of the binary representation, i.e. when the most significant bit changes from "0" to "1", and has its most positive value when the binary representation is all "1". Thus, the value of a binary combination in H-code increases the same way as it does in binary digit form. When the binary combination of a word in binary digit form is "1" it also has its maximum value. The integer code is a straight line. FIG 4B. FLOATING POINT VALUE REPRESENTATION FIG 4B shows a graphical representation of the code for floating-point values according to the invention, called floating-point H values. The binary representation is provided along the horizontal axis, and the H values along the vertical axis, which here is drawn through the point in which the floating-point H values are changing their sign. Also in this representation the most significant bit represents the sign of the value. The floating-point value representation must fulfill the requirement to be universal. For a certain precision the magnitude of the value must be arbitrary variable. Thus extremely small and large values should be represenatable. The floating-point H value scale is logartihmic. The logarithmic H value could be simplified by using straight line approximations between each factor of 2. The result is a typical floating point code. As seen in FIG 4B the binary representation for representing H values between -1 and +1 is provided in the middle of the binary representation field and includes half the field. The relative precision of a value is constant over the entire range of values. The logarithmic values has a certain precision and range. If the magnitude should be arbitrary large it must be possible to adjust the range of the logarithm. The logarithmic value could be applied to the logarithm function still one time or even further times. Thus, it is possible to represent very large values. However, the precision decreases at large magnitudes, but the precision at small levels could be kept or even slightly increased. Since the two bit patterns of the two representations appear in the same manner, an integer size comparator could be used also for floating-point value representations. This means that a particular floating-point value comparator could be avoided. This in turn means that the integer size comparator, which makes the comparing operation in only one cycle, can be used for the floating-point values, which is a great advantage. A floating-point value comparator of conventional type must use many cycles for its operation. In conventional arithmetical logic units several bit patterns could be interpreted as the same number and a normalization is made such that one of these bit patterns is chosen. According to the invention no normalisation need be made, at least not at the actual calculation. Normalization could be made before and after a calculation operation. By having a dense representation similarity between floating-point values, a floating-point value calculation, such as comparison, can be determined in one cycle only. An advantage of having a dense representation is also that a maximum number of floating-point values are available, i.e. no rejected and unusable values are provided in a sequence of values . The reason why there are several bit patterns which could be interpreted as the same number in conventional applications is that the exponent part and the mantissa part of a value are multiplied with each other in order to create the value. For instance the value 1.0 could be 2 1 *l/2, i.e. having the exponent bit pattern 01 and the mantissa bit pattern 100, or 2^*1/4, i.e. having the exponent bit pattern 10 and the mantissa bit pattern 010, the exponent bit pattern and the mantissa bit pattern following after each other. In accordance with an embodiment according to the invention the dense representation is created by providing a "1" implicitly, i.e. without actually being there, in front of the mantissa bit pattern for positive values and a "0" implicitly for negative values. Traditionally, the mantissa is specified as a value between -1 and +1. In accordance with the invention the binary coded mantissa is specified as a value in the range (1.0 to 2.0) or (-2.0 to -1) depending on the sign. The integer patterns are exactly determined, and the floating-point representations shall have the same consecutive order as the integer interpretation, which is a very hard constraint. FIGS 4C. 5A to 5D. FURTHER INFORMATION ON FLOATING-POINT VALUE REPRESENTATION An advantageous solution to this problem is shown schematically in FIG. 4C. FIGs 5A to 5D show a data list of words provided according to the principles shown in FIG. 4C. The column most to the right in FIGs 5A to 5D shows the decimal floating-point value corresponding to the binary combination in the column most to the left. FIG 4C shows a schematical graphical exposition of SUBSTITUTE SHEET the floating-point code, the binary representation is illustrated on the left hand side of a vertical dividing line LIN, and the floating-point H-values are illustrated on the right hand side of the line LIN. The line LIN is illustrated as an axis pointing toward higher values. This is due both for the binary representation and for the H value representation. The representations and the H-values are illustrated to propagate outwards from both sides of the line LIN. Nearest to the line LIN is an illustration of the axes in the diagram in FIG 4B. The H-value axis to the right and the binary representaion axis to the left. The first field outside the axis representation, sh to the right and s to the left, represents the most significant bit. It is "0" for negative values, "1" for positive. The second field outside that, seh and se, respectively, represents the next most significant bit. It is the exponent sign bit. A negative sign is represented by "0" and a positive sign is represented by "1". The third field at least one bit having lower significance than the next most significant bit, one bit if the binary field is low, as in the illustrated case having only seven bits, and more than one bit if the binary field is high, as will be explained below for a case having 32 bits. In the example shown in FIGs 4C, 5A to 5D the coding for seven bit words is shown instead of the 32 bit words that probably will be more frequently used in practice. The binary representation immediately to the left of the center line in FIG 4C will be interpreted to have the H-values -1024 to +768. It is to be noted that the H-values -1 and +1 are placed halfways between the value 0 and the extreme values -1024 and 768, respectively. The first SUBSTITUTE SHEET binary bit s and sh, respectively, both for the representation and for the H-values is the sign of the value, whether it is a positive or a negative value. The second binary bit is the sign of the exponent, i.e. whether the absolute value is above or below the number 1. The H-value exponent sign bit seh is thus positive between -1024 and -1, negative between -1 and +1, and then positive between +1 and +768. As apparent from the left side of FIG. 4C the binary representation exponent sign bit se instead is negative in the first quarter of the binary sequence, positive in the second, negative in the third, and positive in the fourth. The bit seh could be described such as if s=l then seh=se otherwise seh=l-se. Thus, in the binary representation the most significant bit, representing the character sign, has the slowest variation, the next most significant bit, representing the exponent sign, has the next slowest variation, i.e. twice that of the character sign bit. The bit in the next place has twice the variation of the exponent bit and is the code bit c. The code inc3udes only one bit in the example according to FIGs 4C and 5Ato 5D. In other examples the code field may include more than one bit. The code controls the exponent length and is to be regarded in view of the preceding sign bits. The floating-point H-value, i.e. the floating-point notation, which is to be achieved, provides the code field ch in a more particular way. As apparent from the section eh in FIG 4C, which gives the exponent H-values directly, the value eh goes from a large positive value down to a value 0, where the H-value is -1, from there to a large negative value, where the H-value is 0, from there to a value 0, where the H-value is +1, and from there to a large positive value, where the H-value is 768. The section etl abs snows t e absolute exponent H-values and is represented by two curved lines, provided side by side each having both ends at SUBSTITUTESHEET a large positive value and its middle point placed at 0. The code field for the H-values ch is designed to reflect the H-values eh abs and thus is shown to have the same form in dashed lines and the form it will have if the code field includes only one bit in continuous lines. Thus the code ch=c if se=l, and otherwise ch * 1-c, when the code ch only includes 1 bit. Up till now it has been easy to follow the disposition of the list provided in FIGs 5A to 5D, because each one of the bit fields s, sh, se, seh, c and ch includes only one bit, and therefore the comparison between the representations in FIG. 4 and in FIGs 5A to 5D is obvious. The first column in FIGs 5A to 5D is a sequential binary list from 0000000 to 1111111 and its straightforward counterpart in the decimal numeration system is provided in the second column. To the right of the arrow column the transformed numbers for the representation and the H-values are shown. The list is provided with continuous horizontal lines for each switch of the representation code field in order to make it easy to make the comparison to the illustration in FIG. 4C. The column to the right of ch includes a decimal representation of the exponent value e of the representation, and thereafter the decimal representation of the exponent value eh of the H-value. The next two columns show the binary representation of the values e and eh, respectively. The following next two columns show the decimal and the binary, respectively, representation of the mantissa value for the representation. Thereafter the decimal representation of the mantissa value mh of the H-value is shown. It is to be noted that the mantissa varies between -1 and -2 in FIG. 5A, B where the value sh is "0", and between +1 and +2 in FIG. 5C, D where the value sh is "1". The column most to the right shows the decimal H-value provided by the binary combination in the column most to the left, when transformed. As apparent from the upper part of FIG. 5B the representation SUBSTITUTESHEET having a "1" as its most significant bit followed by "0":s represents the particular floating-point value "0". As apparent from the sequence of binary numbers in FIG. 4C, next to the left of the center line, the seven binary bits has its four least significant bits left to be shared by the exponent and the mantissa, since the three most significant bits are reserved to the sign bits and the code bit. From the digital columns e and m it is apparent that in the uppermost section, where the exponent sign se is negative, i.e. "0", and the code value c is "1", the value e includes three bits, and thus the value m one bit (the first two "0":s in the column may be omitted). This is illustrated in FIG. 4C by having an e-representation in many steps in this section. In the next section, in which the exponent sign se still is negative but the code value c is "0", the value e does only include one bit (the first two "0":s in the column may be omitted), and the mantissa value may include three bits. This is illustrated in FIG. 4 by having an e-representation in few steps in this section. In the next section, the value e includes only one bit and the mantissa three bits, etc. As shown in the representation part, the exponent e has many steps in the sections having c=0 and se=0 and few steps in the sections having c=l and se=l. In the section e+bias to the left of the section e it is illustrated with continuous lines the values e provided in a line after each other within each quarter of a full section and with dashed lines how the values eh^ g are constructed by inverting every second quarter of a section in e+bias. (eh represents the value of e with the exponent sign.) Thus the code bit or bits is dependent upon the preceding exponent sign bits, and therefore one could say that the code in fact is including the sign bits and therefore could have a very limited length, i.e. be shorter than if the length of the exponent should be dependent on what is provided only in the code field. The mantissa length is dependent upon the exponent value in such a way that when the exponent is long then the mantissa is short and vice versa. Therefore, the mantissa is not shown in FIG. 4 but is apparent from the column m,m of the list in FIGs 5A and 5B, where the first m illustrates the decimal numeration value and the second m illustrates its digital counterpart. If s-1 then mh=1.0+m otherwise mh==-2+m as mentioned above. The example above was described for a seven bit word length in order to have it illustrative. As mentioned, the word length could be chosen to be quite long, for instance 32 bits. Then, it is practical to have a varying code length. It is also practical, in order to make the circuitry less complicated, to make the passing on from one division point between exponent and mantissa in steps of a group of bits, for instance of four bits. An advantage with this is that it is not necessary to have as many codes as must be had when the passing on is made bit wise. An example of such a precision decoder will be described further below. FIG 6 A detailed embodiment of the circuit in FIG. 2 is shown in FIG. 6. The in/output buses VQ, v lr v 2 and V3 are connected to an input/output buffer 20, which transmits the information on the input to the internal buses Q£, respectively, for each inverted clocking interval of the external clock signal CLOCK provided on a clock control input of the buffer, and the output on the internal output buses ø out , lout , V2 0ut , v 3 D ut to the in/output buses V Q , V 1# V2, V for each clock interval. FIGs 7A, 7B AND 7C An embodiment of the circuit 20 and,the clocking of it is showm in FIGs 7A, 7B and 7C. The input/output buffer 20 includes in turn input buffers, one for each input/output bus V Q , V 1# V2, V3, and the same number of output buffers. In order not to create race problems the clock signals must not overlap. This is arranged by slightly cutting their leading edges. During the first phase of the clock signal CLOCK shown in FIG 7A, being inversed as marked at the left with a bracket, the input from an external source is provided to the internal datapath in the ALU through the input buffers being controlled to a transmitting state. The data is propagated through the internal datapath in the ALU while being transitioned to next state provided on the output buses. The output buffers are set in a blocking state. As shown in FIG 7B, during the phase 1 of the clock period of the clock signal CLOCK, marked with a bracket to the left in FIG 7B the input buffers in the circuit 20 are controlled to a blocking state and the internal circuits in the ALU function as a stable multiplexor to control the signals to be provided on the input/output buses VQ, v-^, V2, V3. The output buffers in the circuit 20 are set in a transmitting state. The condition at a multiple cycle instruction at the phase 0 is shown in FIG 7C. The content at the input/output buses VQ, V*^, v 2' v 3 ^ e£ to hem from the ALU during the preceding phase 1 is kept on them during the phase 0 because of capacitance effects and is thus able to be transmitted through the input buffers, which are controlled to a transmitting state while the output buffers are controlled to a blocking state, to the input buses v 0i' v li' v 2i' v 3i' anc f rom there propagated through the internal datapath in the ALU while being transitioned to the next state. According to a preferable application, only the input list is used to control and perform a computation, which is made by rewriting the content in the input list and to feed the result to the output. The list may include a stored function application or another type of list. The first element in a function application is an instruction code and the rest of the elements are arguments to the instruction. This preferable application is dependent upon that a functional hardware dependent upon the input data is provided. However, the information regarding the kind of information present on the buses v^, ^21' v 3i ^ s P re *f era bly given on an input EXT from the control circuit CU (see FIG. 1A) . The control unit CU preferably has the information of whether the words on the input buses VQ^, *-^, v 2i' v 3i represent instructions and/or numbers, and if the numbers are floating-point values or integers, and gives this information to the ALU control ciruit 27 through the bus EXT. However, there could in fact be useful applications in practice, in which the functional behaviour is not wanted, and then external information to the ALU control drive circuit, for example on the input EXT from the control circuit CU, could be used for providing the control and performance of a computation. An instruction is performed by rewriting the instruction till its eventual result in one step, or rewriting the value of the list in several steps in order to reach the result eventually. When a stepwise rewriting is made the same instruction code could be used for each step or the list could be rewritten to a new instruction code, the list being followed by values. FIG 6 The following processing units are provided in the embodiment shown in FIG. 6 to perform the different instructions: A first comparator 21 is connected to the buses V Q ^ and v- j ^ comparing all information of those buses, i.e. v oi >v ii-' v 0i =v li' and provides the comparing results, i.e. a two bit value, on its output crnp Q *^ connected to an ALU control drive 27. A second comparator 22 is connected to the buses comparing the whole information of those buses, i.e. v ϋ >v 2i v li =v 2i ant * provides the comparing results on its output cmp**^ connected to the ALU control drive 27. A third comparator 221 is connected to the buses and comparing the whole information of those buses, i.e. v 2i >v 3j./ v 2i =v 3i nα - provides the comparing results on its output cmp23 connected to the ALU control drive 27. A fourth exponent comparator 222 is connected to the buses v^ and ^21' eacn being a 32-bit bus, and compares the most significant parts of the word on those buses, i.e. the parts se, c, e, i.e. all the information except the mantissa and the sign. The comparator takes notice of the coding of the parts se, c, e, described above. Therefore, the signal B-^ gj ^, from a precision decoder PD, is fed to a separate input of the comparator 222. A fifth comparator 223 compares the signals B^ gj ^ and B^ gj ^ from the precision decoder. The resulting signal cmp-prc indicates if the signals B^ g ^ and B^ gj ^ are identical. The ALU control circuit 27 feeds the result of the comparations from the comparators to its output Ag TATE connected to the control unit CU (see FIG. 1A) . The result could also be used for control of some of the units to be described below so that prechosen words are provided on the output buses -^ out , 2 0ut and v 3out -*-f appropriate. An insignificance decoder 23 is connected to the wire v*^ and is testing if the bits on v- j ^ are all "0" or "1", if the word on the bus v^ represents and integer, and, if the word on the bus v-.^ represents a floating-point value, testing separately if the bits in the exponent part and in the mantissa part are all "0" or "1". The information regarding this is derived from a signal B^ g ^ indicating the least significant bit group of the input v**^. This signal provides information whether the word on the input buses represent integers or floating-point values, and in the case of floating-point values the division between the exponent and mantissa part. The result of these tests is provided on the output insig 1 connected to an input of the ALU control circuit 27. An insignificance decoder 24 is connected to the bus v ^ and is testing if the bits on are all "0" or "1", if the word on the bus V2i represents and integer, and, if the word on the bus represents a floating-point value, testing separately if the bits in the exponent part and in the mantissa part are all "0" or "1". The information regarding this is derived from a signal B^ g ^ indicating the least significant bit group of the input and providing the same type of information as the signal B lsbl . The result of these tests is provided on the output insig 2 connected to an input of the ALU control circuit 27. An insignificance decoder 25 is connected to the wire and is testing if the bits on 3i are all "0" or "1", if the word on the bus V3 represents and integer, and, if the word on the bus represents a floating-point value, testing separately if the bits in the exponent part and in the mantissa part are all "0" or "1". The information regarding this is derived from the signal B^ g ^. The result of these tests is provided on the output insig3 connected to an input of the ALU control circuit 27. Each insignificance decoder is also controlled by a control signal 053 to be described further below from the ALU control circuit 27. The purpose of having the insignificance decoders is to detect if the information on one of the inputs to take part in a calculation to be made should be insignificant. This information is also provided on the bus Ag TATE to the control unit CU. A final condition that at least one input from one of the insignificance units for instance indicate all zeros could be used by the ALU control circuit 27 for some types of operations including a number of iterations. An instruction decoder 26 is connected to the bus Vg . TFhe bus V Q ^ bears the instruction when the ALU is to perform an arithmetic operation. The result of the decoding of V Q ^ is transmitted to the ALU control drive 27 through the output ins, if V Q ^ bears the instruction or data value. The units 23 to 26 are also controlled by other signals B^ g ^, B^ gj ^ and c^ generated in the circuits PD1, PD2 and 27, respectively, and further described below. THE ADDERS AND SUBSTRACTOR A first adder 28 connected to the buses makes the addition V ϋ + V2i and feed the result to a separate output a*^. A possible carry signal of the result will be fed to an output gr a *^ connected to the ALU control drive 27. A substractor 29 connected to the buses makes the subtraction and feeds the result to a separate output &2 - A possible carry signal of the result will be fed to an output gr a 2 connected to the ALU control drive. A second adder 30 connected to the buses v**^ and V2i makes the addition v ϋ + 2* 2i and feeds the result to a separate output a.^ . A possible carry signal of the result will be fed to an output gr a 3 connected to the ALU control drive 27. Each adder is also controlled by a control signal c5 from the ALU control circuit 27 to be described in further detail below and by the signal B^ g ^. This signal provides information whether the words on the input buses represent integers or floating-point values, and in the case of floating-point values and aligned values on the buses the division between the exponent and mantissa part. This information is essential because discrete values, i.e. integers, are evaluated as one entity, but for continuous values, i.e. floating-point values, the mantissa and the exponent parts are evaluated separately. A first sign and exponent sign circuit 35 is sorting out the sign, exponent sign, most significant mantissa bit and the two least significant mantissa bits of the word on the bus v*^ and feeds its output sign j tc an input of the ALU control drive circuit 27. A second sign and exponent sign circuit 36 is sorting out the sign, exponent sign, most significant mantissa bit and the two least significant mantissa bits part of the word on the bus V 2 J; and feeds its output sign 2 to an input of the ALU control drive circuit 27. Also, a third sign and exponent sign circuit 37 could be connected to the bus and feeds its output sign3 to an input of the ALU control drive circuit 27. It is to be noted that the circuits 35 and 36 are absolutely needed when the sign, the exponent sign and the mantissa bits are provided as a part of the word provided on the buses v-^ and ^21 ' Tn ey are used by the ALU control circuit in case of floating-point value words on the input buses. The circuit 37 may be omitted in some applications of the ALU according to the invention. A sign and exponent sign circuit (not shown) could also in some applications of the ALU according to the invention be provided for the bus VQ . The ALU control drive 27 provides digital output signals on output buses cl, c2, c3, c4, c5 by processing its input signals. The ALU control drive 27 is preferably a boolean gate array. Examples of the control provided by the output signals will be described further below. THE OPERAND UNITS Two operand units rl and r2, one for each of the operands on the buses contain all arithmetic unique to one element. Each operand unit has several information inputs. Three of them are connected to the separate outputs a lf a2, and a of the three units 28, 29 and 30, respectively, two of them to the input buses v- j ^ and V2 , respectively, and three of them are connected to some outputs of an individual precision decoder PD1 or PD2, respectively, to be described further below. In principle each information input is a bus including the same number of wires as each input bus The output of the operand unit rl is the output bus v*^ out and the output of the operand unit r2 is the output bus V2 otlt . A first output cl of the ALU control unit 27 is a composite control signal to control internal elements in the operand unit rl. Other control signals for the unit rl are provided by the precision decoder PD1. A second output c2 of the ALU control unit 27 is a composite control signal to control internal elements in the operand unit r2. Other control signals for the unit r2 are provided by the precision decoder PD2. A third output c3 is a composite signal provided to a third operand unit r3, a fourth output c4 is provided to control a polynome providing circuit 31 to be described further below, a fifth output c5 is provided to control the precision decoders PD1 and PD2 and also the insignificance circuits 23 to 25, the adders 28, 30 and the subtractor 29, and the sign and exponent sign circuits 35 to 37. Each of the operand units rl or r2 has essentially the same configuration, and therefore only one of them r2 will be described in detail. The corresponding elements in the units rl and r2 have been provided with the same references. The operand unit is divided into two groups, the exponent part OP e and the mantissa part OP m . The mantissa part 0P m has an output nl and the exponent part has an output n2. The outputs nl and n2 are connected to inputs of an output bus selector, also called bit group individual selector Ml. A 0/1 generator 40 providing a precision group of four "0" or four "1" at choice, controlled by a control signal to the generator, is also connected to an extra input of the selector Ml. The exponent part 0P e has as inputs four of the inputs of the operand unit, i.e. v 2i , and B bias2 , B CQ incr2 , B co decr2 from the precision decoder PD2, and has also an input n8 from the mantissa part OP m . The input v 2 ^ is connected to the input of an incrementer INC, the input of a decrementer DEC and to one of five inputs of a word selector M2. The outputs n5 and n6 of the components INC and DEC, respectively, are connected to two inputs of the word selector M2. B co i ncr 2, B co (j ecr2 are c nnected to the other two inputs of the word selector M2. The component INC in the operand unit r2 also has carry outputs and Ce d2 connected to the ALU control drive circuit 27. (Also the operand unit rl has increment component carry output signals Ce^ and gr^^ as well as decrement component carry output signals Ce^ and g dl connected to the ALU control drive circuit 27.) The carry outputs are provided early during the first half of the clock cycle. The selectors are controlled late during the first half of the clock cycle, and then this selector control signal is provided in taking care of the fact if there was a carry in some of the increment or decrement circuits or not. The normal maximum propagation delay to the first selector is more than a half cycle. Thus, there are no extra delays caused by this arrangement. However, the typical propagation delay is generally less than a half cycle. All signals are evaluated at the transition to the last half cycle. No unnecessary transitions occur in the selectors. The output n4 of the word selector M2 in the operand unit is connected directly to a first input of a word selector M3 having four inputs and to a second input of it through an inverter INV. The output n2 is the output of the exponent part P e . The input B bias2 is connected to a third input of the word selector M3. The mantissa part OP m has five inputs, i.e. a2 and a^ ' All the inputs are connected to an input each of a word selector M4 having five inputs and an output n8. The output n8 is connected to the fourth input of the word selector M3 in the exponent part 0P e . The output n8 is also directly connected to one of three inputs of a word selector M5, to a second of the inputs of the word selector M5 through a negative shifter SHI, which is shifting the binary information on its input four steps towards the lower significant direction, i.e. dividing the binary information with 16, and to a third of the inputs through a positive shifter SH2, which is shifting the binary information on its input four steps towards the higher significant direction, i.e. multiplying the binary information on its input with 16. The output n7 of the word selector M5 is directly connected to a first one out of six inputs of a word selector M6; through a negative shifter SH3, shifting the binary information on its input one step to the lower significant direction, to a second input; through a second negative shifter SH4, shifting the binary information on its input one step to the lower significant direction, to a third input; through a positive shifter SH5, shifting the binary information on its input one step to the higher significant direction, to a fourth input; and through a second positive shifter SH6, shifting the binary information on its input one step to the higher significant direction, to a fifth input. An internal constant word generator 41 generates a constant word c word 2 at control on its control input C2^ Q and has its output connected to an individual input of the word selector M6. The constant word generator 41 can provide a group of predetermined combinations of zeros or ones, for instance all "0" or all "1" or a word indicating some particular information, controlled by a control signal 02^ to the generator. The generator can store only a limited number of word combinations among which to chose with the control signal C2^ Q . The output of the word selector M6 is the output nl of the mantissa part 0P m . The mantissa part 0P m implements the following function. The basic mantissa value on n8 is selected by the word selector M4 resulting in either 2i , v^, a lf a2, or a-^ . It could be used as it is or be shifted 1, 2, 3, 4, 5, 6 bits to the left (positive shifts) or 1, 2, 3, 4, 5, 6 bits to the right (negative shifts) or could be substitued by the word c^ j .^ provided by the constant word generator 41. The exponent part 0P e implements the following function. Its output could be either the unshifted mantissa value on n8, v 2 j . +1 / inverted v 2 £+l, ^2L" 1 ' inverted v 2i -l, B co _ incr 2, inverted B co incr2' B co-decr2' inverted B co _ decr2 , or B bias2 . In the operand unit r2, the word selectors M2 to M6 are controlled individually by the control word c2 on the output c2 of the ALU control drive circuit 27. Thus, the word selector M2 is controlled by the part C2 of the control word c2, the word selector M3 by the part c2 2 of the control word c2, the word selector M4 by the part c2g of the control word, the word selector M5 by the part c2 5 of the control word, and the word selector M6 by the part c2 4 of the control word. Also, the shifters SHI and SH2 connected to the output n8 of the selector M4 are controlled by a part signal c2g, the shifters SH3 to SH6 by a part signal c2 7 , the incrementer INC and the decrementor DEC by a part signal c2g, the constant word generator 41 providing the output c word 2 by a part signal 02 ^- Q , and the 0/1 generator 40 by a part signal c2*n * The bit group individual selector Ml is controlled by a combined multi bit signal including a part 02*^ of the control word, an output code signal B cde 2 from a precision decoder PD2, an output least significant bit signal B-^ g ^ ad -?2' anα ' n ° ut put exponent signal B eχ _ ad 2 * the two last-mentioned signals are derived in processing circuits 42A and 42B from outputs B lsb 2 and B eχp2 , respectively, coming from the precision decoder PD2. The signals will be described and illustrated further below. The processing circuits 42A and 42B are controlled by the signal c2 5 being a part of the output c2 from the ALU control drive circuit 27. The precision decoder PD2 has the exp sign and code part of the information on the bus as an input together with a binary control signal C53 from the ALU control drive circuit 27, indicating if the word on the bus represents an integer or a floating-point value. The control signal C53 is a part of the output c5 from the ALU control circuit 27. The precision decoder PD1 for the operand unit rl works in an equivalent way. The signals B^ gj ^, B eχp -^ from the precision decoder PD1 are processed in processing circuits 43A and 43B providing the outputs B lsb ad -π and B eχp ad * j i r respectively. The processing circuits 42A, 42B and 43A, 43B are mostly providing the same outputs as its inputs from the decoder to which it belongs. However, in some occations, when a carry has been provided from the incrementer INC or the decrementer DEC the output signals will be shifted, as will be described further below. This shift will be controlled by a part signal c2 5 or cl 5 , respectively, of the output c2 or cl, respectively, from the ALU control circuit 27. The precision decoder PD2 (or PD1) provides outputs which are all insignificant which for example is indicated by having the outputs to the processing circuits 42A, 42B (or 43A, 43B) provided with all zeros, if the word represents an integer, and outputs of the kind described below as B eχp 2, B^ gj .^ and Bcde2 (or B eχpl , B lsbl and B cde2 , if the word v i (or v 1:L ) represents a floating-point value . FIG 8 The bit group individual selector Ml is controlled to select parts of the information provided on the outputs nl and n2 and from the generator 40, respectively. A word of the type shown in FIG. 3, i.e. representing a floating-point value, is illustrated in the upper part of FIG. 8 but in a split rectangular form showing how the bit groups can be formed. The references s, se, c, e, m, sb and lsb stands for sign, exponent sign, code, exponent, mantissa, most significant bit and least significant bit, respectively. Examples of split mosaic combination of the input information to the selector Ml is shown below the word in rectangular form. The type of control is as usual in the data world expressed in mnemonics and examples of such mnemonics are shown to the left in FIG. 8. Each mnemonic is naturally represented by a bit pattern including for instance 5 or 6 bits. The bit pattern is preferably provided on the control bus c2*^ to the selector Ml (and on the control bus cl* | _ to the the selector Ml) . The processing circuits 42A and 42B makes shifts of the signals B^ g *^ an( B ex p 2 c ding from the precision decoder if appropriate to provide the signals B^ gb ad 2 and B eχp adj 2' respectively to the control input of the selector Ml. The selector Ml is thus controlled by several signals provided on its input, but reacts to certain bit combinations of the incoming combined control signal going through a boolean gate array, each combination providing a particular combination of combined output from the inputs nl, n2 and output from the 1/0-circuit 40, as apparent from FIG. 8. DIFFERENCES BETWEEN THE OPERAND UNITS rl AND r2 As mentioned, the operand unit rl has practically the same configuration as the operand unit r2. The differences between the two operand units rl and r2 are the following: the inputs V j and v 2 have changed place. The constant c wordl is independent of the constant c word 2. The circuit rl is controlled by the control output cl, divided into the individual control word parts CI2 to cl ll' °^ tne ALU control drive circuit (instead of by the control output c2) and is controlled by the precision decoder PDl having v li se cli' that is the exp. sign and the code part of v^ as an input (instead of by the precision decoder DP2 having that is the exp. sign and the code part of as an input) . The precision decoder PDl provides the output signals B co -4 ecx i t B co-incrl' B biasl' B expl' B lsbl' ^sbl' and B cdel to tne operand unit rl and a signal B co max ι indicating if the code represents a maximum length of the exponent, and a signal B CQ mjΩ ι indicating if the code represents a minimum length of the exponent to the ALU control drive circuit 27. The precision decoder PD2 provides the output signals B co ccr 2 • B co—incr2' B bias2' B exp2' B lsb2' B msb2' and B cde2 to tne operand unit r2, and a signal B co _ maχ - 1 indicating if the code represents a maximum length of the exponent, and a signal B co _ jn n ^ indicating if the code represents a min um length of the exponent to the ALU control drive circuit 27. The outputs B sb , B eχ _ from the precision decoder PDl or PD2, respectively, must be shifted in the same way as the mantissa is shifted in order to let the new precision be reflected on the outputs and during the normal shifts, which is made by the control of the circuits 42A and 42B or 43A and 43B under control of a part of the signal c2g or clg, respectively, as described above. Each precision decoder is fed with a signal C53 on its input indicating if the word on the input bus respectively, represents an integer or a floating-point value. The signal C53 is a part of the signal from the output c5 of the ALU control drive circuit 27 controlling the circuits 23 to 30. The output signals from the precision decoder will be described in further detail below. MULTIPLICATION AND DIVISION. OPERAND UNIT r3 The third operand unit r3, the multiplicand/quotient function unit, is of another kind than the units rl and r2 and is provided mostly for multiplication and division operations. The unit r3 performs the shift and setting necessary during the multiply and divide functions. It is controlled by a control word provided on the output c3 of the ALU control unit 27. The multiplicand/quotient unit r3 has several inputs, of which a first is provided with the information on the bus v 2 ^, a second with the information on the bus and a third with an output from a constant word generator 44, providing a chosed bit combination among several stored in the generator at control of a part signal c3^ of the output c3 from the circuit 27. The unit r3 is used to evaluate one argument during complex numerical instructions. Its output is connected to the bus V3 OUt . The input 2 £ is fed to a first input of a word selector Mil. The input v 3i is fed directly to a second input of the word selector Mil, to a third input therof through a positive one bit shifter SH11 controlled by a signal part c3 5 , to a fourth input thereof through a first negative one bit shifter SH12, and to a fifth input thereof through a second negative one bit shifter SH13 the two last mentioned bit shifters being controlled by the signals C33, B msjDl , The output of the generator 44 is connected to a sixth input of the word selector Mil. The output of the word selector Mil, to be provided to an input of a second word selector M12, is chosen by a control word part c32 of the control word c3 from the ALU control unit 27. M12 is a bus connection providing the output of the selector Mil to the output bus V3 Qut but which is able to be controlled to a switched off condition by a control word part c3ι, as will be described below. A buffer circuit 26' is connected to the bus V Q ^. The circuit 26' is a bus connection providing VQ^ to its output but which is able to be controlled to a switched off condition by a control word c4 from the ALU control circuit 27. Thus, the output ø out of the circuit 26' has normally the same information as the bus V Q ^. SELF TEST OF THE NUMERIC ALU A so called polynome generator 31 could be provided. The polynome generator generates test codes for the ALU for self testing purposes. The generator 31 uses an entire closure including all informations on the buses as argument and provides values for the goal registers to buses QOUt ' , v lout ' , v 2out' ' v 3out' * When a self test is made, the ALU control unit 27 controls the buffer circuit 26' with the signal c4 and the selector Ml in the operand unit rl with the signal cl^, the selector Ml in the operand unit r2 with the signal c2 lr the selector M12 in the operand unit r3 with the signal 03*^ to switch off the outputs on the buses (v Qout , v lout , v 2out , and v 3out , respectively), and switches on the polynome generator outputs, which are normally switched off. In this way it is the polynome generator outputs v 0out'' v lout' ' v 2out'' v 3out' which nave switched on information to be provided to the in/output buses v Q , v 1# v 2 , and V3 instead of the outputs on the buses Qout , v lout , V2 0ut , and v 3out f rom units 26', rl, r2 and r3. THE TRISTATE DRIVER 39 The output buses from the internal circuits 26', rl, r2 and r3 and the output buses v 0out ', v lout ' , v 2out ', v 3out ' of the polynome circuit 31 are connected to different inputs of an output tristate driver 39. The tristate driver 39 has approximately the same configuration as the buffer 20 shown in FIGs 7A to 7C and is controlled by the output c4 of the ALU control drive circuit to either have internal buffers from the internal circuits switched on, i.e. being transmissive, and the internal buffers for the output buses of the polynome circuit 31 switched off, i.e. being blocking, which is the normal condition, or the other way around in case of test cycles. FIG 9 AND THE PRECISION DECODERS PDl AND PD2 FIG. 9 illustrates an embodiment of the output signals from a precision decoder for an example of a word representing a floating-point value on an input bus v-^ or v 2 £. The output of the precision decoder for floating-point values will be described in connection with this example. The arguments of the precision decoder to be described further below are the exponent sign and the code part described by the floating-point value, and control signals indicating that the word represents a floating-point value are provided. It is 1+4 bit wide. Different codes in the code bit field correspond to different precisions (mantissa lengths and thus exponent lengths). The least significant group lsb (see FIG. 8) of the exponent is varying with the precision. This group is the one having the bit pattern 0100 in the exemplifying word in FIG. 9. The binary signal B^ gjj has one bit per precision group, i.e. eight bits and has "0" for all groups except for the least significant precision group. A code and its inverted form represents the same precision where corresponding exponent signs are complementary, as illustrated in tabular form below. group for lsb code, incl leading exponent sign The code shown in the table above has the sign of the exponent as one element. When this element is true all other bits are used as such, but when it is false they are inverted. As mentioned above, the precision decoder provides successions of booleans, i.e. several output words, which are fed to different units in the ALU, such as to the operand units, the ALU control drive circuit etc. For a word representing a floating-point value the signal B^ sb could only provide a true bit for one of the groups 1 to 6, the rest of the bits being false bits. For group 0 and 7 a false bit is always provided. A succession of eight booleans (one for each precision group) indicates with a true bit the precision groups which belong to the code/exponent part, as illustrated at the side of B eχ _ in FIG. 9. There are in the example shown three possible positions of the most significant exponent bit because of the varying code length. As shown in FIG. 9 B^^ is here three booleans indicating which one of the positions having a true bit (the others being false bits). Thus, B jjjg k is 001 in the shown example indicating that the code length is maximal, such as for the groups for lsb 1 to 4 (see the table above). 010 should indicate the group 5 and 100 the group 6. In the example in FIG. 9 B cdβ is eight booleans corresponding to all bits in the two most significant precision groups. B cde is true ("1") from the least significant code bit to the exponent sign. B bias s nere a 32-bit word used for adjustment of the floating-point value representation. All bits are false ("0") except the least significant exponent bit. The precision decoder also provides incremented and decremented codes B co i ncr and B co decr# respectively, which are used in some operations when precision is altered. Only the first bits extended over the exponent sign and the code part of the word are shown for the signals B co i ncr and B co dβcr » However, the word is preferably 32 bits long. The rest of the bits are preferably all "0". Two booleans B co maχ and B co m ^ n indicate if the code represents a maximum or a minimum length of the exponent. In the example shown in FIG. 9 the least significant exponent bit is provided in the group 4. Then both booleans B co maχ and B co _ fflin are "0". If the least significant exponent bit had been provided in the group 1, then B co min had been a "1", and if it had been provided in group 6, then B co maχ had been a "1". The signals exemplified in FIG. 9 are signals provided in the case of a floating-point value. For an integer the signals B eχp , B jjjgjj , and B cde are all false, i.d. have only "0":s. It is to be noted that it is, of course, possible to use another set of bit combinations to indicate an integer; the condition for it is that a quite particular bit combination for these signals represents an integer. An embodiment of the precision decoder will be described in connection with FIG. 13. EXAMPLE OF ADDITION OF FLOATING-POINT VALUES Above an example of a multiplication operation for integers were given in connection with the description of FIG. 2. Here an example of an addition operation of two floating-point values will be given in order to illustrate the function of the ALU according to the invention. As mentioned the continuous coding scheme has no redundancy, i.e. there is not data added for effor detection purposes. Therefore the normal operations as alignment and precision adjustment are not possible in a direct way. Three states are included in the information on v Qi in order to solve this problem. They define how the operands on the buses below called the a-operand and the b-operand, are coded. The three states are: N none of the a- or b-operands has an altered code, they are both normalized. A the a-operand has an altered code, it is not normalized. B the b-operand has an altered code, it is not normalized. INTERPRETATION OF THE MANTISSA. FIG 10 FIG. 10 illustrates an example of the interpretation of a bit series 1010 of the mantissa for a normalized code and for an altered code. A virtual 1 is provided for the normalized code, which gives the result 1.625, while no virtual bit is provided for the altered code, which gives the result 0.625. FIGS 11 AND 12. ALIGNMENT The first step of a continuous addition, i.e. addition of two floating-point values, is to align the operands on the input buses, if the exponents are not equal. If the values a and b are to be added, and a=1.5*2 31 and b=-1.125*2 33 , the value a has a smaller exponent than the value b and thus has to be aligned before the actual adding operation, as is illustrated in FIGs 11 and 12 showing a first and a second alignment cycle for the exemplifying value a. The illustrative example is chosen such that three cases are used for aligning the two operands. The exponent of the value a is increased by 1 and its mantissa is divided by two (shifted one step to lower significance) . This is done twice in order to have the same exponent (33) as the value b. The example is chosen such that three cases are used for aligning the two arguments: 1. The initial value in an alignment cycle is represented by a binary combination in which the exponent value is the highest possible for the code c and the exponent sign is negative. Note that there is no difference in the precision of a number whether the sign of the exponent is positive of negative. When stepping the exponent the precision must be increased. The exponent part is added by one then the mantissa is shifted left an appropriate number of steps. 2. The exponent value of the initial value in an alignment cycle is the highest possible for the code c in this cycle, and the exponent sign is positive. When stepping the exponent the precision must be decreased. The exponent part is added by one, then the mantissa is shifted right an appropriate number of steps. 3. The exponent value of the initial value of the alignment cycle is not the highest possible. The exponent is stepped and the mantissa is divided by 2. In the first alignment cycle of the value a in the example, i.e. changing from the bit representation above to the bit representation below in FIG. 11, the precision code is incremented one bit to the right, due to the fact that when the exponent is incremented and it is maximal, i.e. including all "l":s, a carry is propagated into the precision code, which also is incremented. Thereafter the code is interpreted as being greater and one bit longer (see the code in group 5 in the table above) . This means in practice that the exponent length is decreased one bit at its left hand side and increased one precision group (4 bits) at its right hand side. The exponent value is also incremented by one. The mantissa is first shifted four steps to the right (precision decreased) and then shifted one step to the right (divided by two). When the mantissa group is shifted one step to lower significance the virtual "1" is shifted into the mantissa part, which thus has the digital combination 1100 in its most significant precision group after the first alignment cycle. HARDWARE EXECUTION OF THE ALIGNMENT This operation is done in one cycle in the ALU in the operand unit rl, if the value a is provided on the bus -^. The exponent value is the highest possible for the representation of the original value a. The exponent sign is positive, which means all exponent bits being 1. When the exponent is incremented by the incrementer INC, all bits become 0 and the incrementer INC feeds a carry gr^ to the ALU control drive circuit 27, which changes the binary output part signals cl 5 such that it controls the processing unit 43A and 43B to make a shift to the left of the signals coming form the precision decoder PDl. The carry gr^ is also transferred into the code part as mentioned above. The same kind of discussion is due for the decrementer DEC, in case a decrementation is to be made, but if a carry gr d -t, j being 1 or 2, is provided then the part signal cj 5 controls the processing unit 43A and 43B or 42A and 42B, respectively, to make a shift to the left (*2). It is to be noted that the incrementers and decrementers are providing their outputs during the first part of the first half period of the clock signal, and thus control signals can be provided to the processing units early in this half period. The control of the selectors of all the operand units is provided during the late part of this first half period of the clock signal. The outputs from the precision decoder are not changed during the later part of the clock cycle. They are stabilized as soon as the internal input buses and have stable values. As mentioned above, in the first half of the clock cycle the input buffers in the bus connection 20 let data from the external buses Vg, v lf V2 and V , respectively, come through, while the output buffers isolate the output data from the operand units from the external bus. In the second half of the clock cycle the input buffers holds the values on the internal input buses and while new output data is transferred to the external bus. This means that the precision decoders are influenced by new output data only in the next clock cycle. The mantissa is shifted one precision group to the right by the shift right one precision group unit SH2 (i.e. dividing with 16) in the operand unit rl. The least significant exponent precision group is indicated by a bit vector signal B^ g ^ provided by the precision decoder PDl. The shift is performed by the processing unit 43A and 43B to the right of this group. In order to shift the mantissa one step further from a new position by the shift one unit SH5 (dividing by 2), the B^ sb] _ vector signal is adjusted to the right by the unit 43A and 43B. The adjusted vector signal B lsb adil ^ s use d to select the output from the mantissa part 0P m and the exponent part OP e . An extra group of four "0" from the circuit 40 is inserted in rl as the new least significant precision group in the exponent part in order to complete it (see FIG. 8 cef_m/cet_m) . The bit value "1", being the virtual bit in a normalized code, is shifted into the new most significant mantissa position, which corresponds to division of a normalized positive mantissa ((1.0+m)/2). The new mantissa is not normalized and the value a therefore gets an altered code (having a "0" as virtual bit between the exponent and mantissa areas) . In the second alignment cycle, shown in FIG. 12, there is no need to alter the precision, i.e. the number of bits in the exponent does not have to be changed. The exponent is just incremented with "1" and the code c remains unaltered. No carry signal is provided to change the code, because the exponent is not the highest possible in the precision state of the original value of this alignment cycle. The mantissa is shifted one step to the right (SH5). Since the shift now is provided from an altered code, no virtual "1" is present between the exponent and the mantissa part, a virtual "0" is shifted in and the digital combination in the most significant precision group will be 0110. Thus, after alignment the value a has an altered code and is represented as 0.375*2 33 . The second step of the continuous addition is to normalize the arguments, not the result of the addition, in order to get a normalized mantissa. The result of a+b is 0.375*2 33 -1.125*2 33 =-0.750*2 33 which is not a normalized result. Thus, an argument normalization will follow after the addition which gives the normalized sum -1.5*2 32 (=2*(-0.750*2 33 /2)) . The multiplication of floating-point values is performed analoguous to the multiplication of integers described above in connection with the description of FIG. 2. However, two bits are used in order to reduce the time delay instead of only one bit. During the multiplication loop the equality for the mantissas is where sm indicates that it is the true signed mantissa value composed by the sign, a virtual bit and the mantissa bits. The word v*^ has no exponent sign, precision code or exponent value during the loop. Instead its mantissa is longer than the actual precision of the operation. Leading bits of the mantissa are coded in such a way that the entire word v^ is a discrete value equal to the partial mantissa. The sign bit has the correct value of the product. The word v 2 ^ is the multiplicand. It is not altered. The word has the original exponent sign, precision, and exponent value. However, the mantissa is appended to the sign-bit to form a precision which is one bit longer than the mantissa part of the word. The mantissa is in this case coded as a discrete value without sign-bit. The sign-bit could be derived from the sign of the word v^. During the multiplication loop the word v*^ is shifted right. The word V3 is also shifted right two bits each turn (SH13). When all bits in have been consumed, the loop is final. The result is then normalized. It is believed that a person skilled in the art could easily derive how other types of operations could be handled by the ALU outgoing from the exemplifying descriptions of its operation given above. FIG 13, PRECISION DECODER The structure in principle of a precision decoder is shown in FIG. 13. It is to be noted that modifications could be made in the shown structure, for instance in order to speed up the calculation rate. These are just constructural features and are apparent for a man skilled in the art and will therefore not be described here. This means that the actual circuit could have quite another configuration than that shown in FIG. 13, but that it will have the principle function as apparent from that Figure. The exponent sign and code part of the input signal v^, where j is either 1 or 2, is fed to a recode circuit 50, which in this principle type of embodiment of the precision decoder at its output provides one of the variants of the code including the leading exponent sign shown in the table above, for instance the left one, whatever of the variants is provided on its input. Alternatively, both variants could be provided on the output of the recode circuit 50, but always in the same order, for instance the left variant in the table above on lines alotted to it, and the right one on lines alotted to it. The output is fed to a bit sequence comparator circuit 51, which monitors the bit combination on its input and provides the digital signal B^^ indicating the bit length of the code, see FIG. 8, i.e. whether it is one, two or three bits long in the chosen example. It also provides the signal B cde . Six bit sequence comparator circuits 52 to 57 are also connected to the output of the recode circuit 50 each one being adapted to react to its particular coding to provide a "1" in the output if the bit pattern on the output wires from the recode circuit 50 is the same what it is adapted to react upon to provide an output "1" instead of its normal output "0". As apparent from FIG. 8 only one of the circuits 52 to 57 at the time is providing a "1", i.e. a true-signal, the others are providing the output "0", i.e. a false-signal. The first and the last bit in the signal B lsb are always a "0". Therefore, two wires 58 and 59 are connected directly to a wire having the bit "0". The wire 58, the outputs from the circuits 52 to 57 and the wire 59 are providing the bus B lsb , which has one bit per precision group. The bus B b ag has four bits per precision group. Each group includes three bits "0" and the bit of the signal B lsb for that particular group. Thus three of the wires of each group is connected to "0" and the fourth to the appropriate wire of the output B^ gb . The output B co _ m _ n is connected to the output of the circuit 52, and the output B co maχ is connected to the output of the circuit 57. The bit pattern of the output B eχ _ includes "0":s in the least significant positions up till the position where the output B^ gjj has a "1", and thereafter all bits are "l":s. The least significant bit which is on the wire 59 will always be a "0", but from the next least position there is a possibility for a bit "1". Therefore, an OR-gate 60 has one input connected to the output of the circuit 57 and the other to the output of the circuit 56. The output of the circuit 57 is connected to the next least position wire of the signal B eχp . The output of the OR-gate 60 is connected to the second next least position wire of the output B eχp . Thus, if the output of the circuit 57 should happen to be a "1", then this will provide an output bit "1" from the OR-gate 60 as well. The output from the OR-gate 60 will be "0" only if the outputs from both the circuits 57 and 56 are "0". The output of the OR-gate 60 is connected to a first input of another OR-gate 61 having its other input connected to the output of the circuit 55. The output of the OR-gate 61 is connected to the third least position wire of the output B eχD and to a first input of an OR-gate 62 having its other input connected to the output of the circuit 54, etc. This kind of cascade coupling of OR-gates provides "1":s in all positions having the same or higher si'gnificance than the position giving a "1" in the output B lsb . The sign, exp sign and code part of the word B co decr has its first wire connected to a unit providing a "1", its second to an inverter 161 connected to the sixth wire of B lsb , its third to an OR-gate 162 having its inputs connected to the fifth and sixth wires of and its fourth and fith wires connected directly to the second and third, respectively, wires of B^ sb . These wires for the sign, exp sign and code part of the word B co decr are connected to the input of a bit completing circuit 66 adding "0":s to the incoming word in order to provide a 32-bits word on its output. The sign, exp sign and code part of the word B co £ ncr has its first and second wires connected to a unit providing a "1", its third to an inverter 163 connected to the seventh wire of B^ sb , its fourth to an OR-gate 164 having its inputs connected to the third and fourth wires of B lsb , and its fifth wire connected directly to an OR-gate 165 having its inputs connected to the third and fifth wires of B lsb . These wires for the sign, exp sign and code part of the word B co i ncr are connected to the input of a bit completing circuit 67 adding "0":s to the incoming word in order to provide a 32-bits word on its output. FIGS 14a TO 14C. ADDER An embodiment of an adder, such as one of the circuits 28 to 30 in FIG. 6 is shown in FIGs 14A to 14C. The adder has two arguments a and b. The argument a is provided on the bus v-^ and the argument b on the bus These arguments are coded either as floating-point values or as integers. The signal c5 lf being "0" for integer and "1" for floating-point value, of the output c5 from the circuit 27 in FIG. 6 and the buses B lβbl and B lsb2 , having all bits "0" for an integer and having one of the bits "1" for a floating-point value, indicate this fact. As shown in FIG. 14A the adder is a binary adder built in 8 cascade coupled sections GO, Gl, .., Gi, .., G7, i.e. one section for each precision group. As apparent from the description above of an addition operation it is essential to align the arguments a and b before they can be added in case of a and b being floating-point values. This means that B lsbl and B lsb2 must be equal. B lsbl is fed as the signal B lsb to control the adder. The signal B^ gb is displaced one step in the direction toward the mantissa when it is connected to the adders, incrementers, decrementers etc, because then it could influence the carry propagation (block it) at the most significant mantissa group. Therefore, the least significant bit in the signal B lsb is not used in these cases. The arguments a and b, each including 32 bits, are divided into eight groups each including 4 bits. Each group of four bits of a and b is provided as a separate input of an individual section Gi, i being an integer between 0 and 7. Each wire of the bus B-^ sb is connected to an individual of the sections Gi, except to GO. A wire c^ n to the section G7 indicates if the adder shall make an addition or a subtraction. c in is "0" for addition and "1" for subtraction. Each section provides a carry signal c out ^ to be fed to the next section and is fed with a carry signal c^ n i coming from the next preceding section, as will be described more in detail below. The addition of the arguments a and b is made individually in each section GO to G7 providing carry signals to the next section in the order G7 to GO, if necessary. For a floating-point value a mantissa carry out bus c m is provided to which a mantissa carry out is provided if necessary. This bus together with the wires c s having the sign bit and c se having the exponent sign bit form the input gr a ^ (or gr a 2 or g a 3) to the circuit 27 in FIG. 6. The circuit 27 provides this information to the control unit CU on the bus A STATE . The signal c5^ indicates if the arguments a and b are integers or a floating-point values, the signal c52 indicate if the code is normal or altered for the argument a, and the signal 053 indicate if the code is normal or altered for the argument b. These signals are fed to the section GO, which corresponds to the most significant precision group including the most significant bit slice (the sign slice) . This is in particular dependent upon the format of the operands a and b (whether they both are integers or floating point values) . A tristate gate 70 is provided to set the bus c m to a defined value, for instance all "0" when the operands are integers, since then no mantissa carry is activated on the bus. The tristate driver 70 is controlled by the signal C53. An embodiment of a configuration of a section GI is shown in FIG. 14B. It is "sliced" into four adder slices AS1 to AS4. It also contains a carry generator for the section which evaluates the carry c out j _ for the next section. Each bit group a^ and b^ for the section Gi in question, has an individual of the bits a^ and ^ik' respectively connected to each individual adder slice ASk, k being an integer between 1 and 4. Each adder slice provides one bit sum^ of the sum output. As will be described more in detail in describing FIG. 14C the carry generator is provided with a generate bit Gen indicating that the sum of the section is greater than or equal to 16, a propagate bit Pr indicating that the sum of the section is greater than or equal to 15, the carry bit from the next preceding section c in ^, a carry in bit c in i4 from the adder slice AS4, and the bit B lsb _ i+1 . The bit B lsb _ i+1 is fed through an inverter 75 to an inverted input of a tristate gate, and directly to the control input of the tristate gate 76. The bit c in i4 is connected to a second inverted input of the tristate gate 76. Thus, when the bit B lsb _ i+1 is "0" then the tristate gate 76 is controlled to transmit the bit B lsb _ i+1 . However, when the bit B lsb _ i+1 is "1" then the tristate gate 76 is controlled to transmit the bit c in i4 indicating that the mantissa has a carry out if it is a "1". It is only necessary to provide a mantissa carry out for the precision group next to the exponent part of the argument, and it is only this group having the bit B lsb i+1 "!' H The carry propagation from section to section is blocked for the precision group next to the exponent part. Thus the bit B lsb i+1 is connected to an inverted input of an AND gate 77 having the inverted signal Gen on its other inverted input and thus transmitting the signal Gen only when B^ sb ^ +1 is H 0". The bit B lsb i+1 is als o connected to an inverted input of an AND gate 78 having the inverted signal Pr on a second inverted input and the bit c in A on a third inverted input and thus transmitting the signal Pr only when Bι sb i+1 is "0" and c in ^ is "0". An OR gate 79 has its inputs connected to the outputs of the AND gates 77 and 78 and is providing an output "1" when one of the AND gates has an output "1". An embodiment of each adder slice ASk is shown in FIG. 14C. The inputs a^ k and b^ are fed to an input each of an EXCLUSIVE OR gate 80 providing a "1" if the inputs are different from each other, otherwise a "0". The output of the EXCLUSIVE OR gate 80 is fed to a first input of a second EXCLUSIVE OR gate 81 and the bit c in iJς to it other input. The output of the EXCLUSIVE OR gate 81 is a "1" only if its inputs are different, and provides the output taking care of the carry bit from the next preceding adder slice, or if the adder slice is first in the section, the carry bit from the next preceding section. The bits a^ jς and b -^ are fed to the inputs of an OR gate 82 having an inverted output, which in turn is connected to a first inverted input of each of three AND gates 83, 84, 85. The inverted bit c^ n ^* is fed to a second inverted input of the AND gate 83 transmitting the bit c in ik if any of the bits a ik and b j - ζ is a "1". The inverted bit P j _ n ^* from the next preceding adder slice is fed to a second inverted input of the AND gate 84 providing the bit P ou t ik being P^ n ^ if any of the bits a^ k and b j ^ is a "1". The inverted bit G^ n j ^* is fed to a second inverted input of the AND gate 85 transmitting the bit G^ n ^ if any of the bits a^ and b^ is a "1". The bit P^ n ^ and the bit G in ik are " 1 " and "0" respectively for each first adder slice AS1 in each precision section, as apparent from FIG. 14B. The bits Pr and Gen are needed in order to realize ripple carry, i.e. make the adder faster. By the fact that there are discrete values on the inputs of the carry chains all the precision groups are computed in parallel, i.e. simultaneously for all precision groups. The last carry c s from the addition will have only 4+8 gate delays to be compared to 32 gate delays without ripple carry. The bits a^ and b^ are also fed to the inputs of an AND gate 88 having an inverted output, which in turn is connected to a first inverted input of each of thwo OR gates 86, 87. The output of the AND gate 83 is connected to a second input of the OR gate 86 providing the output c Qut j ^. The output of the AND gate 85 is connected to a second input of the OR gate 87 providing the output G out i]ζ . In order to provide very fast carry chains it is possible to have only one delay in them if a bit slice is inverting the polarity of the rippling generate and propagation bits are inverted. Thus, in such a case every second precision group section has inverted inputs (not shown). As apparent from the left side in FIG. 14A the most significant precision section GO is slightly different from the other sections. It does not use an input argument B lsb _ 0 . It is assumed being "0" within the group. Instead it has the mantissa carry input c^ n m . It is used to generate the carry input to the sign bit. The output has one extra bit indicating the carry out from the exponent. The normal carry out is generated as in the normal groups except that B lsb 0 is assumed to be a "0", i.e. false. The one bit signals cS^ c5 2 , c5 3 could have the following bit patterns: false,false) means integer: (c5 1 ,c52,c53)=(false,false,true) means both a and b having normalized code; (c5 ,c5 2 ,c5 )=(true,false,false) means a having altered, be normalized code; (c5 1 ,c5 2 ,c53)=(true,true,true) means a having normal, b altered code; FIG 15 The configuration of the incrementer is very similar to the configuration of the adder. FIG 15 shows an embodiment of a precision section in an incrementer. The incrementer has only one input a' (not shown). The increment bit slices AS1' to AS4' differs from the adder bit slices in that they have no generator bit Gen transferred from one to the other. The inverted output Pr from the slice AS4' and the inverted carry c^ n * from the next preceding section are fed to each one of two inverted inputs of an AND gate 90 with two inverted inputs. The carry in c^ n to the first section G7 on the line being an "1" is indicating that an increment is to be made. The output of the AND gate 90 and the bit B*L sb ^ + are fed to an input each of an OR gate 92 providing the output carry c out to the next section. The carry output of the incrementer is provided in the same way as for the adder. The ripple carry chain c^ n /c out indicates if the sum is more than or equal to two. The ripple carry chain Pe' indicates if the sum is more than or equal to one. As the adder the incrementer has a mantissa-carry-out bus c m controlled by the signal B^ gjj i+i * The control bit clg or c2g is indicating if the representation is an integer or a floatingpoint value. The control bits clg and c2g control a tristate gate which sets the mantissa-carry-out bus to a defined value when not used (not shown) . A decrementer has the same configuration as the incrementer, but the decrementer has an inverted input a'^ n * to its decrementer slices, corresponding to the incrementer slices AS1' to AS4'. The selectors in the operand units are generally built by a row of transmission gates. The selector has always a defined output. It has a list of control words and value inputs as arguments. All except one are off. The control of each input is a complementary signal. The entire selector is controlled by a list of such elements. They are controlled in the different state to take the input from a prescribed port. An embodiment of a basic selector bit slice is shown in FIG. 16. One of the bits of each input port to the selector S^ na , S^^, S^ nc and S nd is connected to the input of a controllable switch S a , S b , S c and S d , respectively. A pair of control wires S ca , S cb , S cc , and S cd , respectively, is provided for each switch. The control pair providing a transmit of the input to its belonging switch has the information "1,0", the others have the information "0,1". It is to be noted that the majority of the circuits in the ALU are built in accordance with the principles described above in relation to the adder and that it therefore is believed that a person skilled in the art easily can construct the rest of the circuits using these principles. Therefore, it has not been deemed to be necessary to describe every single circuit in detail. DESCRIPTION OF THE ALU DRIVE CIRCUIT Appendix 1 shows the raltion between inputs and outputs for alignment of exponents in addition of floating point values. The appendix is divided into different "control cases". Each control case corresponds to one output, i.e. one micro instruction. The outputs of the ALU drive circuit 27 which are listed under the heading "Micro instruction wires" are the signal levels on the buses C1-C5. The buses Cl, C2 and C3 are divided into smaller buses Cl , CI2, CI3 etc. connected to various points in the ALU. Different sets of inputs can cause the same output. The alternative input signals that cause the same output are listed as condition 1, condition 2 etc. Thus, the inputs listed under the heading "control case 1" as "state, sense wires - condition 4" cause the outputs under the heading "micro instruction wires" below. The input listed as condition 1,2 and 3 cause the same outputs as Condition 4. Each condition is defined by a certain combination of signal levels (0/1) on some state wires, while other state wires may have undefined values (X = do not care). All the input signals listed in the appendices are also marked in Fig. 6, except for signals co_limitl and co_limit2. In Fig. 6 the signal co_limitl is divided into its two components B co_maxl and B co_minl* The signal co_limit2 is also divided into its two components B co_max2 and B co_min2* The output Ag TATE is simply a copy of all the inputs to the circuit 27. The output A 7A m E is connected to the control unit CU. Appendix 2 shows the relation between inputs to and outputs from the ALU drive circuit 27 when multiplication of integers is being executed. The ALU drive circuit 27, shown in Fig. 6, is a boolean gate array of quite a complicated configuration. An embodiment of it can not be shown, because the configuration of it is calculated in a computer being provided with all the algorithms regarding the configuration of the control signals in relation to the informative signals. The boolean gate array is provided directly as chip mask patterns from the computer adapted to the configuration of the chip mask patterns for the whole ALU according to the invention. Thus this circuit is impossible to show in detail. A list on the relation between inputs to and outputs from the ALU drive circuit 27 is given in the appendices for the cases integer multiplication and alignment of exponents in floating point addition. While the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the true spirit and scope of the invention. In addition, modifications may be made without departing from the essential teachings of the invention. A value could be supplied by the goal register or G-register (not shown) or some of the ALU internal units as instructions operand/mul_guotient or polynome. The informatio ■ regarding the kind of representation in the rest of the bit string on the bus could be given by the information in the instruction bus or could be given in the code field. Alignment of exponents in floating point addition control case 1 state, sense wires - condition 1 state, sense wires - condition 2 ins [0; 0; 0; 0; 1; Or 0; 0; 1] state, sense wires - condition 3 c-nρ_prec X cmpOl (X, X) cπιpl2 (X, X) c-np23 (X, X) cmp_expl2 (x, X) insigl ( (X, x) , (x, x) , (x, x) ) insig2 ( (X, x) , (x, x) , <χ, ) ) insig3 ( (x, x) , (x, x) , (x, X ) ) signl (0, 1, X, X) s gn2 (1, l, x, x) sign3 (x, x, x, x) g*=_il (X, X, X) c_eil x <3 _βl (X, x, x) c_edl l co_limitl (X, 0) gr_i2 (X, x, X) c_ei2 X gr_d2 (X, x, x) c_ed2 x co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, x, X) gr_a3 <χ, x, X) ins [0 ; 0 ; 0 ; 0 ; 1; 0 ; 0 ; 0 ; 1 ] state, sense wires - condition 4 cmρ_prec X cmpOl (X, X) cπrpl2 (X, X) cmp23 (X, X) cmρ_exρl2 (X, X) insigl ((X, x) , <χ, x) , (x, x) ) insig2 {(X, x) , <x, x), (x, x) ) insigS ((X, X), (X, X) , (X, X) ) signl (0, 1, X, X) sign2 (0, 0, X, X) sign3 (X, X, X, X) gr_il (X, X, x) c_eil X gr_dl (X, X, X) c_edl 1 co_limitl (X, 0) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [0; 0; 0; 0; 1; 0; 0; 0; 1] micro instruction wires cl cl_l (0, 1, 0, 0, 0, 0) cl_2 [(0, 1) cl_3 [(0, 1) cl_4 [(0, 1) cl_5 [d, 0) cl 6 [(1, 0) cl 7 (0, [ (0, 1); (1, 0) ], [0; 0]) (0, [(0, 1); (1, 0)], [0; 0; 0; 0] ) [0; 0; 0; 0; 1] (0, 0, 0, 1, Or 0) (1, 0); (0, 1)] (0, 1); (0, 1); (1, 0) ] (1, 0); ( (00,, 11));; ((00,, 11));; (0, 1) ] (0, 1)] (0, 1); (0, 1) (0, 1)] (0, [(0, 1); (1, 0)], [0; 0]) (0, [(0, 1); (1, 0)], [0; 0; 0; 0]) [0; 0; 0; 0; 1] (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1) ; (0, 1) ] (0, [(0, 1); (1, 0)], [0; 0]) [0; 0; 0; 0; 1] ([(1, 0); (0, 1)], 0) c4 (0, 1) c5 (0, 0, 1) control case 2 state, sense wires - condition 1 cιrιρ_prec 0 citipOl (X, X) cmpl2 (X, X) cπιρ23 (X, X) cmp_expl2 (X, 1) insigl ( (X, X) , (X, x) , (x, x) ) insig2 ( (x, X) , (x, x) , (x, X ) ) insig3 ( (X, X) , (x, X) , (x, x) ) signl (1, 0 , X, X) sign2 (1, 0 , X, X) sign3 (X, X, x, X) gr_il (X, X, X) c_eil 1 gr_dl (X, x, x) c_edl x co_li-mitl (X, 0 ) gr_i2 (X, x, x) c_ei2 x gr_d*2 (X, X, X) c_ed2 x co_limit2 (X, X) gr_al (X, x, X) gr_a2 (X, x, X ) gr_a3 (X, x, X) ins [0; 0; 0; 0; 1; 0; 0; 0; 1] state, sense wires - condition 2 ins [0; 0; 0; 0; 1; 0; 0; 0; 1] state, sense wires - condition 3 cmp23 (X, X) cmp_expl2 (X, X) insigl ( (X, X) , (x, x) , (x, x) ) insig2 ( (X, X) , (X, X) , (x, χ> ) insig3 ( (x, X) , (X, x) , (x, χ> ) signl (1, 0, X, X) sign2 (1, 1, x, X) sign3 (x, x, x, X) gr_il (X, X, X) c_eil 1 gr_dl (X, X, X) c_edl X co_limitl (X, 0) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) state, sense wires - condition 4 cmp_prec cmpOl CB-pl2 cιπp23 cπιp_expl2 insigl insig2 insig3 signl sign2 ^ sign3 gr_il c_eil gr_di c_edl co_limitl gr_i2 c_ei2 gr_d2 c_ed2 co_liιnit2 gr_al gr_a2 gr_a3 [0 ; 0 ; 0 ; 0 ; 1; 0 ; 0 ; 0 ; 1] micro instructicn wires cl cl_l cl_2 cl_3 cl_4 (0, 1)] cl_5 cl_6 cl_7 cl_8 cl 10 c2 c2_l (0, 0, 0, 1, 0, 0) c2_2 [ ( 0, 1); (0, 1); (1, 0 ) c2_3 (0, 1)] [ { 0, 1); (0, 1); (0, 1) c2_4 (0, 1); ( 1. 0)] [ ( 0, 1); (0, 1); (1, 0), c2_5 (0, 1); (0, 1); t(0, 1); (1, 0); (0, 1)] (0, 1)] c2_6 c2_7 [(1, 0); (0, 1); (0, 1); (0, 1) <0, 1)] c2_8 (0, [ ( 0, 1); (1, 0)], [0; 0] ) c2_10 ( 0, [ ( 0, 1 ) ; (1, 0)], [0; 0; 0; 0] ) [0; 0; 0; 0; 1] c3 c3_l (1, 0) c3_2 [ c3_3 [((00,, 1); ( 0, 1 ) ; ( 1, 0); (0, 1); (0, 1 ) ; ( 0, 1 ) ] c3_4 (0, [(0, 1); (1, 0)], [0; 0]) [0; 0; 0; 0; 1] - c3_5 ([(1, 0); (0, 1)], 0) c4 (0, 1) c5 (0, 0, 1) 70 (0, 0, 0, 1, 0, 0) (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1); (0, 1) ] (0, [(0, 1); (1, 0)], [0; 0]) [0; 0; 0; 0; 1] - ([(1, 0); (0, 1)], 0) (0, 1) (0, 0, 1) control case 3 state, sense wires - condition 1 X), (X, X)) X), (X, X)) X), (X, X)) ins [0; 0; 0; 0; 1; 1; 0; 0; 1] state, sense wires - condition 2 ins [0; 0; 0; 0; 1; 1; 0; 0; 1] state, sense wires - condition 3 ins [0; 0; 0; 0; 1; 1; 0; 0; 1] state, sense wires - condition 4 ns [0; 0; 0; 0; 1; 1; 0; 0; 1] micro instruction wires (0, 1)] (0, 1)] (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1); (0, 1) ] (0, [(0, 1); (1, 0)], [0; 0]) [0; 0; 0; 0; 1] (1(1, 0); (0, 1)3, 0) (0, 1) (0, 0, 1) cpntrol case 4 state, sense wires - condition 1 cmp_ re cmpOl crop12 ins [0; 0; 0; 0; 1; 1; 0; 0; 1] state, sense wires - condition 2 cmp_prec 0 cπrpOl , ( X, X) c_mpl2 (X, X) cmp23 (X, X) cmp_expl2 (X, 1) insigl {(X, X), (X, X), (X, X)) insig2 ((X, X), (X, X), (X, X)) insig3 ((X, X), (X, X), (X, X)) signl (1, 0, X, X) sign2 (0, l, x, x) sign3 (X, X, X, X) gr_il (X, X, X) c_eil 1 gr_dl (X, X, X) c_edl X co_limitl (X, 0) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [0; 0; 0; 0; 1; 1; 0; 0; 1] state, sense wires - condition 3 cmp23 (X, X) cmρ_expl2 ((XX,, XX)) insigl ( ' ( 'X" " , X " ) , (X, X) , (X, X) ) insig2 ( (X, X) , (X, X) , (X, X) ) insig3 ((X, X), (X, X), (X, X)) signl ( ,1_,, 0 „,, X „,, X „), sign2 (l, l, x, χ> sign3 (x, x, x, x) gr_il (X, X, X) c_eil 1 gr_dl (X, X, X) c_edl x cp_limitl (X, 0) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_liπ-it2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [0; 0; 0; 0; 1; 1; 0; 0; 1] state, sense wires - conditicn 4 CBφ_prec cπ-p01 cmpl2 ins [0; 0; 0; 0; 1; 1; 0; 0; 1] micro instruction wires (0, 0, 0, 1, 0, 0) (0, [(0, 1); (1, 0)3, [0; 0]) (0, [(0, 1); (1, 0)3, [0; 0; 0; 03) [0; 0; 0; 0; 13 (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1); (0, 1)3 (0, [(0, 1); (1, 0)3, [0; 03) [0; 0; 0; 0; 13 - ([(1, 0); (0, 1)3, 0) (0, 1) (0, 0, 1) control case 5 state, sense wires - condition 1 cmp_prec 0 cmpOl (x, x) cmpl2 (x, x) cmp23 (X, X) cmρ_expl2 (0, 0) insigl ( (x, x), (χ f χ>, <χ, χ> > insig2 ('(X v , X v ) 4 , ('X", X «• ) » , ( •X ■» , X « )•) • * insig3 ((X, X), (X, X), (X, X)) signl (0, 0, X, X) sign2 (0, 0, X, X) sign3 (x, x, x, x) gr_il (X, X, X) c_eil x gr_dl (X, x, x) c_edl ι co_limitl (X, X) r _i2 (X, X, X) c_ei2 x r _d2 (X, X, X) c_ed2 x co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, x, X) gr_a3 (X, x, x) ins [0; 0; 0; 0; 1; 0; 0; 0; 1] state, sense wires - condition 2 ins [0; 0; 0; 0; 1; 0; 0; 0; 1] micro instruction wires cl cl_l (0, 0, 1, 0, 0, 1) cl 2 [(0, 1); (0, 1); (1, 0); (0, 1) ] [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1)3 [(0, 1); (0, 1); (0, 1); (1, 0); (0, 1) ; (0, 1)3 [(0, 1); (0, 1); (1, 0)3 [(1, 0); (0, 1); (0, 1); (0, 1); (0, 1) ] (0, [(0, 1); (1, 0)3, [0; 03) (0, [(0, 1); (1, 0)3, [0; 0; 0; 0]) [0; 0; 0; 0; 13 (0, 0, 0, 1, 0, 0) 1(0, 1) (0, 1); (1, 0) (0, 1)3 [(0, 1) (0, 1); (0, 1); (0, 1); (1, 0)3 [(0, 1) (0, 1); (1, 0); (0, 1); (0, 1); (0, 1)3 [(0, 1) (1, 0); (0, 1)3 Ed, 0) (0, 1); (0, 1); (0, 1); (0, 1)3 (0, [(0, 1); (I, ' 0)3, [0; 03) (0, [(0, 1); (1, 0)3, [0; 0; 0; 03) [0; 0; 0; 0; 1] (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1); (0, 1)3 (0, [(0, 1); (1, 0)], [0; 03) [0; 0; 0; 0; 13 ([(1, 0); (0, 1)3, 0) c4 (0, 1) c5 (0, 0, 1) control case 6 state, sense wires - condition 1 ins [0; 0; 0; 0; 1; 0; 0; 0; 13 state, sense wires - condition 2 X), (X, X)) X), (X, X)) X), (X, X)) ins [0; 0; 0; 0; 1; 0; 0; 0; 1] micro instruction wires cl cl_l (0, 0, 1, 0, 0, 0) cl 2 [(0, 1); (0, 1); (1, 0); (0, 1)1 80 (0, 1); (1, 0); (0, 1)3 (0, 1); (1, 0); (0, 1); (0, 1)3 (1, 0)3 (0, 1); (0, 1); (0, 1)3 • (0, [(0, 1); (1, 0)3, [1; 13) (0, [(0, 1); (1, 0)3, [0; 0; 0; 03) [0; 0; 0; 0; 13 (0, 0, 0, 1, 0, 0) (1, 0); (0, 1)3 (0, 1); (0, 1); (1, 0)3 (1, 0); (0, 1); (0, 1); (0, 1)3 (0, 1)3 (0, 1); (0, 1); (0, 1)3 1); (1, 0)3, [0; 03) 1); (1, 0)], [0; 0; 0; 03) [0; 0; 0; 0; 13 (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1); (0, 1)3 (0, (0, 1); (1, 0)], [0; 03) [0; 0; 0; 0; 13 ([(1, 0); (0, 1)3, 0) (0, 1) (0, 0, 1) control case 7 state, sense wires - condition 1 ins [0; 0; 0; 0; 1; 1; 0; 0; 13 state, sense wires - conditicn 2 cmp_prec 0 cmpOl, (X, X) cmpl2 (X, X) cmp23 (X, X) cmp_expl2 (0, 0) insigl ((X, X), (x, x) , (x, x)) insig2 ((X, X) , <χ, x), <χ, x) ) insig3 ((X, X), (X, X) , <χ, X) ) signl (0, 0, X, X) sign2 (1, 1, X, X) sign3 (X, X, X, X) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl 1 cc_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [0; 0; 0; 0; 1; 1; 0; 0; 1] micro instruction wires cl cl_l (0, 0, 1, 0, 0, 1) cl 2 t(0, 1); (0, 1); (1, 0); (0, 1)] 82 ; (1, 0); (0, 1); (0, 1)3 ; (0, 1); (1, 0); (0, 1) ; (0, 1)3 ; (1, 0)3 ; (0, 1); (0, 1); (0, 1)3 , 0)3, [1; 13) , 0)3, [0; 0; 0; 03) (0, 0, 0, 1, 0, 0) [(0, 1) (1, 0) (0, 1)3 [(0, 1) (0, 1) (0, 1); (1, 0)3 [(0, 1) (1, 0) (0, 1); (0, 1); (0, 1)3 1(0, 1) (0, 1)3 [d, 0) (0, 1); (0, 1); (0, 1)3 (0, [(0, 1) (1, 0)3, [0; 03) (0, [(0, 1) (1, " 0)3, [0; 0 0; 03) [0; 0; 0; 0; 13 (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1); (0, 1)3 (0, [(0, 1); (1, 0)3, [0; 03) [0; 0; 0; 0; 13 ([(1, 0); (0, 1)3, 0) (0, 1) (0, 0, 1) cpntrol case 8 state, sense wires - condition 1 ins [0; 0; 0; 0; 1; 1; 0; 0; 1] state, sense wires - condition 2 ins [0 0; 0; 0; 1; 1; 0; 0; 1] micrc instruction wires cl cl_l (0, 0, 1, 0, 0, 0) Cl 2 [(0, 1); (0, 1) ; (1, 0); (0, 1>] [(0, 1); (0, 1) (0, 1); (1, 0) (0, 1)3 [(0, 1); (0, 1) (0, 1); (1, 0) (0, 1); (0, 1)] [(0, 1); (0, 1) (1, 0)3 [(1, 0); (0, 1) (0, 1); (0, 1) (0, 1)3 (0, [(0, 1); (1, 0)], [0; 03) (0, (0, 1) (1, 0)3, [0; 0; 0; 03) [0; 0; 0; 0; 13 (0, 0, 0, 1, 0, 0) 1)3 1); ( 1, 0)3 1); (0, 1); (0, 1)3 1) (0, 1)3 0; 03) [0; 0; 0; 0; 13 (1, 0) t(0, 1); (0, 1); (1, 0); (0, 1); (0, 1); (0, 1)3 (0, [(0, 1); (1, 0)3, [0; 03) [0; 0; 0; 0; 13 ([(1, 0); (0, 1)], 0) c4 (0, 1) c5 (0, 0, 1) control case 9 state, sense wires - condition 1 cmp_prec l cmpOl (x, x) cmpl2 (X, X) anp23 (x, χ> cmp_expl2 (0, 0) Insigl {(x, X), (x, x), (x, )) insig2 (<χ, x), ( χ, x) , ( χ, x) ) insig3 ((X, X), {X, X), (x, x) ) signl (0, 0, X, X) sign2 (0, 0, X, X) sign3 (x, x, x, x) gr_il (X, X, X) c_eil x gr_dl (X, x, x) c_edl X co_limitl (X, X) gr_i2 (X, x, X) c_ei2 X gr_2 (X, X, X) c_ed2 x co_limit2 (X, X) gr_al (X, x, x) gr_a2 (X, x, x) gr_a3 (X, x, x) ins [0; 0; 0; 0; 1; 0; 0; 0; 1] state, sense wires - condition 2 cmp_prec 1 cmpOl ^ (X, X) cnaρl2 ' (X, X) cmp23 (X, X) cmp_expl2 (0, 0) insigl ((X, X), (X, X), (X, X)) insig2 ((X, X), (X, X), (X, X)) insig3 ((X, X), (X, X), (X, X)) signl (.0--,, o.., x_-., x--). sign2 (1, 1, X, X) sign3 (X, X, X,- X) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl X co_liιnitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [0; 0; 0; 0; 1; 0; 0; 0; 13 state, sense wires - condition 3 ins [0; 0; 0; 0; 1; 0; 0; 0; 1] state, sense wires - condition 4 cmp_prec cmpOl cπιpl2 cmp23 cmp_expl2 insigl insig2 insig3 signl sign2, sign3 gr_il c_eil gr_dl c_edl co_limitl gr_i2 c_ei2 gr_d2 c_ed2 co_limit2 gr_al gr_a2 gr_a3 ins [0; 0; 0; 0; 1; 0; 0; 0; 13 micro instruction wires cl cl_l (0, 1, 0, 0, 0, 0) cl_2 [(0, 1) (0, 1); (1, 0); (0, 1)3 cl_3 [(0, 1) (0, 1); (1, 0); (0, 1); (0, 1)] cl_4 [(0, 1) (0, 1); (0, 1); (1, 0); (0, 1); (0, 1)3 cl_5 [(0, 1) (1, 0); (0, 1)3 cl_6 [(1, 0) (0, 1); (0, 1); (0, 1); (0, 1)] cl_7 (0, [(0 1); (1, 0)3, [0; 03) cl_8 (0, t(0 1); (1, 0)], [0; 0; 0; 0]) cl 10 [0; 0; 0; 0; 13 (0, 0, 0, 1, 0, 0) [(0, 1); (0, 1) (1, 0) (0, 1)3 (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1); (0, 1) ] (0, [(0, 1); (1, 0)], [0; 03) [0; 0; 0; 0; 13 ([(1, 0); (0, 1)3, 0) C4 (0, 1) c5 (0, 0, 1) control case 10 state, sense wires - condition 1 craρ_prec 1 cmpOl (X, X) cmpl2 (X, X) cmp23 (X, X) cmp_e-cp12 (0, 0) insigl ((X, X), (X, X), (X, X)) insig2 ((X, X), (X, X), (X, X)) insig3 ((X, X), (X, X), (X, X)) signl π (1,. o0,. xX,. xX). sign2 (0, 1, X, X) sign3 (X, X, X, X) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl X co_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [0; 0; 0; 0; 1; 0; 0; 0; 13 state, sense wires - condition 2 cmp_prec 1 c pOl ^ (X, X) cmpl2 (X, X) cmp23 (X, X) cmp_expl2 (0, 0) insigl ((X, X) , (X, X) , (X, X) ) insig2 ((X, X), (X, X), (X, X)) insig3 ((X, X), (X, X), (X, X)) signl (1, 0, X, X) sign2 (1, 1, X, X) sign3 (X, X, X, X) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl X co_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [0; 0; 0; 0; 1; 0; 0; 0; 13 state, sense wires - condition 3 ins [0; 0; 0 ; 0/ 1; 0 ; 0; 0; 1] state, sense wires - conditipn 4 ), <χ, χ>, <χ, x)) ), (x, χ>, <χ, X ) ) ), (x, x), <χ, x) ) x, χ> x, x) x, X) X) X) X) X) X) X) X) ins [0; 0; 0; 0; 1; 0; 0; 0; 13 micro instruction wires cl cl_l 0, 0, 0) cl_2 (0, 1); (1, 0); (0, 1)] cl_3 (0, 1); (0, 1); (1, 0); (0, 1)] cl_4 (0, 1); (0, 1); (1, 0); (0, 1); (0, 1)3" cl_5 (1, 0); (0, 1)] cl_6 (0, 1); (0, 1); (0, 1); (0, 1)] cl_7 l); (l, 0)3, [l; H) cl 8 1); (1, 0)], [0; 0; 0; 0]) cl 10 [0; 0; 0; 0; 1] 90 (0, 0, 0, 1, 0, 0) [(0, 1); (0, 1); (1, 0); (0, 1)3 [(0, 1); (0, 1); (0, 1); (0, 1); (1, 0)3 [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1) ; (0, 1)3 [(0, 1); (1, 0); (0, 1)3 [(1, 0); (0, 1); (0, 1); (0, 1); (0, 1)3 (0, [{0, 1); (1, 0)3, [0; 03) (0, [(0, 1); (1, 0)], [0; 0; 0; 03) [0; 0; 0; 0; 13 (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1); (0, 1) ] (0, [(0, 1); (1, 0)3, [0; 03) [0; 0; 0; 0; 13 ([(1, 0); (0, 1)3, 0) (0, 1) (0, 0, 1) ccntrol case 11 state, sense wires - condition 1 ins [0; 0; 0; 0; 1; 1; 0; 0; 1] state, sense wires - condition 2 cmp_prec 1 cmpOl ^ (X, X) cmpl2 (X, X) cmp23 (X, X) c-tqp_expl2 (0, 0) insigl < (X, X), (x, x) , (x, x) ) insig2 ((X, x) , <χ, χ> , (x, x) > insig3 ((X, x) , (X, x) , (x, χ> ) signl (0, 0, X, X) sign2 (1, 1, X, X) sign3 (X, X, X, X) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl X co_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [0; 0; 0; 0; 1; 1; 0; 0; 1] state, sense wires - condition 3 cmp_prec 1 cmpOl (X, X) cmpl2 (X, X) i s [0; 0; 0; 0; 1; 1; 0; 0; 1] state, sense wires - condition 4 cmp_prec 1 cmpOl (X, X) cmρl2 (X, X) cπιp23 (X, X) cmp_expl2 (0, 0) insigl ((((XX,, XX)),, (<Xχ,, Xx)),, (X, X)) insig2 ('{"X", X*"), ('X • " ■ , X") % , (X, X)) insig3 ((X, X) , (X, X) , (X, X) ) signl (,0_,, 1_,, X..,, X..), sign2, (1, 0, X, X) sign3 (X, X, X, X) gr_il (X, x, x) c_eil X gr_dl (X, X, X) c_edl X co_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [0; 0; 0; 0; 1; 1; 0; 0; 13 micro instruction wires cl cl_l (0, 1, 0, 0, 0, 0) cl_2 [(0, 1); (0, 1); (1, 0); (0, 1)3 cl_3 [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1)3 cl_4 [(0, 1); (0, 1); (0, 1); (1, 0); (0, 1);' (0, 1)] cl_5 [(0, 1) ; (1, 0); (0, 1)3 cl_6 [(1, 0); (0, 1); (0, 1); (0, 1); (0, 1)] cl_7 (0, [{0, 1); (1, 0)3, [1; 13) cl_8 (0, [(0, 1); (1, 0)3, [0; 0; 0; 0]) cl 10 [0; 0; 0; 0; 1] (0, 0, 0, 1, 0, 0) [(0, 1); (0, 1); (1, 0) ; (0, 1)3 (0, 1); (0, 1); (1, 0)3 (1, 0); (0, 1); (0, 1); (0, 1)] (0, 1)3 [(1, 0); (0, 1); (0, 1); (0, 1); (0, 1)3 (0, [(0, 1) (1, 0)3, [0; 03) (0, [(0, 1); (1, 0)], [0; 0; 0; 0]) [0; 0; 0; 0; 1] (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1); (0, 1) ] (0, [(0, 1); (1, 0)], [0; 03) [0; 0; 0; 0; 1] ([(1, 0); (0, 1)3, 0) c4 (0, 1) c5 (0, 0, 1) control case 12 state, sense wires - condition 1 cmp_prec 1 cmpOl (X, X) cmpl2 (X, X) cmp23 (X, X) cmp_expl2 (0, 0) insigl ((X, X), (X, X), (X, X)) insig2 ((X, X), (X, X), (X, X)) insig3 ((X, X), (X, X), (X, X)) signl (1, 0, X, X) sign2 (0, 1, X, X) sign3 (X, X, X, X) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl X co_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [0; 0; 0; 0; 1; 1; 0; 0; 1] state, sense wires - condition 2 c--5>_prec 1 cmpOl ^ ( X, X) cmpl2 (X, X) cmp23 ( X, X) cmp_expl2 (0, 0) insigl ((X, X), (X, X) (X, X)) insig2 ((X, X), (X, X), (X, X)) insig3 ((X, X), (X, X), (X, X)) signl (1, 0, X, X) sign2 (1, 1, X, X) sign3 (X, X, X, X) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl X co_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [0; 0; 0; 0; 1; 1; 0; 0; 13 state, sense wires - condition 3 cmp_prec 1 cmpOl (X, X) cmpl2 (X, X) ins [0; 0; 0; 0; 1; 1; 0; 0; 1] state, sense wires - condition 4 cmp_prec cmpOl cmpl2 cmp23 cmp_expl2 insigl insig2 insig3 signl sign2 ^ sign3 gr_il c_eil gr_dl c_edl co_limitl gr_i2 c_ei2 gr_d2 c_ed2 co_limit2 gr_al gr_a2 gr_a3 ins [0; 0; 0; 0; 1; 1; 0; 0; 1] micro instruction wires cl cl_l (0, 1, 0, 0, 0, 0) cl_2 cl_3 cl_4 (0, 1)] cl_5 cl_6 cl_7 (0, [(0, 1); (1 cl_8 (0, [(0, 1); (1 cl 10 [0; 0; 0; 0; 1] (0, 0, 0, 1, 0, 0) (1, 0) [(0, 1); (0, 1)*; (1, 0); (0, 1); (0, 1); (0, 1)3 (0, [(0, 1); (1, 0)3, [0; 03) [0; 0; 0; 0; 13 ([(1, 0); (0, 1)3, 0) (0, 1) (0, 0, 1) APPENDIX 2 Integer multiplication control case 1 state, sense wires - condition 1 ins [l; 0; 0; 0; 0; 0; 0; 0; 1] state, sense wires - condition 2 cmp prec X cmpOl (X, X) cmpl2 (X, X) cmp23 (X, X) cmp_expl2 (X, X) insigl ( (X, X) , (X, X) , (X, X) ) insig2 ( (X, X) , (1, X) , (X, X) ) insig3 ((X, X), (X, X), (X, X) ) signl (X, X, X, X) sign2 (1, X, X, X) sign3 (X, X, X, X) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl X co_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [1; 0; 0; 0; 0; 0; 0; 0; 1] micro instruction wires 98 (0, 0, 0, 0, 1, 0) [(0, 1) ; (0, 1) (1, 0) (0, 1)3 (1, 0)3 [0; 0; 0; 0; 13 (0, 0, 0, 1, 0, 0) [0; 0; 0; 0; 1] (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1) (0, 1); (0, 1)] (0, [(0, 1); (1, 0)3, [0; 0]) [0; 0; 0; 0; 13 ([(1, 0); (0, 1)3, 0) c4 (0, 1) c5 (0, 0, 0) control case 2 (x, x ) ) (x, x), (X, x)) ins [1; 0; 0; 0; 0; 0; 0; 0; 1] state, sense wires - condition 2 cmp_prec X cmpOl.. (X, X) cmpl2 (X, X) cmp23 (X, X) c-np_expl2 (X, X) insigl ( (X, X) , (X, X) , (X, χ>) insig2 ((X, X), (0, X), (X, X)) insig3 ((X, X) , (X, x) , (X, x) ) signl (0, X, X, X) sign2 (X, x, x, X) sign3 (X, X, X, X) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl X co_l--mitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [1; 0; 0; 0; 0; 0; 0; 0; 1) state, sense wires - condition 3 crop23 (X, x) cmp_expl2 (X, x) insigl ( (X, X) , (0 , X) , (X, X) ) insig2 ( (x, x) , ( X , χ> , (x, x) ) insig3 ( (x, x) , (x, x) , <χ, χ> ) signl (X, x, x, x) sign2 (0 , x, x, x) sign3 (x, x, x, x) gr_ϋ (X, X, X) c_eil x gr_dl (X, x, X) c_edl x co_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X CO_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [1; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 0 ; 1 ] state, sense wires - condition •* cmp_prec X cmpOl (X, X) cmpl2 (X, X) cmp23 (X, X) cmp_expl2 (X, X) insigl ((X, X), (0, X), (X, X)) insig2 ({X, X), (0, X), (X, X)) insig3 ( (X, X) , (X, X) , (X, X) ) signl (X, X, X, X) sign2 (X, X, X, X) sign3 (X, X, X, X) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl X co_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [1; 0; 0; 0; 0; 0; 0; 0; 1] micro instruction wireβ cl cl_l (0, 0, 0, 0, 1, 0) cl_2 [(0, 1); (0, 1); (1, 0); (0, 1)1 cl_3 [(0, 1); (0, 1); (0, 1); (0, 1); (1, 0)1 cl_4 [(0, 1); (0, 1); (0, 1); (0, 1); (0, 1) r (1, 0)] cl_5 [(0, 1); (1, 0); (0, 1)] cl_6 [(1, 0); (0, 1); (0, 1); (0, 1); (0, 1)] cl_7 (0, [(0, 1); (1, 0)3, [0; 0]) cl_8 (0, [(0, 1); (1, 0)], [0; 0; 0; 0]) cl 10 [0; 0; 0; 0; 1] (0, 0, 0, 0, 1, 0) [(0, 1); (0, 1); (1, 0) (0, 1)3 [(0, 1); (0, 1); (0, 1) (0, 1); (1, 0)3 [{0, 1); (0, 1); (1, 0) (0, 1); (0, 1); (0, 1)3 [(0, 1); (1, 0); (0, 1)3 [(0, 1); (1, 0); (0, 1) ; (0, 1); (0, 1)3 (0, [(0, 1); (1, 0)3, [0; 03) (0, [(0, 1); (1, 0)3, [0; 0; 0; 03) [0; 0; 0; 0; 1] (1, 0) [(1, 0); (0, 1); (0, 1); (0, 1); (0, 1); (0, 1) ] (0, [(0, 1); (1, 0)], [0; 03) [0; 0; 0; 0; 1] ([(1, 0); (0, 1)1, 0) (0, 1) (0, 0, 0) control case 3 state, sense wires - condition 1 ins [1; 1; 0; 0; 0; 0; 0; 0; 1J state, sense wires - condition 2 cmp_prec X cmpOl (X, X) cmpl2' (X, X) cmp23 (x, X) cmp_expl2 (X, X) insigl ( (X, X) , (X, x) , (x, x) ) insig2 ( (X, X) , (X, X) , (x, x)) insig3 ((X, X), (1, X), (x, x) ) signl (X, X, X, X) sign2 (X, X, X, X) sign3 (1, X, X, X) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl X co_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [1; 0; 1; 0; 0; 0; 0; 0; 1] micro instruction wires cl cl_l (0, 0, 0, 1, 0, 0) cl 2 [(0, 1); (0, 1); (1, 0); (0, 1)1 cl_3 1(0, cl_4 , 1); ( 0, 1); (0, 1); (0, 1); ( 1, 0) ] [(0 cl_5 , 1); (0, 1); (1, 0); (0, 1); (0, 1) ; [(0 , 1)3 cl_6 , 1); (1, 0); (0, 1)3 (0 cl_7 [(1, 0); (0, 1 ) ; (0, 1); (0, 1); ( 0, 1)3 cl_8 ( 0, [(0, 1 ) ; (1, 0)3, [0 / 03) cl_10 (0, [(0, 1); ( 1, 0)3, [0; 0; 0; 0]) [0; 0; 0; 0; 1] c2 c2_l ( 0, 0, 0, 1, 0, 0) c2_2 [ ( 0, 1); (0, 1); (1, 0) ; c2_3 ( 0, 1)3 [(0, 1); (0, 1); c2_4 (0, 1); (0, 1); [(0, 1); ( 1, 0)] (0, 1); c2_5 (1, 0); (0, 1); KO, 1); (0, 1); c2_6 (1, 0); ( 0, 1)3 (0, 1)3 [(1, 0); (0, 1); c2_7 (0, 1); (0, 1); (0, 1)3 c2_8 c2_10 lθ- J/Vij I ' 0)] ' «" * <■ 0 ' ^ c3 c3_l (1, 0) c3_2 c3_3 [ ( 0, 1); ( 0, 1 ) ; ( 1, 0); (0, 1); (0, 1 ) ; ( 0, 1 ) 3 c3_4 ( 0, [ ( 0, 1); (1, 0)3, [0; 03 ) [0; 0; 0; 0; 13 c3_5 ( [(1, 0); (0, 1)3, 0) c4 (0, 1) c5 (0, 0, 0) control case 4 state, sense wires ins [1; 1; 0; 0; 0; 0; 0; 0; 1] micro instruction wires (0, 0, 0, 1, 0, 0) (0, 1)1 (0, 0, 0, 0, 1, 0) [(0, 1); (0, 1); (1, 0) (0, 1)1 (0, Di 01) (1, 0) [(0, 1); (0, 1); (0, 1); (1, 0); (0, 1); (0, 1) ] (0, [(0, 1); (1, 0)], [0; 0]) [0; 0; 0; 0; 1] ([(1, 0); (0, 1)], 0) . c4 (0, 1) c5 (0, 0, 0) control case 5 state, sense wires - condition 1 ins [1; 1; 0; 0; 0; 0; 0; 0; 1] state, sense wires - condition 2 cιtιp_prec X cmpOl ^ (X, X) . cmpl2' (X, X) cmp23 (X, X) cmp_expl2 (X, X) insigl ((X, X), (X, X), (X, X) ) insig2 ((X, X), (X, X), (x, x) ) insig3 ((X, X), (X, 1), (X, X)) signl (X, X, X, X) sign2 (0, X, X, X) sign3 (0, X, X, X) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl X co_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, 1, X) gr_a3 (X, X, X) ins [1; 1; 0; 0; 0; 0; 0; 0; 1] state, sense wires - condition 3 ms [1; 1; 0; 0; 0; 0; 0; 0; 1] state, sense wires - condition 4 cmp_prec cmpOl crop12 cmp23 cπ-p_expl2 insigl insig2 insig3 signl sign2 sign3 gr_il c_eil gr_dl c_edl co_limitl gr_i2 c_ei2 gr_d2 c_ed2 cc_limit2 gr_al gr_a2 gr_a3 [1; 0; 1; 0; 0; 0; 0; 11 state, sense wires - condition 5 107 ins [1; 0; 1; 0; 0; 0; 0; 0; 13 micro instruction wires (1, 0)] (0, [(0, 1); (1, 0)], [0; 03) (0, [(0, 1); (1, 0)3, [0; 0; 0; 03) [1; 1; 1; 1; 13 (0, 0, 0, 1, 0, 0) (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1); (0, 1) ] (0, [(0, 1); (1, 0)3, [0; 0]) [0; 0; 0; 0; 13 ([(1, 0); (0, 1)3, 0) (0, 1) (0, 0, 0) control case 6 state, sense wires condition 1 cn-p_jprec X cmpOl (X, X) cmpl2 (X, X) cmp23 (X, X) taπp_expl2 (X, X) insigl ( (x, x) , (x, X) , (x, x) ) insig2 ( (X, x) , (X, X) , (x, X) ) insig3 ( (X, X) , (0, X) , (X, X) ) signl (X, x, x, X) sign2 (0, X, X, X) sign3 (1, X, X, 1) gr_il (X, X, X) c_eil X gr_dl (X, x, X) c_edl X co_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, x, x) c_ed2 X co_limit2 (X, X) gr_al (X, 0, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [1; 1; 0 ; 0 ; 0; 0; 0 ; 0; 1] state, sense wires - condition 2 ins [1; 1; 0; 0; 0; 0; 0; 0; 11 state, sense wires - condition 3 cmp23 (X, x) cmp_expl2 (X, x) insigl ( (X, x) , (x, x) , (x, ) ) insig2 ( (X, x) , (x, x) , ( X . x) ) insig3 ( (x, X) , (x, 0) , (X, X) ) signl (x, x, x, χ> sign2 (l, x, x, x) sign3 (0, X, X, 0) r _il (X, X, X) c_eil x r_ l (X, X, X) c_edl x co_limitl (X, X) r_i2 (X, x, X) c_ei2 x gr_d2 (x, x, X) c_ed2 x co_limit2 (X, X) r_al (X, x, X) gr_a2 (X, 0 , X) r_a3 (X, x, X) ins [1 ; 1 ; 0; 0 ; 0; 0 ; 0 ; 0 ; 1] state, sense wires - condition 4 cπtp_prec X cmpOl (x, x) cmpl2 (x, X) cπtρ23 (X, X) cmp_expl2 (X, X) insigl (<x, X), (X, X) , (x, x) ) insig2 ( (x, x) , (X, χ> , (x, χ> ) insig3 ( (X, X) , (0, X) , (X, X)) signl (X, x, x, X) sign2 ^ (0, X, X, X) sign3 (1, x, x, X) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl x co_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [1; 0; 1; 0; 0; 0; 0; 0; 1] 110 ins [1; 0; 1; 0; 0; 0; 0; 0; 13 micro instruction wires (0, 0, 0, 0, 1, 0) [(0, 1) ; (0, 1) [(0, 1); (0, 1) [(0, 1); (0, 1); (1, 0)3 [(0, 1); (1, 0) [(1, 0); (0, 1) (0, [(0, 1); (1 (0, [(0, 1); (1 [0; 0; 0; 0; 03 (0, 0, 0, 1, 0, 0) [(0, 1); (0, 1); (1, 0) (0, 1)3 [(0, 1); (0, 1); (0, 1) ; (0, 1); (1, 0)] [(0, 1); (0, 1); (1, 0) ; (0, 1); (0, 1) ; (0, 1)3 [(0, 1); (1, 0); (0, 1)3 [(1, 0); (0, 1); (0, 1) ; (0, 1); (0, 1)3 (0, [(0, 1); (1, 0)3, [0; 03) (0, [(0, 1); (1, 0)3, [0; 0; 0; 03) [0; 0; 0; 0; 13 (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1) ; (0, 1) ; (0, 1)3 (0, [(0, 1); (1, 0)3, [0; 0]) [0; 0; 0; 0; 13 ([(1, 0); (0, 1)3, 0) (0, 1) (0, 0, 0) control case 7 state, sense wires - condition 1 cmρ_prec x cmpOl (x, x) crapl2 (X, x) croρ23 (X, X) cmρ_expl2 (X, X) insigl ( (x, x) , (x, xj , ( χ, x) ) insig2 ((x, x) , (x, χ>, (x, χ>) insig3 ((x, X), (0, X), (x, χ>) signl (X, X, x, X) sign2 (0, X, X, X) sign3 (l, x, x, l) gr_il (X, X, X) c_eil X gr_dl (X, x, X) c_edl x co_limitl (X, X) gr_i2 (X, x, x) c_ei2 X r_d2 (X, x, X) c_ed2 x co_limit2 (X, X) gr_al (X, 1, X) gr_a2 (X, x, x) gr_a3 (X, x, X) ins [1; 1; 0; 0; 0; 0; 0; 0; 1] state, sense wires - condition 2 cmp_prec X cmp01„ (X, X) cmpl2 (X, X) cmp23 (X, X) cmp_exρl2 (X, x) insigl ((X, X), (X, X), (x, x)) insig2 ({X, X), (X, X), (X, x)) insig3 ((X, X), (0, X), (X, X)) signl (x, x, x, X) sign2 (1, X, X, X) sign3 (1, X, X, 1) gr_il (X, x, X) c_eil X gr_dl (X, X, X) c_edl X CO_limitl (X, X) gr_i2 (X, X, X) c_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, 0, X) gr_a2 (X, X, X) gr_a3 (X, X, X) ins [1; 1; 0; 0; 0; 0; 0; 0; 1] micro instruction wires cl cl_l (0, 0, 0, 0, 1, 0) cl 2 [(0, 1); (0, 1); (1, 0); (0, 1)1 112 (0, 1)3 (0, [(0, 1); (1, 0)3, [0; 03) (0, [(0, 1); (1, 0)3, [0; 0; 0; 03) [0; 0; 0; 0; 13 (0, 0, 0, 0, 1, 0) [(0, 1) (0, 1) (1, 0) (0, 1)3 [(0, 1) (0, 1) [(0, 1) (1, 0) (0, 1) ] [(0, 1) (1, 0) [(1, 0) (0, 1) (0, [(0, 1); (1 (0, [(0, 1) ; (1 [0; 0; 0; 0; 13 (1, 0) [(0, 1); (0, 1); (0, 1); (1, 0) ; (0, 1) ; (0, 1)3 (0, [(0, 1); (1, 0)3, [0; 03) [0; 0; 0; 0; 13 ([(1, 0) ; (0, 1)3, 0) c4 (0, 1) c5 (0, 0, 0) control case 8 state, sense wires - condition 1 ms [1; 1; 0; 0; 0; 0; 0; 0; 1] state, sense wires - condition 2 micro instruction wires cl cl_l (0, 0, 0, 0, 1, 0) cl 2 [(0, 1); (0, 1) ; (1, 0); (0, 1)] 114 [(0, 1); (0, 1); (0, 1); (0, 1); (1, 0)3 [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1) ; (0, 1)3 f(0, 1); (1, 0); (0, 1)3 [(0, 1); (0, 1); (0, 1); (1, 0); (0, 1)3 (0, [(0, 1); (1, 0)3, [0; 03) (0, [(0, 1); (1, 0)3, [0; 0; 0; 03) [0; 0; 0; 0; 13 (0, 0, 0, 1, 0, 0) (1, 0) ; (0, 1)] (0, 1) ; (0, 1); (1, 0)3 (1, 0),- (0, 1); (0, 1); (0, 1)] (0, 1)3 (0, 1) ; (0, 1); (0, 1)3 0)3, [0; 03) 0)], [0; 0; 0; 0]) (1, 0) [(0, 1); (0, 1); (1, 0); (0, 1); (0, 1); (0, 1) ] (0, [(0, 1); (1, 0)3, [0; 03) [0; 0; 0; 0; 1] ([(1, 0); (0, 1)], 0) (0, 1) (0, 0, 0) control case 9 state, sense wires cmp_prec crop01 crop12 cmp23 cmp_expl2 insigl insig2 insig3 signl sign2 sign3 gr_il c_eil gr_dl c_edl co_limitl gr_i2 c_ei2 gr_d2 c_ed2 cc_limit2 gr_al gr_a2 g^_*3 ins [1; 1; 0; 0; 0; 0; 0; 0; 1] micro instruction wires (0, 0, 0, 1, 0, 0) [(0, 1); (0, 1); (1, 0) (0, 1)1 [(0, 1), (0, 1); (0, 1) (0, 1); (1, 0)1 [(0, 1); (0, 1); (1, 0) <0, 1); (0, 1); (0, 1)1 [(0, 1), (1, 0); (0, 1)] [(1, 0), (0, 1); (0, 1); (0, 1); (0, 1)] (0, [(0, 1); (1, 0)], [0; 0]) (0, [(0, 1); (1, 0)], [0; 0; 0; 01) [0; 0; 0; 0; 1] (0, 0, 0, 0, 1, 0) (0, 1) 1 (1, 0) [(0, 1); (0, 1); (0, 1) ; (1, 0) ; (0, 1) ; (0, 1)] (0, [(0, 1); (1, 0)], [1; 1]) [0; 0; 0; 0; 1] {[(1, 0); (0, 1)], 0) (0, 1) (0, 0, 0) control case 10 state, sense wires - condition 1 cmρ_prec x cmpOl (x, x) cmpl2 (x, x) cmp23 (X, x) cmp_expl2 (X, X) insigl ( <χ, x) , (x, x) , (x, X ) ) insig2 ( (x, x) , (χ r X) , <χ, x) ) insig3 ( (X, X) , (x, 0) , (X, X) ) signl (x, x, x, x) sign2 (0, X, X, X) sign3 (0, X, X, 0) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl X co_limitl (X, X) gr_i2 (X, x, X) c_ei2 x gr_d2 (X, x, x) c_ed2 X co_limit2 (X, X) gr_al (X, x, x) gr_a2 (X, 0, X) gr_a3 (X, x, x) ins [1; 1; 0; 0; 0; 0; 0; 0; 1] state, sense wires - condition 2 cmp_p ec X cmpOl, (X, X) cmpl2 (X, X) cmρ23 (X, X) cmp_expl2 (X, X) insigl ( (X, X) , (X, X) , (X, X) ) insig2 ( (X, X) , (X, X) , (X, X) ) insig3 ( (X, X) , (X, 0) , (X, X) ) signl (X, x, x, X) sign2 (1, X, X, X) sign3 (0, X, X, 0) gr_il (X, X, X) c_eil X gr_dl (X, X, X) c_edl X co_limitl (X, X) gr_i2 (X, X, X) C_ei2 X gr_d2 (X, X, X) c_ed2 X co_limit2 (X, X) gr_al (X, X, X) gr_a2 (X, 1, X) gr_a3 (X, X, X) ins [1; 1; 0; 0; Or 0; 0; 0; 1] micro instruction wires cl cl_l (0, 0, 0, 0, 1, 0) C l 2 [(0, 1); (0, 1); (1, 0) ; (0, 1)] [ ( 0, 1 ) ; ( 0, 1 ) ; (0, 1); (0, 1); ( t 1,, 0 ti )n3-- [{0, 1 ) ; ( 0, 1 ) ; (1, 0); (0, 1); ( 0, 1 ) ; ( 0, 1 ) 3 [ ( 0, 1); (1, 0); (0, 1 ) 3 [(0, 1 ) ; ( 0, 1); (0, 1); (1, 0); (0, 1)3 (0, [(0, 1); (1, 0)3, [0; 03) ( 0, [ ( 0, 1 ) ; (1, 0)3, 10; 0; 0; 0]) [0; 0; 0; 0; 1] ( 0, 0, 0, 0, 1, 0) [ ( 0, 1); (0, 1); (1, 0 ) (0, 1)3 [ ( 0, 1); (0, 1); (0, 1 ) (0, 1); (1, 0)] [(0, 1); (1, 0); (0, 1 ) (0, 1) ; (0, 1); (0, 1)] [ ( 0, 1); (1, 0); (0, 1) ] [ ( 1, 0); (0, 1); (0, 1) ; (0, 1); (0, 1)] ( 0, [(0, 1); (1, 0)], [0 03) ( 0, [ ( 0, 1); (1, 0)3, [0 0; 0; 0]) [0; 0; 0; 0; 1] (1, 0) [(0, 1 ) ; (0, 1 ) ; (0, 1); (1, 0); (0, 1); ( 0, 1 ) 3 (0, [(0, 1); (1, 0)3, [1; 1] ) [0; 0; 0; 0; 13 ( [ ( 1, 0); (0, 1)3, 0) (0, 1) (0, 0, 0)

Claims: We claim 1. A method to perform arithmetical, logical and related operations on numerical value elements, c h a r a c ¬ t e r i z e d by including the following steps: a) providing an input list including said numerical value elements to be processed, and instruction information, b) directly controlling and performing an operation on said numerical value elements on said input list using said instruction information, c) each numerical value element providing a word having a predetermined bit length, the maximum number of words being the same as the maximum providable number of elements in said input list, d) performing a calculation by rewriting the elements in said input list, e) presenting the result as an output list. 2. A method according to Claim 1, c h a r a c t e r i z e d in that said input list is divided into specific list elements, at least one of said list elements being a representation of an instruction word and the rest of said list elements being numerical value word representations. 3. A method according to Claim 1 or 2, c h a r a c t e r i z e d in that all the list elements are numerical value word representations. 4. A method according to any of the preceding Claims, c h a r a c t e r i z e d in that said lists includes a function application in which one of its elements is an instruction code and the rest are arguments to said instruction, and an instruction is performed by rewriting and recycling said instruction code from said result output list to said input list until an eventual result is reached. 5. A method according to Claim 4, c h a r a c t e r i z e d in that at each rewriting said list is rewritten to include a revised instruction code word, if appropriate for the actual calculation, followed by value words. 6. A method according to Claim 4, c h a r a c t e r i z e d in that at a rewriting directly to the result the value is placed on the output list without any instruction code. 7. A method according to any of the preceding Claims, c h a r a c t e r i z e d in that the maximum number of elements in said input list and output list are four. 8. A method according to any of Claims 2 to 7, c h a r a c - t e r i z e d in that said numerical value words are provided in a coded form before actual processing. 9. A method according to any of Claims 2 to 8, c h a r a c ¬ t e r i z e d in that said words representing numerical value words are provided with a coding achieving a dense representation of said numerical values, i.e. every coded representation of a value corresponds to only one numerical value. 10. A method according to any of Claims 2 to 9, c h a r a c ¬ t e r i z e d in that a first coding is provided on a binary word representing an integer value. 11. A method according to any of Claims 2 to 10, c h a r a c - t e r i z e d in that a second coding is provided on a binary word representing a floating-point value. 12. A method according to any of Claims 2 to 11, c h a r a c¬ t e r i z e d in that a first coding is provided on a binary word representing an integer value and a second coding on a binary word representing a floating-point value, and that said codings being such that after coding the numerical value of the floating-point value representations increases in the same order as the numerical value of the integer value representations. 13. A method according to any of Claims 2 to 12, c h a r a c ¬ t e r i z e d in that a binary coded floating-point value representation includes a code field, an exponent field and a mantissa field, said code field having an indication on a division position between said exponent field and said mantissa field, such that the exponent and mantissa fields have variable lengths. 14. A method according to any of Claims 9 to 13, c h a r a c- t e r i z e d in that said dense representation is provided by including a virtual "1", i.e. a "1" not provided physically in the representation, in front of a field of the word for the mantissa part of the floating-point value representation. 15. A method according to any of Claims 9 to 14, c h a r a c- t e r i z e d in that said values are coded in the following way: a) the representation of the value includes a bit string, in which every bit is either "0" or "1" and is binary coded starting from the numerical value zero, b) all possible values in said representation has only one value corresponding to a floating-point value, c) a floating-point value having a higher representation than another floating-point value has a value higher than the said other value, d) said representation of a floating-point value includes a sign bit for the total of said floating-point value, a sign bit of the exponent of said floating-point value, a code stating the length of said exponent, said exponent, which has a variable length, and a mantissa having a variable length, the combined length of said representation being a constant. 16. A method according to Claim 15, c h a r a c t e r i z e d in that said representation having a "1" as its most significant bit followed by "0":s represents a particular floating-point value "0". 17. A method according to Claim 16, c h a r a c t e r i z e d in that all representations not repreβentating the particular floating-point value "0" has a value corresponding to 2 e+bias *mantissa, where e is the value of said exponent in said representation for positive floating-point values being higher or equal to 1.0, for negative floating-point values being lower than -1.0, and where the exponent for floating-point values between 1.0 and -1.0 is inverted, and wherein, for representations not representing the particular floating-point value "0", said mantissas varies between -1 and -2 for representations having a negative sign, i.e. representing a negative number, and between +1 and +2 for representations having positive sign, i.e. representing a positive number. 18. A method according to any of the preceding Claims, c h a r a c t e r i z e d in that an instruction is performed by a parallel computation of a number of possible combinations of said values to be used as intermediate stages in the eventual computed value, chosing one of said computed intermediate stages to be further processed, if needed, to provide an eventual result. 19. A method according to any of Claims 9 to 18, c h a r a c- t e r i z e d in that at addition/subtraction of a first floating-point value A and a second floating-point value B following operations are provided: alignment of said value A to said said value B, if said value A has a smaller exponent than said value B, alignment of said value B to said value A, if said value B has a smaller exponent than said value A, addition/subtraction of said values being aligned to each other, normalizing the result of said addition/subtraction. 20. A method according to Claim 19, c h a r a c t e r i z e d in that said operations at addition/subtraction are parallelly computed at each addition/subtraction operation stage and that that operation is chosen among said parallelly computed operations which is due for the actual addition/subtraction operation stage. 21. A method according to any of Claims 15 to 20, c h a r a c ¬ t e r i z e d in that the following operations are provided for addition/subtraction of a first floating-point value A and a second floating-point value B: alignment of said value A to said said value B and increase/decrease a precision of its mantissa, if said value A has a smaller exponent than said value B, alignment of said value B to said value A and increase/decrease a precision of its mantissa, if said value B has a smaller exponent than said value A, addition/subtraction of said values being aligned to each other, normalizing the result of said addition/subtraction. 22. A method according to Claim 21, c h a r a c t e r i z e d in that said operations at addition/subtraction are parallelly computed at each addition/subtraction operation stage and that that operation is chosen among said parallelly computed operations which is due for the actual addition/subtraction operation stage. 23. A method according to any of Claims 9 to 22, c h a r a c ¬ t e r i z e d in that a multiplication between two floating-point values B and C is made by rewriting the multiplication to 0.0+B*C=V, where V is a constant value, which is rewritten during several stages having an intermediate value A+B 1 *C 1 =V, where A being the next preceding value V, and the exponent for said value C*^ is adjusted by additions/subtractions such that the exponent of said value B*^ eventually becomes "0", the exponent in the eventual result will be the eventual exponent of the value C-^. 24. A numerical arithmetic unit to perform arithmetical, logical and related operations on numerical value elements, including: a) an input including a set of buses, each bus being operative to be provided with a list element in a list, said list including instruction information regarding words in said list, b) a processing device to which said set of buses are connected performing an operation on said words in said list using said instruction information by rewriting said words in accordance with said instruction, and c) presenting the rewritten result on an output including a set of buses having the same number and configuration as said input set of buses. 25. A numerical arithmetic unit according to Claim 24, c h a r a c t e r i z e d in that at least one list element in said list is reserved to include a representation of an instruction information and to be provided on a particular of said input set of buses, and numerical value representations to be calculated are provided on others of said input set of buses, and that said processing device is adapted to perform a calculation by rewriting the numerical value representations in said input list. 26. A numerical arithmetic unit according to Claim 24 or 25, c h a r a c t e r i z e d in that several circuits (21,22,221,23,24,25,28,29,30,35,36,37), eachadaptedtoperform a specific operation on said numerical value representations on said input buses, are provided to present their results of said operations in parallel, and that control drive means (27) provided with said instruction information is chosing the performed result(s) among all the performed results adequate for the execution of the actual instruction to execute. 27. A numerical arithmetic unit according to Claim 26, c h a r a c t e r i z e d in that said list includes a function application in which one of its elements is an instruction code and the rest are arguments to said instruction, said processing device performing an instruction by rewriting and recycling said instruction code from said output to said input until an eventual result is reached, and that at each rewriting said processing device is adapted to rewrite said list to include a reviced instruction code word, if appropriate for the actual calculation, followed by value words if appropriate. 28. A numerical arithmetic unit according to Claim 26 or 27, c h a r a c t e r i z e d in that said representations of numerical value words are provided to said unit in a coded form before actual processing, and that said control drive means (27) is provided with information regarding the actual kind of coding of said representations. 29. A numerical arithmetic unit according to Claim 28, c h a r a c t e r i z e d in that said processing device is adapted to use codings presenting said numerical values into a dense representation, i.e. every coded representation of a value corresponds to only one interpreted value. 30. A numerical arithmetic unit according to Claim 28 or 29, c h a r a c t e r i z e d in that said processing device is adapted to use a first kind of coding on a binary word representing an integer representation. 31. A numerical arithmetic unit according to any of Claims 29 to 30, c h a r a c t e r i z e d in that said processing device is adapted to use a second kind of coding on a binary word representing a floating-point representation. 32. A numerical arithmetic unit according to any of Claims 29 to 31, c h a r a c t e r i z e d in that said processing device is adapted to use a first coding on a binary word representing an integer representation and a second coding on a binary word representing a floating-point representation, and that said codings being such that after coding floating-point representations are provided in the same order as integer representations. 33. A numerical arithmetic unit according to Claim 31 or 32, c h a r a c t e r i z e d in that a binary coded floating-point value representation includes a sign, exponent sign and code field, an exponent field and a mantissa field, said exponent sign and code field having an indication on a division position between said exponent field and said mantissa field, such that the exponent and mantissa fields have variable lengths. 34. A numerical arithmetic unit according to Claim 32 or 33, c h a r a c t e r i z e d in that said words representing numerical value words are provided with a coding providing said numerical values into a dense representation, i.e. every coded representation of a value corresponds to only one interpreted value. 35. A numerical arithmetic unit according to Claim 34, c h a r a c t e r i z e d in that said dense representation is provided by including a virtual "1", i.e. a "1" not provided fysically in the representation, in front of a field of the word for the mantissa part of the floating-point value. 36. A numerical arithmetic unit according to Claim 33 or 34, c h a r a c t e r i z e d in that said representations of numerical values are divided into bit groups, called precision groups, each having a predetermined number of bits, a partition between an exponent part and a mantissa part of said representation, when said representation is representing a floating-point value, being made between two precision groups. 37. A numerical arithmetic unit according to any of Claims 26 to 36c h a r a c t e r i z e d in that at least one operand unit (r-^,^,^) is provided having inputs, to which at least two of said numerical value words and numerical value word results from such (35,36,37) among said operation performing circuits having outputs adapted for further prosecution to a resultant output value of the unit are provided, said operand unit being controlled by said control drive means to further processing of data on said operand unit inputs to rewrite said numerical value words. 38. A numerical arithmetic unit according to any of Claims 26 to 36, c h a r a c t e r i z e d in that outputs of said operation performing circuits are fed to inputs of said control drive means (27) to be processed in said control drive means together with said instruction information to form digital control signals for controlling at least one operand unit. 39. A numerical arithmetic unit according to Claim 37 or 38, c h a r a c t e r i z e d in that said control drive means (27) is providing at least a first operation phase interval and an output operation phase interval during one data transfer internal in said unit from said input to said output, and that possible carry signals from elements in said operand circuit being controlled during said first operation phase interval is fed to said control drive means (27), which control outputs are changed by said possible carry signals before said output phase interval, during which internal elements in said operand circuit having access to outputs from said elements are controlled. 40. A numerical arithmetic unit according to any of Claims 26 to 39, c h a r a c t e r i z e d in that said control drive means (27) is a Boolean gate array. 41. A numerical arithmetic unit according to any of Claims 26 to 40, c h a r a c t e r i z e d in that the maximum length of said input list and output list are four elements provided on a bus each. 42. A numerical arithmetic unit according to any of Claims 26 to 41, c h a r a c t e r i z e d in that said representations of numerical values are divided into bit groups, called precision groups, each having a predetermined number of bits, a partition between an exponent part and a mantissa part of said representation, when it is representing a floating-point value being made between two precision groups; and that at least one precision decoder is adapted to have at least a part of said representation on its input providing information of said exponent/mantissa partition and providing control outputs due to said partition to elements making operations on floating-point values. 43. A numerical arithmetic unit according to Claim 42, c h a r a c t e r i z e d in that the number of precision decoders are two. 44. A numerical arithmetic unit according to Claim 42 or 43, c h a r a c t e r i z e d in that the number of said precision groups are eight for a representation having thirty-two bits. 45. A numerical arithmetic unit according to any of Claims 33 or 44, c h a r a c t e r i z e d in that information of said representation of said floating-point value is given in a code field of variable code length.

Inventors: CARLSTEDT LARS GUNNAR, CARLSTEDT, LARS, GUNNAR
Applicants: CARLSTEDT ELEKTRONIK AB
Application year: 1991
Main classification: G06F9
IPC codes: G06F7, G06F9, G06F12, G11C11, G11C15