Abstract:
A CORDIC processor is provided in carry-save architecture in connection with intense pipelining for vector rotations, particularly given problems in real-time processing. The processor comprises a plurality of vector iteration stages and a plurality of angle iteration stages that are partially redundantly present in order to guarantee a convergency of the CORDIC algorithm despite an ambiguity region in the sign detection of carry-save numbers and in order to simplify other circuit components, for example a multiplier. As a result of the carry-save architecture, only incomplete addition/subtraction operations are executed in the iteration stages, and intermediate results in the form of carry and save words are fed through the CORDIC processor on separate line paths until they are added in an adder at the processor output to form the final result vector. The invention is advantageous in the low chip surface requirement that results from a high regularity of the overall structure and from simply-constructed base cells of the vector and angle iteration stages and in the extremely-high processing speed that results from the combination of intense pipelining and the carry-save architecture.

Description:
BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The present invention relates to a computer processor, and is more particularly concerned with a coordinate rotation digital computer processor CORDIC processor, for vector rotations for solving problems of real-time processing, constructed with a carry-save architecture. 
     2. Description of the Prior Art 
     A CORDIC processor is known from the publication of Helmut Halm, et al entitled &#34;CORDIC-Prozessoren fuer die digitale Signalverarbeitung&#34;, published in the periodical &#34;me&#34;, Vol. 3, No. 1, 1989, pp. 22-27. 
     The pipeline principle and hard-wired shift operations are thereby set forth as possibilities for increasing the data rate. 
     SUMMARY OF THE INVENTION 
     The object of the present invention is to provide a CORDIC processor that is constructed of simple elementary cells, can be easily modified in view of accuracy and word width and mainly represents a good compromise between low chip surface and high data rate. 
     The above object is achieved, according to the present invention, by the provision of a CORDIC processor for vector rotations constructed in accordance with a carry-save architecture for solving problems of real-time processing, in which the processor comprises 
     (a) a vector path and an angle path whereby the vector path is composed of a plurality of series-connected vector iteration stages and the angle path is composed of a plurality of series-connected angle iteration stages; 
     (b) a plurality of devices for mutual decoupling of the vector iteration stages and a plurality of devices for mutual decoupling of the angle iteration stages in order to enable a processing according to a conveyor belt principle known as pipelining; 
     (c) a plurality of vector iteration stages and a plurality of angle iteration stages that contain addition/subtraction circuits, wherein, within a clock interval, only incomplete addition/subtraction operations occur and intermediate results at the end of the clock interval in the form of a carry word and of a sum word (carry-save number) are available on separate lines for carry and sum bits at the output of each vector and angle iteration stage, these words being available for further processing; 
     (d) the plurality of vector iteration stages and the plurality of angle iteration stages comprising structure for realizing shift operations (multiplication with powers of 2) that allow a shift of carry and sum bits; 
     (e) the plurality of angle iteration stages having sign detectors that employ the carry and sum bits for sign detection; 
     (f) a multiplier that is connected to the output lines for the carry and sum words of a last vector iteration stage of the series for multiplying both the carry word and the sum word of each vector component by a correction factor; and 
     (g) an adder that is connected to the output lines for the carry and sum words of a multiplier circuit that adds up the carry and sum words of both vector components to form components of a result vector. 
     The advantage which may be obtained in practicing the present invention is, in particular, that a significantly-improved relationship of data rate to chip surface requirement occurs in the CORDIC processor constructed in accordance with the present invention in comparison to known CORDIC processors, this resulting from the carry-save architecture, and that the data rate is independent of the overall word width. 
     According to a feature of the invention, the CORDIC processor set forth above is particularly characterized in that each angle iteration stage is composed of a plurality of identical angle path base cells; the sign detectors are connected parallel to angle path base cells; the input lines for angle bits of the angle path base cells are connected to lines for the non-inverted and inverted sign output signals of the respectively immediately-preceding angle iteration stage, such that this corresponds to a product formation of the sign output signal of the immediately-preceding angle iteration stage and the binary representation of a respective given, scaled negative angle step, whereby bits not modifiable by the product formation are occupied with fixed logical values; and the structures for realizing a shift operation required for scaling the carry and sum words at the output of an angle iteration stage are comprised such that the output lines for the carry-save bits of an angle path base cell are respectively connected to the outputs of the next more-significant angle path base cell of an immediately-following angle iteration stage. 
     According to another feature of the invention, the processor is characterized in that angle path base cells of an angle iteration stage each contain a respective full adder; that a register, respectively, for carry bit and sum bit and clock by clock signals follows the full adder for mutual decoupling of the vector iteration stages. The inputs of the angle path base cell correspond to the inputs of the full adder, whereby one input of the full adder is connected to the input line for an angle bit and two other inputs of the full adder are connected to the output lines for the carry and sum bits of the immediately-preceding angle path base cell insofar as the preceding angle path base cell exists, and are respectively connected with logical &#34;0&#34; in case a preceding angle path base cell does not exist. The output line for the carry bit comes from the next less-significant base cell and is only looped through the angle path base cell. The output bit line for the sum bit is connected to the output of the first register that, in turn, has its input side connected to the sum output of the full adder; and the output line for the carry bit is connected to the output of the second register for the forwarding of the next more-significant angle path base cell, the input side of the second register, in turn, being connected to the carry output of the full adder. 
     According to another feature of the invention, the processor is particularly characterized in that each vector iteration stage is composed of a plurality of identical vector path base cells. One vector path base cell has its input side connected to the output lines for carry and sum bits of the immediately-preceding vector path base cell insofar as the immediately-preceding angle path base cell exists and, otherwise, either the input lines for the carry bits or the input lines for the sum bits at the input side of the vector path base cell are connected to the processor input lines for inputting a starting vector. The structure for realizing a shift operation in a vector iteration stage is structured such that a respective angle path base cell has its input side connected to the output lines for carry and sum bits of an i-times more-significant, immediate-preceding vector path base cell and when such a vector path base cell does not exist, has its input side connected to the most-significant, immediately-preceding vector path base cell. 
     According to another feature of the invention, in the processor, a vector path base cell is composed of two multiplexers, of four full adders and of a decoupling device for decoupling the vector iteration stages, the decoupling device being in the form of ten transmission gates. An input line for the sum bit of a first vector component is connected to a first input of a first full adder and an input line for the sum bit of a second vector component is connected to a first input of a second full adder. An input line for the carry bit of a first vector component is connected to a first input of a third full adder via a first transmission gate clocked by a first clock signal and an input line for the carry bit of a second vector component is connected to a first input of a fourth full adder via a fourth transmission gate that is likewise clocked by the first clock signal. An input line for the i-fold more-significant carry bit of the second vector component is connected via the first multiplexer to a second input of the first full adder, the i-fold more-significant sum bit of the second vector component is likewise connected via the first multiplexer to the third input of the first full adder, the i-fold more-significant carry bit of the first vector component is connected via the second multiplexer to a second input of the second full adder and the i-fold more-significant sum bit of the first vector component is connected to the third input of the second full adder, likewise via the second multiplexer, whereby the multiplexers invert or do not invert the carry and sum bits dependent on the sign signals of the immediately-preceding vector iteration stage. The sum output of the first full adder is connected via the second transmission gate to a second input of the third full adder and the sum output of the second full adder is connected via a fifth transmission gate to a second input of the fourth full adder, whereby both of the second and fifth transmission gates are clocked by the first clock signal. An output line for a first-stage carrier bit of a vector component is connected via a third transmission gate to the carry output of the first full adder and an output line for a first-stage carry bit of the second vector component is connected via a sixth transmission gate to the carry output of the second full adder, whereby both of the third and sixth transmission gates are clocked by the first clock signal. An input line for a first-stage carry bit of a vector component from the next less-significant vector path base cell is connected to a third input of the third full adder and an input line for a first-stage carry bit of a vector component for the next less-significant vector path base cell is connected to the third input of the third full adder and an input line for a first-stage carrier bit from the second vector component of the next less-significant vector base path cell is connected to the third input of the fourth full adder. The input lines for the second-stage carry bits of the vector components from the next less-significant vector path base cell are looped through onto the output lines for the immediate-following vector iteration stage of the vector path base cell. The sum output of the third full adder is connected via a seventh transmission gate to the output line for the sum bit of a first component of the immediately-following iteration stage and the sum output of the fourth full adder is connected via a ninth transmission gate to the output line for the sum bit of the second component of the immediately-following vector iteration stage, whereby the seventh and ninth transmission gates are clocked by a second clock signal. An output line for a second-stage carry bit of a first vector component is connected via an eighth transmission gate to the carry output of a third full adder and an output line for a second-stage carry bit of the second vector component is connected via a tenth transmission gate and to the carry output of the first full adder, whereby the eighth and tenth transmission gates are clocked by the second clock signal. 
     According to another feature of the invention, the processor is particularly characterized in that at least one vector path iteration stage is redundantly arranged, for example, in order with a given accuracy of the final result vector to allow greater ambiguity regions in the sign detection in the individual angle iteration stages and in order to simultaneously enable an identical correction factor for all combinations of processor input signals. 
     According to another feature of the invention, the processor is particularly characterized in that the number of redundantly-arranged vector and angle iteration stages is of such a magnitude that, at most, the foremost-significant carry and sum bits and a sign output signal of the respective immediately-preceding angle iteration stage are required for sign detection in order to enable an optimized sign detector which is identical for all angle iteration stages and which is more simply constructed than a combination of full adders. 
     According to another feature of the invention, the processor as featured above, is particularly characterized in that an identical, optimized sign detector for all angle iteration stages forms a sign output signal from the foremost-significant carry and sum bits of an immediately-preceding angle iteration stage and from the non-inverted sign output signal of an immediately-preceding angle iteration stage in that the sign output signal of the immediately-preceding angle iteration stage is connected to one of two inputs of an equivalence element and the output of the equivalence element is connected to one of two inputs of a first EXOR (EXCLUSIVE-OR) gate; the most significant carry and sum bits are operated with a second EXOR gate and the output of the second EXOR gate is connected to the second of the two inputs of the equivalence elements; the second most-significant carry and sum bits are operated with a NOR gate, whereby the output of the NOR gate is connected to one of the two OR inputs of a first OR-NAND gate and these carry and sum bits are likewise operated with a first NAND gate. The output of the first NAND gate is connected to one of the two inputs of a second NAND gate and the output of the second NAND gate is connected to a direct NAND input of the first OR-NAND gate. The respective third most-significant carry and sum bits are operated with the input OR gate of a second OR-NAND gate, whereby the output of the second OR-NAND gate is connected to one of the two OR inputs of a third OR-NAND gate and the third most-significant carry and sum bits are operated by a third NAND gate. The output of the third NAND gate is connected to the respective direct NAND input of the second and third OR-NAND gates. The fourth most-significant carry and sum bits are operated with a fourth NAND gate, the output of the fourth NAND gate being connected to the second OR input of the third OR-NAND gate, and the output of the third OR-NAND gate being connected to the respective second OR input of the first OR-NAND gate and to the second input of the second NAND gate. The output of the first OR-NAND gate is connected to the second input of the first EXOR gate and the output of the first EXOR gate supplies the sign output signal of the optimized sign detector. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     Other objects, features and advantages of the invention, its organization, construction and operation will be best understood from the following detailed description, taken in conjunction with the accompanying drawings, on which: 
     FIG. 1 is a schematic illustration of the structure for a CORDIC algorithm for vector rotations; 
     FIG. 2 is a schematic representation of the ambiguity region in the sign estimation of carry-save numbers; 
     FIG. 3 is a block diagram directed to an exemplary embodiment of a CORDIC processor for vector rotations constructed in accordance with the present invention and comprising a vector path and an angle path; 
     FIG. 4 is a schematic representation of an excerpted portion of the angle path of a CORDIC processor constructed in accordance with the present invention and showing angle path base cells and detectors; 
     FIG. 5 is a schematic representation of an excerpted view of the vector path of FIG. 3 of the CORDIC processor constructed in accordance with the present invention showing vector path base cells; 
     FIG. 6 is a schematic representation of an angle path base cell which may be employed in practicing the present invention; 
     FIG. 7 is a schematic illustration of a vector path base cell which may be employed in practicing the present invention; and 
     FIG. 8 is a schematic logic circuit diagram of an optimized sign detector which may be employed in practicing the present invention. 
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     In order to illustrate the operation of the CORDIC processor of the present invention in greater detail, the CORDIC algorithm and special characteristics in view of the sign estimating of carry-save numbers shall be briefly set forth below. 
     The idea of the CORDIC algorithm is to execute the rotation of a vector P o  (X o , Y o ) by the angle Z o , not in one step, but to approach the rotational angle on the basis of a sum of permanently-prescribed sub-angles alpha i . With a definition of the sub-angles alpha i  as 
     
         alpha=atan (2.sup.-i), 
    
     the trigonometric operations needed given vector rotations are replaced by shift operations that are easy to realize (right shift of binary number by i places corresponds to the factor 2 -i ). 
     When, by continued addition or subtraction of the sub-angles alpha i  via N stages, the output Z n  is iterated towards zero, then the coordinates of the vector P o  rotated by Z o  (rotate mode) are obtained for P n  &#39; (X n  &#39;, Y n  &#39;). 
     When the aforementioned values are introduced into the general equations for a two-dimensional vector rotation, then the following equations are obtained: 
     
         X.sub.N &#39;=X.sub.o * cos (Z.sub.o)-Y.sub.o * sin (Z.sub.o) 
    
     
         Y.sub.N &#39;=X.sub.o * cos (Z.sub.o)+X.sub.o * sin (Z.sub.o) 
    
     The iteration equations for this can be written as: 
     
         X.sub.i+1 =X.sub.i -Y.sub.i * sign (Z.sub.1)*2.sup.-i 
    
     
         Y.sub.i+1 =Y.sub.i +X.sub.i * sign (Z.sub.i)*2.sup.-i 
    
     
         Z.sub.i+1 +Z.sub.i -sign (Z.sub.i)*W.sub.i 
    
     where W i  =atan (2 -i ). 
     Whereby, 
     
         X.sub.N &#39;=X.sub.N *K 
    
     
         Y.sub.N &#39;+Y.sub.N *K 
    
     hold true for the outputs X n  &#39; and Y n  &#39;, where ##EQU1## 
     FIG. 1 illustrates the principle of the CORDIC algorithm for vector rotations. The rotation of a vector is therefore realized by a plurality of identical stages that are composed only of adder/subtractor circuits, devices for realizing shift operations and a sign detection of Z i  (sign (Z i )). The iteration stage i=0 has inputs for the coordinates X o  and Y o  of a vector to be rotated, for the rotational angle Z o  and for a 0 th  angle step W o  =atan (1/2), whereby the sign signal (sign Z o ) formed from the rotation angle Z o  allows the adder/subtractor circuits (identified by circles) to unambiguously become adders or subtractors. With adders and subtractors, a coupling of the vector coordinates X o , Y o  is achieved and a residual angle iterated to zero is formed from the rotational angle Z o  and from the 0 th  angular step. This is likewise true of the further stages i=1 to i=n, whereby, indicated by oblique strokes, an i-fold shift occurs and the angular steps become smaller. The vector coordinates X n  and Y n , in addition to a residual angle Z n , are available at the output of the stage i=n. 
     In a carry-save architecture, the intermediate result of an addition of two&#39;s compliment numbers is represented by a sum word and by a carry word, whereby a final result arises only by the addition of the sum word and the carry word. As a result of the redundant number representation, the sign of this number cannot be unambiguously determined. The sign of a result in carry-save representation can therefore only be estimated in that a defined plurality of leading significance r are considered. FIG. 2 illustrates the ambiguity region U arising in the sign estimation, showing this ambiguity in a diagram that illustrates the sign (sign result) of the result dependent on the result value RESULT on the word width m and on the number of most significant bits r. It becomes clear from FIG. 2 that the arising ambiguity region U in the sign estimation becomes all the smaller the more leading significance are utilized for the sign decision. In order to preserve the advantage of a high data rate for the carry-save architecture independent of the overall word width, the number of significance to be considered, however, should be kept as low as possible. 
     FIG. 3 is a block diagram directed to an exemplary embodiment of a CORDIC processor constructed in accordance with the present invention for vector rotations. This processor is composed of a vector path VP, an angle path WP, a multiplication circuit MULK, an adder circuit VMA (vector merging adder) and a clock generator CG. The input quantities of the angle path are the components X o , Y o  of the start vector and the input quantity of the angle path WP is the rotational angle Z o . The vector path VP is composed of angle iteration stages IXY 0 . . . IXY 11b; the same holds true of the angle path WP that is of the angle iteration stages IZ 0 . . . IZ 11b, whereby each of the angle iteration stages supplies sign signals sign (Z i  &#39;), sign (Z i  &#39;) to the appertaining iteration stage IXY. In the exemplary embodiment shown in FIG. 3, all odd-numbered iteration stages are redundantly present and are referenced with &#34;a&#34; and &#34;b&#34; for further distinction. The output lines for carry and sum words of the two rotated vector components X N , Y N  of the last vector iteration stage IXY 11b are connected to the multiplier MULK and the output lines thereof for the carry and sum words XC N  &#39;, SX N  &#39;, YC N  &#39;, YS N  &#39; of the multiplied vector are, in turn, connected to the adder circuit VMA, whereby the adder circuit VMA supplies the final result vector X N  &#39;, Y N  &#39; at its outputs. In addition, FIG. 3 illustrates a clock generator CG that generates four clock signals CK 4 from a single clock signal CK. 
     In order to satisfy an accuracy requirement of g=10 -3 , an input word width of, respectively, eleven bits must be provided for the components X o , Y o  of the start vector. Given a rotational angle Z o  between +pi/2 and -pi/2 and an accuracy requirement of g=10 -3 , two additional bits for places preceding the decimal point are required, so that the input word width of the rotational angle amounts to 13 bits. An internal word width of 17 bits results from the 11 bits of the input word width, one bit for the extreme case that both vector components are added, one bit for a magnification factor 1/K that results on the basis of the iteration and four bits in order to avoid rounding errors. Due to the right shifts needed in each stage, lower significance are shifted out of the presentable numerical range. So that the accuracy requirement is met at the outputs X N  &#39; and Y N  &#39; despite to these rounding errors across all stages, the internal word width must be additionally increased by four places following the decimal point. Following the adder VMA, the output word width for X N  &#39; and Y N  &#39; given the aforementioned accuracy requirement, can be respectively reduced to a minimum of 11+1 bits for adding up the vector components, which is equal to 12 bits. 
     The amount of the residual angle Z i  becomes small from iteration stage-to-iteration stage, so that the word width in the angle path can be reduced by one bit after each stage. In order to fully exploit the existing word width in order to achieve the given accuracy and so that sign detectors DET need not be arranged shifted, a scaling of Z i  with 2 i  occurs. Applied to the equations set forth above, 
     
         Z.sub.i+1 &#39;=2*(Z.sub.i &#39;+W.sub.i &#39;) 
    
     where W i  &#39;=-sign (Z i  &#39;)*2 i  * atan (2 -i ) 
     results when the amount of the current residual angle Z i  &#39; at the output of the angle iteration stage IZi lies in the ambiguity region U of the sign decision, then a decision &#34;zero&#34; would have to be introduced in addition to the sign decisions &#34;positive&#34; and &#34;negative&#34;, so that the values X i  and Y i  are not changed. The value of Z i  &#39; in this iteration stage is multiplied by 2 in accordance with the scaling, so that the amount of the residual angle again becomes so large in the next stage (or in one of the next stages) that a reliable decision &#34;positive&#34; or &#34;negative&#34; is possible. Decision errors concerning the sign of Z i  &#39; due to the ambiguity region U would therefore be impossible. 
     The iteration stages not implemented given a &#34;zero decision&#34; would then, however, also have to be taken into consideration in the calculation of correction factor K. Instead of a simple multiplication of the outputs X N  and Y N  by the constant correction factor K, an extremely involved multiplier logic would therefore have to be introduced. In order to obtain a correction factor K that is constant for all rotational angles Z o , the &#34;zero decision&#34; can be replaced by a doubling of all iteration stages. 
     When, due to the ambiguity region U, an incorrect decision concerning the sign is made in an angle iteration stage, for example the stage IZ 1a, then the amount of the residual angle is enlarged instead of being reduced. In the following, double-up angle iteration stage, for example IZ 1b, a reliable sign decision is then guaranteed, so that the preceding iteration step is, in turn, canceled. The result across two stages then corresponds to the result of one stage having a &#34;zero decision&#34;, with a difference that all stages are always executed and the factor K therefore remains constant for arbitrary input angles Z o . This solution, however, leads to a considerable added expense for hardware due to the redundant design of each iteration stage. The proposals that have been presented proceed from the opinion that errors in the sign recognition should not be made in any stage in order to guarantee the convergency of the CORDIC algorithm. The convergency condition, however, can be more generally formulated as: in case of an incorrect sign decision in the angle iteration stage IZ i, all further angle iteration stages IZ i+1 through IZ n must satisfy the elimination of the error and keep the output Z N  within the framework of a given accuracy g. 
     This formulation leads to a fixed relationship between the number of stages to be doubled (factor p j ) and the number of leading significances r that must be taken into consideration for the sign decision of each stage. ##EQU2## where p j  =1 for a regular iteration stage and p j  =2 for a redundant iteration stage. 
     When, for example, the residual angle should remain below 10 -3  after N=11 stages, then at least nine leading signifcances must be utilized for sign estimating without redundant stages. When each stage is doubled up (p j  =2), only two bits now have to be taken into consideration. When, by contrast, only all odd-numbered stages are doubled (p j  =1 when j is an even number and p j  =2 when j is an odd number), then four bits are adequate. This consideration leads to a compromise in the architecture between the obtainable data rate (r as small as possible) and the necessary chip surface (stage i as small as possible). When the convergency is guaranteed, then the plurality of iteration steps defines the obtainable accuracy at the outputs X n  &#39; and Y n  &#39;. With the following inequality, the minimum number of iteration cycles N can be calculated for a given accuracy. 
     
         N≧-1d(tan (acos (1-(1/2*g).sup.2)) 
    
     Given the desired accuracy of g=10 -3 , r=4 leading significances result for the sign estimating in the exemplary embodiment illustrated in FIG. 3 and a number of N=11 angle iteration stages that are required results given doubling of all odd-numbered iteration stages. 
     The multiplier circuit MULK can be realized on a hard-wired basis since the multiplication always occurs with a constant correction factor. Due to the redundant stages, a modified correction factor K&#39; results. ##EQU3## 
     Given the selected configuration, a value of K&#39;=0.5387 decimally and K&#39;=0.1000101000-1 in the CSD code results. The representation in K&#39; in the CSD code enables the realization of the multiplication with only three shift/addition operations corresponding to the significances differing from zero. The adder circuit VMA is executed either as a carry-look ahead adder (CLA) or as a carry-ripple adder (CRA), whereby the carry-look ahead adder CLA has the advantage of a higher processing speed and the carry-ripple adder CRA can be more easily modified in terms of word width. The CORDIC processor realized in 1.5 μm CMOS technology can be operated with clock frequencies up to, typically, 60 MHz. 
     FIG. 4 illustrates an excerpted view of an angle path of the structure of FIG. 3 composed of angle path base cells BCZ and detectors DET, shown in the region of the doubled first angle iteration stages IZ 1a and IZ 1b as well as of the following, regular angled iteration stage IZ 2. At the angle iteration stage IZ 1a, an input word Z 1b  &#39; that is likewise composed of carry and sum words is formed in the cells BCZ 1a, 0, . . . BCZ 1a, 12 according to the CORDIC calculating rule, being formed therein from the input words Z 1  a&#39; composed of carry and sum words and the angle step W 1  a that is either inverted or noninverted by the sign signals sign (Z 1  a&#39;), sign (Z 1  a&#39;). Parallel thereto, sign signals sign (Z 1  b&#39;), sign (Z 1  b&#39;) for the following angle iteration stage IZ 1b are formed from the four most-significant bits in a detector DET 1a. The angle iteration stages IZ 1a and IZ 1b are identical. Due to the connection to the next iteration stage, a left shift by one bit occurs at the output of the redundant stages, for example, IZ 1b, as well as at the regular stage, this corresponding to a scaling with the factor 2. 
     The wiring of the base cells results from the evaluation of the following equation. 
     
         W.sub.i &#39;=-2.sup.i * atan (2.sup.-i)* sign (Z.sub.i &#39;) 
    
     The following values result therefrom for the iteration stages: 
     
         ______________________________________W.sub.0 &#39; = 11.00110111000 * sign (Z.sub.0 &#39;)W.sub.1 &#39; = 11.00010010101 * sign (Z.sub.1 &#39;)W.sub.2 &#39; = 11.00000101001 * sign (Z.sub.2 &#39;)W.sub.3 &#39; = 11.00000001011 * sign (Z.sub.3 &#39;)W.sub.4 &#39; = 11.00000000011 * sign (Z.sub.4 &#39;)W.sub.5 &#39; = 11.00000000001 * sign (Z.sub.5 &#39;)W.sub.6 &#39; - W.sub.1 &#39; = 11.00000000000 * sign (Z.sub.1 &#39;)______________________________________ 
    
     When sign (Zi&#39;) is negative, all bits of the zero-one sequence of the expression -2 i  * atan (2 -i ) must be inverted and one is added at the place of the lsbs. A fixed zero occupation (GND) of the lsbs W o .o &#39;, a respective fixed one occupation (VDD) of the isbs W 1 .0 &#39; . . . W 5 .0 &#39; thereby result and only the msb is respectively dependent on the sign signal sign (Z i  &#39;) given W 6  &#39;-W 11  &#39;. In the case of regular stages and in the case of doubled stages, the Z inputs of the least significant angle path base cells BCZ i ,0 are connected to the output of the immediately-preceding angle path base cells. 
     FIG. 5 illustrates an excerpted view of the vector path of FIG. 3 in accordance with the invention comprising vector base cells BCXY i ,k in the region of the regular vector iteration stage IXY 2, of the basic stage IXY 3a and of the redundant stage IXY 3b pertaining to the basic stage IXY 3a. The inputs XY 2 ,0 . . . XY 2 ,16 and the outputs XY 4 ,0 . . . XY 4 ,16 are formed of the lines for the carry and sum bits of the vector components X, Y. A respective vector path base cell (BCXY i, k) has its input side connected to the output lines for carry and sum bits (XC i , k, YC i , k, XS i , k, YS i , k) of the immediately-preceding vector path base cell (BCXY i-1, k), insofar as the immediately-preceding vector path base cell exists and, otherwise, either the input lines for carry bits or the input lines for sum bits at the input side given the vector path base cells (BCXY, 0, k) are connected to the processor input lines for inputting a starting vector (X o , Y o ). 
     In a vector iteration stage, the structure for realizing a shift operation comprises a respective vector path base cell BCXY i , k with its input side connected to the output lines for the carry and sum bits XC i ,k+1, YC i ,k+i, XS i , k+i, YS i , k+i of an ifold more-significant, immediately-preceding vector path base cell (BXY i-1 , k+i) and, when this vector path base cell does not exist, has its input side connected to the most-significant, immediately-preceding vector path base cell BXY i-1 ,116 (msb). In accordance with the equations set forth above, the input word X i  must be added to or subtracted from the input word Y i  shifted left i times in each vector iteration stage and vice-versa. In order to minimize the wiring expense for the shift operations between two stages, both data paths for X and Y are bit-by-bit interlaced with one another. 
     FIG. 6 illustrates an angle path base cell BCZ of the present invention. The inputs of the angle path base cell correspond to the inputs of the full adder VA, whereby the one input of the full adder VA is connected to the input lines for an angle bit W i ,k and two other inputs of the full adder VA are connected to the output lines for the carry and sum bits ZC i , k, ZS i , k of the immediately-preceding angle path base cell BCZ i-1 , k insofar as this preceding angle path base cell exists. When such a preceding angle path base cell does not exist, then the inputs of the full adder VA are respectively occupied with a logical &#34;zero&#34; (GND). For mutual decoupling of the vector iteration stages, C 2  MOS registers R1 and R2 are provided, these being clocked by the clock signals CKM and CKS. The clock generator CG mentioned in connection with FIG. 3 generates output signals CK 4, whereby these correspond to the clock signals CKM and CKS and to the clock signals respectively inverted relative thereto. The chronologically-offset clock signals CKM and CKS allow a data transfer according to the master-slave principle. 
     The output line for the carry bit ZC i+1 ,k comes from the next less-significant base cell BCZ i, k-1 and is only looped through the angle path base cell. The output bit line for the sum bit ZS i+1 , k is connected to the output of the first register R1 that, in turn, has its input side connected to the sum output of the full adder VA. The output line for the carry bit ZC i+1 , k+1 is connected to the output of the second register R2 for forwarding to the next most-significant angle path base cell BCZ i, k1, this second register R2 having its input side, in turn, connected to the carry output of the full adder VA. 
     FIG. 7 illustrates a vector path base cell of the present invention that is composed of two multiplexers MUX 1 and MUX 2, four full adders VA1 . . . VA4 and 10 transmission gates 1-10 for decoupling the vector iteration stages. An input line for the sum bit SX i , k of a first vector component X is connected to a first input of the first full adder VA1, and an input line for the sum bit YS i , k of a second vector component Y is connected to a first input of the second full adder VA2. An input line of the carry bit XC i , k of the first vector component X is connected to a first input of the third full adder VA3 via the first transmission gate 1 clocked by a first clock signal CKM, and an input line for the carry bit YC i , k of the second vector component Y is connected to a first input of the fourth full adder VA4 via the fourth transmission gate 4 that is likewise clocked by the first clock signal CKM. An input line for the i-times more-significant carry bit YC i , k+i of the second vector component Y of the second vector component Y is connected via the first multiplexer MUX1 to a second input of the first full adder VA1, and the i-times more significant sum bit YS i , k+i of the second vector component Y is connected to the third input of the first full adder VA1, likewise via the first multiplexer MUX1. The i-times more-significant carry bit XC i , k+1 of the first vector component X is connected via the second multiplexer MUX2 to a second input of the second full adder VA2 and the i-times more-significant sum bit XS i , k+i of the first vector component is likewise connected to the third input of the second full adder VA2, likewise via the second multiplexer MUX2. The multiplexers MUX1 and MUX2 connect through the carry and sum bits of the immediately-preceding vector iteration stage to the full adder VA1 or, respectively, VA2 either inverter or noninverted dependent on the sign signals sign (Z i  &#39;), sign (Z i  &#39;). The sum output of the first full adder VA1 is connected via the second transmission gate 2 to a second input of the third full adder VA3 and the sum input of the second full adder VA2 is connected via the fifth transmission gate 5 to a second input of the fourth full adder VA4, whereby both transmission gates 2 and 5 are clocked by the first clock signal CKM. An output line for a first-stage carry bit XCI i+1 , k+1 of a first vector component is connected via the third transmission gate 3 to the carry output of the first full adder VA1, and an output line for a first-stage carry bit YCI i+1 , k+1 of the second vector component is connected via the sixth transmission gate 6 to the carry output of the second full adder VA2, whereby both transmission gates are clocked by the first clock signal CKM. An input line for a first-stage carry bit XCI i+1 , k of a first of the first vector component X from the next less-significant vector path base cell BCXY i, k-1 is connected to the third input of the third full adder VA3, and an input line for a first-stage carry bit YCI i+1 , k from the second vector component Y of the next less-significant vector path base cell BCXY i, k-1 is connected to the third input of the fourth full adder VA4. The input lines for second-stage carry bits XC i+1 , k, YC i+1 , k of the vector component X and Y from the next less-significant vector path base cell BCXY i, k-1 are looped through onto the output lines for the immediate-following vector interaction stage of the vector path base cell VCXY i, k. The sum output of the third full adder VA3 is connected via the seventh transmission gate 7 to the output line for the sum bit XS i+1 , k of a first component of the immediately-following interaction stage, and the sum output of the fourth fill adder VA4 is connected via the ninth transmission gate 9 to the output line YS i+1 , k for the sum bit of the second component of the immediately-following vector iteration stage, whereby the transmission gates 7 and 9 are clocked by the second clock signal CKS. An output line for a second-stage carry bit XC i+1 , k+1 of a first vector component is connected via the eighth transmission gate 8 to the carry output of the third full adder VA3, and an output line for a second-stage carry bit YC i+1 , k+1 of the second vector component is connected via the tenth transmission gate 10 to the carry output of the fourth full adder VA4, whereby the transmission gates 8 and 10 are clocked by the second clock signal CKS. 
     A simple realization of the logic for sign estimating is comprised in a carry ripple adder (CRA) for the four highest significances of Z i  &#39; whose sign is interpreted as the sign of the corresponding carry-save number. Since the four most-significant bits of the scaled angle steps W 0  &#39; . . . W 11  &#39;, as set forth initially, all begin with the most-significant bits, 11,00, the four-bit ripple adder can be simplified to the optimized detector DET opt  illustrated in FIG. 8. The sign estimating therefore occurs parallel to the addition of Z i  &#39; and W i  &#39; in order to therefore shorten the running time of the stage. As a result of the optimized sign detector DET opt , a sign output signal (Z i+1  &#39;) is formed from the foremost significant carry and sum bits ZC i , 9, ZS i , 9 &#39; . . . ZC i , 12 &#39;, ZS i , 12 &#39; of an immediately-preceding angle interaction stage IZ i-1 and of the non-inverted sign output signal sign (Z i  &#39;) of an immediately-preceding angle iteration stage IZ i-1. The sign output signal sign (Z i  &#39;) of the immediately-preceding angle iteration state is connected to one of the two inputs of an equivalence gate EQ and the output of the equivalence gate EQ is, in turn, connected to one of the two inputs of a first EXCLUSIVE-OR (EXOR) gate EX1. The most-significant carry and sum bots ZC i , 12, ZS i , 12 are operated with a second EXOR gate circuit EX2 and the output of the EXOR gate EX2 is connected to the second of the two inputs of the equivalence gate EQ. The second most-significance carry and sum bits ZC i , 11 &#39;, ZS i , 11 &#39; are operated with a NOR gate, whereby the output of the NOR gate is connected to one of two OR inputs of a first OR-NAND gate ONA1, and these carry and sum bits are likewise operated with a first NAND gate NA1, whereby the output of the first NAND gate NA1 is connected to one of the two inputs of a second NAND gate NA2, and the output of the second NAND gate NA2 is connected to a direct NAND input of the first OR-NAND gate ONA1. The respective third most significant carry and sum bits ZC i , 10 &#39;, ZS i , 10 &#39; are operated with the input OR gate of a second OR-NAND gate ONA2, whereby the output of the second OR-NAND gate ONA2 is connected to one of two OR inputs of a third OR-NAND gate ONA3. The third most-significant carry and sum bits are likewise operated by a third NAND gate NA3, whereby the output of the third NAND gate NA3 is connected to the direct NAND input of the second and third OR-NAND gate ONA2, ONA3. The fourth most-significant carry and sum bits ZC i , 9 &#39;, ZS i , 9 &#39; are operated with a fourth NAND gate NA4. The output of the fourth NAND gate NA4 is connected to the OR input of the third OR-NAND gate ONA3, and the output of the third OR-NAND gate ONA3 is connected to the second OR input of the first OR-NAND gate ONA1 and to the second input of the second NAND GATE NA2. The output of the first OR-NAND gate ONA1 is connected to the second input of the first EXOR gate EX1, and the output of the first EXOR gate EX1 supplies the sign output signal SIGN (Z i+1  &#39;) of the optimized sign detector DET opt . 
     There is also the possibility of realizing the CORDIC algorithm for other modi (multiplication, division, square root or hyperbolic functions) in carry-save architecture. A universal CORDIC processor, controlled via all parameters, would therefore have to be operated in all modi, whereby Y or Z must be optionally iterated to zero. Farther-reaching convergency considerations have shown that a combination of the different modi in a processor with carry-save architecture is basically realizable. 
     Although we have described out invention by reference to particular illustrative embodiments thereof, many changes and modifications of the invention may become apparent to those skilled in the art without departing from the spirit and scope of the invention. We therefore intend to include within the patent warranted hereon all such changes and modifications as may reasonably and properly be included within the scope of our contribution to the art.