IEEE Transactions on Signal Processing · 1992 · 10 citations · 5 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureReal-time SystemsTime Series AnalysisAutocorrelation AnalysisDigital Signal ProcessingFourier AnalysisPattern RecognitionSignal ProcessingTime Series ComputationAutocorrelation StructureData Processing AlgorithmsDigital Signal Processing BlocksFast Fourier TransformFermat FactorizationFourier TransformSignals
A method for speedy computation of the autocorrelation coefficients used by linear predictive coding (LPC) that uses Fermat number transform (FNT) is described. It is found that there exists a fast computational algorithm for FNT which has a computational structure similar to the fast Fourier transform (FFT). Since the fast Fermat number transform (FFNT) and FFT have similar computational structures, readily available FFT VLSI hardware structures may be adopted for real-time implementation of the FFNT. A verification of the FFNT on an MC 68000 single-board computer has been performed with quite satisfactory results.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
5
Theory and application of digital signal processing
T.N. Trick · Proceedings of the IEEE · 1975 · 1.9K citations