DFA
DFA
• where k = 1, 2, 3,…., N.
• Sx (k Δ f) is a complex quantity, which is obtained by operating on all
the sample x (n · Δt); n = 1, 2, 3,…, N by the complex
factor exp [-j[(2Πkn)/N]].
• The discrete inverse transform is given by
• where n = 1, 2, …, N.
• Since Sx (k · Δ f); k = 1, 2, …, N is a complex quantity, the DFT
provides both amplitude and phase information at a particular point in
the spectrum.
• The discrete transforms are usually implemented by means of the Fast
Fourier Transform (FFT), which is particularly suitable for
implementation in a digital computer, since N is constrained to the
power of 2, i.e. 210 = 1024.
• A digital signal analyzer block diagram is shown in Fig. 9.15. This
digital signal analyzer employs an Fast Fourier Transform algorithm.
• The block diagram is divided into three sections, namely
1. the input section,
2. the control section and
3. the display section.
• The input section consists of two identical channels.
• The input signal is applied to the input amplifier, where it is conditioned and
passed through two or more anti-aliasing filters.
• The cut-off frequencies of these filters are selected with respect to the
sampling frequency being used.
• The 30 kHz filter is used with a sampling rate of 102.4 kHz and the 300 kHz
filter with a sampling rate of 1.024 MHz.
• To convert the signal into digital form, a 12 bit ADC is used. The output
from the ADC is connected to a multiplier and a digital filter.
• Depending on the mode of the analyzer to be used, either
• In Base-band mode (in which the spectrum is displayed from a dc to an
upper frequency within the bandwidth of the analyzer) (or)
• In the band selectable mode (which allows the full resolution of the
analyzer to be focused in a narrow frequency band), the signal is multiplied
either by a sine or cosine function.
• The processing section of the analyzer provides FFT processing on the input
signal (linear or logarithm).
• The input signal used for such measurements is often the internal random
noise generator.