1A)

he sampling theorem states that, “a signal can be exactly reproduced if it is sampled at the rate fs which is greater
than twice the maximum frequency W.” To understand this sampling theorem, let us consider a band-limited signal,
i.e., a signal whose value is non-zero between some –W and W Hertz.

B)

A digital signal can only have a set of finite values. If the digital signal is *binary*, it can only have 2 values, 0 or 1.
A PWM signal is an example of a continuous signal (NOT discrete), and binary digital having just 2 values.
A discrete signal is one that is defined only at specific time intervals

C)

Linear time-invariant systems (LTI systems) are a class of systems used in signals and systems that are both
linear and time-invariant. ... Time-invariant systems are systems where the output does not depend on when an
input was applied. These properties make LTI systems easy to represent and understand graphically.

D)

Region of Convergence (ROC) Whether the Laplace transform of a signal exists or not depends on the complex
variable as well as the signal itself. All complex values of for which the integral in the definition converges form a
region of convergence (ROC) in the s-plane.

E)

Properties of the Z-transform, Notation, Linearity, Time-shifting, Time Reversal, ... Conjugation, Convolution, Digital
Signal Processing, Joseph Picone, ... The region of convergence for the second term is a subset of the region

F)

A stable system satisfies the BIBO boundedinputforboundedoutput condition. Here, bounded means finite in
amplitude. For a stable system, output should be bounded or finite, for finite or bounded input, at every instant of
time

G)

Zero padding is a simple concept; it simply refers to adding zeros to end of a time-domain signal to increase its
length

H) In DTFT your Discrete, aperiodic time domain signal is transformed into continuous, periodic frequency domain
signal. In DFT, your input signal is the output of your DTFT which is a continuous, periodic frequency domain signal,
and DFT gives you the Discrete samples of the continuous DTFT.

I) A twiddle factor, in fast Fourier transform (FFT) algorithms, is any of the trigonometric constant coefficients that
are multiplied by the data in the course of the algorithm. ... This remains the term's most common meaning, but it
may also be used for any data-independent multiplicative constant in an FFT

J) A causal system is one whose output depends only on the present and the past inputs. A noncausal
system's output depends on the future inputs. In a sense, a noncausal system is just the opposite of one that has
memory.
NO7)Properties of Discrete Fourier Transform
As a special case of general Fourier transform, the discrete time transform shares all properties
(and their proofs) of the Fourier transform discussed above, except now some of these properties
may take different forms. In the following, we always

assume and .

 Linearity

 Time Shifting

Proof:

If we let , the above becomes

 Time Reversal
 Frequency Shifting

 Differencing

Differencing is the discrete-time counterpart of differentiation.

Proof:

 Differentiation in frequency

proof: Differentiating the definition of discrete Fourier transform with respect to , we

get
 Convolution Theorems

The convolution theorem states that convolution in time domain corresponds to

multiplication in frequency domain and vice versa:

Recall that the convolution of periodic signals and is

Here the convolution of periodic spectra and is similarly defined as

 Proof of (a):

Proof of (b):

 Parseval's Relation