COMPUTER AND METHOD FOR THE DISCRETE BRACEWELL TRANSFORM

Abstract: A special purpose computer (35) and method of computation for performing an N-length real-number discrete transform. For a real-valued function f( tau ) where tau has the values 0,1,....,(N-1), the Discrete Bracewell Transform (DBT) H (v) is as in (I), where, v = 0,1,....,N-1; cas theta = cos theta + sin theta . The DBT is performed without need for employing real and imaginary parts, and in efficient embodiments, is executed efficiently and in less time than the Discrete Fourier Transform (DFT). The process steps for the original transform and the inverse retransformation are the same.

Description: Co puter and Method for the Discrete Bracewell Transform BACKGROUND OF THE INVENTION This invention relates generally to the field of digital data processing apparatus and more specifically to a com¬ puter for performing a discrete transform on input data. The Fourier transform has been well know to mathematicians, scientists, engineers and others for many years. The Fourier transform is a tool used in many fields such as medicine, economics, and engineering to analyze data. For example, when the input data represents time-varying electrical signals, the Fourier transform is often per¬ formed to identify the frequency components within the electrical signals. Similarly, an inverse Fourier trans¬ form is often performed to produce a time-varying elec¬ trical signal from frequency components. In addition, data may be processed by first performing the Fourier transform. modifying the frequency components in a desired way, and inverting the transform. For general background, reference is made to the book "The Fourier Transform and its Applications" McGraw-Hill, Inc., 2nd Ed. 1978 by Ronald N. Bracewell. In digital data processing apparatus, the Fourier transform is normally performed with discrete values of input data in accordance with the well-known discrete Fourier transform (DFT) defined as follows: N-l X(k) = Σ x(n)e -i(2τr/N)nk n=0 The inverse Fourier transform is performed by substituting "i" for "-i" in the discrete Fourier transform. In the DFT transform, N values of the input data x(n) [where n is equal to 0,1, ..., (N-l) ] are transformed to produce N val¬ ues of output data X(k), where k is equal to 0,1, ..., (N-l) . The number N of values of input data may vary, but the larger the value of N the greater the resolution of the output data. Transforms in accordance with the above equation are called N-point or N-length DFT's. In order to practically and efficiently perform N-length DFT's, digital computers are utilized. Even using digital computers, how¬ ever, performance of N-length DFT's for large N is still a formidable task. For this reason, many prior art techniques have been developed to more efficiently perform the N-length discrete Fourier transform. One significant technique for improving the efficiency of performing the discrete Fourier transform is described in the article by J. . Cooley and J. W. Tukey, "An Algorithm for the Machine Calculation of Complex Fourier Series", Math of Computation, Vol. 19, pp. 297-301, April 1965. When the Cooley-Tukey algorithm was utilized on a general purpose computer, a more than fifty times improvement in processing time occurred for 1024-point DFT. The Cooley- Tukey algorithm is known as the fast Fourier transform (FFT) and is a radix-2 algorithm. General background information concerning the fast Fourier transform (FFT) and variations thereof are described in the article "What is the Fast Fourier Transform?", Proceedings of the IEEE, Vol 55, No. 10, October 1967, Cochran et. al., pp. 1664-1674. The FFT method of computing the N-length DFT relies upon selecting the transform length N as a power of 2. The calculations are grouped in pairs to achieve a significant reduction in the calculation time required for the N-length DFT. Many other algorithms have been proposed for more effi¬ ciently performing the N-length DFT. A number of such al¬ gorithms, including the nested Winograd algorithm, are de¬ scribed and compared in the article "A Prime Factor FFT Al¬ gorithm Using A High-Speed Convolution" by Kolba and Parks, IEEE Transactions on Acoustics Speech and Signal Process¬ ing, Vol ASSP-25, No. 4, August 1977, pp. 281-294. In the prime factor FFT by Kolba and Parks, the transform length N is selected equal to the product of a number of mutually prime factors N jr N 2 , ..., N., ..., N L . Each of the prime factors N^ of N is employed in an N.-length DFT using convolution. In the Kolba and Parks prime factor FFT, L different and shorter length DFT's are executed in order to achieve the N-point DFT. The Kolba and Parks prime factor FFT compares favorably with the radix-2 algorithm of Cooley-Tukey and the nested algorithm of Winograd (U.S. Patent 4,156,920) . While various techniques, such as those described above, have significantly improved the efficiency of performing the N-length discrete Fourier transform (DFT) , even greater increases in efficiency are desirable. The discrete Fourier transform (DFT) has two characteris¬ tics that are sometimes computationally undesirable. The inverse DFT is not identical with the direct DFT transform and so it is necessary to keep track of the +i and -i versions. Also, the DFT has complex rather than real val¬ ues and thus requires provision for complex arithmetic and separately managed storage for real and imaginary part ' s. In many applications, both real and imaginary parts are not required and hence the calculations using both tend to be inefficient. More efficient acquisition of complex Fourier coefficients is possible in the case of real data by a modification of the FFT algorithm. Conversely, complex inputs may be han¬ dled more efficiently, in the cases where it is known that the results should be real, by a different modified algo¬ rithm. Both of these modifications, derived from the FFT, must occupy storage space in computer memory when real data are to be processed by (i) transformation followed by (ii) operations carried out in the transform domain, and (iii) retransformation into the data domain. While other linear integral transforms have been proposed, none heretofore have been implementable as discrete trans¬ forms suitable for use as improvements over the Discrete Fourier Transform. For example, as referred to by Bracewell, The Fourier Transform and its Applications, on page 179, Hartley is credited with linear integral trans¬ forms (Hartley Transforms) , but these have not been avail¬ able as discrete transforms nor have algorithms been avail¬ able to implement them. In view of the above background of the invention, there is a need for economical computers and methods for more effi¬ ciently performing and inverting N-point discrete trans¬ forms and particularly for computers which avoid unneeded complex computations when only • real computations are desired. SUMMARY OF THE INVENTION The present invention is a special purpose computer and method of computation for performing an N-length real- number discrete transform. For a real-valued function f(τ) where τ has the values 0,1,... , (N - 1), the Discrete Bracewell Transform H(v) in accordance with the present in¬ vention is as follows: -1 N- 1 H(v) = (N l ) Σ f(τ)cas(2τrvτ/N) τ=0 where, v = 0 , 1 , . . . ,N-1 casθ = cosθ+sinθ. The Discrete Bracewell Transform can be arrived at by per¬ forming the multiplications and summation indicated by the formula but the efficiency is improved by means of a Fast Bracewell Transform (FBT) , which proceeds by a plurality of stages. The first stage receives an input sequence of N input data values, F n ., which are given for values of j υ t j from 0 to N-l as follows: The first stage permutes the order of the input sequence using a bisecting permutation. The bisecting permutation is carried out, for example, by sorting the original se¬ quence into odd-numbered and even-numbered elements thereby bisecting the original sequence into two segments, an odd segment and an even segment. The elements are then reor¬ dered with the odd-segment first followed by the even- segment. The new sequence in turn, has each segment odd-even bisected and reordered to form a new sequence. The odd-even bisecting and reordering is performed P-l times for N-length data when N=2 . The permutation thus performed is called a bisecting permutation and results in a sequence of N permuted data values, F. ., which are given for values of j from 0 to N-l as follows: = F ι,3 1,0' 1,(N-1) After the permutation stage, the transform is completed in P subsequent stages. Each of the P subsequent stages eval¬ uates N equations of a form that in general adds three terms where one term includes a value directly from the previous stage, another term includes a value from the pre¬ vious stage multiplied by a cosine,term, and another term includes a value from the. previous stage multiplied by a sine term. Two of the P subsequent stages after the permuting stage may be implemented using sum and difference calculations without need for explicit multiplication by cosine or sine factors. In accordance with the above summary, the present invention provides an improved special-purpose computer and method of computation for performing an N-length real-number discrete transform without need for employing real and imaginary parts. In efficient embodiments of the present invention, the Discrete Bracewell Transform (DBT) is executed effi¬ ciently and in less time than the Discrete Fourier Trans¬ form (DFT) . Additional objects and features of the invention will ap¬ pear from the following description in which the preferred embodiments of the invention have been set forth in detail in conjunction with the drawings. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a schematic block diagram of a discrete transform computer for performing the Discrete Bracewell Transform. FIG. 2 is a data processing system employing the discrete transform computer of FIG. 1. FIG. 3 is a more detailed block diagram of one implementa¬ tion of the FIG. 1 computer. DETAILED DESCRIPTION General The Discrete Bracewell Transform (DBT) is a linear discrete transform that is as a means of obtaining an approximation to the Hartley transform (HT) . The DBT is a new entity not previously available. The Fast Bracewell Transform (FBT) is a new method for arriving at the Discrete Bracewell Transform (DBT) . The FBT transforms data given in the form of, or reducible to, an ordered finite set of real numbers. The DBT and the FBT are transforms that are particularly useful for digital spectral analysis and convolution and these may be used in procedures that are widely practiced in many branches of technology including engineering, medi¬ cine, geophysics and statistics. The FBT exhibits desir¬ able features of convenience and speed. The FBT is suit¬ able for any application to which the Fast Fourier Trans¬ form (FFT) can be put and has superior convenience and speed in many applications. Discrete Transform Computer-FIG. 1 A discrete transform computer is shown for performing the Discrete Bracewell Transform. The computer receives an or¬ dered finite set of real numbers on input lines 12. The p ordered set includes N numbers where N is equal to 2 and where P is a positive integer. The input values of data on lines 12 are permuted in the permute processor 4 (PROC 1) . The permute processor 4 permutes the input numbers on lines 12 using an odd-even bisecting and reordering permutation (bisecting permutation) hereinafter described in further detail. The input sequence of numbers on lines 12 is denominated F Q . and the output sequence on lines 29 from the permute processor 4 is denominated F. .. In FIG. 1, a processor 3 receives the permuted sequence F. . on lines 29 and pro- vides the transformed output F._. 1% . on output lines 31. \*+J./ ,j In FIG. 1, the processor 3 includes the P processor stages PROC (2), ..., PROC (P+l) . The PROC (2) stage 5. is the first stage and the PROC (P+l) stage 7 is the last stage. Each of the stages PROC (2), ..., PROC (P+l) pro¬ cesses an N-valued input sequence from the previous stage to form an N-valued output sequence. Each stage, s, for s equal to values from 2 to P+l calculates N values of Fs ,j. for j equal to values from 0 to N-l. Each value of F s t l for the s stage is calculated as a function of direct val¬ ues from the previous s-1 stage, as a function of values from the previous s-1 stage multiplied by a cosine factor, and as a function of values from the previous s-1 stage multiplied by a a sine factor. The trigonometric values of the sine and cosine factors, when required, are provided in the FIG. 1 computer by the trig generator 2. The N-valued transform output appears on lines 31. In FIG. 1, the control 32 provides timing and other control signals to the generator 2 and processors 3 and 4 to cause them to perform the desired transform. Application System-FIG. 2 In FIG. 2, an application system for utilizing the discrete transform computer 35 of FIG. 1 is shown. In the FIG. 2 system, the data collection device 34 is, for example, a radar device which provides N samples of radar data during each time frame. Control 32 provides clocking and framing signals in a conventional manner to clock and frame the in¬ put radar data samples. The N radar data samples, for each frame period, are input to the discrete transform computer 35 The discrete transform computer 35 transforms the input " radar data samples and forms, on the output lines 31, the Discrete Bracewell Transformed values. The transformed values are provided as an input to the utilization device 36. Utilization device 36 receives the transformed values, one set of N values for each frame, and executes recongni- tion calculations based upon the transformed values in or¬ der to determine the nature of the radar signals provided by the data collection device 34. In this manner, the FIG. 2 apparatus provides a radar detection apparatus which can operate in real time. A further understanding of the transform by the discrete transform computer 35 can be obtained with reference to a mathematical derivation of the Discrete Bracewell Trans¬ form. Mathematical Derivation Given a real function f(τ) for τ = 0,1,..., (N - 1) the Dis¬ crete Bracewell Transform H(v) of the present invention is as follows: , N-l H(v) o {u '1 ) ∑ f(τ)cas(2πvτ/N) Eq. (1) τ=0 where, v = 0,1, ... ,N-1 casθ = cosθ+sinθ. The inverse DBT is as follows: N-l f(τ) = Σ H(v)cas(2πvτ/N) , Eq. (2) v=0 where, τ = 0,1, ...,N-1. The symbol τ can be thought of as a mnemonic for time, while v/N is like frequency measured in cycles per unit of time. In order to perform the transform of Eq. (1) , the sequence of input data is permuted by odd/even sorting and reorder¬ ing until two-element data pairs are reached. To superpose all the two-element transforms requires a decomposition formula that expresses the DBT of a given se¬ quence in terms of the DBTs of subsequences of half length. This formula permits, for example, the DBT of a four ele¬ ment sequence [a, a- b- b 2 3 to be expressed in terms of the DBTs of the two interleaved two-element sequences [a- b.] and a 2 b-] . To derive the decomposition formula two theo¬ rems are employed, the shift theorem and the. similarity theorem. The shift theorem' states that if f(τ) has DBT H(v) then the DBT αf F(τ + a) is as follows: DBT=H(v)cos(2ιrav/N)-H(N-v)sin.(2ιrav/N) . Eq. (3) The similarity theorem states that if a sequence f(τ) is stretched to double its length by inserting a zero element after each given element then the elements of the original DBT are repeated. As examples, the sequence [1 2 3 4] has DBT [2.5 -1 -0.5 0] and the sequence [1 0 2 0 3 0 4 0] has DBT [2.5 -1 -0.5 0 2.5 -1 -0.5 0] . Using these theorems, the general decomposition formula is as follows: H ( v ) =H al ( v)+H a2 (v)cos(2ιrv/N)+H a2 (N-v)sin(2τrv/N) Eq. (4) where H .(v) and H _(v) are respectively the %N-element transforms of the a, and a- sequences, but with the ele¬ ments repeated to double the length. In the derivation of Eq. (4) , a = 1 is used in the shift theorem. Computation In order to perform DBT computations, N data elements F . s t j are processed in P+l stages. The stages are identified by the s subscript and the sequence location for each data el¬ ement is identified by the subscript j. F„ . = real valued element s = stage = 0,...,(P+1) j = element number = 0,1, ..., (N-l) N = number data elements p N = 2 where P is a positive integer In Stage 0, (s = 0) The sequence of N input data values F n . are given for all values of j from 0 to N-l as fol- υ » J lows: In Stage 1 (s = 1) , the F n . input data elements of Stage 0 are permuted using a bisecting permuatation. The bisecting permutation rearranges the sequence of data by placing the F n • member in Stage 0 into the F. . posi- tion in Stage 1. The value of j ' is calculated from j, for example, by executing the routine of CHART 1 for all N val¬ ues of j. In the following CHART 1, j is represented by J and j* is represented by Jl. CHART 1 10 R = J 20 Jl = 0 30 FOR K = 1 TO P 40 S = R DIV 2 50 Jl= J1+J1+R-S-! 60 R = S 70 NEXT K Examples of the calculations called for by CHART 1 are set forth in the following CHART 2 for the values F.. n F- -; 1 ,U 1,1 F^ 2 and F- - for a sixteen element (N=16, P=4) sequence. CHART 2 11 F 1l,.-j5 - F Orj' 1 j-o 0 0 2 0 0 0 K R S jl 1 j=l 0 1 2 0 0 2 3 0 0 4 4 0 0 8 F l,l - F 0,8 11 1 j=2 1 - 0 2 1 0 1 3 0 0 2 4 0 0 4 F = F r l,2 r 0,4 K R 11 1 j=3 1 1 2 1 0 3 3 0 0 6 4 0 0 12 F l,3 ~ F 0,12 Using the bisecting permutation described, the permuted da¬ ta elements for a sixteen element example are set forth in TABLE 1. TABLE 1 (Stage 1) =. F F ι,o £ 0,0 = F *1.1 £ 0,8 F 1.2 = F 0.4 F l,3 ~ F 0,12 E l,4 = F 0,2 F l,5 = F 0,10 F 1.6 = p 0,6 = F 0,14 F l,7 F l,8 = F o,ι = F F l,9 c 0,9 = F F l,10 F 0,5 F ι,ιι = F 0,13 F l,12 = F 0,3 = F F l,13 r 0,ll = F F 1.14 0,7 = F F 1.15 r 0,15 In each of the subsequent stages (s equal to 2,...,T) after the permute Stage 1, the N values of F . for each stage s r 3 are formed by evaluating N equations for each stage. Each equation is essentially of the following form: F s,j = ' F s-l, e + < F s-l,f" c s, » + (F s-l,g'< s _,h»q E *- <5 > where, p N = number of data elements = 2 s = stage number = 2,...,T T = total number of stages = P+l Q = N/(2E) = number of pairs of sets of equations in a stage q = 0,1,..., (Q-l) E = 2s-2 = number of equations in each set of each pair e = [0+(2E) (q)] ,...,[ (E-1)+(2E) (q) ] f = e + E g = f when h = 0 and also when ^-^. - n g = K-f when h ≠ 0 where K is a constant equal to (2g]._ 0 +E h = 0,..., (2E-1) for first set of pair h = 0,...,(2E-1) for second set of pair h = 0,...,(2E-1) j = p+h = 0,1,..., (N-l) C β * = cos (2ιr h 2 3"1 ) Eq. (6) S B . - sin (2ιr h/2 S-1 ) Eq. (7) Eq. (5) is used to form N equations for each stage. Each stage s uses the data values of the previous stage (s-1) to form new data values. The output F . from the final stage (s = T) is the desired transform of the input data F n .. Note that Eq. (5) is of the same form as Eq. (4) and repre¬ sents one manner of evaluating Eq. (4) . The stages 2 through T form the N equations as a function of the number N of data elements and of the particular stage. By way of example, the sixteen value (N=16) example of TABLE 1 will be described for stages 2 through 5. For that 16-element example, some of the parameters for Eqs. 5, 6, and 7 are given in the following CHART 3. The CHART 3 parameters are used to form the equations of TABLE 2, ..., TABLE 5. CHART 3 TABLE 2 1 4 TABLE 3 2 2 TABLE 4 4 1 TABLE 5 8 0 In Stage 2, there are eight pairs (Q=8; q=0,l,..,,7) of sets of equations with one (E=l) equation per set. The N equations for F- . are set forth in TABLE 2. TABLE 2 (Stage 2) = F 2,j l,e < F l,f > < C 2.,h> + (F ι,g < S 2,h> In Stage 3, there are four pairs (Q=4; q-0,1...,3) of sets of equations with two equations (E=2) per set (e=0,l; 4,5; 8,9; 12,13). The N equations for F- . are set forth in TABLE 3. TABLE 3 (Stage 3) + + 3,j 2,e (F 2,f> (C 3,h> < F 2,g > < S 3,h In Stage 4, there are two pairs (Q=2; q=0,l) sets of equations with four equations (E-4) per set (E=0,l,2,3;8,9,10,ll). The N equations for F are set 4,j forth in TABLE 4. TABLE 4 (Stage 4) 4,j 3,e (F 3,f > < C 4,h > + < F 3,g > < S 4 C 4,0 c 3,0 + (F 3,4 (F 3,4 ) ( s 4 F 4,l ■ 3,1 + (F 3,5 (F 3,7 ) ( s 4 F 4,2 '3,2 + (F 3,6 (F 3,6 )Cs 4 F 4,3 ■ 3,3 + (F 3,7 (F 3,5 ) ( s 4 * F 4,4 3,0 + (F 3,4 (F 3,4 ) ( s 4 * F 4,5 • 3,1 + (F 3,5 (F 3,7 ) ( s 4 p 4,6 • 3,2 + (F 3,6 (F 3,6 ) ( s 4 F 4,7 3,3 + (F 3,7 (F 3,5 ) ( s 4 F 4,β 3,8 + (F 3,1 (F 3,12 , (S 4. 3,9 + (F 3,1 (F 3,15 MS 4 ? 4,10 ^3,10 + (F 3,1 (F 3,14 , (S 4, 4,11 ? 3,11 + (F 3,15 (F 3,13 , (S 4, ? 4,12 ? 3,8 + (F 3,12 (F 3,12 , (S 4 * 4,13 '3,9 + (F 3,13 (F 3,15 ) (S 4, '4,14 '3,10 + (F 3,1.4 (F 3,14 ) (s 4| * 4,15 + (F '3,11 3,15 (F 3,13 )(s 4> In Stage 5, there is one pair (Q=l; q=0 ) of sets of equations with eight (E=8) equations per set ( e=0,l,..., 7 #)/ .. T -h«eβ N e cquuaαti..o wnuso fo wr * F '■ ζ -^. are g 1 . Ven i. n T_A_B__LE_ 5-. TABLE 5 (Stage 5) (F ) (S 5,j >4,e + (F 4,f > < C 5,h > 4,g 5,h T he values of F - . determined in Stage 5 and defined in TA¬ B LE 5 represent the Discrete Bracewell Transform (DB T ) of the F Q . data sequence, F Q 0 , F Q ^ t ..., F Q lg . While the DBT can be performed by calculating values for each of the equations in TABLE 1, ... , TABLE 5, certain improvements are possible in order to speed the operation and thereby forming a Fast Bracewell Transform (FBT) . A characteristic feature of the equations is the presence of retrograde indexing as for example i Table 5 in the F 4,g S 5,h termS F 4,15 S 5,1' F 4,14 S 5,2' F 4,13 S 5,3' F 4,12 S 5,4' where a diminishing index in one factor accompanies a rising index in the other that is, the indexes g and h change in opposite directions. Fast Bracewell Transform (FBT) The FBT takes an ordered data set of N real numbers and performs sequentially the operations in CHART 4 to obtain the DBT. CHART 4 STAGE 1 (a) Permutation. STAGE 2 (b) Summing and differencing. (c) Interleaving. STAGE 3 (d) Three parallel selection operations. (e) Two parallel modulation operations. (f) Combining. SUBSEQUENT STAGES (g) Return to (d) . (h) Completion. It is assumed that the number of data elements N is one of the numbers such as 4, 8, 16, 32, ..., that is, N=2 where P is an integer. To handle other situations, padding of artificial data (adding 0's) is applied to bring the total -23- p number of elements to a total N=2 . Then, the steps (a) through (h) of CHART 4 are performed. (a) Permutation. The N data elements are rearranged in order in a bisecting permutation according to the following rules. Remove the second, fourth, sixth and all even-numbered elements from the original sequence of elements thereby leaving the odd-numbered elements and place the even-numbered elements in their same order, at the end of the odd-numbered ele¬ ments to form a new reordered sequence. For example, if the elements of an original data sequence are [abcdefgh] then the odd-even sorting and reordering yields a new se¬ quence [acegbdfh] . The new sequence is bisected into the segments [aceg] and [bdfh] . Each segment is odd-even sorted and reordered. The rearrangment is repeated until the num¬ ber of rearrangements reaches a total number R. The number R is arrived at as follows. Let as stipulated. Then 3 R is one less than P. For example, if N = 8 = 2 , then R (the number of rearrangements) is 2. The segment [aceg] is rearranged as [aecg] and the segment [bdfh] is rearranged as (bfdhl so that the completed bisecting permutation is [aecgbfdh] in the N=8 example described. (b) Summing and Differencing. Summing means add the first and second elements [a+e] of the permuted sequence to form the first element of a sum sequence. The second element of the sum sequence is formed by adding the third and fourth elements of the permuted se¬ quence and so on forming [g+f] and [d+h] . Differencing means subtracting the second from the first element [a-e] of the permuted sequence to form the first element of a difference sequence. The second element of the difference sequence is formed by subtracting the fourth from the third element [c-g] of the permuted sequence and so on to form [b-f] and [d-h] in the example described. (c) Interleaving. An interleaved sequence is formed by taking elements alter¬ nately from the sum and difference sequences, starting with the first element of the sum sequence. In the example de¬ scribed in the interleaved sequence is [(a+e) (a-e) (b+f) (b-f) (c+g) (c-g) (d+h) (d-h) 1. (d) Selection. The interleaved sequence is now subjected to three selec¬ tion operations that will result in three new sequences A, B and C. In Sequence A, retain the first two elements of the inter¬ leaved sequence, discard the next two, retain the next two, discard the next two, and so on, leaving gaps where the el¬ ements were discarded. Fill the two-element gaps by copy¬ ing the preceding two elements into each gap. For example, if the interleaved sequence at the end of Stage 2 were [abcdefgh] then the discarding would result in [ab ef] and sequence A would be [ababefe ] . In Sequence B, discard the first two elements of the inter¬ leaved sequence, retain the next two, discard the next two, retain the next two, and so on. Fill the gaps by copying the following two elements into each gap. Sequence B would be [σdcdghgh] . In Sequence C, of Stage 3, sequence C is the same as se¬ quence B. (e) Modulation. Sequence B is modulated by multiplying the first four ele¬ ments in turn by the Eq. (6) cosine factors C 3 0 =1, C- , =0, C- 2 s1 " 1 ' c 3 3 =0 * his modulation is merely a brief way of saying, "Retain the first element, discard the second, reverse the sign of the third, discard the fourth." The four factors are applied to the next four el¬ ements and so on until all the elements of sequence B have been modulated. Sequence C is modulated by the Eq. (7) sine factors S- Q =0, S- .=1, S 3 2 =0 ' S 3 3 s " 1 n the same way. (f) Combining. The three separate sequences, sequence A and the two se¬ quences formed from sequences B and C by modulation are now combined by addition, element by element. This completes Stage 3. (g) Return to (d) . Stage 4 consists of repeating the operations described above under (d) Selection, (e) Modulation and (f) Combining but with the following differences. (i) In the selection instructions for obtaining sequences A and B replace "two" by "four". In subsequent stages, re¬ place "four" by "eight" and so on. (ii) In Stage 4, there will be eight cosine factors C 4 Q , C 4 1' C i 2' •••» C 4 7 an< e *9ht sine factors S 4 Q , S 4 ., S 4 2 ' • • • , S 4 7 to be applied to the first and later groups of eight elements until all the elements of sequences B and C respectively are exhausted. These cosine and sine factors are C 4 Q =l, C. -=r, C 4 2 =0, C 4,3=- r ' C 4,4=- 1 ' C 4,5=- r ' C 4,6 =0 ' C 4,7 =r; S 4,0 =0 ' S 4,l =r ' S 4,2 =1 ' S 4,3=- r ' S 4,4 =0 ' S 4,5 β - r ' S 4,6=- 1 ' S 4,7 ="r ' where r is the square root of 0.5. In subsequent stages these factors may be arrived at by the Eq. (6) and Eq. (7) formulas Ss._,„n = sin(2τrn/2 s"1 ) where n = 0,1,2, ..., (2s-1-1) and s is the number of the stage. It is necessary to return to (d) a certain number of times which is determined as follows. If N=8 there is no return to (d) . If N=16 there is one return. If N=32,64, ... the ' number of returns is 2,3, .... If N=4 the FBT procedure is complete at the end of Stage 2. (h) Completion. The final ordered sequence of real numbers constitutes the DBT of the data sequence as arrived at by the FBT proce¬ dure. Other Embodiments The formulas for Ss β f n and Cs Λ n mentioned above may be used for calculating the factors used in Stage 4. When Stage 4 is reached, the eight factors may be (i) calculated direct¬ ly from the formulas, or' (ii) the factors may be pre- calculated together with those needed for later stages. Variant (i) has the advantage of shortening the instruction set and therefore reducing the necessary storage space in memory. Variant (ii) has the advantage of increased speed in arriving at the result. In CHART 4, on the completion of STAGE 3, the next instruc¬ tion is "Return to (d) ." However, a gain in speed may be obtained by delaying the return. Under this variant, STAGE 4 is executed in a way that is analogous to STAGE 3 but in¬ corporates the 16 factors C 4 Q ... C 4 - and S 4 Q ... S 4 .- directly into the instruction set. Conversely, STAGE 3 itself may be eliminated by advancing the return. This advance leads to further savings in the length of the instruction set but also leads to the lapse of more time before the results are arrived at. A further increase in speed is possible with a combined two-staged delayed return. The whole of the column of equations in TABLE 2 (Stage 2) can be eliminated as fol¬ lows. For example, the equation F, 0 +F 2 2 =F 3 0 at the head of Stage 3 can be rewritten F. 0 +F ι ι +F ι 2 +F l 3 =F 3 0 by direct substitution from Stage 2, and so on for the rest of the equations in Stage 3. Matrix Formulation A condensed representation of the DBT is obtained by for¬ mulating the eighty equations of TABLE 1 through TABLE 5 in matrix form. We may write [H]=N "1 [L p ][L p _ 1 ] [ χ ][P][fl Eq.(8) where [H] is the N-element column matrices representing the data f(τ), [H] is the Discrete Bracewell Transform H(v), [P] is the bisecting permutation matrix and the [L.] (where i equals P,P-1,...,1) are matrix operators which convert the column matrix operand to the column matrix of level i. In the example with N=16 and P=4, i runs from 1 to 4. A subsequent step of conversion to the discrete Fourier transform F(v) may also be represented by the (complex) ma¬ trix multiplication. [F]=CΦ1[H] Eq. (9) Combining Eq. (8) and Eq. (9) a new expression for the dis¬ crete Fourier transform is obtained as follows: The matrix operator N~ [φ] [L ...L.] [P] thus represents a new factorization of the DFT matrix operator [W] , where [Fl=[W][f], [W]=exp(-i2n/N) and [W] is given by the follow¬ ing TABLE 6. A characteristic feature of the FHT operators L-, L., ... is the presence of retrograde indexing of the terms con¬ taining sine factors as revealed by elements lying on di¬ agonals that run in the opposite direction to the main di¬ agonal. The factors, which are directly verifiable from TABLE 1 through TABLE 5, are given in the following TABLE 7 through TABLE 12. TABLE 6 jyl- -D TABLE 7 85/042 -30- TABLE 8 TABLE 9 1 1 1 1 1 -1 I -1 1 1 1 1 I -I L> = i -1 1 1 1 1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 TABLE 10 TABLE 11 TABLE 12 In the above TABLE 10 and TABLE 11, C n and S n are the lev¬ el-dependent abbreviations for Eq. (6) and Eq. (7) , respec¬ tively • and For [L-j] of TABLE 10, Cn and Sn„ correspond to the C t. § .n and S4., .n values of Eq. (6) and Eq. (7) where n=h=0,l,...,7. For [ 4 ] of TABLE 11, C and S correspond to the C- h and S- . values of Eq. (6) and Eq. (7) where n=h=0,l,...,15. The matrix representation offers a different way of viewing the Fast Bracewell Transform. For example, L. shows the retrograde indexing of the sine factors as elements on lines of slope 45°. L. and L- do not have such elements at all. One might also notice that L- and L 2 have only 2N nonzero elements compared with 3N in the limit for factors of higher level. Convolution In the vast majority of image processing applications, con¬ volution is carried out between two functions of which one is symmetrical. Since two-dimensional convolution per¬ formed on an image can be reduced to one dimension by spreading the image out serially as in a television wave¬ form, it will suffice here to speak in terms of one dimen¬ sion. Under conditions where f,(τ) has no particular sym¬ metry and is to be convolved with f 2 (τ) which is an even function, the convolution theorem for the DBT is as fol¬ lows: f 1 (τ)*f 2 (τ) has DBT H 1 (v)H 2 ( ). Eq. (11) In other words, the DBT of a convolution of this type is the product of the two separate Discrete Bracewell Trans¬ forms. Therefore, to perform convolution, we take the two DBTs, multiply them together term by term, and take the DBT again. This procedure represents and improvement over tak¬ ing the two DBTs, multiplying the complex values together and inverting, since one complex multiplication, (a+ib) (c+id)=ac-bd+i(ad+bc) , stands for four real multiplications for the DFT. In the general case where f 2 (τ) is not symmetical, the con¬ volution theorem has a second term, let H 2 (v)=H 2 (v) +H 2Q (V) where H 2e and H 2Q are the even and odd parts of H 2 ( v). If f 2 (τ) were symmetrical then the odd part of H- (v) would be zero. The general convolution theorem then reads as follows: f 1 (τ)*f 2 (τ)-H 1 (v)H 2e (v)+H 1 (-v)H 2o (v) Eq. (12) This theorem is deducible from the convolution theorem for the DFT. Eight-Element Computer - FIG. 3 One specific embodiment of a computer for performing trans¬ forms is shown in FIG. 3. In FIG. 3, the permute unit 4 receives the F n . input data values (specifically, the υ , J eight input data values F Q Q , F Q ., ..., F Q -) on the eight input data lines 12. In one embodiment, the permute unit 4 can be a simple electrical cross-connector which by cross-connection operates to reorder the input data values as indicated hereinafter in TABLE 13 and TABLE 14. Each of the input lines 12 is a multi-bit bus where the number of lines forming the bus is equal to the number of bits repre¬ senting each data element. For example, each one of the lines 12 can be a 16-bit bus. In an alternative embodiment, the permute unit 4 includes a plurality of 8-way (N-way) selection gates, one gate for each of the eight (N) input data values. The selection gates are under control of gate control 14 for selecting the outputs in the manner indicated in connection with TA¬ BLE 13 and TABLE 14. Control 14, in one embodiment, in¬ cludes a processor for executing the program routine of CHART 1 in order to cause the desired permutation of data values. In such an embodiment, the number, N, of data ele¬ ments can be any size desired. The output F. . data values from the permute unit 4 are latched into registers 15 which provide the permuted data elements as inputs to the second stage 3. In the second stage, for the eight-element example described, four sum and difference adders 5-1, 5-2, 5-3 and 5-4 are included. The sum and difference adders 5-1 through 5-4 provide the equivalent of the calculations set forth in TABLE 14. The adder 5-1 receives the F- Q and the F- - inputs from the permute unit 4. The F 2 Q output is the sum of the F. Q and F. . inputs. The F 2 . output from the adder 5-1 is the difference F- Q - F. .. These two outputs correspond to the calculation indicated by the first two equations of TA¬ BLE 14. Note that in TABLE 14, in accordance with Eq. (6), the value of C 2 Q is +1 and the value of C 2 . is -1. Also, the values of S 2 Q and S 2 - are both 0. Accordingly, the TABLE 2 equations are reduced to the sum and difference terms which are calculated by the adders 5-1 through 5-4 of FIG. 3. Accordingly, no explicit multiplication by sine and cosine factors is required. The outputs from the adders 5-1, ..., 5-4 are latched into registers 16. The registers 16 in turn provide inputs to the third stage. The third stage includes the adder units 6-1 and 6-2. Each adder unit includes two sum and differ¬ ence adders. In the unit 6-1, the first adder forms the sum of the F 2 « and F 2 2 inputs to provide the F- Q output. The same adder receives the same inputs and provides the difference output F 3 2* In a similar manner, the second one of the two adders in the unit 6-1 receives the F 2 χ and F 2 3 inputs and provides the sum output F 3 ^ and the difference output F- -. In a similar manner, the second adder unit 6-2 provides the sum outputs F 3 . and , 5 and the difference outputs F 3 g and F 3 _. The third stage 6 essentially provides the calculations in¬ dicated in TABLE 15. Note that, in TABLE 15, the value of the cosine terms in accordance with Eq. (6) has C 3 0 =+ l, C 3 - and C 3 3 =0, and C 3 2 = ~ 1# Similarly, in accordance with Eq. (7) , the sine terms S 3 Q and S 3 2 are equal to 0, S 3 - is equal to +1 and S 3 3 is equal to -1. With these values of the sine and cosine terms, the calculations indicated in TABLE 15 reduce to the sum and difference calculations provided by the adder units 6-1 and 6-2 of FIG. 3. Accordingly, the third stage requires no explicit multiplication by sine and cosine factors. The outputs from the adder units 6-1 and 6-2 are latched into registers 17 at the input of the fourth stage. The fourth stage 7 performs the calculations indicated in connection with TABLE 16. The fourth stage 7 essentially performs the calculations of TABLE 17. In FIG. 3, the lines 19 for the data values F 3 0' F 3 1' F 3 2 anc F 3 3 are αt ^" e ^ twice and represent the terms under the column F 3,,e of TABLE 17. The lines 20 represent the factors in the column F, , of TABLE 17. These terms are multiplied by the cosine factors C. n , ..., C 4,7 In FIG. 3, the lines 21 represent the terms F 3 4 , • t F 3 7 . The permuting unit 22 reverses the order of the terms F 3 5' F 3 g» ^3 7 a s represented by the column F 3 in TABLE 17. Permuting unit 22 is similar to permuting unit 4 and like unit 4 is implemented in hardware, for example. electrical cross-connections or as gate-controlled cross-connections. In one implementation, cross-connections from registers 17 [for F 3 4 , F 3 -, F 3 6 and P 3 7 1 to the inputs of multipliers 24 are made without need of an explicit permute unit 22. The multiplier unit 23 performs the eight, two-input multi¬ plies of the cosine terms. Similarly the multiplier unit 24 multiplies the eight, two-input multiplies of the sine terms. The sine and cosine terms on lines 38 and 39 are provided by trig generator 2. In one embodiment, generator 2 includes a sine store 51 and a cosine store 52 each storing - precalculated values of the required sine and cosine factors. * In one embodiment, the multipliers 23 and 24 are each implemented in hardware as eight 2-input multiplier stages. Each stage of multiplier 23 for example, receives one of the eight data lines 20 and one of the eight cosine lines 38 and connects the product on one of the eight lines 40 to unit 25, register 45. In a preferred embodiment, however, the multiplier units 23 and 24 are simplified. The C . 2 , C, g , S. Q and S 4 . terms are all 0 in accordance with Eq. (6) and Eq. (7) . Similar¬ ly the terms C 4 Q and S 4 2 are equal to +1 and the C 4 . and S 4 6 terms are -1 and similarly require no multiply or its equivalent. The values for all of the remaining sine and cosine factors are + or - (0.5) V2. Multiplication for those remaining factors is carried out in any convenient way, for example, utilizing two-input multiplier stages, but only where multiplication is . required. The adder unit (COMBINE) 25 performs eight, three-input adds corresponding to the eight equations of TABLE 17. Unit 25 in one embodiment, is constructed as eight, three-input adders. Each three-input adder receives one of the lines 19, one of the lines 40 and one of the lines 41 and provides one of the output lines 41. Typically, lines 40 and lines 41 are input to registers 45 and 46, respectively, which inturn have outputs which effectivley connect lines 40 and 41 as inputs to the adders. The output from the combine unit 25 provides the unnor- malized signals F-. Q , ..., F, _. These eight outputs are divided by the value of N (N=8) . In the embodiment of FIG 3, the division is carried out by the shifter 26 which shifts each of the outputs by P bits. In the example of FIG. 3, P is equal to three so that shifter 26 is a three-bit shifter. In the FIG. 3 system, the data is latched into the registers 15, 16 17, 45 and 46 and is latched and shifted in shifter 26 by clock signals from clock 47. Eight-Element Computer Operation In order to illustrate the operation of the FIG. 3 discrete transform computer, let the given input data sequence F n . be f(τ)=[l 2 3 4 5 6 7 8]. Permutation can proceed in P-l steps or directly by the cross-connection of FIG. 3. The first step is to bisect the data into the two odd and even four-element segments [1 3 5 7] and [2 4 6 8] , as in the column headed "ir" in TABLE 13. The second step separates each four-element segment into two two-element sements [1 5], [3 7], [2 6] and [4 8]. As P=3, the second step is the last step of the bisecting permutation. TABLE 13 r Si t ) /o( /ιW Mr) M ) B[ y ) y 6 4 6 -4 •8 •2.4 •0.3 5 7 6 4 12 -4 0 0 6 8 8 8 •4 0 5.6 0.7 7 The sequence [1 5 3 7 2 6 4 8] is the permuted sequence f_(τ). Each two-element segment [a b] is now transformed; thus [1 5] gives %[6 -4], but the factor H is suppressed until the end. When concatenated these elementary trans¬ forms constitute the first stage F. . values f.(τ)=[6 -4 10 -4 8 -4 12 -4]. Owing to the degeneracy of the sine and cosine factors exhibited in TABLE 15, the steps for obtain¬ ing f 2 * τ are very sim P le * Thus 16-6+10, -8=-4-4, -4=6-10, 0=4+4, and so forth. In the final stage, computation of F 3 (τ) involves sines and cosines of eighths of a turn. In adder unit 25 there are three sets of eight inputs each and one set of eight outputs. The first of the eight outputs is the sum of the first elements of the three input sets and similarly for the others. In the FIG. 3 apparatus, a factor h was suppressed P times so the result F 3 (τ) must be divided by 8 to conclude that the input sequence [1 2 3 4 5 6 7 8] has DBT [4.5 -1.7 -1 -0.7 -0.5 -0.3 0 0.7]. The equations for the four stages of the discrete transform computer of FIG. 3 are represented by the following TABLE 14, ..., TABLE 17. Evaluation of the eight equations in each TABLE 14, ..., TABLE 17 results in the DBT of TABLE 13. TABLE 14 (Stage 1) c ι,o - F 0,0 F - F 1,1 0,4 ? = F 1,2 0,2 . = F 1,3 0,6 = F ■ 1,4 0,1 = F 1,5 0,5 = p 1,6 0,3 'l,7 * F 0,7 TABLE 15 (Stage 2) q 2,j " F l,e + < F l,f > «^ h ) + (F χ ) (S 2fh ) 0 F 2,0 = F + 1,0 + (F "l.l " C 2.0> ) (S 1,1 2,0 F = F + 2,1 1,0 <P 1,1 » (C 2,1> + (F ) (S 1,1 2,1 F 2,2 = F + 1,2 + (P 1,3 " C 2,θ' (F 1,3 ) (S 2,0 F 2,3 = F + 1,2 ,F 1,3 " C 2,l> + (F 1,3 ) (S 2,1 F 2,4 = F 1,4 + + (P 1,5 " C 2,0» (F 1,5 ) (S 2,0 F 2,5 = F 1,4 + (P 1,5 " C 2,l + (F 1,5 ) (S 2,1 F 2,6 - F 1,6 + + (P 1,7 "^.O 1 (F 1,7 ) (S 2,0 F 2,7 = F + 1,6 P 1,7 " C 2 rl > + (F 1,7 ) (S 2,1 TABLE 16 (Stage 3) q F = F 3,j 2,e (P 2 f f (C 3,h> + < P 2,g ) (S 3,h J TABLE 17 (Stage 4) q = F 4,j 3,e < P 3,f " C 4,h » + F 3,g " S 4,h> 0 = F 3,0 + (F 3,4 ) (C 4,0 + (F 3,4 ) (S 4,0 0 , 4 ' 0 [4,1 (F ) (C 3,1 + 3,5 4,1 + (F 3,7 ) (S 4,1 0 '4,2 = F (F 3,2 + (F 3,6 ) (C 4,2 + 3,6 ) (S 4,2 0 [4,3 = ) (C 3,3 + (F 3,7 4,3 + (F 3,5 ) (S 4,3 0 4,4 ■ F 3,0 + (F 3,4 ) (C 4,4 + (F 3,4 ) (S 4,4 0 = F 4,5 + (F 3,1 3,5 ) (C 4,5 + (F 3,7 ) (s 4,5 0 ■ F (F ? 4,6 3,2 + (F 3,6 ) (C 4,6 + 3,6 ) (S 4,6 0 = F + ( (F 4,7 3,3 3,7 ) (C 4,7 + 3,5 ) (s 4,7 Computer Program A Fast Bracewell Transform program that also gives the Fourier transform is given in the following TABLE 18. The following explanatory program computes the DBT of an N-element data set, where N is between 2 and 512, and places it in F(P, ), where P = log 2 N. The real and imagi¬ nary parts of the DFT appear in R() and X() . p The User furnishes the 2 data values and changes line 50 to the appropriate value of P, where P is between 1 and 9. Data in algebraic form may be expressed on line 70 by sub¬ stituting any desired function for the sample function 1+1. For numerical data, append the necessary DATA statements, delete lines 70-90 and change line 1010 to read FOR 1 = 0 TO N7 @READ F(0,I) § F(I,1) = F(0,I) § NEXT I. The program is written for clarity rather than for speed. However, careful practice is exemplified. For example, in subroutine 7000 where the DFT is obtained from the DBT (DHT) , two divisions by 2 are avoided (by relegation to the display subroutine 8000) and a multiplication by 2 is han¬ dled by addition. Note that @ stands for a semicolon between separate state¬ ments under the one line number, that ! stands for RE, (re¬ mark) and that the subroutine on line 8000 that tabulates the results needs adaptating to local circumstances. Run¬ ning time to completion of the DFT is assigned to the vari¬ able TO and is printed out at the end (see sample) . Time taken by the HP-85 for N = 256 will be 2 minutes or in gen¬ eral 0.0 NP seconds. If P is greater than 8, the 32K memory of the HP-85 over¬ flows. On a machine with more memory, change line 20 to p read DIM(P,2 )j alternatively, edit to reuse the arrays. TABLE 18 4040 IF J>—1 THEN COTQ 4030 40SO J«M(TU) 10 I "FHT8AS" 4060 IF K-J THEN GOTO 4020 20DIMF(8.266) I Hartley 4070T-F(0.1*1) 30DIMRU2B),X(129) I Fouritr 4080F(0.I*1)-F{0.J*») 40DIM8(266). C(366) t . U i co« 4090F(0.J*1)-T 60P-3 I l<P<β 4100 IF KN-3THENGOTO4020 •0 H4-3Λ(P-3) • M3-H4*N4 t H-H2 4110 RETURN ♦N2 • 7-M-1 P7-P-I 6000 I Subr ?t 4e . t 1 » _ 70 DEFFN F(I) 60101 Get F(l.I).2 •leatat DFTt 80 FN F-I*l I Staple iuactloa 6020 FOR 1-0 TO M-2 STEP 3 00 FN END 6030 F(1.I)-F(0.I)«F(0.I+1) 100TO-TIME I Start tlur 6040 F(l.I+l)-F(0.I)-F(0.Itli 110COSUB 1000 I Inatrt data 6060 NEXT I 120 COSUB 2000 I Cat contfi of 2 6060 IFP-l THENGOTO 170 I Doaβ 130COSUB 3000 I Get CO > SO 6070 I Get F(2.1).4 iliiut DFT* 140COSUB4000 I Peπmitt ualngTable B 160COSUB 6000 I Stafea 1 * 6080 L.N-2 160COSUB 6000 I Staaea 3.4...8 6090 FOR 1-0 TO N-4 STEP 4 170COSUB7000 I Cat DFT 6100 F(2.I)-F(l.I)*F(l,I*2) ISO TO-TIME-TO ! Stoptlatr 6110 F(2.I*l)-F(l.in)»F(l.I*3) loocosuaβoooi p»° * r.auita 6120 F(2.I-r2)-F(l,I)-F(l.I«2) 200 END 6130 F<2.I*3)-F(l.I*i)-F(l.I*3) 6140 NEXT I 1000 I Subr Iimrt data 6160 IF P-2 THEH GOTO 170 I Done 1010 FOR 1-0TO H7 • F(O.I),FU. 6160 RETll. II I)-FNF(I) • NE TI 6000 » Subr Scapea 3.4...8 1020 RETURN 0010 U-P7 1660 NEXT I 6020 S«4 2000 I SubrCat powers of 2 6030 FOR -2 toP7 20101-16 M(0)-l • M(l)-2 6040 62-S+S 202QM<Z+1)-H(I}«M(I) 6060 U-U- 20301-1*1 6060 SO-M(U-l) 2040 IF I<PTHEU GOTO 2020 6070 FOR Q-0 TO 117 STEP S3 2060REllRH 6080 I-Q 3000 I Subr -i-fl coalnaa 6090 D-I*S 3010 M-2*PI/U •λ-0 6100 F( t.I)-Fα.I)*Fα.D) 3020 FOR1-1 TOII •Λ-A*U •5(1) 6110 Fα»1.0)-F .I)-F( .D) •SIU(Λ)tCU)-CflS(Λ)f uεx 6120 K-D-l TI 6130 FORJ-SO TO 114 STEP SO 3030 RETUR1I 6140 1-1*1 4000 I Subr ferauf • ' 6150 D-HS 4010 J, 1—1 6160 E-K*S 40201"I«1 BT-P 6170 Y-Fα.D)*C(J)tFα.ε)»S(J) 4030 T-T-l - J-H<T) TABLE 18 (Continued) 6180 Z-Fα,D)*S(J)-F .E}*C(J) 6210 F(L*1.K)-F( .X)«Z 6230 K-K-l 6240 NEXTJ 6250 E-X«S 6260 UEXTQ 6270 S-S2 62B0 IIEXT L 6290 RETURU 7000 I Subr Cφt OFT 7010 R<0)-F(L.O)*Fα.O) I XCO)-0 7020 FOR I-l TO 112 7030 B-F(L.U-l) 7040 R(I)>FU,I)«B 7050 X{I)-F(L.I)-B 7060 UEXT I 7070 RETURU 8000 ! Subr Shoa rcaulta 8010CLEAR 9 PRIUT β PRHIT **l, v f(r) H(*») R(.) +J X(f}"6PRIIIT 8020 JS» M " 8030 FOR 1-0TO117 8C 0 J-MIH(I.ll-I) I Reflect 8050 F-IliT(.S«1000«FHF(I))/1000 8060 H-IUT(.6«1000/ll«F .t))/1000 8070 R-II1T(.6*1000*R(J)/II)/2000 • X-IllT(.6*tOOO*X(J)/li)/2000 8080 JS- M «j M *VAL3(ABS(X)) • IF SC;i(X)—1 THEU J5-"-J H *VAL $(ABS(X» 8090 IF X » 0 THE!! J$-"" 8100 PRIUT I;TAB(6);F;TAB(12);H; TAB(2l);R;J* 8110 UEXT I 8120 PRIUT 0 PRIUT N H- M kV_LJCl) ft". T ac --• *VAL:(TO)* "aec" 8130 RETURN 0 1 4.S 4.6 ' 1 2 -1.707 -.6 -J 1.207 2 3 -1 -.6 -) .6 3 4 -.707 -.5 -J .207 4 6 -.6 -.6 6 « -.293 -.5 *J .207 6 7 0 -.S *J .6 7 8 .707 ••6 *J 1.207 u-a. Tie* was 1.436 •ec The present invention has been described employing several mathematical representations, but the invention is not limited to any particular representation. The interrelationship between time and frequency in connection with transforms is well known and it will be clear to those skilled in the art that the present invention covers decimation in frequency as well as decimation in time. While the invention has been particularly shown and de¬ scribed with reference to preferred embodiments thereof, it will be understood by those skilled in the art that the foregoing and other changes in form and detail may be made therein without departing from the spirit and scope of the invention.

Claims: What is claimed is: 1. A method of performing a discrete transform on an input sequence of N input data values, F n ., where N is equal to p «fJ 2 t where P is a positive, integer and where j has values from 0 to N-l, comprising, permuting the input sequence, F n ., with a bisecting permutation to form a permuted sequence . F . , processing said permuted sequence in P subsequent stages s where s has values from 2 to P+l, where the output from one stage form the inputs for the next stage and where each stage calculates N values of F . as a function of di- s t rect values from the previous s-1 stage, as a function of values from the previous s-1 stage multiplied by .cosine factors to form cosine terms, and as a function of values from the previous s-1 stage multiplied by sine factors to form sine terms whereby the transformed data values, F P +1 ' are P rovided from the P+l stage. 2. The method of Claim 1 wherein a first stage with s equal to 2 of said P subsequent stages forms sum and dif¬ ference values from sequential pairs of the permuted se¬ quence values to form the N output values from said first stage without need for explicit multiplication by said sine or cosine factors. 3. The method of Claim 2 wherein a second stage of said P subsequent stages forms sum and difference values from al¬ ternate output values from said first stage to form the N output values from said second stage without need for ex¬ plicit multiplication by said sine or cosine factors. 4. The method of Claim 3 wherein each stage s after said second stage forms each said cosine factor C . ' and each said sine factor S- . as follows: C D » cos (2π h/2 s"1 ) S e . = sin (2ιr h/2 s-1 ) where, h = 0,..., (2E-1) E = 2 s"2 . ' 5. The method of Claim 1 wherein the P+l stage includes the step of dividing each output for the P+l stage by N to form the transformed data values, F„ P+.,l,3.. 6. The method of Claim 1 wherein said processing step in¬ cludes for each of said subsequent stages the steps of add¬ ing said direct value, said cosine term and said sine term to form each value of F. .. s 7. The method of Claim 1- further including the steps of ffoorrmmiinngg ssaaiidd iinnppuutt ddaattaa vvaalluueess,, FF Qn ., as discrete values in υ rj one or more data collection steps. 8. The method of Claim 8 further including the steps of processing said transformed data values, F p+1 ^» in one or more utilization steps. 9. A method of performing a discrete transform on an input sequence of N input data values, F n . where N is equal to p ' J 2 , where P is a positive integer and where j has values from 0 to N-l, comprising, permuting the input sequence F n ., with a bisecting permutation to form a permuted sequence, F. ., • *- ■ » J processing said permuted sequence in P subsequent stages s where s has values from 2 to P+l, where the output from one stage forms the input for the next stage and where each stage calculates N values of Fs_, . as a function of di- rect values F , from the previous s-1 stage, as a func- tion of values F . - from the previous s-1 stage multi- plied by a cosine factor Cs,.n and as a function of values from the previous s-1 stage multiplied by a a sine factor S„s,.h where Fs,j. is calculated as follows: F s,j - t F s-l,e + « .-l,f» (C s,h> + (F s-l,g> < S s,h"< where , p N = number of data elements = 2 s = stage number = 2,...,T T = total number of stages = P+l Q a N/(2E) = number of pairs of sets of equations in a stage _ q = 0,1,..., (Q-l) E = 2s—2 = number of equations in each set of each pair e = [0+(2E) (q)] ,...,[(E-1)+(2E) (q) ] f - e + E g = f when h • 0 and also when -^-^- - n g as κ-f when h ≠ 0 where K is a constant equal to (2g], _ Q +E h * = 0,..., (2E-1) for first set of pair h = 0,...,(2E-1) for second set of pair h = 0,...,(2E-1) j = p+h = 0,1,..., (N-l) S β S i.Xl = sin (2ιr h/2 8"1 ) . 10. The method of Claim 9 wherein a first stage with s equal to 2 of said P subsequent stages forms sum and dif¬ ference values from sequential pairs of the permuted se¬ quence values to form the N output values from said first stage without need for explicit multiplication by said sine or cosine factors. 11. The method of Claim 10 wherein the second stage of said P subsequent stages forms sum and difference values from alternate output values from said first stage to form the N output values from said second stage without need for explicit multiplication by said sine or cosine factors. 12. The method of Claim 9 wherein each stage s after said second stage forms each said cosine factor C S ψ.i and each said sine factor S, h as follows: β s,n _ * = cos (2ιr h/2 s_1 ) where, h = 0,..., (2E-1) E = 2 s"2 . 13. The method of Claim 9 wherein the P+l stage performs the step of dividing each output for the P+l stage by N to form the transformed data values, F_ - .. 14. The method of Claim 9 wherein said processing includes for each of said subsequent stages the steps of adding said direct value, said cosine term and said sine term to form each value of F S 15. The method of Claim 9 further including the steps of forming said input data values, F n ., as discrete values in one or more data collection steps. 16. The method of Claim 9 further including the steps of processing said transformed data values, F p+1 ^» in one or more utilization steps. 17. A method of performing a discrete transform on an in¬ put sequence of N input data values, F n . where N is equal p υ t J to 2 , and P is a positive integer where j has values from 0 to N-l, comprising, permuting the input sequence F n ., with a bisecting permutation to form a permuted sequence, F- ., processing said permuted sequence in P subsequent stages s where s has values from 2 to P+l, wherein the out¬ put from one stage forms the input for the next stage and wherein each stage calculates N values of Fs,3. as a func- tion of direct values F _, -, _. from the previous s-1 stage, as a function of values F - from the previous s-1 stage multiplied by a cosine factor Cs*π. to form a cosine term and as a function of values from the previous s-1 stage multiplied by a a sine factor Ss * .n to form a sine term where F . is calculated by concurrently adding the direct value, the consine term and the sine term as follows: F s,j - t p s-l,e +(F s-l,f" c s,h' + (F s-l,g ) (S S ,h>lq where , p N a number of data elements = 2 s * stage number = 2,...,T T = total number of stages = P+l Q = N/(2E) = number of pairs of sets of equations in a stage q = 0,1,..., (Q-l) E = 2s—2 = number of equations in each set of each pair e = [0+(2E) (q)] ,...,[(E-1)+(2E) (q) ] f = e + E g = f when h = 0 and also when f = f] _ 0 g = K-f when h ≠ 0 where K is a constant equal to (2g]. Q +E h = 0,..., (2E-1) for first. set of pair h = 0,...,(2E-1) for second set of pair h = 0,...,(2E-1) j = +h = 0,1,..., (N-l) Ss_,, .n = sin (2ιr h/2 s_1 ) . 18. A method of performing a discrete transform H(v) on an input sequence of N input data values, F n . representing p υ 1 f(τ) where N is equal to 2 , and P is a positive integer where j is equal to τ and has values from 0 to N-l, and where the discrete transform is of the form -1 N-l H(v) = (N x ) Σ f(τ)cas(2ιrvτ/N) τ=0 where, casθ = cosθ+sinθ v=0 , . . . ,N-1 comprising, permuting the input sequence F n ., with a bisecting u 1 permutation to form a permuted sequence, F. ., processing said permuted sequence in P subsequent stages s where s has values from 2 to P+l, where the output from one stage forms the input for the next stage and where each stage calculates N values of F . as a function of di- s r 3 rect values F , from the previous s-1 stage, as a func- tion of values F S w -1 a I... from the previous s-1 stage multi- plied by a cosine factor Cs f .π and as a function of values from the previous s-1 stage multiplied by a a sine factor Ss,.h where Fs,3. is calculated as follows: s , j " tF s-l , e + < P β-l , fϊ < c β f h + (F s-l , g ) (S s ,h^q where , p N = number of data elements « 2 s = stage number = 2,...,T T - total number of stages = P+l Q = N/(2E) = number of pairs of sets of equations in a stage q » 0,1,..., (Q-l) E = 2s-2 = number of equations in each set of each pair e » [0+(2E) (q)],...,[(E-l)+(2E) (q) ] f = e + E g = f when h = 0 and also when f=f l*,-n g = K-f when h ≠ 0 where K is a constant equal to (2g]__ 0 +E h = 0,..., (2E-1) for first set of pair h = 0,...,(2E-1) for second set of pair h = 0 , . . . , (2E-1) j = p +h = 0 , 1, . . . , (N-l) c = , - cos (2ιr h/2 S_1 ) S s β , .h = sin ( 2τr h/2 s-1 ) . 19. An apparatus for providing a discrete transform on an input sequence of N input data values, F Q ., where N is equal to 2 , where P is a positive integer and where j is equal to values from 0 to N-l, comprising, means for permuting the input sequence, F n ., with a υ 1 3 bisecting permutation to form a permuted sequence, F. ., processing means for processing- said- permuted sequence in P subsequent stages s where s has values from 2 to P+l, where the output from one stage forms the input for the next stage and where each stage calculates N values of F ., for j equal to values from 0 to N-l, as a function of s, direct values from the previous s-1 stage, as a function of values from the previous s-1 stage multiplied by a cosine factor to form a cosine term, and as a function of values from the previous s-1 stage multiplied by a a sine factor to form a sine term whereby the transformed data values, F Γ f >J T.J I .,3 . > are provided from the P+l stage. 20. The apparatus of Claim 19 wherein said processing means includes a first stage with s equal to 2 for said P subsequent stages, said first stage including adder means to form sum and difference values from sequential pairs of the permuted sequence values to form the N output values from said first stage without need for explicit multiplica¬ tion by said sine or cosine factors. 21. The apparatus of Claim 20 wherein said processing means includes a second stage of said P subsequent stages, said, second stage including adder means to form sum and difference values from alternate output values from said first stage to form the N- output values from said second stage without need for explicit multiplication by said sine or cosine factors. 22. The apparatus of Claim 21 wherein each stage s after said second stage includes generator means to form each said cosine factor Cs,.h and each said sine factor S2,.h as follows: C β s,n s cos (2ιrh/2 s"1 ) s s h = sin < 2ιrh 2S"1 ϊ where, h = 0,..., (2E-1) E = 2 s"2 . 23. The apparatus of Claim 19 wherein the P+l stage in¬ cludes means for dividing each output for the P+l stage by N to form the transformed data values, F n - .. 24. The apparatus of Claim 19 wherein said processing means includes for each of said subsequent stages adder means for adding said direct value, said cosine term and said sine term to form each value of F e .. =f J 25. The apparatus of Claim 19 further including data col¬ lection means for forming said input data values, F Q ., as discrete values. 26. The apparatus of Claim 19 further including utiliza¬ tion means for processing said transformed data values, F P+l,j * 27. An apparatus for providing a discrete transform on an input sequence of N input data values, F n . where- N is p u rJ equal to 2 , and P is a positive integer where j is equal to values from 0 to N-l, comprising, permuting means for permuting the input sequence F n . , u r j with a bisecting permutation to form a permuted sequence, processing means for processing said permuted se¬ quence, said processing means including P subsequent stages s where s has values from 2 to P+l, said processing means including connection means connecting the output from one stage as the input for the next stage and wherein each stage calculates N values of F , . for j equal to values from 0 to N-l, said processing means including connection means for providing direct values F , from the previous s-1 stage, said processing means including multiplier means for multiplying values F , f from the previous s-1 stage by a cosine factor C S f .XI to form a cosine term and said pro- cessing means including multiplier means for multiplying values from the previous s-1 stage by a sine factor S . to form a sine term, said processing means including adder means for adding terms to form F . as follows: s , F s , j - lF s-l , e + < F s-l , f ) ( C s ,h> + < p β-l , g> < 8 β f h n q where , p N - number of data elements = 2 s * stage number = 2,...,T T = total number of stages = P+l Q = N/(2E) = number of pairs of sets of equations in a stage q « 0,1,..., (Q-l) E = 2s-2 = number of equations in each set of each pair e = tO+(2E) Cq) ],..., [(E-1)+(2E) (q) ] f = e + E g ss κ-f when h ≠ 0 where K is a constant equal to (2g] n _ 0 +E h = 0,..., (2E-1) for first set of pair h = 0,...,(2E-1) for second set of pair h = 0,...,(2E-1) j « p+h - 0,1,..., (N-l) C g h = cos (2π h/2 3"1 ) S s h - sin (2π h/2 3"1 ) . 28. The apparatus of Claim 27 wherein said processing means includes a first stage with s equal to 2 for said P subsequent stages, said first stage including adder means to form sum and difference values from sequential pairs of the permuted sequence values to form the N output values from said first stage without need for explicit multiplica¬ tion by said sine or cosine factors. 29. The apparatus of Claim 28 wherein said processing means-includes a second stage of said P subsequent stages, said -second stage including adder means to form stun and difference values from alternate output values from said first stage to form the N output values from said second stage without need for explicit multiplication by said sine or cosine factors. 30. The apparatus of Claim 29 wherein each stage s after said second stage includes generator means to form each said cosine factor Cs,n and each said sine factor S2~,.n as follows: β t, = cos (2ιr h/2 3"1 ) S s h = sin (2ιr h/2 3"1 ) where, h = 0,..., (2E-1) E = 2 3"2 . 31. The apparatus of Claim 27 wherein the P+l stage in¬ cludes means for dividing each output for the P+l stage by N to form the transformed data values, F p+1 .. 32. The apparatus of Claim 27 wherein said processing means includes for each of said subsequent stages adder means for adding said direct value, said cosine term and said sine term to form each value of F. s 33. The apparatus of Claim 27 further including data col¬ lleeccttiioonn mmeeaannss ffoor forming said input data values, F n . , as υ » 3 discrete values. 34. The apparatus of Claim 27 further including utiliza¬ tion means for processing said transformed data values, F P+l,j # 35. An apparatus for providing a discrete transform on an input sequence of N input data values, F n . representing p υ O f(τ) where N is equal to 2 , and P is a positive integer where j is equal to τ and has values from 0 to N-l, and where the discrete transform is of the form N-l H(v) = (N ,-l * ). Σ f(τ)ςas(2ιrvτ/N) τ=0 where, casθ s cosθ+sinθ v=0,...,N-l comprising, permuting means for permuting the input sequence F Q ., with a bisecting permutation to form a permuted sequence, processing means for processing said permuted se¬ quence, said processing means including P subsequent stages s where s has values from .2 to P+l, said processing means including connection means connecting the. output from one stage as the input for the next stage and wherein each stage calculates N values of F_ . where j has values from 0 s O to N-l, said processing means including means for storing direct values F - from the previous s-1 stage, said pro- cessing means including multiplier means for multiplying values F *» f from the previous s-1 stage by a cosine fac¬ tor C S f.ii to form a cosine term and said processing means including multiplier means for multiplying values from the previous s-1 stage by a sine factor S S_ f .El to form a sine term, said processing means including adder means for add¬ ing said direct value, said cosine term and said sine term to form F„ . as follows: so F s,j - " .-l.e + < F s-l,f" C s,h> + (P s-l,g'< S s, ' ] g where, p N = number of data elements = 2 s = stage number = 2,...,T T = total number of stages = P+l Q * N/(2E) = number of pairs of sets of equations in a stage q = 0,1,..., (Q-l) E = 2s—2 = number of equations in each set of each pair e = t0+(2E) (q)],...,[(E-l)+(2E) (q) I f = e + E g = f when h * 0 and also when ^~^- h - Q g * K-f when h ≠ 0 where.K is a constant equal to * 2g] ^_ Q +E h = 0,..., (2E-1) for first set of pair h ■ 0,...,(2E-1) for second set of pair h = 0,...,(2E-1) j = p+h = 0,1,..., (N-l) Ss,.n = sin (2ιr h/2 3""1 ) . 36. The apparatus of Claim 35 wherein said adder means is a three-input adder for each of said N values. 37. The apparatus of Claim 35 wherein each of said subse¬ quent stages includes register means for storing output values from the previous stage. 38. The method of Claim 1 further including the step of converting the transformed data values to Fourier trans¬ forms. 39. The method of Claim 18 including the steps of perform¬ ing the discrete transforms of a first sequence of input data values, f.(τ), and a second sequence of input data values, f 2 (τ), which is an even function, by performing said permuting and said processing steps for each of said first and second sequences to form a first transform H(v)equal to H.(v), and a second transform H(v)equal to H 2 (v), respectively, and forming the transform of the convolution of said first and second sequences by multiplying said first and second transforms to form the product H.tvjH-tv). 40. The method of Claim 39 including the step of forming the convolution of said first sequence and said second sequence by repeating said permuting and said processing steps on said product. 41. The method of Claim 1 wherein said bisecting permuta¬ tion comprises, bisecting each sequence, starting with said input se¬ quence, into odd and even segments and reordering said seg¬ ments with said odd segment followed by said even segment to form a reordered sequence, repeating said bisecting by bisecting each segment of the reordered sequence to form new odd and even segments of each segment and reordering each new odd and even segment with the odd segment followed by the even segment to form the next reordered sequence, repeating said bisecting until P-l reordered sequences have been formed whereby the (P-l) reordered sequence is the bisected permuted sequence. 42. The method of performing a discrete transform H(v) on an input sequence of N input data values, f(τ) where N is p equal to 2 , and P is a positive integer where τ and has values from 0 to N-l, forming the transform H (v) for each value of v the following sum for all values of τ. -1 N-l (N A ) Σ f(τ)cas(2πvτ/N) τ=0 where , casθ s cosθ+sinθ θ = (2ιrvτ/N) . 43. A method of performing a discrete transform on an input sequence of N real input data values, F n ., where N p υ »J is equal to 2 , where P is a positive integer and where 3 has values from 0 to N-l, comprising, permuting the input sequence, F n ., in a first stage u with a bisecting permutation to form an N-numbered permuted sequence, F. ., 1 3 processing said permuted sequence in P subsequent stages s where s has values from 2 to P+l, where the out¬ puts from one stage form the inputs for the next stage, where the s-1 stage for each value of s from 2 to P+l provides N-numbered outputs as inputs to the s stage, where the s equal 2 stage receives the F. . sequence as an input, and where each stage calculates N values of F . as a function of direct values from the previous s-1 stage, as a function of first values F . - from the previous s-1 stage multiplied by cosine factors C -. to form cosine terms, and as a function of values from the previous s-1 stage multiplied by sine factors C S ψ.i to form sine terms having retrograde indexes in that the indexes g and h for said sine terms change in opposite directions, whereby the transformed data values, F-j. +..1, ., are provided from the P+l stage. 44. The method of Claim 43 wherein a first stage with s equal to 2 of said P subsequent stages forms sum and dif¬ ference values from sequential pairs of the permuted se¬ quence values to form the N output values from said first stage without need for explicit multiplication by said sine or cosine factors. 45. The method of Claim 44 wherein a second stage of said P subsequent stages forms sum and difference values from alternate output values from said first stage to form the N output values from said second stage without need for ex¬ plicit multiplication by said sine or cosine factors. 46. The method of Claim 45 wherein each stage s after said second stage forms each said cosine factor C 5 ψ.IX and each said sine factor S . as follows: β t , = cos (2πh/2 3-1 ) S g h = sin (2τrh/2 s"1 ) where, h = 0,..., (2E-1) E = 2 3"2 . 47. The method of Claim 43 further including the step of performing the inverse transform by using the transformed data values F_ +1 .-. as the input sequence F Q ., repeating said permuting and processing steps to form the transformed data values as F. .. υ O

Inventors: BRACEWELL RONALD N, BRACEWELL, RONALD, N.
Applicants: UNIV LELAND STANFORD JUNIOR, THE BOARD OF TRUSTEES OF THE LELAND STANFORD JUNIO
Application year: 1985
Main classification: G06F15
IPC codes: G06F17