Boots – shoes – and leggings
Patent
1989-06-08
1990-11-20
Shaw, Dale M.
Boots, shoes, and leggings
G06F 1531
Patent
active
049723588
ABSTRACT:
The discrete Fourier transform is continuously calculated at input signal sample rate using recursive filtering, rather than transversal filtering. This reduces the number of complex digital multiplications per computational cycle to N, the number of spectral components in the discrete Fourier transform, where rectangular truncation window or a new exponential window is used. Where a triangular truncation window is used the number of complex digital multiplications per computational cycle is reduced to 2N.
REFERENCES:
patent: 4689762 (1987-08-01), Thibodeau, Jr.
patent: 4760549 (1988-07-01), du Chene et al.
patent: 4787055 (1988-11-01), Bergeon et al.
patent: 4791590 (1988-12-01), Ku et al.
patent: 4831570 (1989-05-01), Abiko
"A Mathematical Approach to Modeling the Flow of Data & Control in Computational Networks", L. Johnsson & D. Cohen, VLSI Systems & Computations, H. T. Kung et al., pp. 213-225, Computer Science Press Rockville, MD. 1981.
L. R. Rabiner & B. Gold, Theory and Application of Digital Signal Processing, Prentice Hall, Englewood Cliffs, NJ, pp. 50-57.
F. J. Harris, "On the Use of Windows for Harmonic Analysis with the Discrete Fourier Transform", Proceedings of the IEEE, vol. 66, No. 1, Jan. 1978, pp. 51-83.
Hartley Richard I.
Welles II Kenneth B.
Davis Jr. James C.
General Electric Company
Limberg Allen L.
Mai Tan V.
Shaw Dale M.
LandOfFree
Computation of discrete fourier transform using recursive techni does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Computation of discrete fourier transform using recursive techni, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computation of discrete fourier transform using recursive techni will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-458906