Patent Document

[0001]    This invention relates to a method and apparatus for matrix decomposition, more specifically for implementation of QR-decomposition (QRD) and recursive least squares (RLS) based QRD, and in particular to an architecture that is suitable for implementation in an FPGA (field programmable gate array). 
         [0002]    In many areas of technology, for example in specific areas of signal processing such as wireless communications or image processing, it is necessary to solve problems in linear algebra. One well-known technique for solving such problems is to use the QR-decomposition (QRD)-based recursive least squares (RLS) algorithm. 
         [0003]    QR-decomposition is a well-accepted technique employed in matrix calculations. A matrix A is decomposed into Q and R: 
         [0000]    
       
      
       A=Q·R  
      
     
         [0004]    Where R is an upper triangular matrix and Q is an orthogonal matrix, that is: 
         [0000]        Q   T   ·Q= 1 
         [0005]    In this example, Q is formed of a sequence of Givens rotations, each designed to annihilate a particular element of the matrix A. 
         [0006]    QR-decomposition can be used to solve systems of linear equations; e.g. to solve for matrix w, given input and output 3×3 matrices A and z: 
         [0000]    
       
         
           
             
               A 
               · 
               w 
             
             = 
             
               
                 
                   z 
                    
                   
                     
 
                   
                   [ 
                   
                     
                       
                         
                           A 
                           11 
                         
                       
                       
                         
                           A 
                           12 
                         
                       
                       
                         
                           A 
                           13 
                         
                       
                     
                     
                       
                         
                           A 
                           21 
                         
                       
                       
                         
                           A 
                           22 
                         
                       
                       
                         
                           A 
                           23 
                         
                       
                     
                     
                       
                         
                           A 
                           31 
                         
                       
                       
                         
                           A 
                           32 
                         
                       
                       
                         
                           A 
                           33 
                         
                       
                     
                   
                   ] 
                 
                  
                 
                   [ 
                   
                     
                       
                         
                           w 
                           1 
                         
                       
                     
                     
                       
                         
                           w 
                           2 
                         
                       
                     
                     
                       
                         
                           w 
                           3 
                         
                       
                     
                   
                   ] 
                 
               
               = 
               
                 
                   [ 
                   
                     
                       
                         
                           z 
                           1 
                         
                       
                     
                     
                       
                         
                           z 
                           2 
                         
                       
                     
                     
                       
                         
                           z 
                           3 
                         
                       
                     
                   
                   ] 
                 
                 . 
               
             
           
         
       
     
         [0007]    Decompose A into Q·R as described above, and multiply both sides by Q T , giving: 
         [0000]    
       
         
           
             
               R 
               · 
               w 
             
             = 
             
               
                 
                   Q 
                   T 
                 
                 · 
                 z 
               
               = 
               
                 
                   
                     
                       z 
                       ′ 
                     
                      
                     
                       
 
                     
                     [ 
                     
                       
                         
                           
                             R 
                             11 
                           
                         
                         
                           
                             R 
                             12 
                           
                         
                         
                           
                             R 
                             13 
                           
                         
                       
                       
                         
                           0 
                         
                         
                           
                             R 
                             22 
                           
                         
                         
                           
                             R 
                             23 
                           
                         
                       
                       
                         
                           0 
                         
                         
                           0 
                         
                         
                           
                             R 
                             33 
                           
                         
                       
                     
                     ] 
                   
                    
                   
                     [ 
                     
                       
                         
                           
                             w 
                             1 
                           
                         
                       
                       
                         
                           
                             w 
                             2 
                           
                         
                       
                       
                         
                           
                             w 
                             3 
                           
                         
                       
                     
                     ] 
                   
                 
                 = 
                 
                   [ 
                   
                     
                       
                         
                           z 
                           1 
                           ′ 
                         
                       
                     
                     
                       
                         
                           z 
                           2 
                           ′ 
                         
                       
                     
                     
                       
                         
                           z 
                           3 
                           ′ 
                         
                       
                     
                   
                   ] 
                 
               
             
           
         
       
     
         [0008]    It is then a simple task to solve for w using backsubstitution, as shown below for N coefficients. 
         [0000]    
       
         
           
             
               w 
               N 
             
             = 
             
               
                 z 
                 N 
                 ′ 
               
               
                 R 
                 NN 
               
             
           
         
       
       
         
           
             
               w 
               i 
             
             = 
             
               
                 1 
                 
                   R 
                   ii 
                 
               
                
               
                 ( 
                 
                   
                     z 
                     i 
                     ′ 
                   
                   - 
                   
                     
                       ∑ 
                       
                         j 
                         = 
                         
                           i 
                           + 
                           1 
                         
                       
                       N 
                     
                      
                     
                       
                         R 
                         ij 
                       
                        
                       
                         w 
                         j 
                       
                     
                   
                 
                 ) 
               
             
           
         
       
       
         
           
             
               
                 for 
                  
                 
                     
                 
                  
                 i 
               
               = 
               
                 N 
                 - 
                 1 
               
             
             , 
             … 
              
             
                 
             
             , 
             1 
           
         
       
     
         [0009]    It is often appropriate to solve a succession of linear systems, each slightly different from the previous one. Calculating the optimum solution afresh for each iteration is prohibitively expensive in terms of complexity, as each calculation is O(N 3 ), that is, it requires a number of individual calculations that varies with the cube of N. However, it is possible to update the matrix decomposition in O(N 2 ) operations. 
         [0010]    In particular, the recursive least squares form of QR-decomposition (QRD-RLS) is used to compute and update the least-squares weight vector of a finite impulse response filter. Standard recursive least squares uses the time-averaged correlation matrix of the data; in comparison, QRD-RLS operates directly on the input data matrix. This approach is more computationally complex, but has the advantage that it is more numerically stable than standard RLS. With QRD-RLS, the decomposed matrices that are formed are iteratively updated with a forgetting factor A, as shown in subsequent details on implementation. The values stored in the matrix from previous iterations are multiplied by λ, where 0&lt;λ≦1, such that the results are more heavily weighted towards recent input values. The case where λ=1 is standard QR-decomposition. 
         [0011]    There are a number of areas where it is appropriate to apply QR-decomposition, and particularly QRD-based RLS that provides a method for iteratively updating the optimum solution, based on new inputs. 
         [0012]    The technique can be applied in general signal processing problems (i.e. time domain equalization). However, it may be appropriate to apply the technique in antenna beamforming. 
         [0013]    The algorithm can also be exploited in multi-input multi-output (MIMO) techniques, in particular to solve the channel covariance matrix, allowing the parallel data streams to be extracted. 
         [0014]    Another example of where this technique can be used is polynomial-based amplifier digital predistortion. Here an adaptive filter is applied on a number of higher-order polynomials of the input data, for example to apply an inverse of the transfer characteristic of a subsequent power amplifier. In this case, QRD-RLS can be used to calculate and iteratively update the optimum filter coefficients that are applied. 
       SUMMARY OF INVENTION 
       [0015]    According to an aspect of the present invention, there is provided a processor for performing a QR-decomposition. The processor has a program memory; a program controller, connected to the program memory to receive program instructions therefrom; and at least one processing unit. At least one processing unit comprises a CORDIC calculation block; and a distributed memory structure, having separate memory blocks for storing respective parameter values. 
         [0016]    According to a second aspect of the present invention, there is provided a processor for mixed Cartesian and polar processing in QR-decomposition. The processor includes at least one boundary cell and at least one internal cell. At least one boundary cell comprises: a first CORDIC unit, for receiving real and imaginary components of an input value, and for supplying first magnitude and phase values as outputs; a second CORDIC unit, for receiving the first magnitude value as an input, and for supplying a second phase value as an output, and supplying a data value R from an output to an input thereof; and a sin/cos calculation unit, for receiving the first and second magnitude values as inputs, and for calculating real and imaginary sin and cos values thereof. At least one internal cell comprises: a complex multiplication block, for receiving real and imaginary components of an input value, for receiving said sin and cos values from said boundary cell, and for supplying a data value R from an output to an input thereof, and for supplying real and imaginary components of an output value. 
         [0017]    According to a third aspect of the present invention, there is provided a method of supplying data to a systolic array, comprising: storing data relating to a first frame in a first component of a buffer memory and storing zeroes in a second component of said buffer memory; reading data from said first component of said buffer memory into said systolic array; and, thereafter: storing data relating to a second frame in said second component of said buffer memory. 
         [0018]    According to a fourth aspect of the present invention, there is provided a method of reading data out from a systolic array into a backsubstitution buffer, comprising reading data out from said systolic array, and writing data into said backsubstitution buffer, in an order in which it will be processed in a backsubstitution process. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0019]    For a better understanding of the present invention, and to show more clearly how it may be carried into effect, reference will now be made, by way of example, to the following drawings, in which: 
           [0020]      FIG. 1  is a schematic block diagram of the general form of an FPGA-based ASIP. 
           [0021]      FIG. 2  is a schematic diagram of a programmable logic device that can be used for implementation of the processor in accordance with the invention. 
           [0022]      FIG. 3  is a schematic diagram of a systolic array according to one aspect of the present invention. 
           [0023]      FIG. 4  is a schematic block diagram showing the method of operation for processing cells receiving real inputs, according to one aspect of the present invention. 
           [0024]      FIG. 5  is a schematic block diagram showing the method of operation for processing cells receiving complex inputs, according to one aspect of the present invention. 
           [0025]      FIG. 6  is a schematic block diagram of an example of the system according to one aspect of the invention, in which there is one processor. 
           [0026]      FIG. 7  is a schematic block diagram of the data dependency of the systolic array elements when operating with one processor unit. 
           [0027]      FIG. 8  is a schematic block diagram of a systolic array mapping in accordance with an aspect of the invention. 
           [0028]      FIG. 9  is a schematic block diagram of the systolic array mapping showing the time slots for scheduling between three processor units. 
           [0029]      FIG. 10  is a schematic block diagram showing the scheduling of three processor units. 
           [0030]      FIG. 11  is a schematic block diagram showing the scheduling of two processor units. 
           [0031]      FIG. 12  is a schematic block diagram of the data dependency of the systolic array elements when operating with three processor units. 
           [0032]      FIG. 13  is a schematic block diagram illustrating mixed Cartesian/polar processing. 
           [0033]      FIG. 14  is a chart of resources versus calculation time, showing the results of full CORDIC implementation. 
           [0034]      FIG. 15  is a chart of resources versus calculation time, showing the results of mixed Cartesian/polar implementation. 
           [0035]      FIG. 16  is a chart of resources versus calculation time, showing the results of mixed Cartesian/polar implementation. 
           [0036]      FIG. 17  is a chart of resources versus calculation time, showing the results of mixed Cartesian/polar implementation. 
           [0037]      FIG. 18  is a schematic diagram of an input array in accordance with an aspect of the invention. 
           [0038]      FIG. 19  is a schematic diagram of the input array of  FIG. 18  at a later time. 
           [0039]      FIG. 20  is a schematic diagram of the operation of a smaller input array in accordance with an aspect of the invention. 
       
    
    
     DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS 
       [0040]      FIG. 1  shows the general form of an FPGA-based application-specific integrated processor (ASIP). A pipelined program memory  2  and program counter  4  supply the machine with an encoded instruction word. The program memory  2  is typically included within the processor  6  and exploits the dual-port facilities of the memories to allow external sources to load program code. 
         [0041]    The encoded instruction word feeds a decode block  8  that decodes the data to provide a set of control signals for the processor  6 . Control signals include: immediate values such as literals, register file read and write addresses; function unit enable and operation select signals; multiplexer operand-select codes. 
         [0042]    The processing core  6  includes a set of function units  10 ,  12  and the multiplexers  14 ,  16  that route data between them. The function units include memories  18 , registers, basic arithmetic and logic units, and multiply—add blocks. These blocks may exploit specific features of the FPGA device or may rely on standard libraries such as the library of parameterized modules (LPM). In addition, custom application specific units  20  may be included. 
         [0043]    Function units  22  implementing bus-masters, slaves, general purpose I/O, and streaming point-to-point protocols provide I/O functionality. 
         [0044]      FIG. 2  is a schematic diagram illustrating a programmable logic device (PLD), in the form of a Field Programmable Gate Array  400 . As is conventional, the illustrated device  400  includes logic array elements  402  and dedicated memory  404 . The interconnections between the array elements  402  and elements of the memory  404  can be altered, based on configuration data that is supplied to the device. This configuration data therefore determines the functions that the configured device can perform. 
         [0045]      FIG. 1 , and the following Figures, therefore illustrate the functional relationships between components of the device, it being understood that these functional components are formed from the logic array elements  402  and elements of the memory  404  by suitable configuration data. 
         [0046]    The recursive least squares form of QR-decomposition (QRD-RLS) is suitable for a parallel implementation in the form of a systolic array, which on the face of it appears ideal for a hardware solution, in particular in a PLD as shown in  FIG. 2 . However, the resulting architecture can be difficult to reconfigure or scale, and may become too large, especially for a large number of inputs or limited hardware requirement. In this case, the mapping of the systolic array processing cells to available hardware resources necessitates complex control from a conventional RTL perspective. In contrast, using the application specific processor facilitates control and re-use of hardware, permitting a readily scalable and reconfigurable solution. This is complementary to a conventional general-purpose processor approach, as an ASIP solution permits efficient use of the available hardware, targeted for a specific set of requirements. 
         [0047]      FIG. 3  is a block schematic diagram of an example of a systolic array  24  used for QRD-RLS, in which there are four ‘input’ coefficients to array  24  and one ‘output’ coefficient. Similar systolic arrays may be envisaged with a different number of input coefficients. 
         [0048]    The top row  26  of array  24  has five processing cells: one boundary cell  28  operating in vectorize mode to calculate a Givens rotation, followed by four internal cells  30 ,  32 ,  34 ,  36  operating in rotate mode to apply a calculated Givens rotation. Boundary cell  28  receives an input X 1 (0), generates one or more phase outputs  38  and passes the or each phase output sideways to internal cell  30 . 
         [0049]    Internal cell  30  receives an input X 2 (0) and combines it with the or each phase output  38  to generate a new output  40 . The or each phase output  38  is passed to each internal cell in row  26  without being altered. Similarly, each remaining internal cell in row  26  combines the or each phase output  38  with an input to create outputs  42 ,  44 ,  46 . 
         [0050]    Each new output  40 ,  42 ,  44 ,  46  is passed downwards to row  48 . Row  48  has one boundary cell  50  and three internal cells  52 ,  54 ,  56 . Boundary cell  50  receives output  40  and generates one or more new phase outputs  58 . The or each new phase output  58  is passed sideways to each internal cell  52 ,  54 ,  56  in row  48 . 
         [0051]    Internal cell  52  receives output  42  and the or each phase output  58  and generates a new output  62 ; internal cell  54  receives output  44  and the or each phase output  58  and generates a new output  64 ; and internal cell  56  receives output  46  and the or each phase output  58  and generates a new output  66 . 
         [0052]    Each new output  62 ,  64 ,  66  is passed downwards to row  70 . Row  70  has one boundary cell  72  and two internal cells  74 ,  76 . Boundary cell  72  receives output  62  and generates one or more new phase outputs  78 . The or each new phase output  78  is passed sideways to each internal cell  74 ,  76  in row  70 . 
         [0053]    Internal cell  74  receives output  64  and the or each phase output  78 , and generates a new output  84 ; and internal cell  76  receives output  66  and the or each phase output  78 , and generates a new output  86 . 
         [0054]    Each new output  84 ,  86  is passed downwards to row  90 . Row  90  has one boundary cell  94  and one internal cell  96 . Boundary cell  94  receives output  84  and generates one or more new phase outputs  98 . The or each new phase output  98  is passed sideways to internal cell  96 . 
         [0055]    In addition to creating outputs, each cell, boundary and internal, generates a value that is stored inside the cell. 
         [0056]    Data is input to array  24  in a time-skewed manner. The calculations for a particular decomposed matrix (R), and therefore for a particular time snapshot of coefficients, propagate through the array on a diagonal wavefront. 
         [0057]    It should be noted that array  24  is a logical representation of the processing required, and is not representative of the system architecture employed to implement it. While mapping one processing unit to each cell would give the highest throughput possible, such an approach is too resource-intensive. In practice, a smaller number of processing units is employed (possibly even one processing unit) and time-shared between the cells. Further details of the mapping scheme are given below. 
         [0058]      FIG. 4  is a schematic block diagram showing the method of operation for processing cells receiving real inputs, according to one aspect of the present invention. 
         [0059]    Each cell contains at least one CORDIC (coordinate rotation digital computer) unit. CORDIC is a hardware-efficient algorithm for computing functions such as trigonometric, hyperbolic and logarithmic functions. It works by rotating the phase of a complex number by multiplying it by a succession of constant values. However, the constant values can be multiples of 2, and thus in binary arithmetic each calculation can be done using solely shift-and-adds. The CORDIC unit can therefore be conveniently implemented in a PLD as shown in  FIG. 2 . 
         [0060]    Two types of systolic node processing elements are employed here: internal cells (squares) and boundary cells (circles). Boundary cells are used to calculate the Givens rotation that is applied across a particular row in the matrix. As such, the new input is compared to the stored data value (denoted R ij ), and a unitary transform is calculated which annihilates the previous value (which is the conceptual output) and calculates the new value of this element. This value corresponds to the magnitude of a vector made up of the input value and the previous value (scaled by the forgetting factor λ). 
         [0061]    Boundary cell  100  uses CORDIC unit  102  to achieve this by iteratively rotating the vector (R ij , X i ) until the input is annihilated and a new vector (R′ ij , 0) is output. 
         [0062]    The unitary transform (Givens rotation θ out ) which is calculated in boundary cell  100  is output and applied to the remainder of the row by internal cells  104 ,  106 ,  108  (with an index R ij , where i≦j). For example, internal cell  106  uses CORDIC unit  110  to apply the transform to input values, and previous (stored) values, to calculate a new (stored) value, and an output. The transform is also output, to be used by the next boundary cell  108  in the row. 
         [0063]      FIG. 5  is a schematic block diagram showing the method of operation for cells receiving complex inputs, according to one aspect of the present invention. 
         [0064]    The method of operation is similar to that in the case of real inputs; however, in this case at least two CORDIC processes are required in each processing unit. Boundary cell  112  requires two CORDIC processes  114 ,  116  to calculate the Givens rotations that are applied across a particular row in the matrix. First, the new (complex valued) input is received, and a unitary transform calculated by CORDIC block  114  which annihilates the phase of the complex input, and outputs the phase φ out  and the magnitude of the input |X in |. The magnitude of the input, |X in |, is passed to another CORDIC block  116 , which compares it with the stored data value, R ij , and calculates a unitary transform (Givens rotation θ out ) which annihilates the previous value (which is the conceptual output) and calculates the new value of this element. 
         [0065]    The unitary transforms (φ out  and θ out ) which are calculated in boundary cell  112  are output and applied to the remainder of the row by internal cells (with an index R ij , where i≦j). For example, internal cell  118  applies the transforms (shown as φ in  and θ in  as the inputs to the cell  118 ) to input (complex) values, and previous (stored, complex) values, to calculate a new (stored) value, and a (complex) output. The transforms are also output, to be used by the next boundary cell in the row. 
         [0066]    CORDIC block  120  receives a complex input and applies the first Givens rotation φ in . The real part of the so-transformed complex input is passed to CORDIC block  122 , where it is paired with the real part of complex stored data value R ij , and the second Givens rotation θ in  applied. Similarly, the imaginary part of the so-transformed complex input is passed to CORDIC block  124 , where it is paired with the imaginary part of complex stored data value R ij , and the second Givens rotation θ out  applied. 
         [0067]    Although separate CORDIC blocks are shown in  FIGS. 4 and 5 , it will be appreciated that fewer CORDIC blocks than shown could be used by employing time-sharing techniques. For example, a single CORDIC block could perform all the calculations described above for a single processing cell in consecutive steps. However, such a system would have the disadvantage of reduced throughput. 
         [0068]    The overall system is implemented using a custom processor approach, one or more processing units being controlled by a program and a program controller. This provides an efficient solution, exploiting significant time multiplexing between the processing units for an efficient implementation, and allowing a trade-off between performance and size. Moreover, the system has run-time flexibility in: the number of coefficients, the size of frame (i.e. number of inputs to take), real/complex numbers and the number of bits resolution. 
         [0069]    The system has run-time flexibility in its application: the same hardware can be used with different parameters, e.g. smart antennas, space-time coding channel estimation and MIMO reception. The use of a program controller to control multiple processing units allows the system to be scaled up or down easily. It is a simple task to add more processing units, improving the calculation time, or reduce the number of processing units, improving hardware efficiency. 
         [0070]      FIG. 6  is a schematic block diagram of an example of the system according to one aspect of the invention, in which there is one processor. 
         [0071]    As shown in  FIG. 6 , the overall design comprises a program  200 , program counter  201 , and a program controller  202  which controls the functionality of the other modules and resets the calculation if required. 
         [0072]    The overall design also includes an input-formatting block, not shown in  FIG. 6 . This reads in the input data in the correct order and the correct format. 
         [0073]    The processing unit  204  comprises a CORDIC block  206  to do the calculation, an input wrapper  208  and an output wrapper  210  for the CORDIC block  206  (to ensure correct number format) and a distributed memory structure that (along with the scheduling) allows multiple processing units to write to each other whilst ensuring there is only one read operation and one write operation per cycle. 
         [0074]    The overall design also includes an output control block, not shown in  FIG. 5 , that determines when to output the R matrix value (to a backsubstitution module). 
         [0075]    As shown in  FIG. 5 , the processing unit  204  includes logic blocks (CORDIC kernel  204 , and wrappers on the input  206  and output  208  of the CORDIC kernel  204 ), and data memories (ip mem  212 , φ mem  214 , and R mem  218 ). 
         [0076]    The programme controller  202  provides inputs to the processing unit  204 , namely: 
         [0077]    node addr—the address of the node(s) to process. 
         [0078]    mode—the mode of operation for that node (boundary cell or internal cell). 
         [0079]    R wr addr—the destination address for the R value. 
         [0080]    φ addr or output value addr—the destination address of the outputs. 
         [0081]    input (ip) control—an indication whether the input for a particular node is from another node or from the external input. 
         [0082]    output (op) control—a flag to indicate whether an output is required, and what the corresponding address is. 
         [0083]    Internal signals within the processing unit  204  include: R value, which is read from R mem  218 ; φ value, which is the applied Givens rotation, read from CD mem  214 ; and ip value, which is the output received from an internal cell in the row above in the systolic array, read from ip mem  212 . All internal signals are read from internal memories from read address &lt;node addr&gt;, supplied by programme controller  202 . 
         [0084]    Program controller  202  first sends ip control to indicate whether either an external input or ip value should be processed. Wrapper  208  receives R value and either an external input or ip value, puts both values into the correct format for CORDIC processing, and outputs them to CORDIC kernel  206 . CORDIC kernel receives both inputs from wrapper  208 , as well as a signal from program controller  202  indicating whether CORDIC kernel  206  is to operate either in vectorize mode (i.e. as a boundary cell) or in rotate mode (i.e. as an internal cell). 
         [0085]    φ value is written to φ delay line  216 , from where it is further output to φ mem  214 . φ delay line  216  delays writing φ value to φ mem  214  to account for latency in the CORDIC kernel  206 . φ delay line  216  may, for example, be a FIFO memory. 
         [0086]    If CORDIC kernel  206  is to operate in rotate mode, CORDIC kernel  206  also receives φ value and applies the rotation as described in  FIGS. 4 and 5 . It then outputs the transformed ip value and the new R value to output wrapper  210 . 
         [0087]    If CORDIC kernel  206  is operating in vectorize mode, it does not require φ value, and rotates the vector (R, X) so to annihilate the input, as described above. In this case, the new R value is output to wrapper  210 , and the generated φ value is output to φ mem  214 . 
         [0088]    Output wrapper  210  stores the new R value in R mem  218 , and outputs the new ip value to ip mem  214  if operating in rotation mode. 
         [0089]    Program controller  202  further supplies R mem  218  with a signal op control, indicating if the stored R value is to be output to a backsubstitution module (not shown). 
         [0090]    In the example above, wherein the system comprises one processing unit  204 , ip value and φ value are rewritten in ip mem  212  and φ mem  214 , respectively, after undergoing processing. In general, however, there can be any desired number, n, of processing units  204 . In the general case, ip value and φ value are rewritten in ip mem  212  and φ mem  214  of a different processing unit according to rules that are outlined below. 
         [0091]    Scheduling the operations of the processing units is key. It is necessary to ensure that all nodes are processed whilst observing required data dependencies, and to avoid memory contention (i.e. multiple samples being written to one memory at the same time). 
         [0092]    The operation of one or more nodes in the systolic array can be mapped onto each processing unit. In one embodiment of the invention, all nodes can be mapped onto one unit. This gives a very efficient hardware implementation but longer calculation time. 
         [0093]      FIG. 7  is a block schematic diagram illustrating the order of processing of example systolic array  24  when there is one processing unit. In general, processing occurs on diagonals. 
         [0094]    The order is such that the smallest amount of memory is required, and all data dependencies are satisfied. Here the nodes are numbered N 1 -N 14  in the same order as data appears on them. 
         [0095]    In another embodiment, multiple processing units can be used. 
         [0096]    In the method of discrete mapping, one processor unit performs only boundary cell operations, while others perform internal cell operations. This allows optimization of processors, and requires the minimum amount of memory. Other resource-sharing techniques are possible. However, discrete mapping requires the pipeline to be broken to allow calculations to be finished before the next input samples are read in. 
         [0097]    A modified discrete mapping approach can be used to ensure no memory contention. The proposed technique uses the minimum amount of memory (otherwise double buffering would be required). 
         [0098]      FIG. 8  is a block schematic diagram illustrating the modified discrete mapping approach for multiple processing units, for the example systolic array given in  FIG. 3 . The same reference numerals will be used in this Figure. 
         [0099]    The position of cells  56 ,  74 ,  76 ,  94 ,  96  is redrawn above the original array such that five diagonals  220 ,  222 ,  224 ,  226 ,  228  are formed. Diagonal  220  comprises cells  28 ,  56  and  74 ; diagonal  222  comprises cells  30 ,  76  and  94 ; diagonal  224  comprises cells  32 ,  50  and  96 ; diagonal  226  comprises cells  34 ,  52 ; and diagonal  228  comprises cells  36 ,  54  and  72 . 
         [0100]    The repositioning of the cells allows the introduction of a further cell  99  in the systolic array without increasing the latency of the system. This cell  99  may, for example, be used to calculate the error term. 
         [0101]      FIG. 9  is a blockschematic diagram further illustrating the modified discrete mapping approach. 
         [0102]    One new input vector will be read in during each time period, referred to as a beat, and every node in the array will be clocked once. If the number of processing units is less than the number of nodes (which is likely) then each beat is divided into multiple time slots. 
         [0103]    The nodes are divided into groups according to the time slots in which they will be processed. Specifically, diagonal  220  corresponds to time slot  3 ; diagonal  222  corresponds to time slot  4 ; diagonal  224  corresponds to time slot  0 ; diagonal  226  corresponds to time slot  1 ; and diagonal  228  corresponds to time slot  2 . 
         [0104]    The optimum number of processors is the same as the number of nodes on the longest diagonal: one boundary cell and two internal cells in this case. 
         [0105]      FIG. 10  is a block schematic diagram illustrating the operation of the three processors  230 ,  232 ,  234  in this case. Thus, the three nodes in each time slot in  FIG. 9  are mapped onto the three processors. The arrows indicate the flow of data between the three processors  230 ,  232 ,  234 . 
         [0106]    Different mappings are possible. For example,  FIG. 11  illustrates the operation of two processors  236 ,  238  for the array of  FIG. 8 , and the arrows indicate the flow of data between the processors. Thus it is possible to reduce the number of processing units; however, using fewer than the optimum number of processors means that processor  238 , performing internal cell operations, will be more heavily loaded than processor  236 , performing boundary cell operations. This approach decreases the required resources but increases the calculation time. 
         [0107]      FIG. 12  is a schematic block diagram showing the order in which data appears in the example systolic array of  FIG. 2  (5×5 case). The data dependency is to ensure that the operation of a particular node does not occur before the output of the previous beat on the input cell is received. 
         [0108]    Thus, the order in which data appears in the cells is: firstly, the cell indicated by N 1 , namely the cell  28 ; secondly, the cell indicated by N 2 , namely the cell  30 ; thirdly, the cells indicated by N 3 , namely the cells  32  and  50 ; then the cells  34  and  52  indicated by N 4 ; the cells  36 ,  54  and  72  indicated by N 5 ; the cells  56  and  74  indicated by N 6 ; the cells  76  and  94  indicated by N 7 ; and, finally, the cell  96  indicated by N 8 . 
         [0109]    For discrete mapping, calculations must be finished before the next input samples are read in, e.g. the nodes (indicated by N 3  and N 8  in  FIG. 12 ) allocated to time slot  0  are fed by the nodes (indicated by N 2  and N 7  in  FIG. 112  allocated to time slot  4  (see  FIG. 9 ). Therefore the result from time slot  4  must be ready before time slot  0  can be run on the next beat of the systolic array. 
         [0110]    With a single processor, and assuming a restart interval of 1 (i.e. assuming that data can be loaded in, and an answer can be read out, within one cycle), the pipeline can be fully loaded if the latency is less than the number of nodes, e.g. in the single processor case, if the latency is less than or equal to 14 beats the calculation for node N 1  will be available before node N 2  for the next beat is clocked. 
         [0111]    The pipeline can be fully loaded if the latency of the processing unit is not too large or too small. 
         [0112]    If the latency is larger than the number of nodes: processing is stopped until the output appears. E.g. in the 5×5 case there are 14 nodes; if the latency is more than 14 beats, processing cannot start, e.g. node N 2  on beat n cannot be clocked before the output of node N 1  on beat n-1 is received. 
         [0113]    If the latency is too small, there may be a problem if the output of a node is ready too early, e.g. if the latency is only 2 beats, the output of node N 7  is ready before node N 10  is processed. In this case, two separate memories may be needed (one for this beat and one for the last beat). The maximum time between nodes is given by (num_coeffs/2)+1. 
         [0114]    As described above, the QRD operation is implemented as a series of Givens rotations. This involves calculating a rotation in the boundary cell, and applying it in the remaining cells. For example, Matlab code is available for performing these steps, which are also described in “Numerical recipes in C” (2 nd  ed) page 98, section 2.10, “QR Decomposition”. The calculation and application are performed using CORDIC. 
         [0115]      FIG. 13  is a schematic block diagram illustrating mixed Cartesian/polar processing for complex inputs. Again, the boundary nodes  300  operate in vectorize mode, and the internal nodes  302  operate in rotate mode. However, this is a different implementation of the node processor, which is transparent to the higher-level architecture. 
         [0116]    Each boundary cell  300  has a sin/cos unit  304  which outputs sin and cos components of the or each phase output rather than the or each phase value itself. Thus, internal cells  302  can exploit hard multipliers  306  instead of further CORDIC processes, allowing balancing of resources. 
         [0117]    The boundary cell  300  has two CORDIC units  308 ,  310 , which operate in a similar manner to CORDIC units  114 ,  116  in  FIG. 5 . CORDIC unit  308  receives real and imaginary components of the input, and outputs the magnitude of the complex input to CORDIC unit  310 . CORDIC unit  310  receives the magnitude of the complex input, and the stored R value, and annihilates the magnitude component as described previously, creating a new stored R value. 
         [0118]    The boundary cell  300  receives three inputs, the R value, and the real and imaginary components of the input, and it outputs sin and cos components according to the following code (where op is output): 
         [0119]    //x_in is the input (which is complex), x is the stored value (which is real) //lambda is the forgetting factor 
         [0120]    mag_sqd=x_in.real( )x_in.real( )+x_in.imag( )*x_in.imag( )+lambda*x.real( )*x.real( ); 
         [0121]    cos_op=sqrt(lambda)*x.real/mag_sqd: 
         [0122]    sin_op.real( )=x_in.real( )/mag_sqd; 
         [0123]    sin_op.imag( )=x_in.imag( )/mag_sqd; 
         [0124]    Internal cell  302  comprises hard multiplier  306 , which receives real and imaginary components of an input, as well as the sin and cos components output from sin/cos unit  304 , and calculations according to the following code (again where op is output): 
         [0125]    internal_cell_op.real( )=cos_op*x_in.real( )−sqrt(lambda)*(sin_op.real( )*x.real( )−sin_op.imag( )*x.imag( )); 
         [0126]    internal_cell_op.imag( )=cos_op*x_in.imag( )−sqrt(lambda)*(sin_op.imag( )*x.real( )+sin_op.real( )*x.imag( )); 
         [0127]    x.real( )=sin_op.real( )*x_in.real( )+sin_op.imag( )*x_in.imag( )+sqrt(lambda)*cos_op*x.real( ); 
         [0128]    x.imag( )=sin_op.real( )x_in.imag( )−sin_op.imag( )*x_inseal( )+sqrt(lambda)*cos_op*x.imag( ); 
         [0129]    This has the advantage of greatly reducing the number of logic elements (LEs) required for fast processing (see  FIG. 15 ). 
         [0130]      FIG. 14  illustrates a first example of the results and resource utilization from the implementation of QRD-RLS, in the case where the data width is 16-bit, there are 20 coefficients, and the system performs 2000 iterations. Design space exploration allows trade-off between calculation time and resources. 
         [0131]      FIG. 14  shows the results from full CORDIC implementation. Multipliers are used to remove CORDIC scaling; time multiplexing is used where appropriate, between nodes and within nodes; and the system operates with a clock rate of 153.6 MHz. 
         [0132]      FIG. 15  shows the results using a similar top-level architecture with mixed polar and Cartesian processing. As can be seen, this results in a higher multiplier utilization, and less usage of logic. 
         [0133]    In the implementation of the processing unit for performing the RLS algorithm, for example, in order to provide an adaptive filtering system, a “forgetting factor” (λ) is applied. The result is more heavily weighted towards recent inputs 0&lt;λ≦1. If λ=1, the system is not adaptive (i.e. conventional QRD is implemented). 
         [0134]    It is necessary to scale all R values in the array by sqrt(λ) after every beat. In order to implement this, this scaling is combined with the scaling that is required on the output of the CORDIC block (e.g. in a hard multiplier). More specifically, the scaling can be implemented as a series of shift-and-adds, or with a multiplier. 
         [0135]    As mentioned previously, the overall design includes an input-formatting block to put the data input into the correct format for processing. There are three main options for the number format to be used. 
         [0136]    Firstly, there is standard fixed-point format, e.g. Q1.15. In this case, one potentially needs to provide scaling in the input block to avoid overflow. RLS scaling by a forgetting factor will also ensure overflow does not occur. 
         [0137]    Secondly, there is floating-point format, e.g. IEEE-754, single precision format. This typically provides greater accuracy, and a large dynamic range. 
         [0138]    Thirdly, there is block floating-point format. In this case, all R matrix values share one exponent. This provides a large dynamic range, with lower complexity than true floating point. 
         [0139]    In the case of a floating-point implementation, the format can be the same as IEEE-754, or custom mantissa and exponent size. 
         [0140]    Received data must be subject to input conditioning, to convert from the input format (e.g. fixed-point) to floating-point format. Specifically, it is necessary to detect the number of leading zeroes, shift the mantissa, and decrement the exponent. 
         [0141]    The CORDIC operation must be modified. Specifically, a floating-point wrapper must be provided for a fixed-point CORDIC block. One possibility is to right-shift the mantissa of the smaller of the two X and Y inputs to the CORDIC block, so that the exponents are the same. Then, it is possible to perform CORDIC operations as normal, and then normalize X and Y output (zero-detect, shift mantissa, increment/decrement exponent). Phase output can be left as fixed-point. This is not true floating-point, so there is some degradation in performance. 
         [0142]    For the output conditioning of the data, backsubstitution can be performed with floating-point numbers, for greater accuracy, or the data can be converted to fixed-point format. 
         [0143]    In the case of a block floating-point implementation, there is one single exponent value for all matrix values. Less memory is required, and the wrapper for the CORDIC block can be simpler. This still allows gain in the array; there is no need to scale the input values. The format can be the same as IEEE-754, or custom mantissa and exponent size. 
         [0144]    The input conditioning is the same as conventional floating-point. However, the sequence of operations is modified. 
         [0145]    Assuming there is a maximum of x2 gain per beat, exp_shift is set to 0 at the start of the beat. The R value and input value are shifted by one bit if required (see below to determine if required). CORDIC operation is performed as normal, with additional bits provided in the CORDIC block to allow gain. If the magnitude of any output value &gt;1.0, flag exp_shift is marked as 1 but values are stored as normal. At the end of the beat, exponent =exponent+exp_shift. 
         [0146]    If exp_shift==1, then, on the next beat, reset exp_shift to zero, and right shift all R values and IO values between nodes by one place before processing. 
         [0147]    For output conditioning in block floating-point format the exponent can be ignored, as it is the same for all R matrix values and therefore cancels in the backsubstitution calculation. 
         [0148]    Alternatively it is possible to convert to conventional floating-point format for better resolution in backsubstitution calculation. 
         [0149]      FIG. 17  shows a comparison of the use of fixed- and floating-point data in the RLS calculation, in the case where there are 20 coefficients, and the system performs 2000 iterations. The clock rate is 150 MHz. Specifically,  FIG. 17  shows the comparison between 32-bit floating-point data, and 18- or 24-bit fixed-point data. 
         [0150]    The description above sets outs the operation of the systolic array on the input data, but it is also necessary to consider the method of reading data into the systolic array. 
         [0151]    Specifically, it is necessary to stagger the inputs to the systolic array to conform to correct processing. The conventional method would be to use shift registers for this, but a large amount of logic would be required for this. 
         [0152]    Here an alternative method is proposed of reading in, storing and correctly formatting the input blocks in situ in the memory. 
         [0153]    As described previously,  FIG. 3  illustrates the inputs to the systolic array. Specifically, the inputs to the systolic array are staggered to ensure the correct order of processing. Zeroes are fed in when starting processing and data follows a diagonal wavefront. Thus, x 1 (0) is input, then x 1 (1) and x 2 (0) are input, then x 1 (2), x 2 (1) and x 3 (0) are input, and so on. 
         [0154]      FIG. 17  is a schematic diagram of an input array  350 , showing the way in which the input data is conditioned. Input array  350  has a size which is determined by N (number of coefficients), e.g. 20, and M (frame size of input data), e.g. 200. In this illustrated case, the total size=2×N×M (double buffering). 
         [0155]    Firstly, the lower half  352  of the input array  350  is initialized to zero, and the upper half  354  of the input array  350  stores the data for the first frame. Data is read into the systolic array at times t(n) sequentially for all N systolic array inputs. Data is read from the input array 350 on diagonals, such that the first input on the first diagonal  356  is x 0 (0) followed by N-1 zeroes, then the second diagonal  357  contains x 0 (1), x 1 (0), followed by N-2 zeroes, and so on. 
         [0156]      FIG. 18  is a schematic diagram illustrating the input array  350  at a later time. 
         [0157]    Data continues to be read on diagonals. When diagonal  358  is read out, the lower half  352  of the input array  350  is no longer used, as shown in  FIG. 19 , and the next frame of input data can be read into the lower half  352  of the input array  350 . This occurs after N diagonals have been read out from the input array. Similarly, when the upper half  354  is no longer needed (when a further M diagonals have been read out), the next frame of input data is read in there. 
         [0158]      FIG. 19  is a schematic diagram showing the operation of an alternative smaller input array  360 . 
         [0159]      FIGS. 17 and 18  assumed a buffer size of 2NM. However, the input buffer can be N(N+M)=NM+N 2 , as shown in  FIG. 19 . This is because the size of the overlap region when reading on a diagonal is N 2 . 
         [0160]    After reading in the first frame F(0), with N 2  zeroes in the lower part  362  of the input array  360 , as shown in  FIG. 19(   a ), data is read out on diagonals, as illustrated in  FIG. 17 . Then, when sufficient memory is available, i.e. after time NM, the next frame, namely F(1), is read in to the input array  360 . For some time, both the frames will be required, i.e. the most recent fragment of F(0) and the new samples of F(1). Similarly for subsequent frames:
       at time NM, F(1) and the last fragment of F(0) are required as shown in  FIG. 19(   b );   at time 2NM, F(2) and the last fragment of F(1) are required as shown in  FIG. 19(   c ); and   at time 3NM, F(3) and the last fragment of F(2) are required, as shown in  FIG. 19(   d ); etc.       
 
         [0164]    Below is the pseudo-code for the input conditioning. This assumes double buffering, with the memory configured as a 10 buffer of size=2NM bits. 
         [0000]    
       
         
               
               
             
           
               
                   
                   
               
             
             
               
                   
                 valid_count = N; 
               
               
                   
                 start_addr = N * M; 
               
               
                   
                 while{ 
               
               
                   
                  addr=start_addr; 
               
               
                   
                  for i=0;i&lt;N;i++ 
               
               
                   
                  { 
               
               
                   
                   //addr = addr −N + 1; 
               
               
                   
                   if (addr &lt; 0) 
               
               
                   
                    addr = addr + 2*N*M 
               
               
                   
                    read out memory at address addr; 
               
               
                   
                  } 
               
               
                   
                  valid_count = valid_count − 1; 
               
               
                   
                  if (valid_count≦0) 
               
               
                   
                  { 
               
               
                   
                   //read in N*M new values into memory 
               
               
                   
                   valid_count = N; 
               
               
                   
                  } 
               
               
                   
                  start_addr = start_addr + N*N; 
               
               
                   
                  if (start_addr≧2*N*M) 
               
               
                   
                   start_addr=start_addr−2*N*M; 
               
               
                   
                 } 
               
               
                   
                   
               
             
          
         
       
     
         [0165]    As mentioned above, the data follows a diagonal wavefront. As shown in  FIG. 3 , data having the same time index, in parentheses, corresponds to a particular time sample. At one instant in time, if processing of the array is stopped, samples on a diagonal correspond to the same time: the top-left of the array being the newest samples; and the bottom-right of the array being the oldest samples. 
         [0166]    To perform backsubstitution, an array of outputs corresponding to one time sample is required. The standard method for doing this is the ‘stop’ method, which will be described briefly below. 
         [0167]    The stop method involves stopping processing on a diagonal wavefront. For example, one might stop after sample 6. This would result in the whole array corresponding to the same time sample (for example the whole array would be sample 6). It is easy to extract the data when the array has been fully stopped. This method can be easier to implement when there is more than one processing unit. 
         [0168]    In more detail, when the input sample value exceeds a certain time, null values are fed into the systolic array. Zeroes may be able to be fed in, but, in the case of RLS implementation, the forgetting factor will mean that the array values decay with a zero input, and so an additional mechanism is required to prevent this occurring, e.g. a control on the processing unit to suspend processing. 
         [0169]    Once the last node has been suspended, the array values are read out to backsubstitution. To reset processing, all array values, 10 values and theta values are reset to zero. To restart processing, new data are fed in on a diagonal wavefront (as when starting). The processing unit starts processing data when non-null input is received. 
         [0170]    The stop method, therefore, clearly has the disadvantage that processing of the array must be suspended while data is output. Here an alternative method is proposed, termed the ‘sample’ method, which outputs data from the array ‘on the fly’. 
         [0171]    In the sample method, samples are extracted corresponding to a particular sample as the processor is operating. A node value is extracted for e.g. sample 6 (i.e. when a sample corresponding to time value 6 is received). Array processing continues as normal, and there is no need to stop the array. 
         [0172]    In more detail, one implementation of the sample method is for the programme controller to have a modulo D counter (D_count), where D is the number of diagonals in the systolic array (e.g. 5 in the example illustrated in  FIG. 2 ). In the programme, each node has an associated diagonal value, E. An output is read from the processing unit if D_count=E. For example, these values can be written to a backsubstitution buffer. Once D_count is reset to zero, data is valid. That is, all samples in the backsubstitution buffer correspond to the same time sample. The buffer is valid until the next data sample is written. 
         [0173]    When suspending the array processing, it is preferable to ensure suspension only occurs when D_count is reset to zero. Processing is suspended and the backsubstitution buffer is also valid. 
         [0174]    With more than one processing unit, several values will be ready to be written to the backsubstitution buffer on the same cycle. 
         [0175]      FIG. 20  is a schematic block diagram illustrating the order in which data is written to the backsubstitution buffer for the example array given in  FIG. 3 . 
         [0176]    Using the array shown in  FIG. 3 , the order of output to the backsubstitution buffer is indicated by the order of the numerals P 1 -P 14  shown in  FIG. 20 . 
         [0177]    Data is written to the backsubstitution buffer according to one of the two methods described above. The data is ordered in the sequence it will be processed, namely right-to-left from the bottom. This simplifies the addressing in backsubstitution. Details of the mathematical principles of the backsubstitution method have been given previously. 
         [0178]    Backsubstitution can be performed using an embedded or an external processor. 
         [0179]    Using an external or embedded processor, the QR-decomposition engine calculates a predefined number of samples and then suspends processing. A DATA_VALID signal indicates that backsubstitution data buffer is valid, and no more data can be written to the backsubstitution buffer. Processing may be suspended or may continue (depending on system requirements). 
         [0180]    Then the processor performs the backsubstitution calculation, and outputs the calculated coefficients. A PROCESSOR_READY signal indicates when calculation has finished and the processor is ready for another. Calculation can be done in fixed-(int) or floating-point (float) format. It is possible to improve backsubstitution with hardware accelerators for add, multiply, or divide. Depending on the number of samples per decomposition calculation, the processor may be lightly loaded with backsubstitution only, and can perform other tasks. For example, the processor can be implemented with an Altera Nios II (RTM) soft processing core. 
         [0181]    Backsubstitution can alternatively be performed using a hardware or custom processor. 
         [0182]    This gives a faster calculation time than the processor implementation, and so is more appropriate for faster coefficient updates. Calculation is triggered by the DATA_VALID signal. 
         [0183]    Data dependency on divide operation can be mitigated by calculating the reciprocal of the boundary cells as soon as they are ready. Calculation is then multiply and accumulate of available coefficients and reciprocal.

Technology Category: g