DSP

Question 1

FFT

Answer 1

Fast Fourier Transform

Question 2

DFT

Answer 2

Discrete Fourier Transform

Question 3

It is a DFT, but is much faster for
calculations. The whole point of the FFT
is speed in calculating a DFT.

Answer 3

FFT

Question 4

are given credit for
bringing the FFT to the world in their paper: “An
algorithm for the machine calculation of
complex Fourier Series,” Mathematics
Computation, Vol. 19, 1965, pp 297-301.

Answer 4

J.W. Cooley and J.W. Tukey

Question 5

The great German mathematician ______ had used the method more
than a century earlier. This early work was
largely forgotten because it lacked the tool to
make it practical: the digital computer.

Answer 5

Karl Friedrich
Gauss (1777-1855)

Question 6

are honored because they
discovered the FFT at the right time, the
beginning of the computer revolution.

Answer 6

Cooley and Tukey

Question 7

Proposed Fast Fourier
Transform in 1965.

Answer 7

Cooley and Tukey

Question 8

is a highly efficient
procedure for computing DFT of a finite series
and requires less number of computations than
that of direct evaluation of DFT.

Answer 8

The fast fourier transform

Question 9

is based on decomposition and breaking
the transform and combining them to get the
total transform.

Answer 9

FFT

Question 10

There are basically two types of FFT
algorithm

Answer 10

1. Decimation in Time
2. Decimation in Frequency

Question 11

is used to calculate the DFT of
an N-point sequence.

Answer 11

DIT

Question 12

breaks the 16 point signal into two signals
each consisting of 8 points.

Answer 12

first stage

Question 13

decomposes the data into four signals of
4 points. This pattern continues until there are N signals
composed of a single point.

Answer 13

second stage

Question 14

is used each time a signal is broken in two, that is, the
signal is separated into its even and odd numbered
samples

Answer 14

interlaced decomposition

Question 15

The FFT time
domain decomposition is usually carried out by a

Answer 15

bit reversal sorting
algorithm.

Question 16

builds on the Danielson-Lanczos
Lemma and the twiddle factor to create an efficient
algorithm.

Answer 16

Butterfly Diagram

Question 17

It’s the basic unit,
consisting of just two inputs and two outputs.

Answer 17

simplest butterfly

Question 18

the input is bit – reversed order and
the output is natural order

Answer 18

DIT-FFT

Question 19

the input is natural order and the
output is bit-reversed order

Answer 19

DIF-FFT

Question 20

is a system that performs
mathematical operations on a discrete and
sampled time signal, so as to enhance or
reduce certain aspects of that particular signal
as may be necessary.

Answer 20

digital filter

Question 21

There are two fundamental types of digital
filters:

Answer 21

finite impulse response (FIR) and
infinite impulse response (IIR)

Question 22

is the appropriate
selection of the filter coefficients and the number of taps
to realize the desired transfer function H(f).

Answer 22

FIR filter design

Question 23

commonly used for
audio and video processing, communications
systems, and transform analysis to name a few.

Answer 23

Multirate systems

Question 24

The two basic
operations in a multirate system are decreasing
_____ and increasing ______ the
sampling-rate of a signal.

Answer 24

(decimation) and (interpolation)

Question 25

are
sometimes used for sampling-rate conversion,
which involves both decimation and
interpolation.

Answer 25

Multirate systems

Question 26

can be regarded as the discrete-
time counterpart of sampling.

Answer 26

Decimation

Question 27

is the exact opposite of
decimation. It is an information preserving
operation, in that all samples of x[n] are
present in the expanded signal y[n].

Answer 27

Interpolation

Question 28

is for
sampling rate conversion.

Answer 28

multirate signal processing

Question 29

FFT-Coverage

Answer 29

Problem solving

Question 30

Digital filters and Multrirate filters-Coverage

Answer 30

Terms