Scribd
Upload
333 views

Introduction To Digital Signal Processing

The document provides an overview of the topics covered in a course on digital signal processing (DSP). It discusses continuous and discrete time signals, sampling and interpolation, statistics and probability, the z-transform, Fourier analysis, linear filters, digital filters, digital communication systems, and image processing. Key concepts in DSP like histograms, probability mass functions, and probability density functions are also introduced.

Uploaded by

nosgothsoul
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
333 views

Introduction To Digital Signal Processing

The document provides an overview of the topics covered in a course on digital signal processing (DSP). It discusses continuous and discrete time signals, sampling and interpolation, statistics and probability, the z-transform, Fourier analysis, linear filters, digital filters, digital communication systems, and image processing. Key concepts in DSP like histograms, probability mass functions, and probability density functions are also introduced.

Uploaded by

nosgothsoul
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

Section I

Introduction to

DIGITAL SIGNAL PROCESSING

Course Syllabus
Introduction: What is DSP, brief history of the topic, applications. Continuous-time (CT) and Discrete-time (DT) signals: analog versus digital signals. Interpolation and Sampling: Continuous-time (CT) signals, interpolation, sampling. The sampling theorem as orthonormal basis expansion. Processing of CT signals in DT. Statistics, Probability, and Noise: stochastic signal processing and quantization; signal processing as geometry, vectors spaces, bases, approximations. The Z-transform: characterization of DT signals and systems; response of a linear time-invariant (LTI) system to an arbitrary excitation; Fourier Analysis: The discrete Fourier transform (DFT) and series (DFS). The discrete-time Fourier transform (DTFT) and the fast Fourier transform (FFT). Linear Filters: Linear time-invariant systems, convolution, ideal and realizable filters. Filter design and implementation. Digital Filters: FIR and IIR filter structures. Analog-to-Digital (ADC) and Digitalto-Analog (DCA) converters. Digital Communication Systems: Analog channels and bandwidth/power constraints. Modulation and demodulation. Transmitter and receiver design. Image Processing: Introduction to image processing and two-dimensional (2D) Fourier analysis. Filtering and compression. The JPEG compression standard.

Signals, Systems, and Data Processing

Signals, Systems, and Data Processing

Signals, Systems, and Data Processing

Analog versus Digital Signal Processing

Signal Processing Streams

Analog versus Digital Signal Processing

DSP Applications

DSP Applications

DSPhasrevolutionizedmanyareasinscienceandengineering. Afewofthesediverseapplicationsareshownabove.

Interdisciplinarity of DSP

Signals with Different Mean and Variance

Variance Mean

Amplitude of Vpp over Standard Deviation

Ratio of the peak-to-peak amplitude Vpp to the standard deviation for several common waveforms. For the square wave, this ratio is 2; for the triangle wave it is 3.46; for the sine wave it is ~2.86 . While random noise has no exact peakto-peak (pp) value, it is approximately 6 to 8 times the standard deviation .

Nonstationary Processes

Signals generated from nonstationary processes. Both the mean and standard deviation are variable (a). The standard deviation remains constant (e.g., one), whereas the mean changes from a 0 to 2 (b). It is a common analysis approach to break these signals into short segments, and calculate the statistics of each segment individually.

Statistics versus Probability


Statistics is the science of interpreting numerical data, such as acquired signals. Probability is used in DSP to understand the processes that generate signals. Although they are closely related, the distinction between the acquired signal and the underlying process is essential to many DSP techniques. In the case of random signals, the typical error between the mean of the N points and the mean of the underlying process, is given by:

If N is small, the statistical noise in the calculated mean will be very large. In other words, you do not have access to enough data to properly characterize the process. The larger the value of N, the smaller the expected error will become. A milestone in probability theory, the Strong Law of Large Numbers, guarantees that the error becomes zero as N approaches infinity.

Histograms

Figure (a) shows 128 samples from a very long signal, with each sample being an integer between 0 and 255. Figures (b) and (c) show histograms using 128 and 256,000 samples from the signal, respectively. Histograms are smoother when more samples are used.

If.

Histograms and Probability Functions


The sum of all of the values in a histogram must equal the number of points in the signal. Here, Hi is the histogram, N is the number of points in the signal (samples), and M is the number of bins in the histogram.

The the statistical noise (roughness) of the histogram is inversely proportional to the square root of the number of samples used. The histogram is formed from an acquired signal. The corresponding curve for the underlying process is called the probability mass function (pmf). Histograms are always calculated using a finite number of samples, while the pmf is what would be obtained with an infinite number of samples. The histogram and the pmf are used with discrete data only. A similar concept applies to continuous signals, such as voltages in analog electronics. The probability density function (pdf), also called the probability distribution function, is to continuous signals what the pmf is to discrete signals.

PMF and PDF

The relationship between (a) the histogram, (b) the probability mass function (pmf), and (c) the probability density function (pdf). The histogram is calculated from a finite number of samples. The pmf describes the probabilities of the underlying process. The pdf is similar to the pmf, but it is used with continuous rather than discrete signals.

PMF and PDF


To calculate a probability, the probability density is multiplied by a range of values. If the pdf is not constant over the range of interest, the multiplication becomes the integral of the pdf over that range. In other words, the area under the pdf bounded by the specified values. A bin is defined by arbitrarily selecting the length of the histogram to be some convenient number. The value of each bin represents the total number of samples in the signal that have a value within a certain range.

PMF and PDF


How many bins should be used? This is a compromise between two problems. Too many bins make it difficult to estimate the amplitude of the underlying pmf. This is because only a few samples fall into each bin, making the statistical noise very high. At the other extreme, too few of bins make it difficult to estimate the underlying pmf in the horizontal direction. The number of bins controls a trade-off between resolution along the y-axis, and resolution along the x-axis. More samples make the resolution better in both directions.

PMF and PDF

The signal is 300 samples long, with each sample a floating point number uniformly distributed between 1 and 3. Figures (b) and (c) show binned histograms, using 601 and 9 bins, respectively. A large number of bins results in poor resolution along the vertical axis, while a small number of bins provides poor resolution along the horizontal axis

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy