Digital Signal Processing using the Fast Fourier Transform (FFT)

95.00

توصيل مجاني

احصل عليه خلال 24 يوليو

اطلب في غضون 8 ساعة 42 دقيقة

خصم على الدفع

يتم البيع عبر بوكسمارت

4.2

63% إيجابية

المنتج كما في الوصف70%

شريك لنون منذ8+ سنة

أحدث التقييمات الإيجابية

توصيل مجاني لنقطة نون ومراكز الاستلام

هذا المنتج قابل للإرجاع مجاناً

مدفوعات آمنة

نظرة عامة على المنتج

المواصفات

الناشر	Grin Verlag
رقم الكتاب المعياري الدولي 10	3638639142
اللغة	English
تاريخ النشر	14 December 2007

رقم الكتاب المعياري الدولي 13	9783638639149
الكاتب	Albert H Kaiser
وصف الكتاب	Seminar paper from the year 1997 in the subject Technology, grade: 1 (A), Loughborough University (Department of Aeronautical and Automotive Engineering), language: English, abstract: Conventionally a signal is a physical variable that changes with time and contains information. The signal may be represented in analogue (continuos) or discrete (digital) form. The majority of the physical variables of interest for the engineer are of analogue form. However digital data acquisition equipment favour a digital representation of the analogue signal. The digital representation of a analogue signal will effect the characteristic of the signal. Thus an understanding of the underlying principles involved in signal processing is essential in order to retain the basic information of the original signal. The primary goal to use the Discrete Fourier Transform (DFT) is to approximate the Fourier Transform of a continuous time signal. The DFT is discrete in time and frequency domain and has two important properties: - the DFT is periodic with the sampling frequency - the DFT is symmetric about the Nyquist frequency Due to the limitations of the DFT there are three possible phenomena that could result in errors between computed and desired transform. - Aliasing - Picket Fence Effect - Leakage The DFT of a signal uses only a finite record length of the signal. Thus the input signal for the DFT can be considered as the result of multiplying the signal with a window function. Multiplication in the time domain results in convolution in the frequency domain, which will influence the spectral characteristic of the sampled signal. In the table below rectangular and Hanning window are compared: [...] Table The Fast Fourier Transform (FFT) is a computationally efficient algorithm for evaluating the DFT of a signal. It is imported to appreciate the properties of the FFT if it is to be used effectively for the analysis of signals. In order to avoid aliasing and resulting misi
عدد الصفحات	88 pages

مجموع السلة  95.00

Digital Signal Processing using the Fast Fourier Transform (FFT)

95.00

 95