Introduction to Digital Signal Processing Flashcards

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/29

flashcard set

Earn XP

Description and Tags

These flashcards cover the core vocabulary and foundational concepts of Digital Signal Processing (DSP), including signal types, LTI system properties, transforms (DTFT, DFT, z-transform), sampling theory, and filter design methodologies.

Last updated 10:38 AM on 6/6/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

30 Terms

1
New cards

Continuous-time signals

Signals that are often referred to as analog signals, where the independent variable (typically time) is continuous.

2
New cards

Digital signals

Signals for which both the independent variable (time) and the amplitude are discrete.

3
New cards

Discrete-time systems

Systems where both the input and the output are discrete-time signals.

4
New cards

Sampling frequency (fsf_s)

The reciprocal of the sampling period, defined mathematically as fs=1Tf_s = \frac{1}{T}, expressed in units such as HzHz or radians per second as \text{\omega}_s = \frac{2\text{\pi}}{T}.

5
New cards

Unit sample sequence (\text{\delta}[n])

Also referred to as the discrete-time impulse or simply impulse, defined as \text{\delta}[n] = \begin{cases} 1, & n = 0 \\ 0, & n \neq 0 \end{cases}.

6
New cards

Unit step sequence (u[n]u[n])

A basic sequence defined as u[n]={1,n00,n<0u[n] = \begin{cases} 1, & n \ge 0 \\ 0, & n < 0 \end{cases}.

7
New cards

Memoryless systems

Systems where the output y[n]y[n] at any arbitrary time index nn depends only on the input x[n]x[n] at that same value of nn.

8
New cards

Linear systems

Systems defined by the principle of superposition, requiring the meet of both the additivity property and the scaling (homogeneity) property.

9
New cards

Time-invariant systems

Systems where a time shift or delay of the input sequence causes an identical corresponding shift in the output sequence.

10
New cards

Causal system

A system where the output at time index nn depends only on the values of the input at index nn and earlier time instants.

11
New cards

Stable system

A system that produces a bounded output sequence for every bounded input sequence (BIBOBIBO stability).

12
New cards

Impulse response (h[n]h[n])

The response of a linear system to a unit sample sequence input; it completely characterizes a Linear Time-invariant (LTILTI) system.

13
New cards

Convolution sum

The mathematical expression for the output of an LTILTI system, denoted as y[n]=x[n]h[n]=k=+x[k]h[nk]y[n] = x[n] * h[n] = \sum_{k = -\infty}^{+\infty} x[k]h[n - k].

14
New cards

FIRFIR systems

Finite-duration impulse response systems, characterized by an impulse response with a finite number of nonzero samples; these systems are always stable if the impulse response values are finite.

15
New cards

IIRIIR systems

Infinite-duration impulse response systems, where the response to an impulse lasts for an infinite duration of time.

16
New cards

Eigenfunction

A sequence x[n]x[n] for which the system output is a scaled version of the same sequence, such as the complex exponential e^{j\text{\Omega}n} for LTILTI systems.

17
New cards

Frequency response (H(e^{j\text{\Omega}}))

The eigenvalue of an LTILTI system corresponding to the complex exponential input, defined as H(e^{j\text{\Omega}}) = \sum_{n = -\infty}^{+\infty} h[n]e^{-j\text{\Omega}n}.

18
New cards

Nyquist Sampling Theorem

A theorem stating that a bandlimited signal with \text{X}_c(j\text{\omega}) = 0 for |\text{\omega}| \text{\ge} \text{\omega}_N can be uniquely determined by its samples if the sampling frequency \text{\omega}_s \text{>} 2\text{\omega}_N.

19
New cards

Aliasing distortion

A type of distortion that occurs when the sampling frequency is not high enough (\text{\omega}_s \text{\le} 2\text{\omega}_N), causing overlapping copies of the Fourier transform.

20
New cards

Discrete Fourier Transform (DFTDFT)

A Fourier representation for finite-duration sequences of length NN that corresponds to equally spaced samples of the DTFTDTFT, defined as \text{X}[k] = \sum_{n = 0}^{N - 1} x[n]e^{-j\frac{2\text{\pi}}{N}kn}.

21
New cards

Fast Fourier Transform (FFTFFT)

A collection of efficient algorithms used to compute the Discrete Fourier Transform by decomposing the computation into smaller segments.

22
New cards

z-Transform

The discrete-time counterpart of the Laplace transform, defined for a sequence x[n]x[n] as the power series X(z)=n=+x[n]zn\text{X}(z) = \sum_{n = -\infty}^{+\infty} x[n]z^{-n}.

23
New cards

Region of Convergence (ROCROC)

The set of values of the complex variable zz for which the z-transform sum converges.

24
New cards

Poles

The values of zz for which the z-transform X(z)\text{X}(z) is infinite; for rational functions, these are the roots of the denominator polynomial.

25
New cards

Zeros

The values of zz for which the z-transform X(z)=0\text{X}(z) = 0; for rational functions, these are the roots of the numerator polynomial.

26
New cards

Direct Form II

A computational structure for implementing an LTILTI system that rearranges the block diagram to share delay elements, minimizing the memory required.

27
New cards

Gibbs phenomenon

The oscillatory behavior that occurs near a discontinuity (like a brick-wall cutoff) in the frequency response when an ideal impulse response is truncated.

28
New cards

Bilinear transform

A nonlinear mapping technique used to design IIRIIR filters by transforming the imaginary axis of the ss-plane onto the unit circle of the zz-plane to avoid aliasing.

29
New cards

Frequency warping

The nonlinear relationship between continuous-time frequency \text{\omega} and discrete-time frequency \text{\Omega} inherent in the bilinear transform, given by \text{\Omega} = 2\text{\arctan}(\frac{\text{\omega}T}{2}).

30
New cards

Overlap-add method

A procedure for constructing the filtered output of a long signal by segmenting it into sections, convolving each with the impulse response, and adding the overlapping parts.