The document describes MATLAB exercises for a circuits, signals and systems workshop. It includes 9 exercises that students will carry out over 10 weeks exploring topics like Fourier series analysis and synthesis of waveforms, filter circuits, and more. Exercise 2 focuses on using Fourier series to progressively synthesize a square wave by adding weighted harmonics. Exercise 3 similarly synthesizes a triangular wave. Exercise 4 analyzes the Fourier series of a half-wave rectified sine waveform.
This document contains a summary of a session on numbers and divisibility rules:
- The session covered divisibility rules for numbers 2 through 14, as well as rules for large numbers like 7, 13, and 17 using osculators.
- Osculators allow checking divisibility of large numbers by finding a number to add or subtract from the last few digits.
- Modulo arithmetic provides the reasoning behind many divisibility rules.
- Problems were worked through to practice applying divisibility rules, including ones involving different number bases.
This document defines and provides examples of different types of numeric sequences:
- Linear/arithmetic sequences have a constant difference between consecutive terms. Formulas use the first term and common difference.
- Quadratic sequences have a constant second difference; their formulas are of the form an^2 + bn + c.
- Cubic sequences have a constant third difference; their formulas are of the form an^3 + bn^2 + cn + d.
Step-by-step methods are provided for determining the formulas for quadratic and cubic sequences based on analyzing differences between terms. Worked examples demonstrate finding common differences and deriving sequence formulas.
Basic algebra, trig and calculus needed for physics.
**More good stuff available at:
www.wsautter.com
and
http://www.youtube.com/results?search_query=wnsautter&aq=f
The document contains notes on trigonometric graphs and functions. It discusses the amplitude and period of trigonometric graphs, defines radians and relates them to degrees, provides exact values of trigonometric functions at common angles, explains the four quadrants used to measure angles, and gives examples of solving trigonometric equations both graphically and algebraically using properties of the quadrants.
The document summarizes various greedy algorithms and optimization problems that can be solved using greedy approaches. It discusses the greedy method, giving the definition that locally optimal decisions should lead to a globally optimal solution. Examples covered include picking numbers for largest sum, shortest paths, minimum spanning trees (using Kruskal's and Prim's algorithms), single-source shortest paths (using Dijkstra's algorithm), activity-on-edge networks, the knapsack problem, Huffman codes, and 2-way merging. Limitations of the greedy method are noted, such as how it does not always find the optimal solution for problems like shortest paths on a multi-stage graph.
This document discusses double-angle and half-angle trigonometric identities. It derives formulas for sin(2θ), cos(2θ), and tan(2θ) in terms of sin(θ) and cos(θ). It also derives formulas for sin(θ/2), cos(θ/2), and tan(θ/2) in terms of cos(θ). Several examples are provided to demonstrate applying these identities to simplify trigonometric expressions and solve problems.
The document introduces sequences and series. It discusses revising linear and quadratic sequences. It introduces arithmetic sequences, which have a constant difference between terms, and geometric sequences, which have a constant ratio between terms. It provides examples of determining the general term and specific terms of arithmetic and geometric sequences. Formulas are given for the general terms of both arithmetic (Tn = a + (n-1)d) and geometric (Tn = arn-1) sequences.
The document provides an overview of circular functions and trigonometry. It discusses the properties of sine, cosine, and tangent graphs, including their periodic nature, amplitude, and period. Students are expected to learn to graph these functions, describe their properties, and solve trigonometric equations. The document also contains examples and practice problems related to these objectives.
This document contains a summary of a session on numbers and divisibility rules:
- The session covered divisibility rules for numbers 2 through 14, as well as rules for large numbers like 7, 13, and 17 using osculators.
- Osculators allow checking divisibility of large numbers by finding a number to add or subtract from the last few digits.
- Modulo arithmetic provides the reasoning behind many divisibility rules.
- Problems were worked through to practice applying divisibility rules, including ones involving different number bases.
This document defines and provides examples of different types of numeric sequences:
- Linear/arithmetic sequences have a constant difference between consecutive terms. Formulas use the first term and common difference.
- Quadratic sequences have a constant second difference; their formulas are of the form an^2 + bn + c.
- Cubic sequences have a constant third difference; their formulas are of the form an^3 + bn^2 + cn + d.
Step-by-step methods are provided for determining the formulas for quadratic and cubic sequences based on analyzing differences between terms. Worked examples demonstrate finding common differences and deriving sequence formulas.
Basic algebra, trig and calculus needed for physics.
**More good stuff available at:
www.wsautter.com
and
http://www.youtube.com/results?search_query=wnsautter&aq=f
The document contains notes on trigonometric graphs and functions. It discusses the amplitude and period of trigonometric graphs, defines radians and relates them to degrees, provides exact values of trigonometric functions at common angles, explains the four quadrants used to measure angles, and gives examples of solving trigonometric equations both graphically and algebraically using properties of the quadrants.
The document summarizes various greedy algorithms and optimization problems that can be solved using greedy approaches. It discusses the greedy method, giving the definition that locally optimal decisions should lead to a globally optimal solution. Examples covered include picking numbers for largest sum, shortest paths, minimum spanning trees (using Kruskal's and Prim's algorithms), single-source shortest paths (using Dijkstra's algorithm), activity-on-edge networks, the knapsack problem, Huffman codes, and 2-way merging. Limitations of the greedy method are noted, such as how it does not always find the optimal solution for problems like shortest paths on a multi-stage graph.
This document discusses double-angle and half-angle trigonometric identities. It derives formulas for sin(2θ), cos(2θ), and tan(2θ) in terms of sin(θ) and cos(θ). It also derives formulas for sin(θ/2), cos(θ/2), and tan(θ/2) in terms of cos(θ). Several examples are provided to demonstrate applying these identities to simplify trigonometric expressions and solve problems.
The document introduces sequences and series. It discusses revising linear and quadratic sequences. It introduces arithmetic sequences, which have a constant difference between terms, and geometric sequences, which have a constant ratio between terms. It provides examples of determining the general term and specific terms of arithmetic and geometric sequences. Formulas are given for the general terms of both arithmetic (Tn = a + (n-1)d) and geometric (Tn = arn-1) sequences.
The document provides an overview of circular functions and trigonometry. It discusses the properties of sine, cosine, and tangent graphs, including their periodic nature, amplitude, and period. Students are expected to learn to graph these functions, describe their properties, and solve trigonometric equations. The document also contains examples and practice problems related to these objectives.
This document contains 23 multi-part mathematics questions about sequences and series. The questions cover identifying arithmetic and geometric sequences, finding terms of sequences, determining whether sequences are convergent/divergent, evaluating sums of sequences, and solving equations related to sequences and series. Sample questions include finding the 10th term of identified sequences, determining the value of n that satisfies a given sum, and calculating salaries over time that form geometric sequences.
This document discusses trigonometric ratios and identities. It begins by defining angles, their measurement in different systems including degrees, radians and grades. It then defines trigonometric functions including sine, cosine, tangent etc and discusses their domains, ranges and signs in different quadrants. The document also covers trigonometric identities, ratios of compound angles and periodicity of trig functions.
This document contains an unsolved practice paper for the IIT JEE chemistry exam from 2011. It consists of 23 multiple choice questions across 4 sections - single answer, multiple answer, paragraph and integer answer types. The questions cover topics like equations, vectors, functions, probabilities, planes, parabolas, gases and arithmetic/quadratic equations. The full paper is provided for review and practice in preparation for the IIT JEE exam.
The document discusses various concepts related to trees and graphs including:
- Definitions of trees, rooted trees, subtrees, and tree traversal methods like preorder, inorder and postorder searches.
- Minimum spanning trees, algorithms to find them like Prim's and Kruskal's, and definitions of spanning trees.
- Definitions of graphs, types of graphs, Euler's formula, planar graphs, Hamiltonian graphs, and graph isomorphism.
The document provides a review of trigonometry concepts related to right triangles, including:
- The definitions of the trigonometric functions sine, cosine, and tangent using the ratios of sides in a right triangle (SOH CAH TOA)
- Finding all trig values of an angle given one ratio
- Special right triangles and their connections to the unit circle
- The Pythagorean theorem and Pythagorean triples
- Angles of elevation and depression and using trig functions to find unknown side lengths
- Using the inverse trig functions (arcsine, arccosine, arctangent) to find an angle given a side ratio
The document contains examples of arithmetic sequences and their term-to-term and position-to-term rules. It provides sequences and asks the reader to determine the rule for the nth term. It also includes word problems about taxi fares and matchstick patterns that can be represented by sequences. The document covers generating terms of sequences, justifying expressions for the nth term, and extending work to quadratic sequences.
This module covers trigonometric equations and identities. Students will learn to:
1. State fundamental trigonometric identities like reciprocal, quotient, and Pythagorean identities.
2. Prove trigonometric identities algebraically by transforming one side into the other.
3. Use sum and difference formulas for sine and cosine to find values of trig functions of angles that are not special angles.
4. Solve simple trigonometric equations.
Worked examples are provided to simplify expressions using identities, prove identities by algebraic manipulation, and apply sum and difference formulas to find trig values of combined angles.
This document provides a review of trigonometric graphs including how to draw and identify them. It discusses the maximum and minimum values, range, period and number of cycles for sin and cos graphs. It also covers shifting graphs horizontally or vertically and combining trig functions with constants. Examples are provided to illustrate identifying trig graphs from their equations and sketching shifted or combined trig graphs.
FellowBuddy.com is an innovative platform that brings students together to share notes, exam papers, study guides, project reports and presentation for upcoming exams.
We connect Students who have an understanding of course material with Students who need help.
Benefits:-
# Students can catch up on notes they missed because of an absence.
# Underachievers can find peer developed notes that break down lecture and study material in a way that they can understand
# Students can earn better grades, save time and study effectively
Our Vision & Mission – Simplifying Students Life
Our Belief – “The great breakthrough in your life comes when you realize it, that you can learn anything you need to learn; to accomplish any goal that you have set for yourself. This means there are no limits on what you can be, have or do.”
Like Us - https://www.facebook.com/FellowBuddycom
This document discusses extending trigonometric functions beyond right triangles. It introduces trig functions of any angle, coterminal angles, the unit circle, and periodic functions. Examples are provided on evaluating trig functions of angles in all quadrants using reference triangles. The key topics covered are trig functions of real numbers defined on the unit circle, and trig functions being periodic functions.
The string matching problem is a classic of algorithms. In this class, we only look at the Rabin-Karpp algorithm as a classic example of the string matching algorithms
This module teaches about circular functions and their graphical representations. Students will learn to define and calculate the six trigonometric functions of an acute angle in standard position. Specifically, the module will:
1) Describe the properties of sine and cosine functions
2) Teach how to draw the graphs of sine and cosine functions
3) Define the six trigonometric functions of an angle given its terminal point is not on the unit circle
4) Calculate trigonometric function values given certain conditions
Lecture 14 section 5.3 trig fcts of any anglenjit-ronbrown
This document discusses trigonometric functions and the unit circle approach. It defines the six trigonometric functions using points on the unit circle, where the radius is 1. Special right triangles like the 45-45-90 and 30-60-90 triangles are used to determine exact trigonometric function values for angles of 45°, 30°, and 60°. Reference angles are defined as the acute angle between the terminal side of an angle and the x-axis, and are used to determine trigonometric function values for angles in any quadrant. Examples are provided to demonstrate finding trig values using reference angles.
The document discusses Delaunay triangulation, which is a method for generating a triangulation of a set of points in a plane. It begins by motivating the problem of modeling a terrain from sample height points. It then discusses using triangulations to approximate the terrain, and defines properties of triangulations. It introduces the concept of Delaunay triangulation, which maximizes the minimum angle of all possible triangulations. It describes an algorithm called randomized incremental construction that computes the Delaunay triangulation by incrementally adding points and maintaining the Delaunay property through edge flips.
This document contains an unsolved mathematics paper from 2009 containing multiple choice and paragraph style questions testing concepts in complex numbers, trigonometry, probability, matrices, conic sections, and differential equations. There are 4 sections with a total of 20 questions covering topics such as the area of a rectangle defined by complex number roots, properties of unit vectors, loci of points in triangles and ellipses, conditional probabilities of die rolls, the number of possible symmetric matrices meeting certain criteria, matching conic sections to defining expressions, and matching intervals to differential equations and integrals.
This document introduces arithmetic sequences and series. It defines an arithmetic sequence as a sequence where the difference between consecutive terms is constant. The nth term of an arithmetic sequence can be written as a formula of a, the first term, and d, the common difference. An arithmetic series is the sum of terms in an arithmetic sequence, which can be calculated using the sigma notation and the formula for the sum of an arithmetic sequence. Examples are provided to illustrate finding terms and sums of arithmetic sequences and series.
Delaunay triangulation from 2-d delaunay to 3-d delaunaygreentask
The document discusses Delaunay triangulation in 2D and 3D. It covers several key topics:
1. Computing the circumcenter of a triangle and using it to find cavities when inserting a new point.
2. Improving the algorithm to find which edges can form new balls/triangles by recording edges as cavities are found.
3. The complexity of finding cavities and balls, and how finding balls can be optimized.
4. Extending the 2D Delaunay triangulation concepts like cavity detection to 3D meshes. This involves operations to recover missing geometry and merge the cavity mesh.
The document discusses sequences and series, including sigma notation, arithmetic sequences and series, and geometric sequences and series. It defines sequences, finite and infinite sequences, and series. It provides the formulas for the nth term and nth partial sum of arithmetic and geometric sequences. It also gives examples of applying arithmetic and geometric series to problems involving patterns, sums, and compound interest.
This document describes an experiment to perform the discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT) on two input signals using MATLAB. The experiment calculates the magnitude and phase of the DFT and IDFT outputs and compares the results to the MATLAB FFT and IFFT functions. The student learns how to implement the DFT and IDFT and plot the magnitude and phase of signals.
This document contains 23 multi-part mathematics questions about sequences and series. The questions cover identifying arithmetic and geometric sequences, finding terms of sequences, determining whether sequences are convergent/divergent, evaluating sums of sequences, and solving equations related to sequences and series. Sample questions include finding the 10th term of identified sequences, determining the value of n that satisfies a given sum, and calculating salaries over time that form geometric sequences.
This document discusses trigonometric ratios and identities. It begins by defining angles, their measurement in different systems including degrees, radians and grades. It then defines trigonometric functions including sine, cosine, tangent etc and discusses their domains, ranges and signs in different quadrants. The document also covers trigonometric identities, ratios of compound angles and periodicity of trig functions.
This document contains an unsolved practice paper for the IIT JEE chemistry exam from 2011. It consists of 23 multiple choice questions across 4 sections - single answer, multiple answer, paragraph and integer answer types. The questions cover topics like equations, vectors, functions, probabilities, planes, parabolas, gases and arithmetic/quadratic equations. The full paper is provided for review and practice in preparation for the IIT JEE exam.
The document discusses various concepts related to trees and graphs including:
- Definitions of trees, rooted trees, subtrees, and tree traversal methods like preorder, inorder and postorder searches.
- Minimum spanning trees, algorithms to find them like Prim's and Kruskal's, and definitions of spanning trees.
- Definitions of graphs, types of graphs, Euler's formula, planar graphs, Hamiltonian graphs, and graph isomorphism.
The document provides a review of trigonometry concepts related to right triangles, including:
- The definitions of the trigonometric functions sine, cosine, and tangent using the ratios of sides in a right triangle (SOH CAH TOA)
- Finding all trig values of an angle given one ratio
- Special right triangles and their connections to the unit circle
- The Pythagorean theorem and Pythagorean triples
- Angles of elevation and depression and using trig functions to find unknown side lengths
- Using the inverse trig functions (arcsine, arccosine, arctangent) to find an angle given a side ratio
The document contains examples of arithmetic sequences and their term-to-term and position-to-term rules. It provides sequences and asks the reader to determine the rule for the nth term. It also includes word problems about taxi fares and matchstick patterns that can be represented by sequences. The document covers generating terms of sequences, justifying expressions for the nth term, and extending work to quadratic sequences.
This module covers trigonometric equations and identities. Students will learn to:
1. State fundamental trigonometric identities like reciprocal, quotient, and Pythagorean identities.
2. Prove trigonometric identities algebraically by transforming one side into the other.
3. Use sum and difference formulas for sine and cosine to find values of trig functions of angles that are not special angles.
4. Solve simple trigonometric equations.
Worked examples are provided to simplify expressions using identities, prove identities by algebraic manipulation, and apply sum and difference formulas to find trig values of combined angles.
This document provides a review of trigonometric graphs including how to draw and identify them. It discusses the maximum and minimum values, range, period and number of cycles for sin and cos graphs. It also covers shifting graphs horizontally or vertically and combining trig functions with constants. Examples are provided to illustrate identifying trig graphs from their equations and sketching shifted or combined trig graphs.
FellowBuddy.com is an innovative platform that brings students together to share notes, exam papers, study guides, project reports and presentation for upcoming exams.
We connect Students who have an understanding of course material with Students who need help.
Benefits:-
# Students can catch up on notes they missed because of an absence.
# Underachievers can find peer developed notes that break down lecture and study material in a way that they can understand
# Students can earn better grades, save time and study effectively
Our Vision & Mission – Simplifying Students Life
Our Belief – “The great breakthrough in your life comes when you realize it, that you can learn anything you need to learn; to accomplish any goal that you have set for yourself. This means there are no limits on what you can be, have or do.”
Like Us - https://www.facebook.com/FellowBuddycom
This document discusses extending trigonometric functions beyond right triangles. It introduces trig functions of any angle, coterminal angles, the unit circle, and periodic functions. Examples are provided on evaluating trig functions of angles in all quadrants using reference triangles. The key topics covered are trig functions of real numbers defined on the unit circle, and trig functions being periodic functions.
The string matching problem is a classic of algorithms. In this class, we only look at the Rabin-Karpp algorithm as a classic example of the string matching algorithms
This module teaches about circular functions and their graphical representations. Students will learn to define and calculate the six trigonometric functions of an acute angle in standard position. Specifically, the module will:
1) Describe the properties of sine and cosine functions
2) Teach how to draw the graphs of sine and cosine functions
3) Define the six trigonometric functions of an angle given its terminal point is not on the unit circle
4) Calculate trigonometric function values given certain conditions
Lecture 14 section 5.3 trig fcts of any anglenjit-ronbrown
This document discusses trigonometric functions and the unit circle approach. It defines the six trigonometric functions using points on the unit circle, where the radius is 1. Special right triangles like the 45-45-90 and 30-60-90 triangles are used to determine exact trigonometric function values for angles of 45°, 30°, and 60°. Reference angles are defined as the acute angle between the terminal side of an angle and the x-axis, and are used to determine trigonometric function values for angles in any quadrant. Examples are provided to demonstrate finding trig values using reference angles.
The document discusses Delaunay triangulation, which is a method for generating a triangulation of a set of points in a plane. It begins by motivating the problem of modeling a terrain from sample height points. It then discusses using triangulations to approximate the terrain, and defines properties of triangulations. It introduces the concept of Delaunay triangulation, which maximizes the minimum angle of all possible triangulations. It describes an algorithm called randomized incremental construction that computes the Delaunay triangulation by incrementally adding points and maintaining the Delaunay property through edge flips.
This document contains an unsolved mathematics paper from 2009 containing multiple choice and paragraph style questions testing concepts in complex numbers, trigonometry, probability, matrices, conic sections, and differential equations. There are 4 sections with a total of 20 questions covering topics such as the area of a rectangle defined by complex number roots, properties of unit vectors, loci of points in triangles and ellipses, conditional probabilities of die rolls, the number of possible symmetric matrices meeting certain criteria, matching conic sections to defining expressions, and matching intervals to differential equations and integrals.
This document introduces arithmetic sequences and series. It defines an arithmetic sequence as a sequence where the difference between consecutive terms is constant. The nth term of an arithmetic sequence can be written as a formula of a, the first term, and d, the common difference. An arithmetic series is the sum of terms in an arithmetic sequence, which can be calculated using the sigma notation and the formula for the sum of an arithmetic sequence. Examples are provided to illustrate finding terms and sums of arithmetic sequences and series.
Delaunay triangulation from 2-d delaunay to 3-d delaunaygreentask
The document discusses Delaunay triangulation in 2D and 3D. It covers several key topics:
1. Computing the circumcenter of a triangle and using it to find cavities when inserting a new point.
2. Improving the algorithm to find which edges can form new balls/triangles by recording edges as cavities are found.
3. The complexity of finding cavities and balls, and how finding balls can be optimized.
4. Extending the 2D Delaunay triangulation concepts like cavity detection to 3D meshes. This involves operations to recover missing geometry and merge the cavity mesh.
The document discusses sequences and series, including sigma notation, arithmetic sequences and series, and geometric sequences and series. It defines sequences, finite and infinite sequences, and series. It provides the formulas for the nth term and nth partial sum of arithmetic and geometric sequences. It also gives examples of applying arithmetic and geometric series to problems involving patterns, sums, and compound interest.
This document describes an experiment to perform the discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT) on two input signals using MATLAB. The experiment calculates the magnitude and phase of the DFT and IDFT outputs and compares the results to the MATLAB FFT and IFFT functions. The student learns how to implement the DFT and IDFT and plot the magnitude and phase of signals.
This document describes computing Fourier series and power spectra with MATLAB. It discusses:
1) Representing signals in the frequency domain using Fourier analysis instead of the time domain. Fourier analysis allows isolating certain frequency ranges.
2) Computing Fourier series coefficients involves representing a signal as a sum of sines and cosines with different frequencies, and using integral properties to solve for coefficients.
3) Examples are provided to demonstrate Fourier series reconstruction of simple signals like a sine wave and square wave. The square wave example is used to derive its Fourier series coefficients analytically.
4) Computing Fourier transforms of discrete data uses a discrete approximation to integrals via the trapezoidal rule. A Fast Fourier Transform algorithm improves efficiency
This MATLAB section of source code covers MATLAB based projects.
Download free source code viz. FIR,IIR,scrambler,interleaver,FFT,convolution,correlation,interpolation,decimation,CRC,impairments,data type conversions and more.
RS encoder,convolutional encoder,viterbi decoder,OFDM,OFDMA,MIMO is also covered.WiMAX,WLAN,LTE source codes are also provided.
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.
The document discusses decimation in time (DIT) and decimation in frequency (DIF) fast Fourier transform (FFT) algorithms. DIT breaks down an N-point sequence into smaller DFTs of even and odd indexed samples, recursively computing smaller and smaller DFTs until individual points remain. DIF similarly decomposes the computation but by breaking the frequency domain spectrum into smaller DFTs. Both algorithms reduce the computational complexity of computing the discrete Fourier transform from O(N^2) to O(NlogN) operations.
SolutionsPlease see answer in bold letters.Note pi = 3.14.docxrafbolet0
Solution
s:
Please see answer in bold letters.
Note pi = 3.1415….
1. The voltage across a 15Ω is as indicated. Find the sinusoidal expression for the current. In addition, sketch the v and i waveform on the same axis.
Note: For the graph of a and b please see attached jpg photo with filename 1ab.jpg and for c and d please see attached photo with filename 1cd.jpg.
a. 15sin20t
v= 15sin20t
By ohms law,
i = v/r
i = 15sin20t / 15
i = sin20t A
Computation of period for graphing:
v= 15sin20t
i = sin20t
w = 20 = 2pi*f
f = 3.183 Hz
Period =1/f = 0.314 seconds
b. 300sin (377t+20)
v = 300sin (377t+20)
i = 300sin (377t+20) /15
i = 20 sin (377t+20) A
Computation of period for graphing:
v = 300sin (377t+20)
i = 20 sin (377t+20)
w = 377 = 2pi*f
f = 60 Hz
Period = 1/60 = 0.017 seconds
shift to the left by:
2pi/0.017 = (20/180*pi)/x
x = 9.44x10-4 seconds
c. 60cos (wt+10)
v = 60cos (wt+10)
i = 60cos (wt+10)/15
i = 4cos (wt+10) A
Computation of period for graphing:
let’s denote the period as w sifted to the left by:
10/180*pi = pi/18
d. -45sin (wt+45)
v = -45sin (wt+45)
i = -45sin (wt+45) / 15
i = -3 sin (wt+45) A
Computation of period for graphing:
let’s denote the period as w sifted to the left by:
45/180 * pi = 1/4*pi
2. Determine the inductive reactance (in ohms) of a 5mH coil for
a. dc
Note at dc, frequency (f) = 0
Formula: XL = 2*pi*fL
XL = 2*pi* (0) (5m)
XL = 0 Ω
b. 60 Hz
Formula: XL = 2*pi*fL
XL = 2 (60) (5m)
XL = 1.885 Ω
c. 4kHz
Formula: XL = 2*pi*fL
XL = = 2*pi* (4k)(5m)
XL = 125.664 Ω
d. 1.2 MHz
Formula: XL = 2*pi*fL
XL = 2*pi* (1.2 M) (5m)
XL = 37.7 kΩ
3. Determine the frequency at which a 10 mH inductance has the following inductive reactance.
a. XL = 10 Ω
Formula: XL = 2*pi*fL
Express in terms in f:
f = XL/2 pi*L
f = 10 / (2pi*10m)
f = 159.155 Hz
b. XL = 4 kΩ
f = XL/2pi*L
f = 4k / (2pi*10m)
f = 63.662 kHz
c. XL = 12 kΩ
f = XL/2piL
f = 12k / (2pi*10m)
f = 190.99 kHz
d. XL = 0.5 kΩ
f = XL/2piL
f = 0.5k / (2pi*10m)
f = 7.958 kHz
4. Determine the frequency at which a 1.3uF capacitor has the following capacitive reactance.
a. 10 Ω
Formula: XC = 1/ (2pifC)
Expressing in terms of f:
f = 1/ (2pi*XC*C)
f = 1/ (2pi*10*1.3u)
f = 12.243 kΩ
b. 1.2 kΩ
f = 1/ (2pi*XC*C)
f = 1/ (2pi*1.2k*1.3u)
f = 102.022 Ω
c. 0.1 Ω
f = 1/ (2pi*XC*C)
f = 1/ (2pi*0.1*1.3u)
f = 1.224 MΩ
d. 2000 Ω
f = 1/ (2pi*XC*C)
f = 1/ (2pi*2000*1.3u)
f = 61.213 Ω
5. For the following pairs of voltage and current, indicate whether the element is a capacitor, an inductor and a capacitor, an inductor, or a resistor and find the value of C, L, or R if insufficient data are given.
a. v = 55 sin (377t + 50)
i = 11 sin (377t -40)
Element is inductor
In this case voltage leads current (ELI) by exactly 90 degrees so that means the circuit is inductive and the element is inductor.
XL = 55/11 = 5 Ω
we know the w=2pif so
w= 377=2pif
f= 60 Hz
To compute for th.
This document discusses the application of Fourier series and transforms in network analysis. It begins with an introduction to Fourier series expansion and trigonometric Fourier series. It describes how any periodic function can be expressed as an infinite sum of sine and cosine functions. It then covers exponential Fourier series, symmetry considerations, and examples of using Fourier series to analyze electrical circuits subjected to non-sinusoidal periodic excitations.
Q1Perform the two basic operations of multiplication and divisio.docxamrit47
Q1
Perform the two basic operations of multiplication and division to a complex number in both rectangular and polar form, to demonstrate the different techniques.
· Dividing complex numbers in rectangular and polar forms.
· Converting complex numbers between polar and rectangular forms and vice versa.
Q2
Calculate the mean, standard deviation and variance for a set of ungrouped data
· Completing a tabular approach to processing ungrouped data.
Q3
Calculate the mean, standard deviation and variance for a set of grouped data
· Completing a tabular approach to processing grouped data having selected an appropriate group size.
Q4
Sketch the graph of a sinusoidal trig function and use it to explain and describe amplitude, period and frequency.
· Calculate various features and coordinates of a waveform and sketch a plot accordingly.
· Explain basic elements of a waveform.
Q5
Use two of the compound angle formulae and verify their results.
· Simplify trigonometric terms and calculate complete values using compound formulae.
Q6
Find the differential coefficient for three different functions to demonstrate the use of function of a function and the product and quotient rules
· Use the chain, product and quotient rule to solve given differentiation tasks.
Q7
Use integral calculus to solve two simple engineering problems involving the definite and indefinite integral.
· Complete 3 tasks; one to practise integration with no definite integrals, the second to use definite integrals, the third to plot a graph and identify the area that relates to the definite integrals with a calculated answer for the area within such.
Q8
Use the laws of logarithms to reduce an engineering law of the type y = axn to a straight line form, then using logarithmic graph paper, plot the graph and obtain the values for the constants a and n.
· See Task.
Q9
Use complex numbers to solve a parallel arrangement of impedances giving the answer in both Cartesian and polar form
· See Task.
Q10
Use differential calculus to find the maximum/minimum for an engineering problem.
· See Task.
Q11
Using a graphical technique determine the single wave resulting from a combination of two waves of the same frequency and then verify the result using trig formulae.
· See Task.
Q12
Use numerical integration and integral calculus to analyse the results of a complex engineering problem
· See Task.
Level of Detail in
Solution
s: Need to show work leading to final answer
Need
Question 1
(a) Find:
(4 + i2)
(1 + i3)
Use the rules for multiplication and division of complex numbers in rectangular form.
(b) Convert the answer in rectangular form to polar form
(c) Repeat Q1a by first converting the complex numbers to polar form and then using the rules for multiplication and division of complex numbers in polar form.
(d) Convert the answer in polar form to rectangular form.
Question 2
The following data within the working area consists of measurements of resistor values from a producti ...
1) The document discusses using polynomials of different degrees to model stress functions and solve two-dimensional problems in Cartesian coordinates. Polynomials of first, second, third, fourth, and fifth degree are explored.
2) For a second degree polynomial, the stresses represent a state of uniform tension/compression in two perpendicular directions with uniform shear.
3) A third degree polynomial can model a linearly varying stress field, such as pure bending on a face. A fourth degree polynomial can model stresses with a parabolic distribution.
4) The bending of a cantilever beam subjected to an end load is analyzed using inverse and semi-inverse methods, arriving at the same stress distribution. The stresses represent bending with a
This document contains solutions to exercises from Rogawski's Calculus textbook. It provides vector parametrizations of curves, determines whether curves intersect or collide, evaluates limits related to derivatives of vector-valued functions, finds solutions to differential equations, and applies the chain rule.
Bayesian Inference and Uncertainty Quantification for Inverse ProblemsMatt Moores
So-called “inverse” problems arise when the parameters of a physical system cannot be directly observed. The mapping between these latent parameters and the space of noisy observations is represented as a mathematical model, often involving a system of differential equations. We seek to infer the parameter values that best fit our observed data. However, it is also vital to obtain accurate quantification of the uncertainty involved with these parameters, particularly when the output of the model will be used for forecasting. Bayesian inference provides well-calibrated uncertainty estimates, represented by the posterior distribution over the parameters. In this talk, I will give a brief introduction to Markov chain Monte Carlo (MCMC) algorithms for sampling from the posterior distribution and describe how they can be combined with numerical solvers for the forward model. We apply these methods to two examples of ODE models: growth curves in ecology, and thermogravimetric analysis (TGA) in chemistry. This is joint work with Matthew Berry, Mark Nelson, Brian Monaghan and Raymond Longbottom.
The document discusses two types of harmonics that can occur in induction machines: time harmonics and space harmonics. Time harmonics are caused by non-sinusoidal voltage supply from the source and can include the 3rd, 5th, and 7th harmonics. Triplen harmonics (3rd, 9th, etc.) do not affect the machine. The 5th harmonic causes a negative sequence system and the 7th a positive sequence system. Space harmonics are caused by the non-sinusoidal air gap flux distribution due to slotting of coils. Lower order space harmonics (5th, 7th, 11th, 13th) cause kinks in the speed-torque curve, which can
The document discusses two types of harmonics that can occur in induction machines: time harmonics and space harmonics. Time harmonics are caused by non-sinusoidal voltage supply from the source and can include the 3rd, 5th, and 7th harmonics. Space harmonics are caused by the non-sinusoidal air-gap flux distribution due to slotting of the stator and rotor. Space harmonics include the 5th and 7th harmonics, which rotate at different speeds than the fundamental waveform. Both types of harmonics can affect the machine's torque and speed characteristics and cause unwanted heating effects.
This document discusses Fourier analysis and periodic functions. It defines periodic functions and introduces Fourier series representation of periodic functions as the sum of sinusoidal components. The key points are:
1) A periodic function can be represented by an infinite series of sinusoids of harmonically related frequencies, known as Fourier series representation.
2) The coefficients of the Fourier series (a0, an, bn) can be calculated from the integrals of the function over one period.
3) Periodic functions may exhibit odd symmetry, even symmetry, or half-wave symmetry, which determines which coefficients (an or bn) are zero.
4) Examples demonstrate the Fourier analysis of specific periodic waveforms, such as a
1. The document discusses numerical integration techniques for approximating definite integrals that cannot be solved analytically. It covers basic techniques like the rectangle, midpoint, and trapezoid rules as well as more accurate techniques like Simpson's rule.
2. Examples are provided to demonstrate calculating definite integrals numerically to approximate values like the natural logarithm of numbers. The document also introduces Monte Carlo integration techniques using random sampling.
3. As an example problem, the document calculates the final speed of a box moving under a time-varying force using numerical integration over the integral expression for work. The Simpson's rule is identified as an approach to implement in a programming code to solve this example.
This document contains a workshop on the applications of vector spaces and subspaces in the field of information technology and communication. It lists 5 students' names and details of the course. The index outlines sections on introduction, objectives, theoretical foundation, development and conclusions.
In the development section, it provides two examples of applications of vector spaces - one related to representing multivariate data in a matrix for statistical analysis, and another related to representing digital signals transmitted through cables as periodic functions of time that can be analyzed using Fourier series. It also shows exercises calculating Wronskians to determine linear independence of sets of polynomial, trigonometric and exponential functions.
This document provides instructions for candidates taking the Oxford Colleges Physics Aptitude Test (PAT). It includes boxes for candidates to fill in identifying information. The test has two parts (A and B) with equal weight, focusing on mathematics and physics respectively. Part A contains 12 math problems worth a total of 50 marks. Part B contains multiple choice and written answer physics questions worth a total of 50 marks. Calculators and formulas are not permitted. Answers should be shown on the question sheet. The test is 2 hours long and candidates are advised to divide their time evenly between the two parts.
When a device has multiple paths to reach a destination, it always selects one path by preferring it over others. This selection process is termed as Routing. Routing is done by special network devices called routers or it can be done by means of software processes.The software based routers have limited functionality and limited scope.In case there are multiple path existing to reach the same destination, router can make decision based on Hop Count, Bandwidth, Metric, Prefix-length or Delay. Routing decision in networks, are mostly taken on the basis of cost between source and destination. Hop count plays major role here. Shortest path is a technique which uses various algorithms to decide a path with minimum number of hops. Common shortest path algorithms are Dijkstra's algorithm, Bellman Ford algorithm or Floyd algorithm. This presentation simplifies Floyd's algorithm with pictures and example.
The document discusses various graph labeling concepts such as Z3-vertex magic total labeling, Z3-edge magic total labeling, and total magic cordial labeling. It proves that these labelings exist for the extended duplicate graph of a comb graph and the middle graph of the extended duplicate graph of a path graph. An algorithm is provided to obtain an n-edge magic labeling for the extended duplicate graph of a comb graph. The document also discusses the structures of these graphs.
1) The document provides information about straight line graphs, including how to find the equation of a straight line from two points on the line. It discusses key concepts like gradient, y-intercept, and the equation y = mx + c.
2) Formulas are given for calculating gradient from two points and using gradient and a point to find the y-intercept and full equation.
3) Examples are worked through of finding the equation of various lines given graphical or numeric information.
GraphRAG for Life Science to increase LLM accuracyTomaz Bratanic
GraphRAG for life science domain, where you retriever information from biomedical knowledge graphs using LLMs to increase the accuracy and performance of generated answers
Introduction of Cybersecurity with OSS at Code Europe 2024Hiroshi SHIBATA
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
Have you ever been confused by the myriad of choices offered by AWS for hosting a website or an API?
Lambda, Elastic Beanstalk, Lightsail, Amplify, S3 (and more!) can each host websites + APIs. But which one should we choose?
Which one is cheapest? Which one is fastest? Which one will scale to meet our needs?
Join me in this session as we dive into each AWS hosting service to determine which one is best for your scenario and explain why!
Digital Marketing Trends in 2024 | Guide for Staying AheadWask
https://www.wask.co/ebooks/digital-marketing-trends-in-2024
Feeling lost in the digital marketing whirlwind of 2024? Technology is changing, consumer habits are evolving, and staying ahead of the curve feels like a never-ending pursuit. This e-book is your compass. Dive into actionable insights to handle the complexities of modern marketing. From hyper-personalization to the power of user-generated content, learn how to build long-term relationships with your audience and unlock the secrets to success in the ever-shifting digital landscape.
Ocean lotus Threat actors project by John Sitima 2024 (1).pptxSitimaJohn
Ocean Lotus cyber threat actors represent a sophisticated, persistent, and politically motivated group that poses a significant risk to organizations and individuals in the Southeast Asian region. Their continuous evolution and adaptability underscore the need for robust cybersecurity measures and international cooperation to identify and mitigate the threats posed by such advanced persistent threat groups.
HCL Notes and Domino License Cost Reduction in the World of DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-and-domino-license-cost-reduction-in-the-world-of-dlau/
The introduction of DLAU and the CCB & CCX licensing model caused quite a stir in the HCL community. As a Notes and Domino customer, you may have faced challenges with unexpected user counts and license costs. You probably have questions on how this new licensing approach works and how to benefit from it. Most importantly, you likely have budget constraints and want to save money where possible. Don’t worry, we can help with all of this!
We’ll show you how to fix common misconfigurations that cause higher-than-expected user counts, and how to identify accounts which you can deactivate to save money. There are also frequent patterns that can cause unnecessary cost, like using a person document instead of a mail-in for shared mailboxes. We’ll provide examples and solutions for those as well. And naturally we’ll explain the new licensing model.
Join HCL Ambassador Marc Thomas in this webinar with a special guest appearance from Franz Walder. It will give you the tools and know-how to stay on top of what is going on with Domino licensing. You will be able lower your cost through an optimized configuration and keep it low going forward.
These topics will be covered
- Reducing license cost by finding and fixing misconfigurations and superfluous accounts
- How do CCB and CCX licenses really work?
- Understanding the DLAU tool and how to best utilize it
- Tips for common problem areas, like team mailboxes, functional/test users, etc
- Practical examples and best practices to implement right away
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/building-and-scaling-ai-applications-with-the-nx-ai-manager-a-presentation-from-network-optix/
Robin van Emden, Senior Director of Data Science at Network Optix, presents the “Building and Scaling AI Applications with the Nx AI Manager,” tutorial at the May 2024 Embedded Vision Summit.
In this presentation, van Emden covers the basics of scaling edge AI solutions using the Nx tool kit. He emphasizes the process of developing AI models and deploying them globally. He also showcases the conversion of AI models and the creation of effective edge AI pipelines, with a focus on pre-processing, model conversion, selecting the appropriate inference engine for the target hardware and post-processing.
van Emden shows how Nx can simplify the developer’s life and facilitate a rapid transition from concept to production-ready applications.He provides valuable insights into developing scalable and efficient edge AI solutions, with a strong focus on practical implementation.
5th LF Energy Power Grid Model Meet-up SlidesDanBrown980551
5th Power Grid Model Meet-up
It is with great pleasure that we extend to you an invitation to the 5th Power Grid Model Meet-up, scheduled for 6th June 2024. This event will adopt a hybrid format, allowing participants to join us either through an online Mircosoft Teams session or in person at TU/e located at Den Dolech 2, Eindhoven, Netherlands. The meet-up will be hosted by Eindhoven University of Technology (TU/e), a research university specializing in engineering science & technology.
Power Grid Model
The global energy transition is placing new and unprecedented demands on Distribution System Operators (DSOs). Alongside upgrades to grid capacity, processes such as digitization, capacity optimization, and congestion management are becoming vital for delivering reliable services.
Power Grid Model is an open source project from Linux Foundation Energy and provides a calculation engine that is increasingly essential for DSOs. It offers a standards-based foundation enabling real-time power systems analysis, simulations of electrical power grids, and sophisticated what-if analysis. In addition, it enables in-depth studies and analysis of the electrical power grid’s behavior and performance. This comprehensive model incorporates essential factors such as power generation capacity, electrical losses, voltage levels, power flows, and system stability.
Power Grid Model is currently being applied in a wide variety of use cases, including grid planning, expansion, reliability, and congestion studies. It can also help in analyzing the impact of renewable energy integration, assessing the effects of disturbances or faults, and developing strategies for grid control and optimization.
What to expect
For the upcoming meetup we are organizing, we have an exciting lineup of activities planned:
-Insightful presentations covering two practical applications of the Power Grid Model.
-An update on the latest advancements in Power Grid -Model technology during the first and second quarters of 2024.
-An interactive brainstorming session to discuss and propose new feature requests.
-An opportunity to connect with fellow Power Grid Model enthusiasts and users.
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
Main news related to the CCS TSI 2023 (2023/1695)Jakub Marek
An English 🇬🇧 translation of a presentation to the speech I gave about the main changes brought by CCS TSI 2023 at the biggest Czech conference on Communications and signalling systems on Railways, which was held in Clarion Hotel Olomouc from 7th to 9th November 2023 (konferenceszt.cz). Attended by around 500 participants and 200 on-line followers.
The original Czech 🇨🇿 version of the presentation can be found here: https://www.slideshare.net/slideshow/hlavni-novinky-souvisejici-s-ccs-tsi-2023-2023-1695/269688092 .
The videorecording (in Czech) from the presentation is available here: https://youtu.be/WzjJWm4IyPk?si=SImb06tuXGb30BEH .
TrustArc Webinar - 2024 Global Privacy SurveyTrustArc
How does your privacy program stack up against your peers? What challenges are privacy teams tackling and prioritizing in 2024?
In the fifth annual Global Privacy Benchmarks Survey, we asked over 1,800 global privacy professionals and business executives to share their perspectives on the current state of privacy inside and outside of their organizations. This year’s report focused on emerging areas of importance for privacy and compliance professionals, including considerations and implications of Artificial Intelligence (AI) technologies, building brand trust, and different approaches for achieving higher privacy competence scores.
See how organizational priorities and strategic approaches to data security and privacy are evolving around the globe.
This webinar will review:
- The top 10 privacy insights from the fifth annual Global Privacy Benchmarks Survey
- The top challenges for privacy leaders, practitioners, and organizations in 2024
- Key themes to consider in developing and maintaining your privacy program
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdfChart Kalyan
A Mix Chart displays historical data of numbers in a graphical or tabular form. The Kalyan Rajdhani Mix Chart specifically shows the results of a sequence of numbers over different periods.
Best 20 SEO Techniques To Improve Website Visibility In SERPPixlogix Infotech
Boost your website's visibility with proven SEO techniques! Our latest blog dives into essential strategies to enhance your online presence, increase traffic, and rank higher on search engines. From keyword optimization to quality content creation, learn how to make your site stand out in the crowded digital landscape. Discover actionable tips and expert insights to elevate your SEO game.
Webinar: Designing a schema for a Data WarehouseFederico Razzoli
Are you new to data warehouses (DWH)? Do you need to check whether your data warehouse follows the best practices for a good design? In both cases, this webinar is for you.
A data warehouse is a central relational database that contains all measurements about a business or an organisation. This data comes from a variety of heterogeneous data sources, which includes databases of any type that back the applications used by the company, data files exported by some applications, or APIs provided by internal or external services.
But designing a data warehouse correctly is a hard task, which requires gathering information about the business processes that need to be analysed in the first place. These processes must be translated into so-called star schemas, which means, denormalised databases where each table represents a dimension or facts.
We will discuss these topics:
- How to gather information about a business;
- Understanding dictionaries and how to identify business entities;
- Dimensions and facts;
- Setting a table granularity;
- Types of facts;
- Types of dimensions;
- Snowflakes and how to avoid them;
- Expanding existing dimensions and facts.
1. AMIR BAGHDADI
Student Number 2802166
Second Year
CIRCUITS, SIGNALS AND SYSTEMS WORKSHOP
MATLAB and Simulink Exercises during a Computer Workshop – 1 hour per week for
the first 10 weeks. You will carry out the following nine exercises:
Exercise 1: Simulink Model to display a sinusoidal signal on an oscilloscope. Investigate
the effect of changing its amplitude, frequency, dc bias, and phase. Also displays the
RMS
value of the signal.
Exercise 2: Progressive synthesis of a bipolar square wave from sinusoidal signals in
the
Trigonometric Fourier Series of this waveform. Shows plots of the fundamental
frequency
alone, progressively adds the third, fifth, seventh harmonics weighted with coefficients
up
until the 19
th
harmonic. Finishes with a 3-D surface representing the gradual
transformation of a sine wave into a square wave.
Exercise 3: Progressive synthesis of a unipolar triangular wave from sinusoidal signals
in
the Trigonometric Fourier Series of this waveform. Shows a plot of the DC offset
followed
by the fundamental frequency added to it, progressively adds the third, fifth, seventh
harmonics weighted with coefficients up until the 19
th
harmonic. Finishes with a 3-D
surface representing the gradual transformation of a sine wave into a triangular wave.
Exercise 4: Progressive synthesis of a half-wave rectified sine waveform from sinusoidal
signals in the Trigonometric Fourier Series of this waveform. Shows a plot of the DC
offset followed by the fundamental frequency added to it, progressively adds the
second,
fourth, sixth harmonics weighted with coefficients up until the 8
th
harmonic.
Exercise 5: Find the Trigonometric Fourier series of a sawtooth waveform and
synthesize
it by writing a MATLAB program to verify the solution.
Exercise 6: Find the Discrete Fourier Transform (DFT) of a signal f(t) by using the Fast
Fourier Transform (FFT) algorithm in MATLAB. With exercises 6.1: Find the frequencies
in a noiseless (deterministic) signal y(t); and 6.2 Find the frequencies in a noisy signal
y(t)
Exercise 7: Find the power frequency spectrum of three signals with exercises 7.1, 7.2
and
7.3.
1
2. AMIR BAGHDADI
Student Number 2802166
Second Year
Exercise 8: Simulink prediction of the unit step response of some first and second order
circuits. Model the circuit with a transfer function and analytically predict its time
response. Verify with a MATLAB/SIMULINK simulation.
Exercise 9: MATLAB prediction of the frequency response of filter circuits. Sketch Bode
plots of given circuit transfer functions. Compare you sketch with a MATLAB Bode plot.
Predict the frequency response of Low pass, High pass, Band pass, Band stop, Phase
Advance and Phase Lag circuits.
EXERCISE 2: FOURIER SERIES OF SQUARE WAVE
Aim: To show that the Fourier series expansion for a square-wave is made up of a
sum of odd harmonics.
You will show this graphically using MATLAB. Type in step one only to see what it does
(there is no need for the pause at his stage. A sine wave will be displayed.)
1. Start by forming a time vector running from 0 to 10 in steps of 0.1, and take the
sine of all the points. Let's plot this fundamental frequency.
t = 0:.1:10; (%creates a vector of values from zero to ten in steps of 0.1%)
y = sin(t); (%creates a vector y with values that are the sine of the values in the
vector t%)
plot(t,y); (% plots the vector t against the vector y%)
pause; (% the pause is overcome by pressing any button%)
2
4. AMIR BAGHDADI
Student Number 2802166
Second Year
2. Now add the third harmonic weighted by a third to the fundamental, and plot it.
y = sin(t) + sin(3*t)/3; (%creates a vector y%)
plot(t,y); (% plot the time vector t against the vector y %)
pause;
4
6. AMIR BAGHDADI
Student Number 2802166
Second Year
3. Now add the first, third, fifth, seventh, and ninth harmonics each weighted
respectively by a third, a fifth, a seventh, and a ninth)
y = sin(t) + sin(3*t)/3 + sin(5*t)/5 + sin(7*t)/7 + sin(9*t)/9;
plot(t,y);
pause;
6
8. AMIR BAGHDADI
Student Number 2802166
Second Year
4. For a finale, we will go from the fundamental to the 19th harmonic, creating
vectors of successively more harmonics, and saving all intermediate steps as the
rows of a matrix. These vectors are plotted on the same figure to show the
evolution of the square wave.
t = 0:.02:3.14; (% create a vector with values from zero Pi %)
y = zeros(10, length(t));
x = zeros(size(t));
for k=1:2:19
x = x + sin(k*t)/k;
y((k+1)/2,:) = x;
end
plot(y(1:2:9,:)')
title('The building of a square wave')
pause;
5. Here is a 3-D surface representing the gradual transformation of a sine wave into a
square wave.
surf(y);
8
10. AMIR BAGHDADI
Student Number 2802166
Second Year
EXERCISE 3: FOURIER SERIES OF TRIANGULAR WAVE
Aim: To show that the Fourier series expansion for a triangular-wave shown in
figure 2 is made up of a sum of odd harmonics and a constant term.
You will show this graphically using MATLAB.
Then start by forming a time vector running from 0 to 10 in steps of 0.1.
1. t = [0:0.1:10];
2. Lets plot the DC term V/2
t =[0:0.1:10];
y =5;
figure;
plot(t,y);
title('The constant term = 5 V')
10
13. AMIR BAGHDADI
Student Number 2802166
Second Year
The constant term=5V
6
5.8
5.6
5.4
5.2
5
4.8
4.6
4.4
4.2
4
0 1 2 3 4 5 6 7 8 9 10
3. Next plot the DC term plus the fundamental
y = 5 + (40/(pi*pi))*cos(t);
figure;
plot(t,y);
title('The constant term of 5 V plus fundamental frequency')
13
16. AMIR BAGHDADI
Student Number 2802166
Second Year
The constant term of 5V plus fundamental frequency
10
9
8
7
6
5
4
3
2
1
0
0 1 2 3 4 5 6 7 8 9 10
4. Now add the constant 5, the fundamental and third harmonic, and plot it.
y = 5+ (40/(pi*pi))*cos(t) + (40/((3*pi)*(3*pi)))*cos(3*t);
figure;
plot(t,y);
title('The constant term plus fundamental frequency plus thirdharmonic')
16
19. AMIR BAGHDADI
Student Number 2802166
Second Year
The constant term fundamental frequency plus third harmonic
10
9
8
7
6
5
4
3
2
1
0
0 1 2 3 4 5 6 7 8 9 10
5. Plot the sum of constant , fundamental, 3
rd
and 5
th
harmonics
y = 5+ (40/(pi*pi))*cos(t) + (40/((3*pi)*(3*pi)))*cos(3*t) +
(40/((5*pi)*(5*pi)))*cos(5*t);
figure;
plot(t,y);
title('Constant term, fundamental, 3rd and 5th harmonics')
19
22. AMIR BAGHDADI
Student Number 2802166
Second Year
Constant term, fundamental, 3rd and 5th harmonics
10
9
8
7
6
5
4
3
2
1
0
0 1 2 3 4 5 6 7 8 9 10
6. Finally, plot individual terms in the series on the same graph up to the 19
th
harmonic
x = 5;
for k = 1:2:19
x = x + (40/((k*pi)*(k*pi)))*cos(k*t);
y((k+1)/2,:) = x;
end
figure;
plot(y(1:2:9,:)');
title('Constant term, fundamental, 3rd, 5th, 7th upto 19th harmonics');
22
25. AMIR BAGHDADI
Student Number 2802166
Second Year
Constant term, fundamental, 3rd, 5th, 7th upto 19th harmonics
10
9
8
7
6
5
4
3
2
1
0
0 20 40 60 80 100 120
7. Show the above as a 3-D surface representing the gradual transformation of cosine
waves into a triangular wave. Note that the coefficients decrease as 1/n
surf(y);
shading interp
axis off ij
25
28. AMIR BAGHDADI
Student Number 2802166
Second Year
3D Surface of a triangular wave
EXERCISE 4: Fourier Series Of Half Rectified Sine Wave
Aim: To show that the Fourier series expansion for a half-wave rectified sine
waveform is made up of a sum a constant term and even harmonics
of sine and cosine waves.
You will show this graphically using MATLAB.
t = [0:0.1:10];
y =10/pi;
figure;
plot(t,y);
title('The constant term ')
28
30. AMIR BAGHDADI
Student Number 2802166
Second Year
y = (10/pi)*(1 + (pi/2))*sin(t);
figure;
plot(t,y);
title('The constant term plus fundamental frequency')
30
32. AMIR BAGHDADI
Student Number 2802166
Second Year
y = (10/pi)*(1 + (pi/2)*sin(t)-(2/3)*cos(2*t));
figure;
plot(t,y);
title('The constant term plus fundamental frequency plus thirdharmonic')
32
34. AMIR BAGHDADI
Student Number 2802166
Second Year
y = (10/pi)*(1 + (pi/2)*sin(t)-(2/3)*cos(2*t)-(2/15)*cos(4*t));
figure;
plot(t,y);
title('Constant term, fundamental, 2nd and 4th harmonics')
34
36. AMIR BAGHDADI
Student Number 2802166
Second Year
y = (10/pi)*(1 + (pi/2)*sin(t)-(2/3)*cos(2*t)-(2/15)*cos(4*t)-
(2/35)*cos(6*t));
figure;
plot(t,y);
title('Constant term, fundamental, 2nd and 4th harmonics')
36
38. AMIR BAGHDADI
Student Number 2802166
Second Year
EXERCISE 5: Exercise in solving Trigonometric Fourier Series
Show that the Trigonometric Fourier series of the sawtooth wave
38
40. AMIR BAGHDADI
Student Number 2802166
Second Year
The constant term plus fundamental frequency
8
6
4
2
0
-2
-4
-6
-8
0 1 2 3 4 5 6 7 8 9 10
40
41. AMIR BAGHDADI
Student Number 2802166
Second Year
The constant term, fundamental frequency and third harmonic
10
8
6
4
2
0
-2
-4
-6
-8
-10
0 1 2 3 4 5 6 7 8 9 10
41
42. AMIR BAGHDADI
Student Number 2802166
Second Year
The constant term, fundamental frequency, 2nd harmonic and 3rd harmonic
10
8
6
4
2
0
-2
-4
-6
-8
-10
0 1 2 3 4 5 6 7 8 9 10
42
43. AMIR BAGHDADI
Student Number 2802166
Second Year
The constant term, fundamental frequency, 2nd, 3rd and 4th harmonics
10
8
6
4
2
0
-2
-4
-6
-8
-10
0 1 2 3 4 5 6 7 8 9 10
EXERCISE 6: Find the Discrete Fourier Transform (DFT) of a signal f(t) by using
the Fast Fourier Transform (FFT) algorithm in MATLAB
Fourier analysis is extremely useful for data analysis, as it breaks down a signal into
constituent sinusoids of different frequencies.
1. For analogue (continuous-time) signals, the Fourier Transform of a signal f(t) is
dt e t f G
t jw -
+8
8-
∫
= ) ( ) (ω
2. For sampled vector data, Fourier analysis is performed using the Discrete Fourier
transform (DFT).
0 0.001 0.002 0.003 0.004 0.005 0.006 0.007 0.008 0.009 0.01
-0.2
0
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
Continuous-time Signal
Sampled signal
(Sampling period = 1 mS)
Figure 1: Sample and Hold circuit (ADC)
The fast Fourier transform (FFT) is an efficient algorithm for computing the DFT of a
43
44. AMIR BAGHDADI
Student Number 2802166
Second Year
sequence; it is not a separate transform. It is particularly useful in areas such as signal
and
image processing, where its uses range from filtering, convolution, and frequency
analysis
to power spectrum estimation.
The following exercises (6.1, 6.2, 7.1, 7.2 and 7.3) will investigate the Discrete Fourier
Transform and show you that a real continuous-time signal y(t) can be sampled (e.g.
with
an analogue to digital converter ADC as shown in figure 1) and the vector of discrete-
time
data ‘y’ fed to the MATLAB algorithm fft(y) which will compute the Fourier Transform
and plot the frequency spectrum.
•The signal y(t) is sampled with a constant sampling period.
•The sampled data is input to MATLAB by putting the data in a vector ‘y’.
•The FFT algorithm operates on the data vector y and returns the frequency
spectrum in a vector Y where Y = fft(y, N). The elements of Y are complex
numbers to accommodate the fact that the spectrum has both a modulus and phase
at each frequency. N is the number of points over which the FFT will be computed
•To present the results, each element of Y is multiplied by its complex conjugate to
give a real value and this value is normalized by dividing it by the number of
points N in the FFT algorithm.
Yy = Y.* conj(Y)/N
•The final result is plotted to show the power at each contributing frequency
44
45. AMIR BAGHDADI
Student Number 2802166
Second Year
Deterministic signal with two frequency components at 50Hz and 120 Hz
2
1.5
1
0.5
0
-0.5
-1
-1.5
-2
0 5 10 15 20 25 30 35 40 45 50
time (milliseconds)
45
46. AMIR BAGHDADI
Student Number 2802166
Second Year
Frequency content of y
80
70
60
50
40
30
20
10
0
0 50 100 150 200 250 300 350 400 450 500
frequency (Hz)
46
47. AMIR BAGHDADI
Student Number 2802166
Second Year
Noisy signal with two frequency components
8
6
4
2
0
-2
-4
-6
-8
0 5 10 15 20 25 30 35 40 45 50
time (milliseconds)
47
48. AMIR BAGHDADI
Student Number 2802166
Second Year
Frequency content of y
120
100
80
60
40
20
0
0 50 100 150 200 250 300 350 400 450 500
frequency (Hz)
A. Exercise 6.1 Find the frequencies in a noiseless (deterministic) signal y(t).
Create the M-file FFT_deterministic.m, or cut and paste from Blackboard.
clear all;
t = 0:0.001:0.6;
y = sin(2*pi*50*t) + sin(2*pi*120*t) %+ sin(2*pi*200*t)
a = 1000*t(1:50);
b = y(1:50);
figure; plot(a,b);
48
50. AMIR BAGHDADI
Student Number 2802166
Second Year
clear all;
t = 0:0.001:0.6;
y = sin(2*pi*50*t) + sin(2*pi*120*t) %+ sin(2*pi*200*t)
a = 1000*t(1:50);
b = y(1:50);
figure; plot(a,b);
%figure; plot(t,y)
Y = fft(y,512);
Pyy = Y.*conj(Y)/512;
50
52. AMIR BAGHDADI
Student Number 2802166
Second Year
B. Exercise 6.2 Find the frequencies in a noisy signal y(t). Use the M-file
FFT_noisy.m
clear all;
t = 0:0.001:0.6;
x = sin(2*pi*50*t) + sin(2*pi*120*t); % + sin(2*pi*200*t)
n = 1.2*randn(size(t));
y = x + n;
a = 1000*t(1:50);
b = y(1:50);
figure; plot(a,b);
52
54. AMIR BAGHDADI
Student Number 2802166
Second Year
clear all;
t = 0:0.001:0.6;
x = sin(2*pi*50*t) + sin(2*pi*120*t); % + sin(2*pi*200*t)
n = 1.2*randn(size(t));
y = x + n;
a = 1000*t(1:50);
b = y(1:50);
figure; plot(a,b);
%figure; plot(t,y)
Y = fft(y,512);
54
55. AMIR BAGHDADI
Student Number 2802166
Second Year
Pyy = Y.*conj(Y)/512;
f = 1000*(0:256)/512;
figure; plot(f,Pyy(1:257))
55
58. AMIR BAGHDADI
Student Number 2802166
Second Year
EXERCISE 7.1 Find the frequency spectrum of a periodic rectangular signal whose
amplitude is ± 1 and the fundamental frequency is 50 Hz.
You will find the spectrum by first creating a rectangular signal from its Fourier series
and
then applying the Fast Fourier transform (FFT) algorithm to this signal to find the
frequencies contained in it. Recall that the Fourier series of this rectangular pulse was
used
to synthesize the signal in Exercise 2.
clear all,
= 0:0.001:6;
= zeros(size(t));
for k=1:2:19
x = x + sin(2*pi*50*k*t)/k;
end
y = x;
figure; plot(1000*t(1:50),y(1:50))
58
60. AMIR BAGHDADI
Student Number 2802166
Second Year
clear all,
t = 0:0.001:6;
x = zeros(size(t));
for k=1:2:19
x = x + sin(2*pi*50*k*t)/k;
end
y = x;
figure;
plot(1000*t(1:50),y(1:50))
title('Square Wave Signal')
xlabel('time (milliseconds)')
pause
60
61. AMIR BAGHDADI
Student Number 2802166
Second Year
Squarewave Signal
0.8
0.6
0.4
0.2
0
-0.2
-0.4
-0.6
-0.8
0 5 10 15 20 25 30 35 40 45 50
time (milliseconds)
Y = fft(y,512);
Pyy = Y.* conj(Y) / 512;
f = 1000*(0:356)/512;
figure;
plot(f,Pyy(1:357)) % this is a plot of the frequency versus signal power
61
63. AMIR BAGHDADI
Student Number 2802166
Second Year
Y = fft(y,512);
Pyy = Y.* conj(Y) / 512;
f = 1000*(0:356)/512;
figure;
plot(f,Pyy(1:357)) % this is a plot of the frequency versus signal power
title('Frequency content of y')
xlabel('Frequency (HZ)')
63
64. AMIR BAGHDADI
Student Number 2802166
Second Year
Frequency content of y
70
60
50
40
30
20
10
0
0 100 200 300 400 500 600 700
Frequency (Hz)
EXERCISE 7.2 Find the power frequency spectrum of a single shot (non-repeating)
rectangular pulse. Let amplitude A = 1 and pulse width = 1 second. Use the M-file
FFT_Pulse.m
t = 0:0.1:2;
y = [1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0];
figure;
plot(t(1:20),y(1:20))
64
70. AMIR BAGHDADI
Student Number 2802166
Second Year
Frequency content of y
0.2
0.18
0.16
0.14
0.12
0.1
0.08
0.06
0.04
0.02
0
0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5
frequency (Hz)
EXERCISE 7.3 Find the power frequency spectrum of a single shot (non-repeating)
unit pulse (area 1). Let amplitude A = 10 to represent infinity and pulse width = 0
second. Use the M-file FFT_UnitPulse.m
t = 0:0.1:2;
y = [10 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ];
figure;
plot(t(1:20),y(1:20))
70
76. AMIR BAGHDADI
Student Number 2802166
Second Year
Frequency content of y
1.5
1
0.5
0
-0.5
-1
0 0.5 1 1.5 2 2.5 3 3.5 4 4.5 5
frequency (Hz)
EXERCISE 8: Find the Transfer Function of a circuit, find its step response and
frequency spectrum (using MATLAB) by carrying out steps 1 to 5:
1. Show that equation 1 is the differential equation describing the dynamics of the
following series RLC circuit
76