OPTIMAL PARAMETRIC SIGNAL PROCESSOR

Abstract: An optimal parametric signal processor, which receives autocorrelation coefficients, provides lattice coefficients in an optimal manner, and allows the use of any number of available parallel processing units. The signal processor may be implemented in a fully parallel or fully sequential manner, or in a "parallel-partitioned" implementation which provides the benefits of parallel processing, manageable hardware complexity, and optimal signal processing for a given number of available processors.

Description: OPTIMAL PARAMETRIC SIGNAL PROCESSOR FIELD OF THE INVENTION The present invention relates to the field of signal processing, and in particular, parametric signal processing. BACKGROUND OF THE INVENTION Parametric signal processing is used in many areas, such as speech and image analysis, synthesis and recognition, neurophysics, geophysics, array processing, computerized tomography, communications and astronomy, to name but a few. One example of signal processing of particular importance is the linear prediction technique, which is used for speech analysis, synthesis and recognition, and for the processing of seismic signals, to enable the reconstruction of geophysical substrata. The linear prediction technique employs a specialized autocorrelation function. Another form of signal processing which finds a multitude of applications, is the determination of an optimal (in the least square sense) finite impulse response filter. A signal processor employing such a technique works with the autocorrelation of the filter input signal and the cross-correlation between the input and the desired response signal, and may be used in many of the above-mentioned applications. Still another form of signal processing of particular importance is known in the art as *L-step ahead* prediction and filtering, for solving the -•optimum lag* problem. This technique is especially useful in designing spiking and shaping filters. Signal processors which perform this function employ a specialized autocorrelation function which also takes into account a time lag associated with the system. Generally, as the order of the system under investigation increases, the complexity of the signal processing necessary to provide useful information also increases. For example, using the general Gaussian elimination procedure, a system of order p can be processed in *0(p 3 )* steps, indicating the number of steps as being *on the order of* p 3 , i.e., a function of p cubed. Thus, it- ill, be appreciated that a system having order of p=100 requires on the order of one million processing steps to process the signal, a limitation of readily apparent significance, especially where real time processing is required. Signal processing techniques have been developed which have reduced the number of operations required to process a signal. One such method has been based on a technique developed by N. Levinson, which requires 0(p 2 ) sequential operations to process the signal. In particular, the *Levinson technique* requires 0(2*p 2 ) sequential operations in order to process the signal. An improved version of this technique, known as the *Levinson-Durbin* technique requires 0(l*p 2 ) sequential operations to process the signal. Neither of these schemes is suitable for parallel implementation. On the general subject of the Levinson and Levinson-Durbin techniques, see N. Levinson, *The Wiener RMS (Root-Mean-Square) Error Criterion in Filter Design and Prediction*, J. Math Phys.. Vol. 25, pages 261-278, January 1947; and J. Durbin, "The Filtering of Time Series Models*, Rev. Int. Statist. Inst.. Vol. 28, pages 233-244, 1960. Although they represent an order of magnitude improvement over the Gaussian elimination technique, the Levinson and Levinson-Durbin techniques are too slow for many complex systems where real time processing is required. Another way of implementing the main recursion of the Levinson-Durbin technique, for the computation of what is widely known as 'lattice coefficients*, was developed by Schur in 1917, in order to establish a system stability criterion. See I. Schur, *Uber Potenzreihen Die In Innern Des Einheitskreises Beschrankt Sind*, J. Reine Anαewandte Mathematik. Vol. 147, 1917, pages 205-232. Lev-Ari and Kailath, of Stanford University, have developed a different approach, based on the Schur and Levinson techniques, which provides a triangular *ladder* structure for signal processing. The Lev-Ari and Kailath technique uses the signal, per se, as the input to the processor, rather than autocorrelation coefficients, and it is Used in the signal modelling context. See H. Lev-Ari and T. Kailath, *Schur and Levinson Algorithms for Non-Stationary Processes*, IEEE International Conference on Acoustics. Speech and Signal Processing, 1981, pages 860-864. In another modification to the Schur technique, Le Roux and C. Gueguen re-derived the Schur algorithm, giving emphasis to the finite word length implementation, using fixed point arithmetics. See Le Roux and Gueguen, *A Fixed Point Computation of Partial Correlation, Coefficients*, IEEE Transactions on , , an , 1977, pages 257-259. Finally, Kung and Hu, have developed a parallel scheme, based on the Schur technique, which uses a plurality of parallel processors, to process a signal, having order p, in O(p) operations, a significant improvement compared to the Levinson-Durbin technique. See Kung and Hu, *A Highly Concurrent Algorithm and Pipelined Architecture for Solving Toeplitz Systems'', IEEE Transactions on Acoustics. Speech and Signal Processing, Vol. ASSP-31, No. 1, February 1983, pp. 66-76. However, the application of the Kung and Hu technique is severely limited insofar as it requires that the number of processors be equal to the order of the system to be solved. Thus, the Kung and Hu technique cannot process a signal produced by a system having an order greater than the number of parallel processors. System complexity is therefore a major limiting factor in using the Kung and Hu technique, insofar as many complex systems may have orders much higher than the number of parallel processors currently available in modern VLSI or other technology. OBJECTS AND SUMMARY OF THE INVENTION It is therefore an object of the present invention to overcome the difficulties associated with prior art signal processors and methods. It is another object of the present invention to provide an optimal parametric signal processor and processing method. It is another object of the present invention to provide a signal processor and processing method which can be implemented using (i) a single processing unit, to process a signal in a fully sequential manner, (ii) a plurality of processing units to process a signal in fully parallel manner, or (iii) a lesser plurality of processing units to process a signal in a *partitioned parallel* manner. It is another object of the present invention to provide a linear prediction signal processor which also forms the basis for L-step ahead and least square-finite impulse response (LS-FIR) processors. In accordance with a basic aspect of the present invention, a signal processor which receives autocorrelation coefficients corresponding to a system, for providing lattice coefficients of the system, comprises processor means for (1) receiving a plurality of the autocorrelation coefficients; (2) multiplying a first autocorrelation coefficient by a first lattice coefficient, resulting in a first product, and for individually adding a first pair of autocorrelation coefficients, adjacent to the first autocorrelation coefficient, to the first product, to yield a first pair of intermediate values, during a first time interval; (3) multiplying a second autocorrelation coefficient by the first lattice coefficient, resulting in a second product, and for individually adding a second pair of autocorrelation coefficients, adjacent to the second autocorrelation coefficient, to the second product, to yield a second pair of first intermediate values, during a second time interval; and (4) multiplying a selected two of the first intermediate values by a second lattice coefficient, resulting in a pair of third products, and for individually adding another two of the first intermediate values, adjacent to the selected two of the first intermediate values, to the third pair of products, to yield a pair of second intermediate values, during a third time interval; and divider circuitry or forming the quotient of a selected pair of autocorrelation coefficients to produce the first lattice coefficient, and for forming the quotient of a selected pair of the first intermediate values to produce the second lattice - coefficient. The processor means may comprise a plurality of parallel processing units, wherein the first and second time intervals occur substantially simultaneously, and precede the third time interval, to provide a fully parallel, or 'parallel-partitioned* signal processing. Alternatively, the processor means may comprise a single processing unit, wherein the first time interval precedes the second time interval, which in turn precedes the third time interval, to provide a fully sequential signal processor. In accordance with another aspect of the present invention, a signal processor which receives autocorrelation coefficients of a system, for providing lattice coefficients of the system, comprises an input device for receiving the autocorrelation coefficients, and at least two parallel processing units, each of which includes a processor for multiplying a first one of the autocorrelation coefficients by a first lattice coefficient, resulting in a first product, and for individually adding a selected " pair of autocorrelation coefficients, adjacent to the first of the coefficients, to the first product, to yield a pair of first intermediate values. A storage and retrieval structure is included for applying at least two such pairs of first intermediate values from the at least two parallel processing units to at least one of the parallel processing units, to thereby multiply a selected two of the first intermediate values by a second lattice coefficient to produce a pair of second products, and to individually add a pair of first intermediate values, adjacent to the selected two of the first intermediate values, to the pair of second products, to yield at least a pair of second intermediate values. Divider circuitry is also provided for forming the quotient of a selected pair of the autocorrelation coefficients to produce the first lattice coefficient, and for forming the quotient of a selected pair of the first intermediate values to produce the second lattice coefficient. BRIEF DESCRIPTION OF THE DRAWINGS These and other objects, aspects and embodiments of the present invention will be described in more detail below with reference to the following drawing figures, of which: FIG. 1 illustrates the *superlattice* processing structure, for the non-symmetrical case, in accordance with the present invention; FIG. 2 illustrates the signal processing structure in accordance with the present invention, which allows the direct predictor coefficients a^, to be derived from the lattice coefficients k^ produced by the structure of FIG. 1; FIG. 3 illustrates the 'superlattice* processing structure for the symmetrical case, in accordance with the present invention; FIG. 4 illustrates a 'basic cell* in accordance with the present invention; FIG. 5 illustrates the repeated use of the basic cell of FIG. 4, in order to provide -the processing structure of FIGS. 1 and 3; FIG. 6 illustrates the implementation of the superlattice structure using three basic cells, for a system having order 8; FIG. 7 illustrates the signal flow through real and virtual processors which implement the arrangement of FIG. 6; and FIG. 8 illustrates the hardware implementation of the arrangement shown in FIGS. 6 and 7, in accordance with the present invention, illustrating the three basic cells and associated hardware. DETAILED DESCRIPTION OF THE INVENTION The Non-Symmetrical Case With reference to Fig. 1, there is shown a "superlattice* structure of multipliers, designated by triangles, and adders, designated by circles, arranged in a manner to process a signal in order to produce a linear predictor for a non-symmetrical system. This superlattice structure also forms the basis for L-step ahead and LS-FIR processors. As shown in the figure, a signal from a system, having order P, such as a seismic signal, is applied to a well known digital autocorrelator 10, which produces autocorrelation coefficients r_5 through r 5 . The autocorrelation coefficients are delivered to an input device 12, such as a digital register, or buffer memory, for application to the superlattice structure. With the exception of autocorrelation coefficients r_5, T Q and r<- , each autocorrelation coefficient is applied to a pair of multipliers which function to multiply each coefficient by a pair of "lattice coefficients" k n and k n *, k n being the normal lattice coefficient, and k n * being the "adjoint" lattice coefficient. The multipliers indicated by white triangles function to multiply the autocorrelation coefficients by the normal lattice coefficient k n , while the multipliers indicated by the black triangles function to multiply the autocorrelation coefficients by the adjoint lattice coefficients k n *. Production of the normal and adjoint lattice coefficients will be described below. The two products produced by multiplying each autocorrelation coefficient by the normal and adjoint lattice coefficients are added, in the adders indicated by the circles in the figure, to an adjacent pair of autocorrelation coef icients, to produce a set of first intermediate values ~ n , where n = -3, -2, -1, 0, 2, 3, 4, 5, and ξ m , where m=-5, -4, -3, -2, 0, 1, 2, 3. For example, the autocorrelation coefficient r. 4 , is multiplied by k^ and ^* in multipliers 14 and 16, respectively, and the products are added to the pair of autocorrelation coefficients r_ 3 and r- 5 , which are adjacent to coefficient r__ 4 , in adders 18 and 20, respectively. Similarly, autocorrelation coefficient r. 3 , after multiplication by lattice coefficients k^ and k-^*, is individually added to the adjacent pair autocorrelation coefficients r. 4 and . 2 - The same process takes place for autocorrelation coefficients r_ 2 through i" , to produce the set of first intermediate values, as shown. For the sake of continuity, the autocorrelation coefficients r.5 through τ $ , are also designated as °-r. and where n = -4 to 5 and m - -5 to 4. The lattice coefficients are calculated as follows : _- m -r in k m+l = " im+l/ J o k *m+l β ~ ξ +l ξ o The lattice coefficients k^ and k^* are produced directly from the autocorrelation coefficients, while the second set of lattice coefficients, k2 and k 2 *, are calculated from the first intermediate values. In a manner similar to that performed to generate the first intermediate values, selected pairs of adjacent first intermediate values, for example, ξ - 4 and . 3 are multiplied by the normal and adjoint lattice coefficients 2 and k 2 *, respectively, in multipliers 22 and 24. Two first intermediate values « A _2 and . 5 , adjacent to, and on either side of -li¬ the selected pair, are added to the products produced by multipliers 22 and 24, respectively, to produce two __ 2. second intermediate values ^ - 2 and - 5 * Tne remaining second intermediate values are generated in a similar manner, namely, by multiplying a selected pair of adjacent first intermediate values by the normal and adjoint lattice coefficients k 2 and k 2 *, and by adding to the products, the first intermediate values adjacent to, and on either side of, the selected pair. It will also be seen that, following this signal flow, the third intermediate values and final intermediate values are generated in a similar manner. The lattice coefficients k^ completely characterize the linear predictor and can be used instead of the direct predictor coefficients. In fact, they are preferred for storage, transmission and fast speech synthesis, since they have the considerable advantages of being ordered, bounded by unity and can readily be used for stability control, efficient quantization, and the like. Since T Q corresponds to the energy of the signal, and will therefore have the greatest amplitude of any of the signals processed by the superlattice, all variables can be normalized with respect to r , thus facilitating the use of 'fixed point* processing with its attendant advantages of precision, speed, and processing simplicity. The arrangement shown in Fig. 1 can produce lattice coefficients for a system of the type Ra « -d. where R has a Toeplitz structure. A detailed analysis of this technique is given by G. Carayannis et al., *A New Look on the Parallel Implementation of the Schur Algorithm for the Solution of Toeplitz Equations*, IEEE International Conference on Acoustics. Speech and Signal Processing. March 26-29, 1985, the entire disclosure of which is hereby incorporated by reference. Although the lattice coefficients _ an kj_* are usually preferred, the direct predictor coefficients a^, which are useful in spectral estimation, for example, can be derived from the lattice coefficients using the processing structure of Fig. 2. As shown, the lattice coefficients kι_ and k* j _* are applied to a pair of multipliers 30 and 32, which function to multiply those lattice coefficients by the second lattice coefficients k2 and k2* . respectively, to produce a first set of products a^ 2 nd a *l 2' respectively. These products are then multiplied, in multipliers 34 and 36, respectively, by k 3 * and k3, and added to k2* and k2» respectively, to produce the values a*2 3 and &2 3 respectively. Also, the value of the lattice coefficients k 2 and k 2 * are multiplied by 3* and 3, respectively, in multipliers 38 and 40, and the intermediate values *ι 2 anα ^ a l 2 are added to these products to produce further intermediate values a*ι_ 3 and a* j _ 3, respectively. This process continues until the direct filter coefficients aι_ 8 through a 8 8 and a*ι_ 8 through a* 8 are produced. The Symmetrical Case A special situation exists where the system to be analyzed can be characterized by Ra. •=• ^d, where R has a symmetrical Toeplitz structure, as in the case of auto-regressive linear prediction. In such cases, the superlattice structure of Fig. 1 is simplified to the symmetrical superlattice form shown in Fig. 3, since ri=r.i; ki=ki* and J •= ^-.±, for the symmetrical case. Thus, the two triangular lobes of Fig. 1 become identical, so that one of them can be omitted, allowing the elimination of half of the signal processing. The signal processing structure for the symmetrical case, shown in Fig. 3, provides linear prediction, or auto-regressive modelling, by calculating the lattice coefficients, or in the symmetrical case, the 'PARCOR* (partial correlation) coefficients. It should initially be noted that with this signal processing structure (as well as that shown in Fig. 1) there is no redundancy. That is, each 3 appearing in the processor is produced only once. Additionally, only those signals needed for the production of lattice coefficients, or PARCORs are involved. Thus, the signal processing structure shown in Fig. 3 (and in Fig. 1) represent optimal processing schemes. The signal processor illustrated in Fig. 3 can be implemented as described with reference to Figs. 4-8, below. For the purposes of simplicity, this discussion is limited to the symmetrical case. However, the implementation of the non-symmetrical case will become apparent in view of the description of the symmetrical case. In a manner similar to that shown for the non- symmetrical case of Fig. 1, a system signal is applied to a digital autocorrelator 10, which produces autocorrelation coefficients which characterize the symmetrical system, namely, rg through r 8 . The coefficients are applied to an input device 42, such as a digital register or memory. Note that the signal processor of Fig. 3 receives a signal from a system having an order of 8, whereas the system in Fig. 1 receives a signal from a system having an order of 5. As with the signal processor of Fig. 1, the signal processor of Fig. 3 takes each autocorrelation coefficient, except the first and last, namely r~ and r 8 , and multiplies it by the first lattice coefficient kτ_, which is calculated from r 0 and r x ( 0 , ~ ι) , r P-I ^P-l according to the general formula p = - jp Q* The product of each such multiplication is added, individually, to the adjacent two autocorrelation coefficients, to produce the first intermediate values n » where n-^O, 2 to 8 and -6 to -1. For example, autocorrelation coefficient r^, designated as τ_ and -i > for the sake of conformance with the intermediate variables, is multiplied by lattice coefficient ^, and autocorrelation coefficients r 0 and r2 are added, individually, to the product, to produce a pair of first intermediate values o and "I 21 respectively. Similarly, the next two first intermediate values, namely ~ι and 3 are produced by multiplying autocorrelation coefficient r2 by the lattice coefficient k^, and adding, individually, the adjacent autocorrelation coefficients, namely, rτ_ and r 3 to the products. The second intermediate values can be calculated from the first intermediate values in a similar manner. First, k 2 can be calculated from the ratio of J 2 anα ^ J 0 in accordance with the formula given above. Then, second intermediate values 3 3 an ^ o» f° r example, are calculated by multiplying the first intermediate values -l and J 2 *>Y the lattice coefficient k 2 , and adding the adjacent first intermediate values J 3 and JJ Q to the products, individually. The signal processing continues until the final values 8 and 0 re obtained, from which the last lattice coefficient k 8 can be calculated from the above formula. If direct predictor coefficients are desired, the processing structure shown in Fig. 2 can be employed for the symmetrical case as well as the non- symmetrical case. However, the processing structure of Fig. 2 is somewhat simplified for the symmetrical case since k n = k n *. Returning to Fig. 3, several points should now be noted. Although drawn as a triangular lobe, to illustrate the precise details of the signal processing, it will be appreciated that the various items of hardware, namely, the multipliers, designated by triangles, and the adders, designated by circles, can be comprised of a single set of 14 multipliers and 14 adders which first function to produce the first intermediate values, then the second intermediate values, and so on through the final values. Furthermore, if 14 multipliers and adders are not available, a lesser number can be shared within any given group of intermediate values. Specifically, Fig. 4 illustrates a 'basic cell* 44 which comprises a pair of multipliers 46 and a pair of adders 48. As shown in Fig. 4, the basic cell 44 functions to produce a signal e * a + k^.b, and a signal f « d + k-^.c. The basic cell can be realized with one *two- cycled* processor, or two *one-cycled* processors, to provide signals e and f. The use of the basic cell, as defined in Fig. 4, provides a homogeneous configuration in the hardware, in the sense that the repetition of the same basic cell suffices to produce the whole superlattice structure. More specifically. Fig. 5 illustrates three basic cells denoted by solid, dashed and dotted lines, respectively. By merely duplicating the processing unit illustrated in Fig. 4, a superlattice of any size can be 'constructed*, to process a signal of virtually any complexity. For example, the superlattice of Fig. 5 will process a signal from a system having order 3. To process a signal from a system having order 4, a first additional basic cell can be 'placed on top of* the basic cell 2, to produce first intermediate values e 3 and f 3 (not shown) . A second additional basic cell would similarly be added, to receive as inputs, β 2 , f 2 , © 3 and f 3 , to produce outputs h 2» i 2 (not shown) . Finally, a third additional basic cell would be used to receive hι_, i lr h2 and i 2 as inputs, and produce outputs j^ and l- (also not shown) . Fully Parallel Implementation With recent advances in VLSI technology, the present invention is able to take advantage of the presence of more than one processor, in a multi¬ processor environment, wherein each parallel processor (or pair of processors) functions as a *basic cell*. Returning to Fig. 3, a *fully parallel* implementation is one in which all first intermediate values are produced essentially simultaneously, in parallel, and then, at a later time, all second intermediate values are produced in parallel, and so on, until the signal parameters have propagated through the entire superlattice. The fully parallel implementation of the superlattice is optimal in terms of signal processing speed. For a fully parallel implementation, at least p-1 basic cells must be provided for a system having order p. From Fig. 3 it can be seen that seven basic cells are required for a system having order 8. In operation, the autocorrelation coefficients are delivered to the input device 42, such as a digital register or buffer memory, and applied to the seven basic cells substantially simultaneously, to produce the set of first intermediate values. These intermediate values are then 'fed back* into the input device 42 for reapplication to the processing units. However, since there are only fourteen of the first intermediate values, compared to the sixteen input values generated from the autocorrelation coefficients, during the second step, only six of the seven basic cells are utilized, rather than all seven, to produce the set of second intermediate values. The second intermediate values are similarly 'fed back* into the input device 42 and reapplied to five of the basic cells, to produce the set of third intermediate values, and so on until the set of sixth intermediate values are 'fed back* to a single basic cell, to produce the final values. It will be seen that a sequence of p-1 parallel steps are required to compute the PARCORs. In other words, the complexity of the signal processor is on the order of p, and p-1 processing units are required for the implementation of the fully parallel technique. This compares favorably to the technique proposed by Kung and Hu, cited above, which requires more processing elements. A computer program, written in Pascal, for simulating the fully parallel implementation, is given in Appendix 1, below. Order Recursive Implementation It will be appreciated from an inspection of Fig. 5 that the entire superlattice structure of the signal processor in accordance with Fig. 3 can be built using a single basic cell, as a 'building block*. For example, the basic cell shown in Fig. 4 can first function as basic cell 1, in Fig. 5, to process values al, bl, cl and dl to produce intermediate values el and fl, from which a lattice coefficient can be calculated. However, in order to determine the next lattice coefficient, the basic cell of Fig. 4 must function as basic cell 2 of Fig. 5. In doing so, it processes values a2, b2, c2 and d2 to produce intermediate values e2 and f2. The values a2 and b2 are actually the same as two of the inputs to the first basic cell, namely cl and dl. Finally, the basic cell of Fig. 4 is used as basic cell 3 in Fig. 5, to calculate hi and il based on el, fl, e2 and f2, and the last lattice coefficient can be calculated from hi and il. It will be appreciated that a superlattice of any size can be constructed from a single basic cell, in order to fully process the autocorrelation coefficients associated with a system having virtually any order. In implementing the order recursive technique, with reference to Fig. 3, the autocorrelation coefficients from digital autocorrelator 10 are applied to the input device 42 and stored therein. The single basic cell would first produce ^ Q and "^2 based on autocorrelation coefficients rn, rτ_ and r 2 , and the lattice coefficient k^, which in turn, k l' 3 would k 2 , use. and r2 and r3. These values would be 'fed back* to the input of the basic cell, along with values 3o anα - 4 *5 __ ^ 2 n order to produce J 0 and j 3 , based on those values and 2« At this point, the next lattice coefficient, k 3 , can be produced from J Q and 3 / and stored with the other lattice coefficients. This process of recursively *feeding back* the intermediate variables into the basic cell to produce further intermediate values, to allow the production of further lattice coefficients, is repeated until the entire signal is processed in accordance with the scheme illustrated in Fig. 3. Since only one basic cell is used in this case, a signal processor which uses the order recursive implementation is a strictly sequential machine requiring p(p-l) machine cycles (on t_.he order of p squared) to process a signal from a system having order p. However, since the single basic cell is the only computational structure involved, it is very easily implemented. Further, where the PARCORs are needed instead of the direct filter coefficients, the order recursive technique of the present invention is somewhat faster and much simpler than the Levinson- Durbin technique, but the LeRoux-Gueguen technique has the same complexity. A computer program, written in Pascal, for simulating the order recursive signal processor, is set forth in Appendix 2, below. Partitioned Parallel Implementation As will be appreciated, the implementation of the present invention which produces the. most rapid signal processing is the fully parallel implementation, discussed above. However, that technique has the disadvantage of requiring almost as many basic cells (p-1) as the order of the system to be investigated (p) . Thus, for systems having a very large order, a fully parallel implementation may not be achievable because of lack of a sufficient number of processors. Also, a fully parallel implementation may in some cases be undesirable because of economics achievable through the use of fewer processors. At the other extreme, the simplest way to implement the signal processor in accordance with the present invention is with the use of but a single basic cell, in the order recursive implementation. However, that implementation has the disadvantage of being the slowest, requiring on the order of p 2 operations in order to fully process the signal. The present invention provides a compromise between the constraints of hardware complexity and processing speed through the use of *partitions" which *cut through" the superlattice structure, in parallel, but which are implemented in a time sequential manner. Briefly, the partitioned parallel implementation employs the use of a plurality of basic cells, the number of basic cells being less than p-1, where p is the order of the system. By exploiting the presence of a plurality of parallel processors, in a single system, such as on a VLSI chip, the signal processor in accordance with the present invention will be capable of processing signals associated with virtually any system, of any order, faster than any presently known signal processor, with the exception of that proposed by Kung and Hu. However, as discussed above, the Kung and Hu implementation requires the use of as many processors as the order of the system, a requirement which will often be impossible to achieve. Furthermore, the fully parallel implementation of the present invention is as fast as the Kung and Hu technique. The signal flow through the superlattice for the partitioned parallel implementation will be discussed with reference to Fig. 6, which illustrates a superlattice structure for processing a signal from a system having order 8. The signal is processed using only 3 basic cells, namely 50, 52, and 54, which process the autocorrelation coefficients rO through r4 to produce the set of first intermediate values j n " ~ 2 ' -1 » °» 2 ' 3 » nd 4 * These first intermediate values are *fed back* to the inputs of two of the basic cells, for example 52 and 54, and second intermediate values n, *- l , 0, 3 and 4, are produced. These second intermediate variables are *fed back* to but a single basic cell, for example, 54, and processed to produce third intermediate values Q and 4 . Thus far, the basic cells 50, 52 and 54 have implemented, in parallel, the processing technique of the present invention, as shown in Fig. 3, but only for a portion, or 'partition' of the superlattice, corresponding in width to the number of parallel basic cells employed. This partition will be referred to as 'Partition 1'. After processing Partition 1, the basic cells 50, 52 and 54 are now supplied with autocorrelation coefficients r 3 «r 7 , in order to implement a second partition, referred to in Fig. 6 as 'Partition 2'. The basic cells process the autocorrelation coefficients, to produce the first intermediate values -r __, n " -3, -4, -5, 5, 6 and 7, which values are 'fed back* to the basic cells 50, 52 and 54, along with two of the first intermediate values -2 nc 4 Produced and stored during the processing of the first partition. The basic cells 50, 52 and 54 then process these values, in parallel, to produce the second intermediate values -fnr n ■ -4, -3, -2, 5, 6 and 7. In a similar manner, these values are 'fed back' to the basic cells 50, 52 and 54, along with two of the second intermediate values, ^ -1 and 4 , produced and stored during the first partition, and the basic cells process those values, in parallel, to thereby derive the third intermediate alues, 5n n ■ 3, -2, -1, 5, 6 and 7. The third intermediate values are 'fed back* to the basic cells, along with the third intermediate values, and 134, produced and stored during Partition 1, to produce the fourth intermediate variables ^^, n = -2, -1, 0, 5, 6, and 7. Since no fourth intermediate values were produced during Partition l, only six fourth intermediate values are available and are applied to two of the basic cells, for example, 52 and 54. The six values are processed therein, in parallel, to produce the fifth intermediate variables j [, n = -1, 0, 6 and 7, which are in turn *fed back" to one of the basic cells, 54, for example, to thereby provide the sixth intermediate variables 3 η and -r . As will be appreciated, during the processing of the first two partitions, the lattice coefficients which have been produced (kl - k7) are also stored. It will also be appreciated that during the processing of Partitions 1 and 2, basic cells 50, 52 and 54 operate to *cut through* the superlattice in parallel, in order to provide lattice coefficients k 2 "-k 4 , in Partition 1, and then recursively 'cut through' the superlattice in parallel, to produce lattice coefficients ks-k in Partition 2. There now only remains the processing for the last lattice coefficient k 8 , which is accomplished in a third partition, 'Partition 3*. Since the system is of order 8, the processing during Partition 3 requires but a single basic cell, which can be any one of cells 50, 52 or 54. Specifically, autocorrelation coefficients rg-r 8 are applied to the selected basic cell and processed to produce the first intermediate values ^ 8 and - 6 - These values are 'fed back* to the basic cell, along with two of the first intermediate values, namely _ -r _ η• and _j -r.1 5 . , produced and stored during Partition 2. These values are processed to produce second intermediate values _ 8 and __.-5• Tne above process is repeated until the completion of Partition 3, at which time the last lattice coefficient k 8 can be produced. Thus, when the superlattice of the present invention is implemented using the partitioned parallel implementation, the effective signal flow is fully parallel within any one partition, allowing high-speed processing, yet recursive, or sequential, from partition to partition, thus allowing the processing of a signal from a very high order system using a limited, feasible number of basic cells. A specific example of the partial partitioned implementation will now be described with further reference to Figs. 7 and 8. As shown in Fig. 7, the signal processor is implemented using three parallel processors, 56, 58 and 60, designated *real processors*, which include the basic cells 50, 52 and 54 of Fig. 6. As mentioned above, each of the processors 56, 58 and 60 can implement a basic cell either as one 'two-cycled* processor, or as two "one- cycled* processors. Since the basic cells need only function to multiply and add, they readily lend themselves to implementation in the form of inexpensive and simple 'reduced instruction set* (RIS) processors. Also shown in Fig. 7 are a plurality of other processors, termed *virtual processors*, the existence of which is simulated, in order to process an input signal in accordance with the superlattice structure of Fig. 6. Referring to Fig. 8, the parallel processors 56, 58 and 60 are shown as comprising the basic cells 50, 52 and 54, respectively, of Fig. 6. Each processor also comprises an *a, b Register*, a *c, d Register", an "e, f Register* and a "k Register", which function to individually store values a, b, c, d, e and f, associated with each basic cell (see Fig. 4), and values k associated with lattice coefficients. An "r buffer* 62 is provided for receiving the autocorrelation coefficients r 0 ...rp, and communicates with the processors 56, 58 and 60 by way of an *r bus' 64. Each of the a, b Registers and c, d Registers in each of the processors 56, 58 and 60, receives autocorrelation coefficients directly from the r bus 64. A 'k buffer* 66 provides lattice coefficients k to each of the k Registers in processors 56, 58 and 60, via k bus 68. Dividers and associated logic 70, 72 and 74 are associated with the processors 56, 58 and 60, respectively, and function to receive an output from the e, f Register of its associated processor, produce the lattice coefficients associated therewith, and deliver them to the k Registers of the processors, and the k Buffer 66, via k bus 68. In addition, divider and logic 70 associated with the bottom processor 56, is also in communication with r bus 64 via bus 76, for the special function of the calculation of k^, the first lattice coefficient, from autocorrelation coefficients ro and r-^. Although a separate divider 70, 72 and 74 is shown as being provided for each processor 56, 58 and 60, a single divider and logic will suffice for the entire signal processor, and it is envisioned that when the present invention is embodied in a custom VLSI circuit, only a single divider will be provided. On the other hand, in the case where off-the-shelf commercial processors are used, separate dividers can be provided as shown, and may in fact form a part of each of the processors 56, 58 and 60. In the latter case, the use of all of the dividers is not necessary, and the requisite divisions can be performed by any one of the processors. Within each processor, it is seen that the a, b Register, the c, d Register, and the k Register each provide signals to their associated basic cells, while the output of each basic cell is applied to its associated e, f Register. Each e, f Register provides an output to its associated c, d Register and divider. Between processors, the output of the e, f Register of the bottom processor 56 is applied to the a, b Register of middle processor 58, while the output of the e, f Register in the middle processor 58 is applied to the a, b Register of the top processor 60. The output of the e, f Register of the top processor 60 is similarly applied to the input of the a, b Register of the bottom processor 56, by way of a bordering buffer 78. The operation of the hardware shown in Fig. 8 to produce the superlattice processing structure illustrated in Figs. 6 and 7 will now be described. Phase 0 - Initial Division (kι_ computation) : The divider attached to the bottom-processor accepts the first two correlation coefficients from the r-buffer and produces k* j _. All other elements are idle. Phase 1 - Initialization of partition 1: The a, b and c, d registers of all processors are initialized through the r-bus with the proper autocorrelation coefficients. Phase 2 - Basic cell computations: The basic-cells of all processors compute intermediate values and store them in the e, f registers of each processor. Phase 3 - k computation - storage - transmission: The divider attached to the bottom processor computes k2 from the e, f, register of this processor. k 2 is stored in the k-buffer and transmitted to the k-register of each processor through the k-bus. Phase 4 - Initialization of a, b and c, d registers, update of the bordering buffer: The following transfers take place: e,f of the bottom processor ^-a,b of the middle processor. e,f of the middle processor ^-a,b of the top processor. e,f of the top processor *-*-the bordering buffer. e,f of the middle processor --c,d of the middle processor. e,f of the top processor -»-c,d of the top processor. Phase 5 - Basic cell computations with the bottom processor idle: The basic cells of the middle and top elements produce intermediate values which are stored in the corresponding e,f registers. Phase 6 - k3 computation - storage - transmission: The divider attached to the middle processor computes k 3 , fed by the e,f registers of this processor. k 3 is stored in the k-buffer and transmitted to the k-register of each processor through the k-bus. Phase 7 - Initialization of a,b and c,d registers, update of the bordering buffer: The following transfers take place: e,f of the middle processor _**-a,b of the top processor. e,f of the top processor —»-bordering buffer. e,f of the top processor——^-c,d of the top processor. Phase 8 - Top basic cell computation with the bottom and the middle processor idle: The top basic cell computes intermediate values which are stored in its e,f registers. Phase 9 - k computation-storage: The divider attached to the top-processor computes k4, fed by the e,f registers of that processor. k4 is stored in the k-buffer, but it is not transmitted to the k-registers. Phase 10 - k ] _ retransmission: k 1# which has been stored in the k-buffer, is transmitted to the k-registers of all processors through the k-bus. Phase 11 - Initialization of partition 2: The a,b and c,d registers of all processors are initialized through the r-bus with the proper autocorrelation coefficients. Phase 12 - Basic cells computation: The basic cells of all processors compute intermediate values and store them in the e,f registers of each processor. Phase 13 - Initialization of the a,b and c,d registers, update of the bordering buffer: The following transfers take place: e,f of the bottom processor— *-a,b of the middle processor. e,f of the middle processor—»— a,b of the top processor. e,f of the bottom processor ^c,d of the processor. e,f of the middle processor —»»-c,d of the processor. e,f of the top processor— — c - d. of the processor. e,f of the top processor * -bordering buffer. The a,b register of the bottom processor must be initialized from the bordering buffer before the contents of the latter are destroyed by the storage of the newly computed contents of e, f in the top processor. Phase 14 - Basic cell computation: The same as phase 12. phase 15 - a,b,c,d initialization, update of bordering buffer: The same as phase 13. phase 16 - Basic cell computation: The same as phase 12. Phase 17 - a,b,c,d initialization, update of Bordering Buffer The same as phase 13. Phase 18 - Basic cell computation: The same as phase 12. Phase 19 - l*x, 5 computation-storage transmission: The same as phase 3, but .-, is computed-stored- transmitted instead of k 2 . Phase 20 - a,b,c,d initialization, bordering buffer updating: The same as phase 4, but e,f are stored in a different register of the bordering buffer. Phase 21 - Basic cell computations with the bottom processor idle: The same as phase 5. Phase 22 - g computation-storage-transmission: The same as phase 6, but kg is computed-stored- transmitted instead of k 3 » Phase 23 - a,b,c,d initialization, bordering buffer updating: The same as phase 7, but e,f of the top processor are stored in different registers of the bordering buffer. Phase 24 - top basic cell computations with bottom and middle processors idle: The same as phase 8. Phase 25 - lκ.η computation-storage: The same as phase 9, but k7 is computed and stored instead of k4. Phase 26 - k* j _ retransmission: The same as phase 10. Phase 27 - Initialization of partition 3: The same as phase 11. The continuation through the third partition will be understood by those skilled in the art in view of the foregoing. It will be seen that the storage of intermediate values via the bordering buffer 78, in Fig. 8, is indicated, in Fig. 7 by a small circle in the data path as it crosses the functional location of the bordering buffer 78. It will thus be realized that the use of parallel processors in the partitioned parallel implementation introduces a 'bordering discontinuity', leading to the organization of the hardware illustrated in Fig. 7. In the example provided in Figs. 6, 7 and 8, three parallel processors have been shown to illustrate the functioning of the partitioned parallel implementation, because of its general nature. It exhibits a lack of symmetry with regard to the behavior of each processor. For example, the middle processor 58 does not communicate with the bordering buffer. The top processor applies data to the bordering buffer, while the bottom processor receives data from the bordering buffer. Thus, the number of processors can be extended to as many as needed, by simply adding more processors of the 'middle* type. The superlattice concept is suitable for efficient hardware implementation with commercially available processors. A small number of processors, i.e., 3 to 6, may be used for many applications with very good results and a substantial increase in processing speed over that of prior art signal processors. A computer program written in Pascal is provided in Appendix 3, below for simulating the parallel partitioned implementation of Figs. 6-8, in the manner described above. Furthermore, the appended computer program can be modified by those skilled in the art, in a straightforward manner, in order to drive a multiprocessor version of the present invention, such as that shown in Fig. 8. It will thus be appreciated that the present invention allows the use of a feasible number of parallel processors to perform highly efficient linear prediction signal processing. When so implemented, the 'parallel-partitioned* implementation provides the benefits of parallel processing, manageable hardware complexity, and optimal signal processing for a given number of available processors. It will also be appreciated that the superlattice structure of the present invention can be implemented in a fully parallel, or fully sequential manner, if desired. Various changes and variations to the present invention will occur to those skilled in the art in view of the foregoing description. It is intended that all such changes and variations be encompassed so long as the present invention is employed, as defined by the following claims. -31- APPENDIX 1 ************ ************************************************ ****) *> NAME: AR_PAR *) *) PURPOSE: COMPUTER SIMULATION OF LINEAR PREDICTION, *> USING A PARALLEL IMPLEMENTATION OF THE *) SCHUR RECURSIONS ON THE SUPERLATTICE *) *> PARAMETERS: *) INPUT: mα:ORDER OF THE PREDICTOR *) r :AUTOCORRELATION SEOUENSE *) OUTPUT: k :LATTICE (PARCOR) COEFFICIENTS *> *) PARAMETER TYPES: *> cortype: AFBAYCO..mo_ OF REAL *) pcαrtype: ARRAYCl..mo OF REAL *> *) *************************************************************** ***) prαcedure AR_PAR(mo:integer: r:cαrtype; var : pcortype) ; var a,b:arrayCO..503 a-f real; c,d:real: j,n:integer; begin ■ for j:- 58 - to o do a__ _:=r_j3; •for J:=0 to mα dα bCj3:- s rCj3; C13:»-rCl_/rC03; -for n:=l tα mc-1 do begin for j:-*-__ to (mo-n+l. do begin ; end _πd; (* procedure AR_PAR *) APPENDIX 2 <***** ********* * ************************************ *****************) *) NAME AP OR *) *) PURPOSE COMPUTER SIMULATION OF LINEAR PREDICTION *) USING AN ORDER-RECURSIVE IMPLEMENTATION *) OF THE SCHUR RECURSIONS ON THE *) SUPERLATTICE *> PARAMETERS: *> INPUT: mα:ORDER OF THE PREDICTOR *) r :AUTOCORRELATION SEOUENSE *) OUTPUT: k :LATTICE (PARCOR) COEFFICIENTS *) *) PARAMETER TYPES: *> pcortype: ARRA CO..mo3 OF PEAL *) cαrtype: ARRAY l..mo OF REAL *) *) (********************************************************************) procedure AR_OR<mo: integer; r: cortype; var ks pcortype) var a,b:array l..503 o-f real; c,d,e,*f:real; j,n:integer; begin aC13:=rC13: bC13:=rC03; kC13:=-rC13/rC03; -for j:=2 to mα do begin begin c:-=e+kCn3*- ; d:=bCπ3+kCn3*aCπ3; aCn3:=e; bCn3:=- ; e:=c; • f:=d; end; end; APPENDIX 3 program simulation ( input,output) ; type tr -array CO.. T001 of real; t --array [1..1001 of real; var r :tr; k :tk; system_order,i : integer; procedure partitioπed_parallel(system_order : integer; r ;tr; var k :tk); (-♦This procedure simulates the partitioned parallel implementation of the superlattice. u-εinσ three (tωo cycled ) processors uhich work concurrent¬ ly. It accepts the autocorrelation coefficients 'r' and the sytem order as input and produces the reflection coefficients 'k f . * ) const πbr_of_processors ** " 3; type tb •» array C 1..100,t ..21 of real; var rest,nbr_of_partitions, level,max_level ,max_level_minus_t : integer; a_b orn.b_bottorn,a_bo om_tem ,b_bo . m_tf_mD:re l : a_mιddie,t__mid le,a_mid le_temρ,b_middle_temp.real; bor_buf er1_temp,bor_buffer2_temptre l . partition.proc: integer; bor_b ffer:tb; e_top.f_top: real; e_middle. f_middie:real; e_bo tom,f_bottorn:real: (* The designation of parameters a_bottorn.b_bottorn,a_bottoπι_temp,b_botto _teιnp a_middle, _middle,a_middle_temp, _middle_temρ bor_buffert_temp,bor_buffer2_temp e_top.f_toρ.e_middle,f_ iddle,e_bot om,f_bottoιn is made for programming convenience only and is unrelated to the register π?m_s appearing in the diagra of fig. 8. *) procedure initialize ( partition,proc : integer; var a,b,c,d : real ); var offset : integer; begin offset:- ( par ition-1 ) -»3-t+proc; at-rCoffsetl: b.-T-offset+H; c:-b: d:-r[offset+21 end; (-* of procedure initialize -*) (4*44HH_4444*4-**44-»-ir*4-»H»**#*-»-*-** ■ *-** ■ **#**♦*44»*****»***♦-*** * *-***--»*-»»-»**») procedure basic_cell ( a,b,c.d,k_mult : real: var e,f 1 real ) ; begin f:-d+c-*k_mul ; e:=a+b-*k_mult end: (* of procedure initialize * ) (4*44-******#44*4*-*-«*4*-.4********-*4*****4***4**^ p-rrσcedure bottom_processor ( partition,level integer; bb1,bb2 : r__lr var a_bottorn,b_bottorn : real; var e,f:real ) . var a.b.c,d,k_mult : real; oegin if level=t then initialize ■ partition.1.a,b,c,d ) else begin a: » bb1 : b:=nb2: c:=e: d:-f: end: k_mult:=k.l*_vell; basic_cell ' a.b,c.d.k_mult,e,f ): a_bottom:=e: b_bo tom:=f end: ( * ♦ of procedure bottom_processor -» ) (4 ■ * ■ -* ■ + ■ *-* ■ -* +*-.*-*-*-*-."♦ ■ ♦+-♦-.-*-** • »*->.-.+ ■ » ■ »#** ■ * • ♦ • »-»-♦-. *1 »4.4*444**4*4***#*ιlH. • *.***-• • * ■ * ■ ) procedure middle_processor ( partition.level : integer; a_bo torn.b_bo torn : real: var a_middϊe,b_mιddle : real; var e,f:real ) ; var a.b,c.d.k_mult : real; begin if level*! hen initialize ( partition,2,a,b,c,d ) else begin a: - » a_bottom: b:=b_bottom; c:-&: d:-f end: k_mult: » i C level 1: basιc._cell ( a.b,c,d,k_mul .e,f ); a_ ιddle:=e; b_mιd le:^*f end: (•♦ of proc-dure mιddle_processor • *») ( +4444444444444444444444*444444444444444**444*444**4**********4*******) procedure toρ_processor ( partition. level : integer; a_τ)iddle,b_mιdrile . * real; var bor_buffer: tb; var e. :real ) : var a,D,c,d.l*r_mulr : real; begin if level*"! then initialize ( partition,3,a,b.c,d ) els begin a: * *a_middle: b:=b_mιddle; c:=e: d:-f end: lf_f!.ult: * "k[ level]; basi-__.ce11 ( a.b,c,d.k_mul ,e. f ) ; bor_bufferC lev^l , I ] :=e; bor.bυ erC level .21 :=f end: (* of proredure top_processor *) 44**44444**444*-****************** ************************#*****#*-l be m rest:-**(system_order-l ) mod nbr_of_pτocessors; nbr_of_par ti t ions:- »( system_order-1 ) div nbr_of_processors; if restOO then nbr_of_partitions:*nbr_of_part tions+1 ; for partition:-! to nbr_of_partitions do begin m _level :=partition * *nbr_of_processors; for level :=1 to max_level-2 do begin a_bo t tom_t emp : - » a_bo t torn ; b_bottom_temp:=b_bottom; bottom_processor ( partition,level, bor_buffer1_.temp,bor_buffer2_temp, a_bottom,b_bottom,e_bottom.f_bottom) l a_middle_temρ:=a_midd1e: b_middle_temp:-**b_mιddle; nuddle_processor ( partition, level , a_bot orfi_temp,b_bottom_temp, a_m ddle,b_middle,e_midd1e,f_midd1e); bor_buffer1_temp:=bor_.bufferl level,11; bor_buffer2_temp:=bor_bufferC level ,21 ; • * op_processor ( partition, level . a_middle_ temp.b_mid le_temp, bor_buf *~er.e_top,f_top) ; end: (* of level loop *) max_level_mιnus_l :=max_level-1 ; [max_level_minus_l 1: » -b_bottom/a_bottom: a_mιddle_temp:=a_mιddle; b..mιdHl * ?_temρ:* i *b_ iddle: mιddle__processor ( partition, max_level_minus_l ,a_bottom,b_bottom, a_middle.b._middlι=*.e_mιddle. f_mι cι!e) : k[max_level. :*-*-b_middle/a_middle: top_proceasor ( partition,max_level_minus_l , a_middle_tem .b_middle_temp, bor_buffer.e_top.f_top ); top_pro essor ( partition, ax_level , a_middle,b_middl ,. bor_buffer.e_top.f_top ); k[max_level+l 1 :— or_bufferEmax_level,23/bor_bufferlmax_level, 11 end; end: -* of procedure partιtιoned_parallei *) -37- begiπ ( • * Tes t data ■ * ) rCO. - 1: system order:=10; ( * The results are the following : HI] - 0.2133256 VΛZl —0.169P310 kC3] - fl.3166915 k[4] - 0.4394402 k[5] —0.3G70546 k[61 - 0.2772037 k[7] =-0.6954674 k.81 =-0.1860846 k[91 =-0.0412548 103= 0.3096930 *) partitioned ρarallellsys eπ»_order,r,k ) : for M=l to -_.ystem_order do ωri eln(k[ i]) end.

Claims: . autocorrelation coefficients corresponding to a system having order p, for providing lattice coefficients of said system comprising: an input device for receiving said autocorrelation coefficients; at least two parallel processing units, each of which includes a processor for multiplying a first one of said autocorrelation coefficients by a first lattice coefficient, resulting in a first product, and for individually adding a selected pair of said autocorrelation coefficients, adjacent to said first of said coefficients, to said first product, to yield a pair of first intermediate values; a storage and retrieval structure for applying at least two of said pairs of first intermediate values from said at least two parallel processing units to at least one of said parallel processing units, to thereby multiply a selected two of said first intermediate values by a second lattice coefficient to produce a pair of second products, and to individually add a pair of said first intermediate values, adjacent to said selected two of said first intermediate values, to said pair of second products, to yield at least a pair of second intermediate values; and divider circuitry for forming the quotient of a selected pair of said autocorrelation coefficients to produce said first lattice coefficient, and for forming the quotient of a selected pair of said first intermediate values to produce said second lattice coefficient. 2. A signal processor which receives autocorrelation coefficients corresponding to a system having order p, for providing lattice coeff c ents of said system, comprising: processor means for (i) receiving a plurality of said autocorrelation coefficients; (ii) multiplying a first autocorrelation coefficient by a first lattice coefficient, resulting in a first product, and for individually adding a first pair of autocorrelation coefficients, adjacent to said first autocorrelation coefficient, to said first product, to yield a first pair of first intermediate values, during a first time interval; (iii) multiplying a second autocorrelation coefficient by said first lattice coefficient, resulting in a second product, and for individually adding a second pair of autocorrelation coefficients, adjacent to said second autocorrelation coefficient, to said second product, to yield a second pair of first intermediate values, during a second time interval; and (iv) multiplying a selected two of said first intermediate values by a second lattice coefficient, resulting in a pair of third products, and for individually adding another two of said first intermediate values, adjacent to said selected two of said first intermediate values, to said third pair of products, to yield a pair of second intermediate values, during a third time interval; and divider circuitry for forming the quotient of a selected pair of autocorrelation coefficients to , forming the quotient of a selected pair of said first intermediate values to produce said second lattice coefficient. 3. The signal processor of claim 2 wherein said processor means comprises a plurality of parallel processing units, and wherein said first and second time intervals occur substantially simultaneously, and precede said third time interval. 4. The signal processor of claim 2 wherein said processor means comprises a single processing unit, and wherein said first time interval precedes said second time interval, and said second time interval precedes said third time interval.

Inventors: CARAVANNIS GEORGE, HALKIAS CHRISTOS, KOUKOUTSIS ELIAS, MANOLAKIS DIMITRIS, CARAVANNIS, GEORGE, HALKIAS, CHRISTOS, KOUKOUTSIS, ELIAS, MANOLAKIS, DIMITRIS
Applicants: ADLER RES ASSOC, ADLER RESEARCH ASSOCIATES
Application year: 1987
Main classification: G06F15
IPC codes: G06F15, G06F17, H03H17