This document discusses discrete-time signals and systems. It defines discrete-time signals as continuous-amplitude signals that are represented by a discrete sequence of values obtained through sampling a continuous-time signal. Linear time-invariant systems are introduced as systems where the output is the input convolved with the system's impulse response. Examples of discrete-time signals and systems are provided to illustrate concepts such as shifting signals by adding or subtracting from the time index n.
Signal Processing Introduction using Fourier TransformsArvind Devaraj
1) The document introduces signal processing by discussing signals, systems, and transforms. It defines signals as functions of time or space and systems as maps that manipulate signals. Transforms represent signals in different domains like frequency to simplify operations.
2) Signals can be represented in the frequency domain using Fourier transforms. This makes operations like filtering easier. Low frequencies represent overall shape while high frequencies are details like noise or edges.
3) Linear and time-invariant systems can be characterized by their impulse response. The output is the convolution of the input and impulse response. Convolution is a mechanism that shapes signals to produce outputs.
This document discusses the discrete Fourier transform (DFT) and fast Fourier transform (FFT). It begins by contrasting the frequency and time domains. It then defines the DFT, showing how it samples the discrete-time Fourier transform (DTFT) at discrete frequency points. It provides an example 4-point DFT calculation. It discusses the computational complexity of the direct DFT algorithm and how the FFT reduces this to O(N log N) by decomposing the DFT into smaller transforms. It explains the decimation-in-time FFT algorithm using butterfly operations across multiple stages. Finally, it notes that the inverse FFT can be computed using the FFT along with conjugation and scaling steps.
The document summarizes key concepts about the Fast Fourier Transform (FFT). The FFT converts discrete time domain data into its frequency spectrum components. It breaks down a signal into its constituent frequencies. The document explains key FFT terms like sampling rate, fundamental period, Nyquist frequency, and Euler's formula. It then works through an example of applying the FFT to a sampled sine wave to demonstrate how it extracts the wave's 10Hz frequency component.
This document summarizes key concepts in digital and analog communications:
1) It defines source coding, channel encoding/decoding, digital modulation/demodulation, and how digital communication system performance is measured in terms of error probability.
2) Thermal noise in receivers is identified as the dominant source of noise limiting performance in VHF and UHF bands.
3) Storing data on magnetic/optical disks is analogous to transmitting a signal over a radio channel, with similar signal processing used for recovery.
4) Digital processing avoids signal degradation but requires more bandwidth, while analog processing is sensitive to variations but does not lose quality over time.
5) Fourier analysis is used to derive the
This document discusses Fourier series and related concepts. It provides definitions and formulas for general Fourier series, Fourier series for discontinuous functions, the change of interval method, Fourier series for even and odd functions, and half range Fourier cosine and sine series. Examples of applications of these Fourier series concepts and techniques are also presented.
This document discusses Laplace transforms and their application to solving differential equations. It defines the Laplace transform, provides examples of common transform pairs, and lists several properties that allow transforms to be manipulated algebraically. The document states that Laplace transforms can convert differential equations into algebraic equations in the frequency domain, making them easier to solve. The transform method involves taking the Laplace transform of the differential equation, solving for the unknown variable, and taking the inverse Laplace transform to obtain the time domain solution.
- The document discusses linear time-invariant (LTI) systems and their representations in the time domain.
- It covers various properties of LTI systems including parallel and cascade connections, causality, stability, and memory.
- Methods for representing LTI systems using impulse responses, differential/difference equations, and step responses are presented.
- Solving techniques for determining the homogeneous and particular solutions of LTI systems described by differential or difference equations are outlined.
A signal is a pattern of variation that carry information.
Signals are represented mathematically as a function of one or more independent variable
basic concept of signals
types of signals
system concepts
Signal Processing Introduction using Fourier TransformsArvind Devaraj
1) The document introduces signal processing by discussing signals, systems, and transforms. It defines signals as functions of time or space and systems as maps that manipulate signals. Transforms represent signals in different domains like frequency to simplify operations.
2) Signals can be represented in the frequency domain using Fourier transforms. This makes operations like filtering easier. Low frequencies represent overall shape while high frequencies are details like noise or edges.
3) Linear and time-invariant systems can be characterized by their impulse response. The output is the convolution of the input and impulse response. Convolution is a mechanism that shapes signals to produce outputs.
This document discusses the discrete Fourier transform (DFT) and fast Fourier transform (FFT). It begins by contrasting the frequency and time domains. It then defines the DFT, showing how it samples the discrete-time Fourier transform (DTFT) at discrete frequency points. It provides an example 4-point DFT calculation. It discusses the computational complexity of the direct DFT algorithm and how the FFT reduces this to O(N log N) by decomposing the DFT into smaller transforms. It explains the decimation-in-time FFT algorithm using butterfly operations across multiple stages. Finally, it notes that the inverse FFT can be computed using the FFT along with conjugation and scaling steps.
The document summarizes key concepts about the Fast Fourier Transform (FFT). The FFT converts discrete time domain data into its frequency spectrum components. It breaks down a signal into its constituent frequencies. The document explains key FFT terms like sampling rate, fundamental period, Nyquist frequency, and Euler's formula. It then works through an example of applying the FFT to a sampled sine wave to demonstrate how it extracts the wave's 10Hz frequency component.
This document summarizes key concepts in digital and analog communications:
1) It defines source coding, channel encoding/decoding, digital modulation/demodulation, and how digital communication system performance is measured in terms of error probability.
2) Thermal noise in receivers is identified as the dominant source of noise limiting performance in VHF and UHF bands.
3) Storing data on magnetic/optical disks is analogous to transmitting a signal over a radio channel, with similar signal processing used for recovery.
4) Digital processing avoids signal degradation but requires more bandwidth, while analog processing is sensitive to variations but does not lose quality over time.
5) Fourier analysis is used to derive the
This document discusses Fourier series and related concepts. It provides definitions and formulas for general Fourier series, Fourier series for discontinuous functions, the change of interval method, Fourier series for even and odd functions, and half range Fourier cosine and sine series. Examples of applications of these Fourier series concepts and techniques are also presented.
This document discusses Laplace transforms and their application to solving differential equations. It defines the Laplace transform, provides examples of common transform pairs, and lists several properties that allow transforms to be manipulated algebraically. The document states that Laplace transforms can convert differential equations into algebraic equations in the frequency domain, making them easier to solve. The transform method involves taking the Laplace transform of the differential equation, solving for the unknown variable, and taking the inverse Laplace transform to obtain the time domain solution.
- The document discusses linear time-invariant (LTI) systems and their representations in the time domain.
- It covers various properties of LTI systems including parallel and cascade connections, causality, stability, and memory.
- Methods for representing LTI systems using impulse responses, differential/difference equations, and step responses are presented.
- Solving techniques for determining the homogeneous and particular solutions of LTI systems described by differential or difference equations are outlined.
A signal is a pattern of variation that carry information.
Signals are represented mathematically as a function of one or more independent variable
basic concept of signals
types of signals
system concepts
The document defines complex frequency as a type of frequency that depends on two parameters: σ, which controls the magnitude of the signal, and w, which controls the rotation. It presents the equation for a complex exponential signal and defines the terms. It then analyzes three cases of complex frequency: 1) when w = 0 and σ varies, 2) when σ = 0 and w varies, and 3) when both σ and w have values. The response of a circuit to various input signals is also analyzed using the complex frequency concept.
The document discusses the Fast Fourier Transform (FFT) algorithm. It begins by explaining how the Discrete Fourier Transform (DFT) and its inverse can be computed on a digital computer, but require O(N2) operations for an N-point sequence. The FFT was discovered to reduce this complexity to O(NlogN) operations by exploiting redundancy in the DFT calculation. It achieves this through a recursive decomposition of the DFT into smaller DFT problems. The FFT provides a significant speedup and enables practical spectral analysis of long signals.
This document provides an overview of discrete-time signals and systems in digital signal processing (DSP). It discusses key concepts such as:
1) Discrete-time signals which are represented by sequences of numbers and how common signals like impulses and steps are represented.
2) Discrete-time systems which take a discrete-time signal as input and produce an output signal through a mathematical algorithm, with the impulse response characterizing the system.
3) Important properties of linear time-invariant (LTI) systems including superposition, time-shifting of inputs and outputs, and representation using convolution sums or difference equations.
This document contains tables summarizing key properties and formulas related to signals and systems. Table 1 summarizes properties of the continuous-time Fourier series for periodic signals. Table 2 does the same for the discrete-time Fourier series. Tables 3 and 5 cover properties of the continuous-time and discrete-time Fourier transforms, respectively, for aperiodic signals. Table 4 lists common Fourier transform pairs. The document provides a concise reference of essential information on signal processing techniques.
The document discusses the chain rule and Euler's theorem.
It explains the chain rule for functions of single, multiple, and general variables. The chain rule gives rules for finding the derivative of a composite function.
It also explains that if a function is homogeneous of degree k, its partial derivatives will be homogeneous of degree k-1. Euler's theorem relates the values of a homogeneous function to the values of its partial derivatives. The theorem is extended to functions of multiple variables.
This document outlines the course details for a digital signal processing course. The main goal of the course is to design digital linear time-invariant filters that are widely used in applications such as audio, communications, radar, and biomedical engineering. Topics that will be covered include sampling of continuous-time signals, discrete-time signals and systems, the z-transform, filter design techniques, discrete Fourier transforms, and applications of digital signal processing. Students will be evaluated based on midterm and final exams, quizzes, assignments, and a project.
This document discusses the continuous-time Fourier transform. It begins by developing the Fourier transform representation of aperiodic signals as the limit of Fourier series coefficients as the period increases. It then defines the Fourier transform pairs and discusses properties like convergence. Several examples of calculating the Fourier transform of common signals like exponentials, pulses and periodic signals are provided. Key concepts like the sinc function are also introduced.
DSP_2018_FOEHU - Lec 08 - The Discrete Fourier TransformAmr E. Mohamed
The document provides an overview of the Discrete Fourier Transform (DFT). It begins by discussing limitations of the discrete-time Fourier transform (DTFT) and z-transform in that they are defined for infinite sequences and continuous variables. The DFT avoids these issues by being a numerically computable transform for finite discrete-time signals. It works by taking a finite signal, making it periodic, and computing its discrete Fourier transform which is a discrete frequency spectrum. This makes the DFT highly suitable for digital signal processing. The document then provides details on computation of the DFT and its relationship to the DTFT and z-transform.
The document discusses the Z-transform, which is a tool for analyzing and solving linear time-invariant difference equations. It defines the Z-transform, provides examples of common sequences and their corresponding Z-transforms, and discusses properties such as the region of convergence. Key topics covered include the difference between difference and differential equations, properties of linear time-invariant systems, and mapping between the s-plane and z-plane.
This document discusses the decimation-in-time (DIT) algorithm for computing the discrete Fourier transform (DFT) in a more efficient manner than directly calculating all N points. DIT works by splitting the input sequence into smaller sequences, computing smaller DFTs, and recombining the results. Specifically, it separates the input into even and odd samples, computes partial DFTs on each, and combines them using a "butterfly" structure. This structure implements each step of the algorithm with one multiplication, reducing the complexity from N^2 operations to N^2/2 + N operations. The document provides an example of an 8-point DFT computed using the DIT algorithm and butterfly structure.
DSP_FOEHU - Lec 02 - Frequency Domain Analysis of Signals and SystemsAmr E. Mohamed
This document describes a linear system and the convolution integral used to represent it. It defines the convolution integral and shows that a linear system can be represented as the convolution of the input function with the impulse response function. It then provides examples of calculating the output of a linear system using the convolution integral.
The document discusses convolution, which is a mathematical operation used in signal and image processing. Convolution provides a way to multiply two arrays of numbers to produce a third array. It defines convolution as an integral that calculates the output of a linear time-invariant system by integrating the product of the input and impulse response functions. The key properties of convolution are that it is commutative, distributive, and associative. Examples are provided to demonstrate calculating the convolution of different signals.
This document discusses digital data transmission and its components. It begins by comparing analog and digital signals, with digital signals taking on discrete values. The main components of a digital communication system are described as sampling, quantization, encoding, and decoding. Different coding techniques like ASK, PSK, and FSK are explained. The document also covers topics like baseband data transmission, receiver structure, probability of error analysis, and performance metrics for digital communication systems.
This document outlines the course contents for a Digital Signal Processing course taught by Dr. Somchai Jitapunkul. The course covers topics including discrete-time signals and systems, sampling, the z-transform, Fourier analysis, filter design techniques, and applications of digital signal processing. Exams include a final and design project. Recommended textbooks and references are provided. Application areas like communications, audio, image processing, and biomedical are briefly described.
DSP_FOEHU - Lec 08 - The Discrete Fourier TransformAmr E. Mohamed
The document discusses the Discrete Fourier Transform (DFT). It explains that while the discrete-time Fourier transform (DTFT) and z-transform are not numerically computable, the DFT avoids this issue. The DFT represents periodic sequences as a sum of complex exponentials with frequencies that are integer multiples of the fundamental frequency. It can be viewed as computing samples of the DTFT or z-transform at discrete frequency points, allowing numerical computation. The DFT provides a link between the time and frequency domain representations of a finite-length sequence.
Reference for z and inverse z transformabayteshome1
The z-transform is an important tool for analyzing digital systems and digital signal processing. It allows the design of digital filters and frequency analysis of digital signals. The z-transform represents a discrete-time signal as a function of a complex variable z. It is defined as the summation of the signal multiplied by z to the power of n from negative infinity to positive infinity. The values of z that satisfy the convergence of this summation form the region of convergence. The z-transform has properties of linearity, shift, and convolution that allow transforming difference equations into algebraic equations that can be solved. The inverse z-transform is used to obtain the original discrete-time signal from its z-transform.
This document provides an introduction to two-port networks. It defines the standard configuration of a two-port network with two ports, an input and an output. It then describes various two-port parameter sets - including Z, Y, transmission, and hybrid parameters - and provides examples of calculating the parameters for simple resistive networks. It also demonstrates how the parameters change when elements are added outside the two ports of the original network.
This doctoral thesis models pulse propagation in optical fibers using finite-difference methods. It summarizes the numerical model, which solves the nonlinear Schrödinger equation describing pulse propagation using Crank-Nicholson and split-step Fourier methods. It tests the model's accuracy by comparing results to analytic solutions and a commercial simulation program. Effects like dispersion, loss, self-phase modulation and polarization mode dispersion are modeled. Additional models are presented for optical amplifiers and filters used in the fiber links.
This document provides a summary of common mathematical and calculus formulas:
1) It lists many basic mathematical formulas such as logarithmic, exponential, trigonometric, and algebraic formulas.
2) It also presents various differentiation formulas including the chain rule, product rule, quotient rule, and formulas for deriving trigonometric, exponential, and logarithmic functions.
3) Integration formulas and theorems are covered including integration by parts, substitutions, and the Fundamental Theorem of Calculus.
The document defines complex frequency as a type of frequency that depends on two parameters: σ, which controls the magnitude of the signal, and w, which controls the rotation. It presents the equation for a complex exponential signal and defines the terms. It then analyzes three cases of complex frequency: 1) when w = 0 and σ varies, 2) when σ = 0 and w varies, and 3) when both σ and w have values. The response of a circuit to various input signals is also analyzed using the complex frequency concept.
The document discusses the Fast Fourier Transform (FFT) algorithm. It begins by explaining how the Discrete Fourier Transform (DFT) and its inverse can be computed on a digital computer, but require O(N2) operations for an N-point sequence. The FFT was discovered to reduce this complexity to O(NlogN) operations by exploiting redundancy in the DFT calculation. It achieves this through a recursive decomposition of the DFT into smaller DFT problems. The FFT provides a significant speedup and enables practical spectral analysis of long signals.
This document provides an overview of discrete-time signals and systems in digital signal processing (DSP). It discusses key concepts such as:
1) Discrete-time signals which are represented by sequences of numbers and how common signals like impulses and steps are represented.
2) Discrete-time systems which take a discrete-time signal as input and produce an output signal through a mathematical algorithm, with the impulse response characterizing the system.
3) Important properties of linear time-invariant (LTI) systems including superposition, time-shifting of inputs and outputs, and representation using convolution sums or difference equations.
This document contains tables summarizing key properties and formulas related to signals and systems. Table 1 summarizes properties of the continuous-time Fourier series for periodic signals. Table 2 does the same for the discrete-time Fourier series. Tables 3 and 5 cover properties of the continuous-time and discrete-time Fourier transforms, respectively, for aperiodic signals. Table 4 lists common Fourier transform pairs. The document provides a concise reference of essential information on signal processing techniques.
The document discusses the chain rule and Euler's theorem.
It explains the chain rule for functions of single, multiple, and general variables. The chain rule gives rules for finding the derivative of a composite function.
It also explains that if a function is homogeneous of degree k, its partial derivatives will be homogeneous of degree k-1. Euler's theorem relates the values of a homogeneous function to the values of its partial derivatives. The theorem is extended to functions of multiple variables.
This document outlines the course details for a digital signal processing course. The main goal of the course is to design digital linear time-invariant filters that are widely used in applications such as audio, communications, radar, and biomedical engineering. Topics that will be covered include sampling of continuous-time signals, discrete-time signals and systems, the z-transform, filter design techniques, discrete Fourier transforms, and applications of digital signal processing. Students will be evaluated based on midterm and final exams, quizzes, assignments, and a project.
This document discusses the continuous-time Fourier transform. It begins by developing the Fourier transform representation of aperiodic signals as the limit of Fourier series coefficients as the period increases. It then defines the Fourier transform pairs and discusses properties like convergence. Several examples of calculating the Fourier transform of common signals like exponentials, pulses and periodic signals are provided. Key concepts like the sinc function are also introduced.
DSP_2018_FOEHU - Lec 08 - The Discrete Fourier TransformAmr E. Mohamed
The document provides an overview of the Discrete Fourier Transform (DFT). It begins by discussing limitations of the discrete-time Fourier transform (DTFT) and z-transform in that they are defined for infinite sequences and continuous variables. The DFT avoids these issues by being a numerically computable transform for finite discrete-time signals. It works by taking a finite signal, making it periodic, and computing its discrete Fourier transform which is a discrete frequency spectrum. This makes the DFT highly suitable for digital signal processing. The document then provides details on computation of the DFT and its relationship to the DTFT and z-transform.
The document discusses the Z-transform, which is a tool for analyzing and solving linear time-invariant difference equations. It defines the Z-transform, provides examples of common sequences and their corresponding Z-transforms, and discusses properties such as the region of convergence. Key topics covered include the difference between difference and differential equations, properties of linear time-invariant systems, and mapping between the s-plane and z-plane.
This document discusses the decimation-in-time (DIT) algorithm for computing the discrete Fourier transform (DFT) in a more efficient manner than directly calculating all N points. DIT works by splitting the input sequence into smaller sequences, computing smaller DFTs, and recombining the results. Specifically, it separates the input into even and odd samples, computes partial DFTs on each, and combines them using a "butterfly" structure. This structure implements each step of the algorithm with one multiplication, reducing the complexity from N^2 operations to N^2/2 + N operations. The document provides an example of an 8-point DFT computed using the DIT algorithm and butterfly structure.
DSP_FOEHU - Lec 02 - Frequency Domain Analysis of Signals and SystemsAmr E. Mohamed
This document describes a linear system and the convolution integral used to represent it. It defines the convolution integral and shows that a linear system can be represented as the convolution of the input function with the impulse response function. It then provides examples of calculating the output of a linear system using the convolution integral.
The document discusses convolution, which is a mathematical operation used in signal and image processing. Convolution provides a way to multiply two arrays of numbers to produce a third array. It defines convolution as an integral that calculates the output of a linear time-invariant system by integrating the product of the input and impulse response functions. The key properties of convolution are that it is commutative, distributive, and associative. Examples are provided to demonstrate calculating the convolution of different signals.
This document discusses digital data transmission and its components. It begins by comparing analog and digital signals, with digital signals taking on discrete values. The main components of a digital communication system are described as sampling, quantization, encoding, and decoding. Different coding techniques like ASK, PSK, and FSK are explained. The document also covers topics like baseband data transmission, receiver structure, probability of error analysis, and performance metrics for digital communication systems.
This document outlines the course contents for a Digital Signal Processing course taught by Dr. Somchai Jitapunkul. The course covers topics including discrete-time signals and systems, sampling, the z-transform, Fourier analysis, filter design techniques, and applications of digital signal processing. Exams include a final and design project. Recommended textbooks and references are provided. Application areas like communications, audio, image processing, and biomedical are briefly described.
DSP_FOEHU - Lec 08 - The Discrete Fourier TransformAmr E. Mohamed
The document discusses the Discrete Fourier Transform (DFT). It explains that while the discrete-time Fourier transform (DTFT) and z-transform are not numerically computable, the DFT avoids this issue. The DFT represents periodic sequences as a sum of complex exponentials with frequencies that are integer multiples of the fundamental frequency. It can be viewed as computing samples of the DTFT or z-transform at discrete frequency points, allowing numerical computation. The DFT provides a link between the time and frequency domain representations of a finite-length sequence.
Reference for z and inverse z transformabayteshome1
The z-transform is an important tool for analyzing digital systems and digital signal processing. It allows the design of digital filters and frequency analysis of digital signals. The z-transform represents a discrete-time signal as a function of a complex variable z. It is defined as the summation of the signal multiplied by z to the power of n from negative infinity to positive infinity. The values of z that satisfy the convergence of this summation form the region of convergence. The z-transform has properties of linearity, shift, and convolution that allow transforming difference equations into algebraic equations that can be solved. The inverse z-transform is used to obtain the original discrete-time signal from its z-transform.
This document provides an introduction to two-port networks. It defines the standard configuration of a two-port network with two ports, an input and an output. It then describes various two-port parameter sets - including Z, Y, transmission, and hybrid parameters - and provides examples of calculating the parameters for simple resistive networks. It also demonstrates how the parameters change when elements are added outside the two ports of the original network.
This doctoral thesis models pulse propagation in optical fibers using finite-difference methods. It summarizes the numerical model, which solves the nonlinear Schrödinger equation describing pulse propagation using Crank-Nicholson and split-step Fourier methods. It tests the model's accuracy by comparing results to analytic solutions and a commercial simulation program. Effects like dispersion, loss, self-phase modulation and polarization mode dispersion are modeled. Additional models are presented for optical amplifiers and filters used in the fiber links.
This document provides a summary of common mathematical and calculus formulas:
1) It lists many basic mathematical formulas such as logarithmic, exponential, trigonometric, and algebraic formulas.
2) It also presents various differentiation formulas including the chain rule, product rule, quotient rule, and formulas for deriving trigonometric, exponential, and logarithmic functions.
3) Integration formulas and theorems are covered including integration by parts, substitutions, and the Fundamental Theorem of Calculus.
This document provides formulas and definitions for calculus, including derivatives, integrals, exponents, logarithms, trigonometric functions and identities, hyperbolic functions, and other mathematical concepts. It includes over 50 formulas and definitions summarized across two pages with accompanying graphs.
Formulario de Calculo Diferencial-IntegralErick Chevez
This document provides a 3-sentence summary of the key information:
The document is a formula sheet for calculus that includes definitions and formulas for derivatives, integrals, logarithms, exponents, trigonometric functions and their inverses, hyperbolic functions, and other calculus topics. It also contains 5 graphs illustrating trigonometric, inverse trigonometric, and hyperbolic functions. The document is in Spanish and provides contact information for the author as well as links to related websites.
This document provides formulas and definitions for calculus, including:
- Derivatives and integrals of basic functions
- Exponent rules
- Logarithm rules
- Trigonometric functions and their inverses
- Trigonometric identities
- Hyperbolic functions and their inverses
- Graphs of trigonometric and hyperbolic functions
This document provides formulas and definitions for calculus, including derivatives, integrals, exponents, logarithms, trigonometric functions, and hyperbolic functions. It includes formulas for derivatives of sums, products, quotients, and compositions of functions. It also includes trigonometric identities, graphs of trigonometric functions, and definitions of inverse trigonometric functions and hyperbolic functions.
(1) The document discusses two approaches to solving ordinary differential equations (ODEs) that model linear time-invariant (LTI) systems: (1) solve the ODE directly or (2) determine the zero-input response (ZIR) and zero-state response (ZSR).
(2) It provides an example of using these approaches to analyze an RLC circuit with a voltage input of 10e-3tu(t).
(3) The nature of the response of a second-order system depends on the damping ratio, and can be overdamped, critically damped, or underdamped.
This document discusses the discrete Fourier transform (DFT) and its inverse, the inverse discrete Fourier transform (IDFT). It defines the DFT and IDFT formulas, introduces twiddle factors, and shows how to represent DFTs and IDFTs using matrices. Examples are provided to calculate DFTs and IDFTs both directly from the definition and using matrix representations.
The document discusses a website that provides free solutions manuals and solucionarios for many university textbooks. It contains solved problems and step-by-step explanations to help students understand difficult concepts. Visitors can download the materials for free to help them study engineering, science and other subjects. The solutions manuals cover topics like signals, noise and electrical communication and contain the solutions to all the problems in the corresponding textbooks.
This document is a solutions manual for a textbook on communication systems. It provides step-by-step solutions to problems from each chapter of the textbook. The problems cover topics such as signal representations using Fourier series and integrals, power calculations for periodic signals, and bandpass signal representations. The solutions demonstrate techniques for analyzing and working with signals commonly encountered in electrical communication systems.
The document presents mathematical analysis of the Birch and Swinnerton-Dyer conjecture using power series. It derives formulas for the coefficients of the power series involving the sums and derivatives of the coefficients. It then applies these formulas and the Legendre polynomial to obtain an equation relating the coefficients to the value of the parameter λ.
- The document discusses representation of stochastic processes in real and spectral domains and Monte Carlo sampling.
- Stochastic processes can be represented in the real (time or space) domain using autocorrelation and variogram functions, and in the spectral domain using power spectral density functions.
- Monte Carlo sampling uses techniques to generate random numbers from a probability density function for random sampling.
4 matched filters and ambiguity functions for radar signals-2Solo Hermelin
Matched filters (Part 2of 2) maximizes the output signal-to-noise ratio for a known radar signal at a predefined time.
For comments please contact me at solo.hermelin@gmail.com.
For more presentations on different subjects visit my website at http://www.solohermelin.com.
The document discusses the discrete Fourier transform (DFT) and its application to signals with different numbers of points. It provides the equations to calculate the DFT of 2-point, 4-point and 8-point signals. For a 4-point signal x(n) with points x(0), x(1), x(2), x(3), it shows the calculation of the DFT X(k) at points X(0), X(1), X(2), X(3).
The document provides solutions to problems from a discrete-time signal processing textbook. It includes:
1) Solutions to convolution problems graphically representing signals and their convolution.
2) Derivations of impulse responses from difference equations and system functions using the z-transform.
3) Analyses of signals as eigenfunctions of linear time-invariant systems.
The document provides solutions to problems from a discrete-time signal processing textbook. It includes:
1) Solutions to convolution problems graphically representing signals and their convolution.
2) Derivations of impulse responses from system functions using the z-transform.
3) Analyses of signals as eigenfunctions and determining if systems are linear and time-invariant.
4) Solutions involving filtering, modulation, and determining system properties from inputs and outputs.
The document provides solutions to problems from a discrete-time signal processing textbook. It includes:
1) Solutions to convolution problems graphically representing signals and their convolution.
2) Derivations of impulse responses from system functions using the z-transform.
3) Analyses of signals as eigenfunctions and determining if systems are linear and time-invariant.
4) Solutions involving filtering, modulation, and determining system properties from input-output relations.
1. The document discusses transmission lines and their characteristics including different types of transmission lines, distributed circuit models, transmission line equations, and phasor analysis.
2. It also covers topics such as impedance matching, transmission line parameters, wavelength, wave velocity, and signal propagation on transmission lines.
3. Examples of wavelength and wave velocity for different materials at frequencies of 1 GHz and 10 GHz are provided.
We have implemented a multiple precision ODE solver based on high-order fully implicit Runge-Kutta(IRK) methods. This ODE solver uses any order Gauss type formulas, and can be accelerated by using (1) MPFR as multiple precision floating-point arithmetic library, (2) real tridiagonalization supported in SPARK3, of linear equations to be solved in simplified Newton method as inner iteration, (3) mixed precision iterative refinement method\cite{mixed_prec_iterative_ref}, (4) parallelization with OpenMP, and (5) embedded formulas for IRK methods. In this talk, we describe the reason why we adopt such accelerations, and show the efficiency of the ODE solver through numerical experiments such as Kuramoto-Sivashinsky equation.
This document contains important derivatives formulas for bachelor level mathematics. It includes the derivatives of common functions like sin, cos, tan, coth, and expressions involving constants, logarithms, and exponential functions. It also includes the derivatives of composite functions, Leibniz's theorem for computing derivatives of products, and taking higher order derivatives. The document was created by Atiq ur Rehman and is available online at http://www.mathcity.org.
Walmart Business+ and Spark Good for Nonprofits.pdfTechSoup
"Learn about all the ways Walmart supports nonprofit organizations.
You will hear from Liz Willett, the Head of Nonprofits, and hear about what Walmart is doing to help nonprofits, including Walmart Business and Spark Good. Walmart Business+ is a new offer for nonprofits that offers discounts and also streamlines nonprofits order and expense tracking, saving time and money.
The webinar may also give some examples on how nonprofits can best leverage Walmart Business+.
The event will cover the following::
Walmart Business + (https://business.walmart.com/plus) is a new shopping experience for nonprofits, schools, and local business customers that connects an exclusive online shopping experience to stores. Benefits include free delivery and shipping, a 'Spend Analytics” feature, special discounts, deals and tax-exempt shopping.
Special TechSoup offer for a free 180 days membership, and up to $150 in discounts on eligible orders.
Spark Good (walmart.com/sparkgood) is a charitable platform that enables nonprofits to receive donations directly from customers and associates.
Answers about how you can do more with Walmart!"
The chapter Lifelines of National Economy in Class 10 Geography focuses on the various modes of transportation and communication that play a vital role in the economic development of a country. These lifelines are crucial for the movement of goods, services, and people, thereby connecting different regions and promoting economic activities.
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptxEduSkills OECD
Iván Bornacelly, Policy Analyst at the OECD Centre for Skills, OECD, presents at the webinar 'Tackling job market gaps with a skills-first approach' on 12 June 2024
A Visual Guide to 1 Samuel | A Tale of Two HeartsSteve Thomason
These slides walk through the story of 1 Samuel. Samuel is the last judge of Israel. The people reject God and want a king. Saul is anointed as the first king, but he is not a good king. David, the shepherd boy is anointed and Saul is envious of him. David shows honor while Saul continues to self destruct.
Level 3 NCEA - NZ: A Nation In the Making 1872 - 1900 SML.pptHenry Hollis
The History of NZ 1870-1900.
Making of a Nation.
From the NZ Wars to Liberals,
Richard Seddon, George Grey,
Social Laboratory, New Zealand,
Confiscations, Kotahitanga, Kingitanga, Parliament, Suffrage, Repudiation, Economic Change, Agriculture, Gold Mining, Timber, Flax, Sheep, Dairying,
Chapter wise All Notes of First year Basic Civil Engineering.pptxDenish Jangid
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
2. Objectives
• The students understand the concepts of:
– Discrete-time signals and systems
– Linear Time-Invariant Systems
– Convolution– Convolution
DSP2-2
3. Signals
• Signals are the patterns of physical
representation.
• Signals can be represented mathematically as
a function of one or more independenta function of one or more independent
variables, e.g., Time t or Sequence n.
• Signals can be 1-D or 2-D.
3
15. Sampling
• We get the digital signal by sampling
tt
( )x t t nT
• The result is x(n):
( )x t ( )x n
( ) ( ) t nT
x n x t
...
1
s
T
f
tt
DSP2-15
16. Discrete-time “x(n)” = Sampling “s(n)” x Analogue “x(t)”
Discrete-time signals obtained by
Sampling
tt
( )x t
( )x n
• S(n) is composed of delayed Impulses
nnTT
tt
nn
( )x n( )s n
1
DSP2-16
17. An Impulse is Delta Function
11
( ) ( ) t nT
n t
• The definition of impulse is
nn00
1, 0
( )
0, 0
n
n
n
DSP2-17
18. Delayed Delta Functions
• The unit delayed delta function
11Non-delayed impulse
( )n
nn00
nn
11
The unit-delayed impulse
( 1)n
( )n
11
00 11
DSP2-18
19. Summing of Delayed Delta Functions
• Sampling signal can be derived as a sum of
delayed impulses. For example, for N=3
( ) ( ) ( 1) ( 2) ( 3)s n n n n n
• Or
3
0
( ) ( )
k
s n n k
DSP2-19
20. Summing of Delayed Delta Functions
( )n
( 1)n
( 2 )n
++
++
nn
nn
nn
++
++
== ( 2 )n
( 3)n
++
nn
nn
11 22 33
++
==
00
nn
( ) ( 1) ( 2) ( 3)n n n n
DSP2-20
21. Summing of Delayed Delta Functions
with Sampling interval T
( )t
( )t T
( 2 )n T
++
++
tt
tt
tt
++
++
== ( 2 )n T
( 3 )n T
++
tt
tt
TT 22TT 33TT
++
==
00
tt
( ) ( ) ( 2 ) ( 3 )t t T n T n T
DSP2-21
23. Converting Continuous-time to
Discrete-time
• From
• Let x(t)=x(kT) :
( ) ( ) ( )
k
x t t kT x nT
( ) ( ) ( )x kT t kT x nT
• Move x(kT)
Inside the sum:
( ) ( ) ( )
k
x kT t kT x nT
( ) ( ) ( )
k
x kT t kT x nT
DSP2-23
25. Convert to a sequence
• We can drop the sampling interval T by to
make a sequence x(n)
( ) ( )x nT x n
DSP2-25
nn
( )x n
tt
( )x nT
T is normalised
26. Discrete-time Signal x(n) from x(n)
1
( )x n ( )x n( )s n
=
( ) ( ) ( )
k
x k n k x n
nnnn nn
DSP2-26
=
27. Discrete-Time Systems
• x(n) is the input of the system T
T( )x n ( )y n
• x(n) is the input of the system T
• y(n) is the output of the system T
• T is the system and is characterised by its impulse
response.
DSP2-27
28. Example 2.0: y(n) = x(n)
(0) (0)y x(0) (0)
(1) (1)
(2) (2)
(10) (10)
y x
y x
y x
y x
DSP2-28
29. Example 2.1: System 1
• Example 2.2.1
• Determine y(n) when
, 3 3
( )
0, otherwise
n n
x n
) ( ) ( )A y n x n
) ( ) ( )
) ( ) ( 1)
) ( ) ( 1)
1
) ( ) ( 1) ( ) ( 1)
3
) ( ) max ( 1), ( ), ( 1)
) ( ) ( )
n
k
A y n x n
B y n x n
C y n x n
D y n x n x n x n
E y n x n x n x n
F y n x k
DSP2-29
30. Example 2.1: System
) ( ) ( )A y n x n
( ) ( ) ,3,2,1,0,1,2,3,y n x n
• Note: the symbol refers to the position
when n=0.
DSP2-30
( ) ( ) ,3,2,1,0,1,2,3,y n x n
31. Example 2.1: System
) ( ) ( 1)B y n x n
( ) ,3, 2,1,0,1, 2,3,y n ( ) ,3, 2,1,0,1, 2,3,y n
DSP2-31
32. Example 2.1: System
) ( ) ( 1)C y n x n
( ) ,3, 2,1,0,1, 2,3,y n ( ) ,3, 2,1,0,1, 2,3,y n
DSP2-32
33. Example 2.1: System
1
) ( ) ( 1) ( ) ( 1)
3
D y n x n x n x n
1 1 2
0, (0) ( 1) (0) (1) 1 0 1
3 3 3
n y x x x
3 3 3
2
( ) {...,4,3,2,1, ,1,2,3,4,...}
3
y n
DSP2-33
34. Example 2.1: System
) ( ) max ( 1), ( ), ( 1)E y n x n x n x n
( ) {...,4,3,2,1,2,3,4,...}y n ( ) {...,4,3,2,1,2,3,4,...}y n
DSP2-34
35. Example 2.1 : System
•
• Accumulator
) ( ) ( )
n
k
F y n x k
( ) ,3,5,6,6,7,9,12,0,...y n
DSP2-35
45. Relationship between the unit step
function and the Delta function
• Define u(n)
( ) ( ) ( 1) ( 2) ( 3)
( )
u n n n n n
n k
Or
0
( )
k
n k
( ) ( )
n
k
u n k
DSP2-45
46. Example 4
• Let x(n) be
• Determine ) ( ) ( )
) ( 1) ( )
) ( 1) (2 )
) ( 1) ( 1 )
a x n u n
b x n u n
c x n u n
d x n u n
DSP2-46
57. Systems
• A system is any process that produces an
output signal in response to an input signal.
• Systems are can also be represented
mathematically as a function of one or moremathematically as a function of one or more
independent variables, e.g., Time t or
Sequence n.
57
58. An Electric Circuit System
• System of a simple RC circuit.
vc(t)
=Signal
System
vc(t)
= Signal
58
59. Model of Simple RC Circuit
• Using Kirchoff’s Voltage Law (KVL)
( ) ( ) ( )
( ) ( ) ( )
R c s
c s
v t v t v t
Ri t v t v t
( ) ( ) ( )
( ( )) ( ) ( )
c s
c c s
Ri t v t v t
d
R C v t v t v t
dt
1 1
( ) ( ) ( )c c s
d
v t v t v t
dt RC RC
59
60. Linear Constant-Coefficient Differential
Equation (LCCDE)
• Linear Constant-Coefficient Differential
Equation (LCCDE)
( ) ( )k kN M
k kk k
d y t d x t
a b
dt dt
• For 1st order:
• or: 1 1
( ) ( ) ( )c c s
d
v t v t v t
dt RC RC
0 0
k kk k
k kdt dt
1 0 0( ) ( ) ( )
d
a y t a y t b x t
dt
60
61. System Model of A Car
Zhou, Hui & Qiu, Yi. (2015). A simple mathematical model of a vehicle with seat and occupant for studying the effect of vehicle dynamic parameters on ride comfort.
61
62. System Model of A Heart
Yalcinkaya, Fikret & Kizilkaplan, Ertem & Erbas, Ali. (2013). Mathematical modelling of human heart as a hydroelectromechanical system. ELECO 2013 - 8th International Conference on Electrical
and Electronics Engineering. 362-366. 10.1109/ELECO.2013.6713862.
62
63. Linear Time-invariant (LTI) Systems
• A discrete-time system T[ ] can either be
– Linear or Non-linear
– Time-invariant or Time-varying
• We prefer systems that are Linear and Time-
invariant.
( )x n
( ) [ ( )]y n T x n
T
DSP2-63
64. Linear Systems
• For a system to be linear,
T1 1 2 2( ) ( ) ( )x n a x n a x n
1 1 2 2
1 1 2 2
( ) ( ) ( )
[ ( )] [ ( )]
y n a y n a y n
a T x n a T x n
DSP2-64
1 1 2 2 1 1 2 2[ ( ) ( )] [ ( )] [ ( )]T a x n a x n a T x n a T x n
T1 1 2 2( ) ( ) ( )x n a x n a x n
65. How to test linearity: Full Test
DSP2-65
1 1 2 2 1 1 2 2[ ( ) ( )] [ ( )] [ ( )]T a x n a x n a T x n a T x n Linear
66. How to test linearity: Simplified (Drop
all constants)
DSP2-66
Linear 1 2 1 2[ ( ) ( )] [ ( )] [ ( )]T x n x n T x n T x n
67. Example 2.2
• Determine whether the systems are linear or
non-linear.
2
) ( ) ( )
) ( ) ( )
A y n nx n
B y n x n
2
2
( )
) ( ) ( )
) ( ) ( )
) ( ) ( )
) ( ) x n
B y n x n
C y n x n
D y n Ax n B
E y n e
DSP2-67
68. Example 2.2: A)
) ( ) ( )A y n nx n
1 2[ ( ) ( )]
( ) ( )
n x n x n
nx n nx n
1 2( ) ( )nx n nx n
DSP2-68
1 2( ) ( )nx n nx n
Linear
69. Example 2.2: B)
2
) ( ) ( )B y n x n
2 2
1 2( ) ( )x n x n
DSP2-69
2 2
1 2( ) ( )x n x n
Linear
70. Example 2.2: C)
2
) ( ) ( )C y n x n
2
1 2
2 2
( ) ( )
( ) 2 ( ) ( ) ( )
x n x n
x n x n x n x n
2 2
1 2
2
1 2
( ) ( )
( ) ( )
x n x n
x n x n
DSP2-70
2 2
1 1 2 2( ) 2 ( ) ( ) ( )x n x n x n x n
Non-Linear
71. Example 2.2: D)
) ( ) ( )D y n Ax n B
1 2
1 2
[ ( ) ( )]
( ) ( )
T x n x n
A x n x n B
1 2( ) ( )A x n x n B
DSP2-71
1 2[ ( ) ] [ ( ) ]Ax n B Ax n B
Non-Linear
1 2( ) ( )A x n x n B
72. Example 2.2: E)
( )
) ( ) x n
E y n e
1 2( ) ( )x n x n
e
Non-Linear
DSP2-72
1 2( ) ( )x n x n
e e
Non-Linear
1 2( ) ( )x n x n
e
77. Example 2.3: Time-Invariance Testing
• Determine whether the following systems are
Time-invariant or Time-varying
) ( ) ( ) ( 1)A y n x n x n
0
) ( ) ( )
) ( ) ( )
) ( ) ( ) cos
B y n nx n
C y n x n
D y n x n n
DSP2-77
78. Example 2.3: Time-Invariance Testing
A)
) ( ) ( ) ( 1)A y n x n x n
( ) ( ) ( 1)y n k x n k x n k
( , ) [ ( )]
( ) ( 1)
y n k T x n k
x n k x n k
( ) ( ) ( 1)y n k x n k x n k
DSP2-78
Time-invariant
79. Example 2.3: Time-Invariance Testing
B)
) ( ) ( )B y n nx n
( ) ( ) ( )y n k n k x n k
( , ) [ ( )]
( )
y n k T x n k
nx n k
( ) ( ) ( )y n k n k x n k
DSP2-79
Time-varying
80. Example 2.3: Time-Invariance Testing
C)
( ) ( ( )) ( )y n k x n k x n k
) ( ) ( )C y n x n
( , ) [ ( )]
( )
y n k T x n k
x n k
( ) ( ( )) ( )y n k x n k x n k
DSP2-80
Time-varying
81. Example 2.3: Time-Invariance Testing
D)
0( ) ( ) cos ( )y n k x n k n k
0) ( ) ( ) cosD y n x n n
0
0
( , ) [ ( ) cos ]
( ) cos ( )
y n k T x n n
x n k n
0( ) ( ) cos ( )y n k x n k n k
DSP2-81
Time-varying
82. Why is the LTI Systems so Important?
• The LTI property allows us to analyse the
characteristics of the system.
• Above all, with this LTI property, the system
can be used to find the relationship betweencan be used to find the relationship between
the input, the impulse response and the
output of the system.
• We are talking about the Convolution.
DSP2-82
83. h[n] has multiple components
• Consider the DT case. (Easier than CT!)
• h[n] has multiple components.
[ ]x n [ ]y n
SystemSystem
[ ]h n =Impulse Response
0 1
1 0.8
83
84. h[n] has only one component
• Now, let h[n] be a signal with only one
component.
• We call this type of signal as a unit impulse.
[ ]x n [ ] [ ]y n x n
SystemSystem
0
1 [ ]h n =Impulse Response
84
85. An Impulse is Delta Function
• The definition of unit impulse is
1, 0
[ ]
0, 0
n
n
n
0, 0n
0 n
1
85
86. Delayed Delta Functions
• The unit delayed delta function
Unit impulse
[ ]n
1
The unit-delayed impulse
[ 1]n
[ ]n
0 n
0 n
1
1
86
87. Multiple Delayed [n]
The unit-delayed impulse
[ 1]n
0 n
1
1
The 2-delayed impulse 1
[ 2]n
0 n1
The k-delayed impulse
[ ]n k
0 n
1
1
2
2 k
87
88. [ ]x n
n
1
0
1 n
1
1
=
=
[0] [ ]x n
[1] [ 1]x n
[ ]n
[ 1]n
Sifting of x[n] by (delayed)[n]
nk
1 n
2 n
1
1
=
=
[2] [ 2]x n
[ ] [ ]x k n k
[ 2]n
[ ]n k
88
89. [0] [ ]x n
[1] [ 1]x n
Summation of Each Signal
[2] [ 2]x n
[ ] [ ]x k n k
+
[ ]x n
[ ] [ ] [ ] [ ]
k
y n x k n k x n
89
90. Combining Sifting and Summing to
construct the output
[0] [ ]x n
[1] [ 1]x n
[2] [ 2]x n
[ ]x n
[ ] [ ] [ ]
[ ]
k
y n x k n k
x n
[ ]x n
[2] [ 2]x n
[ ] [ ]x k n k
+
System
90
Sifting
91. Construction of Signal From Sifted
Components
• Construction of Signal From Sifted Components
is then written as
[ ] [ ] [ ]
k
x n x k n k
• Since this is operation of x[n] and [n], we write
• This is called the “Convolution equation” between
x[n] and [n].
k
[ ] [ ] [ ]x n x n n
91
92. System defined by [n]
[ ] [ ]y n x n[ ]n( )x n
[ ] [ ] [ ] [ ] [ ]
k
x n x k n k x n n
92
93. Computing the Convolution as a System
2
2
[ ] [ ] [ ]
0 ( 2) (0 2) ( 1) (0 1) (0) (0 0) (1) (0 1) (2) (0 2)
k
n y n x k n k
x x x x x
1 ( 2) (1 2) ( 1) (1 1) (0) (1 0) (1) (1 1) (2) (1 2)
2 ( 2) (2 2) ( 1) (2 1) (0) (2 0) (1) (2 1) (2) (2 2)
3 ( 2)
x x x x x
x x x x x
x
(3 2) ( 1) (3 1) (0) (3 0) (1) (3 1) (2) (3 2)x x x x
93
94. 2
2
[ ] [ ] [ ]
0 [0]
1 [1]
k
n y n x k n k
x
x
1 [1]
2 [2]
3 [3]
x
x
x
[ ] [ ]y n x n
94
95. Finding Impulse Response
• If delta function is input, output will be h[n]
[ ] [ ]y n h n[ ]n [ ]h n
[ ] [ ] [ ] [ ] [ ]
k
h n n h n k h n k
h[n] = Impulse
Response
95
96. Input and Impulse Response are
Interchangeable (Commutative)
[ ] [ ] [ ] [ ] [ ]x n x n n x k n k
[ ]x n [ ]n [ ]x n
[ ]x n[ ]n [ ]x n
[ ] [ ] [ ] [ ] [ ]
k
x n n x n k x n k
96
[ ] [ ] [ ] [ ] [ ]
k
x n x n n x k n k
97. Example
• Determine
2
2
[ ] [ ] [ ]
k
n y n k x n k
2
2
[ ] [ ] [ ]
k
y n k x n k
2
0 ( 2) (0 2) ( 1) (0 1) (0) (0 0) (1) (0 1) (2) (0 2)
1 ( 2) (1 2) ( 1) (1 1) (0) (1 0) (1) (1 1) (2) (1 2)
2 ( 2) (2 2) ( 1) (2 1) (0) (2 0) (1) (2 1) (2) (2 2)
3 ( 2)
k
x x x x x
x x x x x
x x x x x
x
(3 2) ( 1) (3 1) (0) (3 0) (1) (3 1) (2) (3 2)x x x x
97
98. 2
2
[ ] [ ] [ ]
0 [0]
1 [1]
k
n y n k x n k
x
x
1 [1]
2 [2]
3 [3]
x
x
x
[ ] [ ]y n x n
98
104. SystemSystem
System with and without
Delayed Delta functions
•
( ) ( 1)y n x n
SystemSystem
( ) ( ) ( 1)h n n n
[ ] [ ] [ 1]h n n n
( )x n
104
105. Example
• Let
• Find
[ ] [ ] [ 1]h n n n
• Find
• For n=0,...,3
2
2
[ ] [ ] [ ]
k
y n h k x n k
105
106. 2
2
( ) [ ( ) ( 1)] ( )
( 2) (2) ( 1) (1) (0) (0) (1) ( 1) (2) ( 2)
0
( 3) (2) ( 2) (1) ( 1) (0) (0) ( 1) (1) ( 2)
( 2) (3) ( 1) (2) (0) (1) (1) (0) (2) (1)
k
n y n k k x n k
x x x x x
x x x x x
x x x x x
2
2
( ) ( ) ( )
k
y n h k x n k
( 2) (3) ( 1) (2) (0) (1) (1) (0) (2) (1)
1
( 3) (3) ( 2) (2) (
x x x x x
x x
1) (1) (0) (0) (1) ( 1)
( 2) (4) ( 1) (3) (0) (2) (1) (1) (2) (0)
2
( 3) (4) ( 2) (3) ( 1) (2) (0) (1) (1) (0)
( 2) (5) ( 1) (4) (0) (3) (1) (2) (2) (1)
3
( 3) (5) ( 2) (4) ( 1) (3)
x x x
x x x x x
x x x x x
x x x x x
x x x
(0) (2) (1) (1)x x
106
107. 2
2
( ) ( ) ( )
0 (0) ( 1)
1 (1) (0)
k
n y n k x n k
x x
x x
1 (1) (0)
2 (2) (1)
3 (3) (2)
x x
x x
x x
[ ] [ ] [ 1]y n x n x n
107
108. Convolution
• If we have general impulse response h[n]
[ ]x n [ ]y n
SystemSystem
[0]h [1]h
108
110. Example
• Now if the impulse response is consisted of a
scaled unit delayed
( ) {1,0.8}h n
• Or h(0) =1 and h(1) =0.8
• This means we can write h(n) as
DSP2-110
( ) ( ) 0.8 ( 1)h n n n
( ) {1,0.8}h n
111. Convolution of x(n) and h(n) = {1,0.8}
( ) ?y n h(n)h(n) ( ) ?y n
(0)h (1)h
DSP2-111
0 1
h(n)h(n)
( ) ( ) 0.8 ( 1)h n n n
( )x n
113. ( 2) (2) ( 1) (1) (0) (0) (1) ( 1) (2) ( 2)x x x x x
Calculate Convolution at n=0
n =0 and let k=-2,-1,0,1,2
2 2
2 2
(0) ( ) (0 ) 0.8 ( 1) (0 )
k k
y k x k k x k
( 2) (2) ( 1) (1) (0) (0) (1) ( 1) (2) ( 2)
0.8[ ( 3) (2) ( 2) (1) ( 1) (0) (0) ( 1) (1) ( 2)]
x x x x x
x x x x x
DSP2-113
(0) 0.8 ( 1)x x
114. ( 2) (3) ( 1) (2) (0) (1) (1) (0) (2) (1)x x x x x
Calculate Convolution at n=1
n =1 and let k=-2,-1,0,1,2
2 2
2 2
(1) ( ) (1 ) 0.8 ( 1) (1 )
k k
y k x k k x k
( 2) (3) ( 1) (2) (0) (1) (1) (0) (2) (1)
0.8 ( 3) (3) ( 2) (2) ( 1) (1) (0) (0) (1) ( 1)
x x x x x
x x x x x
DSP2-114
(1) 0.8 (0)x x
115. ( 2) (4) ( 1) (3) (0) (2) (1) (1) (2) (0)x x x x x
Calculate Convolution at n=2
n =2 and let k=-2,-1,0,1,2
2 2
2 2
(2) ( ) (2 ) 0.8 ( 1) (2 )
k k
y k x k k x k
( 2) (4) ( 1) (3) (0) (2) (1) (1) (2) (0)
0.8 ( 3) (4) ( 2) (3) ( 1) (2) (0) (1) (1) (0)
x x x x x
x x x x x
DSP2-115
(2) 0.8 (1)x x
116. ( 2) (5) ( 1) (4) (0) (3) (1) (2) (2) (1)x x x x x
Calculate Convolution at n=3
n =3 and let k=-2,-1,0,1,2
2 2
2 2
(3) ( ) (3 ) 0.8 ( 1) (3 )
k k
y k x k k x k
( 2) (5) ( 1) (4) (0) (3) (1) (2) (2) (1)
0.8 ( 3) (5) ( 2) (4) ( 1) (3) (0) (2) (1) (1)
x x x x x
x x x x x
DSP2-116
(3) 0.8 (2)x x
117. ( )
0 (0) 0.8 ( 1)
1 (1) 0.8 (0)
2 (2) 0.8 (1)
n y n
x x
x x
x x
2 (2) 0.8 (1)
3 (3) 0.8 (2)
x x
x x
( ) ( ) 0.8 ( 1)y n x n x n
DSP2-117
118. Example 1: Convolution
• Determine the convolution results of
y(n)=x(n)*h(n) for n=0,…,3 where
( ) {3,2}h n
and x(n) and h(n) are zero for other values of n.
( ) {3,2}h n
( ) {5,4}x n
DSP2-118
119. Solution
• From
• If h(n) and x(n) is zero when 0< n and n> 1,
( ) ( ) ( )
k
y n h k x n k
• If h(n) and x(n) is zero when 0< n and n> 1,
then we calculate convolution only for h(0) =0
and 1.
• Note that, like n, k is just an index for the sum.
1
0
( ) ( ) ( )
k
y n h k x n k
DSP2-119
120. 3 ( 2) (2) ( 1) (1) (0) (0) (1) ( 1) (2) ( 2)x x x x x
Calculate Convolution at n=0
n =0 and let k=-2,-1,0,1,2
2 2
2 2
(0) 3 ( ) (0 ) 2 ( 1) (0 )
k k
y k x k k x k
3 ( 2) (2) ( 1) (1) (0) (0) (1) ( 1) (2) ( 2)
2[ ( 3) (2) ( 2) (1) ( 1) (0) (0) ( 1) (1) ( 2)]
x x x x x
x x x x x
DSP2-120
3 (0) 2 ( 1)x x
3 5 2 0 15
121. 3 ( 2) (3) ( 1) (2) (0) (1) (1) (0) (2) (1)x x x x x
Calculate Convolution at n=1
n =1 and let k=-2,-1,0,1,2
2 2
2 2
(1) 3 ( ) (1 ) 2 ( 1) (1 )
k k
y k x k k x k
3 ( 2) (3) ( 1) (2) (0) (1) (1) (0) (2) (1)
2 ( 3) (3) ( 2) (2) ( 1) (1) (0) (0) (1) ( 1)
x x x x x
x x x x x
DSP2-121
3 (1) 2 (0)x x
3 4 2 5 22
122. 3 ( 2) (4) ( 1) (3) (0) (2) (1) (1) (2) (0)x x x x x
Calculate Convolution at n=2
n =2 and let k=-2,-1,0,1,2
2 2
2 2
(2) 3 ( ) (2 ) 3 ( 1) (2 )
k k
y k x k k x k
3 ( 2) (4) ( 1) (3) (0) (2) (1) (1) (2) (0)
2 ( 3) (4) ( 2) (3) ( 1) (2) (0) (1) (1) (0)
x x x x x
x x x x x
DSP2-122
3 (2) 2 (1)x x
3 0 2 4 8
123. 3 ( 2) (5) ( 1) (4) (0) (3) (1) (2) (2) (1)x x x x x
Calculate Convolution at n=3
n =3 and let k=-2,-1,0,1,2
2 2
2 2
(3) 3 ( ) (3 ) 2 ( 1) (3 )
k k
y k x k k x k
3 ( 2) (5) ( 1) (4) (0) (3) (1) (2) (2) (1)
2 ( 3) (5) ( 2) (4) ( 1) (3) (0) (2) (1) (1)
x x x x x
x x x x x
DSP2-123
3 (3) 2 (2)x x
3 0 2 0 0
124. ( )
0 3 (0) 2 ( 1)
1 3 (1) 2 (0)
2 3 (2) 3 (1)
n y n
x x
x x
x x
2 3 (2) 3 (1)
3 3 (3) 2 (2)
x x
x x
( ) 3 ( ) 2 ( 1)y n x n x n
DSP2-124
125. Homework 2
• Determine in details the convolution results of
y(n)=x(n)*h(n) for n=-1,…,3 where
( ) [1, 2,3]x n
• and x(n) and h(n) are zero for other values of
n.
( ) [1, 2,3]x n
( ) [1,1,1]h n
DSP2-125
126. Answer
( ) ( ) ( ) ( ) ( )
( ) ( ) ( ) ( )
y n h n x n x n h n
h k x n k x k h n k
( ) ( ) ( ) ( )
[1,3,6,5,3]
k k
h k x n k x k h n k
DSP2-126
127. The Properties of Convolution
• Cumulative Property
• Associative property
( ) ( ) ( ) ( )x n h n h n x n
• Distributive property
•
1 2 1 2{ ( ) ( )} ( ) ( ) { ( ) ( )}x n h n h n x n h n h n
1 2 1 2( ) { ( ) ( )} ( ) ( ) ( ) ( )x n h n h n x n h n x n h n
DSP2-127