电子与通信工程专业英语 作者 徐存善 Unit 20.ppt

Digital Signal Processing (DSP) The evolution of a new point of view toward digital signal processing was further accelerated by the disclosure in 1965 of an efficient algorithm for computation of Fourier transforms. This class of algorithms has come to be known as the fast Fourier transform or FFT. The fast Fourier transform algorithm reduced the computation time of the Fourier transform by orders of magnitude. This permitted the implementation of increasingly sophisticated signal processing algorithms with processing times that allowed interaction with the system. Another important implication of the fast Fourier transform algorithm was tied to the fact that it was an inherently discrete-time concept. It was directed toward the computation Of Fourier transform of a discrete-time signal or sequence and involved a set of properties and mathematics that were exact in the discrete-time domain, it was not simply an approximation to a continuous-time Fourier transform. The importance of this was that it has the effect of stimulating a reformulation of many signal processing concepts and algorithms in terms of discrete-time mathematics and these techniques then formed an exact set of relationships in the discrete-time domain. The techniques and applications of digital signal processing are expanding at a tremendous rate. With the advent of large scale integration and the resulting reduction in cost and size of digital components, together with increasing speed, the class of applications of digital signal processing techniques is growing. Special purpose digital filters can now be implemented at sampling rates in the megahertz range. Digital processors also form an integral part of many modern radar and sonar systems. 6. The importance of this was that it has the effect of stimulating a reformulation of many signal processing concepts and algorithms in terms of discrete-time mathematics and these techniques then formed an exact set