Boots – shoes – and leggings
Patent
1985-02-27
1986-08-05
Malzahn, David H.
Boots, shoes, and leggings
G06F 15332
Patent
active
046047212
ABSTRACT:
A special purpose computer and method of computation for performing an N-length discrete Fourier transform (DFT) using a sum and difference conjugate prime factor transform. The transform length N is selected as equal to the product of L mutually prime factors N.sub.1, N.sub.2, . . . , N.sub.1, . . . , N.sub.L. For each one of the L mutually prime factors N.sub.i, an N.sub.i -length DFT is performed. Each N.sub.i -length DFT transform is performed using a data processing element called a kernel. Each kernel includes one or more memory elements for reordering data and a computational element. The computational element includes adder circuit means for forming the sum term, SUM(n).sub.i equal to the quantity x(n.sub.i)+x(N.sub.i -n.sub.i) and the difference term, DIFF(n.sub.i) equal to x(n.sub.i)-x(N.sub.i -n.sub.i).
REFERENCES:
patent: 4092723 (1978-05-01), Picquendar et al.
patent: 4156920 (1979-05-01), Winograd
patent: 4293921 (1981-10-01), Smith
Cooley et al, "An Algorithm for the Machine Computation of Complex Fourier Series", Math. of Computation, vol. 19, pp. 297-301, Apr. 1965.
Cochran et al, "What is the Fast Fourier Transform?", Proceedings of the IEEE, vol. 55, No. 10, pp. 1664-1674, Oct. 1967.
Kolba et al, "A Prime Factor FFT Algorithm Using a High-Speed Convolution", IEEE Tran. on Acoustics, Speech & Signal Processing, vol. ASSP-25, No. 4, pp. 281-294, Aug. '77.
Nussbaumer, "New Approach to the Computation of Large One-Dimensional Discrete Fourier Transforms", IBM Tech. Disclosure Bulletin, vol. 23, No. 2, Jul. 8, pp. 634-638.
Singleton, "Algorithm for Computing Mixed Radix Fast Fourier Transform", IEEE Trans. Audio & Electroacoustics, vol. AU-17, No. 2, pp. 93-103, Jun. 1969.
Malzahn David H.
Stern Robert J.
TRW Inc.
LandOfFree
Computer and method for high speed prime factor transform does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Computer and method for high speed prime factor transform, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer and method for high speed prime factor transform will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-972563