ECS455: Chapter 5 OFDM
|
|
- Winfred Matthews
- 5 years ago
- Views:
Transcription
1 ECS455: Chapter 5 OFDM 5.4 Cyclic Prefix (CP) 1 Dr.Prapun Suksopong prapun.co/ecs455 Office Hours: BKD Tuesday 9:30-10:30 Friday 14:00-16:00
2 Three steps towards odern OFDM 1. Mitigate Multipath (ISI): Decrease the rate of the original data strea via ulticarrier odulation (FDM) 2. Gain Spectral Efficiency: Utilize orthogonality 3. Achieve Efficient Ipleentation: FFT and IFFT Extra step: Copletely eliinate ISI and ICI Cyclic prefix 2
3 Cyclic Prefix: Motivation (1) Recall: Multipath Fading and Delay Spread 3
4 Cyclic Prefix: Motivation (2) OFDM uses large sybol duration T s copared to the duration of the ipulse response τ ax of the channel to reduce the aount of ISI Q: Can we eliinate the ultipath (ISI) proble? To reduce the ISI, add guard interval larger than that of the estiated delay spread. If the guard interval is left epty, the orthogonality of the sub-carriers no longer holds, i.e., ICI (inter-channel interference) still exists. To prevent both the ISI as well as the ICI, OFDM sybol is cyclically extended into the guard interval. 4
5 5 Cyclic Prefix
6 N n v v-1 N N-1 Recall: Convolution x Flip Shift Multiply (pointwise) Add h h = h 0 h 1 x hn xhn h n h N 1 h N h N + L 1 6
7 N n n v v-1 v v-1 N N-1 N N-1 Circular Convolution x (Regular Convolution) x h h h = h 0 h = h 0 h 1 h 1 h n h n h N 1 h N 1 7 Replicate x (now it looks periodic) Then, perfor the usual convolution only on n = 0 to N-1 h N h N + L 1
8 Circular Convolution: Exaples 1 Find
9 Discussion Regular convolution of an N 1 point vector and an N 2 point vector gives (N 1 +N 2-1)-point vector. Circular convolution is perfor between two equal-length vectors. The results also has the sae length. Circular convolution can be used to find the regular convolution by zero-padding. Zero-pad the vectors so that their length is N 1 +N 2-1. Exaple: In odern OFDM, we want to perfor circular convolution via regular convolution. 9
10 Circular Convolution in Counication We want the receiver to obtain the circular convolution of the signal (channel input) and the channel. Q: Why? A: CTFT: convolution in tie doain corresponds to ultiplication in frequency doain. This fact does not hold for DFT. DFT: circular convolution in (discrete) tie doain corresponds to ultiplication in (discrete) frequency doain. We want to have ultiplication in frequency doain. So, we want circular convolution and not the regular convolution. Proble: Real channel does regular convolution. Solution: With cyclic prefix, regular convolution can be used to create circular convolution. 10
11 0 0 Exaple Solution: ? Let s look closer at how we carry out the circular convolution operation. Recall that we replicate the x and then perfor the regular convolution (for N points) Goal: Get these nubers using regular convolution
12 Exaple ? Observation: We don t need to replicate the x indefinitely. Furtherore, when h is shorter than x, we don t even need a full replica. Not needed in the calculation
13 Exaple *? Copy the last saples of the sybols at the beginning of the sybol. This partial replica is called the cyclic prefix Try this: use only the necessary part of the replica and then convolute (regular convolution) with the channel Junk!
14 Exaple 2 We now know that * Cyclic Prefix Siilarly, you ay check that * Cyclic Prefix
15 Exaple 3 We know, fro Exaple 2, that [ ] * [3 2 1] = [ ] And that [ ] * [3 2 1] = [ ] Check that [ ] * [3 2 1] = [ ] and [ ] * [3 2 1] = [ ] 15
16 Exaple 4 We know that [ ] * [3 2 1] = [ ] [ ] * [3 2 1] = [ ] Using Exaple 3, we have [ ] * [3 2 1] = [ ] +[ ] * [3 2 1] = [ ] +[ ] = [ ] 16
17 Putting results together Suppose x (1) = [ ] and x (2) = [ ] Suppose h = [3 2 1] At the receiver, we want to get * [ ] * [ ] = [ ] We transit [ ]. [ ] [ ] = [ ] Cyclic prefix Cyclic prefix At the receiver, we get [ ] * [3 2 1] = [ ] 17 Junk! To be thrown away by the receiver.
18 Circular Convolution: Key Properties Consider an N-point signal x[n] Cyclic Prefix (CP) insertion: If x[n] is extended by copying the last saples of the sybols at the beginning of the sybol: xn Key Property 1: Key Property 2: x n, 0 n N 1 x n N, v n 1 h x n h* x n for 0 n N 1 FFT h x n H X k k 18
19 19 OFDM with CP for Channel w/ Meory We want to send N saples S 0, S 1,, S N-1 across noisy channel with eory. First apply IFFT: Then, add cyclic prefix This is inputted to the channel. The output is Reove cyclic prefix to get Then apply FFT: Sk IFFT s n,, 1, 0,, 1 s s N s N s s N,, 1, 0,, 1 rn hn snwn FFT y n p N p N r r N r n R k By circular convolution property of DFT, Rk HkSk W No ICI! k
20 OFDM Syste Design: CP A good ratio between the CP interval and sybol duration should be found, so that all ultipaths are resolved and not significant aount of energy is lost due to CP. As a thub rule, the CP interval ust be two to four ties larger than the root ean square (RMS) delay spread. 20 [Tarokh, 2009, Fig 2.9]
21 Reference A. Bahai, B. R. Saltzberg, and M. Ergen, Multi-Carrier Digital Counications: Theory and Applications of OFDM, 2nd ed., New York: Springer Verlag,
ECS455: Chapter 5 OFDM. ECS455: Chapter 5 OFDM. OFDM: Overview. OFDM Applications. Dr.Prapun Suksompong prapun.com/ecs455
ECS455: Chapter 5 OFDM OFDM: Overview Let S = (S 1, S 2,, S ) contains the information symbols. S IFFT FFT Inverse fast Fourier transform Fast Fourier transform 1 Dr.Prapun Suksompong prapun.com/ecs455
More informationMobile Communications TCS 455
Mobile Counication TCS 455 Dr. Prapun Sukopong prapun@iit.tu.ac.th Lecture 24 1 Office Hour: BKD 3601-7 Tueday 14:00-16:00 Thurday 9:30-11:30 Announceent Read Chapter 9: 9.1 9.5 Section 1.2 fro [Bahai,
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Processing Prof. Mark Fowler Note Set #21 Using the DFT to Implement FIR Filters Reading Assignment: Sect. 7.3 of Proakis & Manolakis Motivation: DTFT View of Filtering There are
More informationEE6604 Personal & Mobile Communications. Week 15. OFDM on AWGN and ISI Channels
EE6604 Personal & Mobile Communications Week 15 OFDM on AWGN and ISI Channels 1 { x k } x 0 x 1 x x x N- 2 N- 1 IDFT X X X X 0 1 N- 2 N- 1 { X n } insert guard { g X n } g X I n { } D/A ~ si ( t) X g X
More informationDFT-Based FIR Filtering. See Porat s Book: 4.7, 5.6
DFT-Based FIR Filtering See Porat s Book: 4.7, 5.6 1 Motivation: DTFT View of Filtering There are two views of filtering: * Time Domain * Frequency Domain x[ X f ( θ ) h[ H f ( θ ) Y y[ = h[ * x[ f ( θ
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationN-Point. DFTs of Two Length-N Real Sequences
Coputation of the DFT of In ost practical applications, sequences of interest are real In such cases, the syetry properties of the DFT given in Table 5. can be exploited to ake the DFT coputations ore
More informationConvolutional Codes. Lecture Notes 8: Trellis Codes. Example: K=3,M=2, rate 1/2 code. Figure 95: Convolutional Encoder
Convolutional Codes Lecture Notes 8: Trellis Codes In this lecture we discuss construction of signals via a trellis. That is, signals are constructed by labeling the branches of an infinite trellis with
More informationComplexity reduction in low-delay Farrowstructure-based. filters utilizing linear-phase subfilters
Coplexity reduction in low-delay Farrowstructure-based variable fractional delay FIR filters utilizing linear-phase subfilters Air Eghbali and Håkan Johansson Linköping University Post Print N.B.: When
More informationAnalyzing Simulation Results
Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient
More informationEfficient Filter Banks And Interpolators
Efficient Filter Banks And Interpolators A. G. DEMPSTER AND N. P. MURPHY Departent of Electronic Systes University of Westinster 115 New Cavendish St, London W1M 8JS United Kingdo Abstract: - Graphical
More informationSingle-Carrier Block Transmission With Frequency-Domain Equalisation
ELEC6014 RCNSs: Additional Topic Notes Single-Carrier Block Transmission With Frequency-Domain Equalisation Professor Sheng Chen School of Electronics and Computer Science University of Southampton Southampton
More informationFourier Series Summary (From Salivahanan et al, 2002)
Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t
More informationALGEBRA REVIEW. MULTINOMIAL An algebraic expression consisting of more than one term.
Page 1 of 6 ALGEBRAIC EXPRESSION A cobination of ordinary nubers, letter sybols, variables, grouping sybols and operation sybols. Nubers reain fixed in value and are referred to as constants. Letter sybols
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informationOn Constant Power Water-filling
On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives
More informationNagoya Institute of Technology
09.03.19 1 2 OFDM SC-FDE (single carrier-fde)ofdm PAPR 3 OFDM SC-FDE (single carrier-fde)ofdm PAPR 4 5 Mobility 2G GSM PDC PHS 3G WCDMA cdma2000 WLAN IEEE802.11b 4G 20112013 WLAN IEEE802.11g, n BWA 10kbps
More information26 Impulse and Momentum
6 Ipulse and Moentu First, a Few More Words on Work and Energy, for Coparison Purposes Iagine a gigantic air hockey table with a whole bunch of pucks of various asses, none of which experiences any friction
More informationThe Transactional Nature of Quantum Information
The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.
More informationUsing a De-Convolution Window for Operating Modal Analysis
Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis
More informationMulti-Scale/Multi-Resolution: Wavelet Transform
Multi-Scale/Multi-Resolution: Wavelet Transfor Proble with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of different frequencies. A serious drawback in transforing to the
More informationSOLVING LITERAL EQUATIONS. Bundle 1: Safety & Process Skills
SOLVING LITERAL EQUATIONS Bundle 1: Safety & Process Skills Solving Literal Equations An equation is a atheatical sentence with an equal sign. The solution of an equation is a value for a variable that
More informationINTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN
INTELLECTUAL DATA ANALYSIS IN AIRCRAFT DESIGN V.A. Koarov 1, S.A. Piyavskiy 2 1 Saara National Research University, Saara, Russia 2 Saara State Architectural University, Saara, Russia Abstract. This article
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationStandard & Canonical Forms
Standard & Canonical Fors CHAPTER OBJECTIVES Learn Binary Logic and BOOLEAN AlgebraLearn How to ap a Boolean Expression into Logic Circuit Ipleentation Learn How To anipulate Boolean Expressions and Siplify
More informationIntroduction to Discrete Optimization
Prof. Friedrich Eisenbrand Martin Nieeier Due Date: March 9 9 Discussions: March 9 Introduction to Discrete Optiization Spring 9 s Exercise Consider a school district with I neighborhoods J schools and
More informationTactics Box 2.1 Interpreting Position-versus-Time Graphs
1D kineatic Retake Assignent Due: 4:32p on Friday, October 31, 2014 You will receive no credit for ites you coplete after the assignent is due. Grading Policy Tactics Box 2.1 Interpreting Position-versus-Tie
More informationPattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition
More informationTime-of-flight Identification of Ions in CESR and ERL
Tie-of-flight Identification of Ions in CESR and ERL Eric Edwards Departent of Physics, University of Alabaa, Tuscaloosa, AL, 35486 (Dated: August 8, 2008) The accuulation of ion densities in the bea pipe
More informationarxiv: v3 [cs.ds] 22 Mar 2016
A Shifting Bloo Filter Fraewor for Set Queries arxiv:1510.03019v3 [cs.ds] Mar 01 ABSTRACT Tong Yang Peing University, China yangtongeail@gail.co Yuanun Zhong Nanjing University, China un@sail.nju.edu.cn
More information1 Proof of learning bounds
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a
More informationBirthday Paradox Calculations and Approximation
Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays
More informationA Computationally Efficient Block Transmission Scheme Based on Approximated Cholesky Factors
A Computationally Efficient Block Transmission Scheme Based on Approximated Cholesky Factors C. Vincent Sinn Telecommunications Laboratory University of Sydney, Australia cvsinn@ee.usyd.edu.au Daniel Bielefeld
More informationModule 3. Convolution. Aim
Module Convolution Digital Signal Processing. Slide 4. Aim How to perform convolution in real-time systems efficiently? Is convolution in time domain equivalent to multiplication of the transformed sequence?
More informationImpact of Imperfect Channel State Information on ARQ Schemes over Rayleigh Fading Channels
This full text paper was peer reviewed at the direction of IEEE Counications Society subject atter experts for publication in the IEEE ICC 9 proceedings Ipact of Iperfect Channel State Inforation on ARQ
More informationANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER
IEPC 003-0034 ANALYSIS OF HALL-EFFECT THRUSTERS AND ION ENGINES FOR EARTH-TO-MOON TRANSFER A. Bober, M. Guelan Asher Space Research Institute, Technion-Israel Institute of Technology, 3000 Haifa, Israel
More informationOcean 420 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers
Ocean 40 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers 1. Hydrostatic Balance a) Set all of the levels on one of the coluns to the lowest possible density.
More informationDiscussion Examples Chapter 13: Oscillations About Equilibrium
Discussion Exaples Chapter 13: Oscillations About Equilibriu 17. he position of a ass on a spring is given by x 6.5 c cos t 0.88 s. (a) What is the period,, of this otion? (b) Where is the ass at t 0.5
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationWhen Short Runs Beat Long Runs
When Short Runs Beat Long Runs Sean Luke George Mason University http://www.cs.gu.edu/ sean/ Abstract What will yield the best results: doing one run n generations long or doing runs n/ generations long
More informationSPECTRUM sensing is a core concept of cognitive radio
World Acadey of Science, Engineering and Technology International Journal of Electronics and Counication Engineering Vol:6, o:2, 202 Efficient Detection Using Sequential Probability Ratio Test in Mobile
More informationHomework 3 Solutions CSE 101 Summer 2017
Hoework 3 Solutions CSE 0 Suer 207. Scheduling algoriths The following n = 2 jobs with given processing ties have to be scheduled on = 3 parallel and identical processors with the objective of iniizing
More informationBEE604 Digital Signal Processing
BEE64 Digital Signal Processing Copiled by, Mrs.S.Sherine Assistant Professor Departent of EEE BIHER. COTETS Sapling Discrete Tie Fourier Transfor Properties of DTFT Discrete Fourier Transfor Inverse Discrete
More informationNUMERICAL MODELLING OF THE TYRE/ROAD CONTACT
NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT PACS REFERENCE: 43.5.LJ Krister Larsson Departent of Applied Acoustics Chalers University of Technology SE-412 96 Sweden Tel: +46 ()31 772 22 Fax: +46 ()31
More informationWeighted OFDMA Time-Frequency Synchronization for Space Solar Power LEO Satellites Networks: Performance and Cost Analysis
Weighted OFDMA Tie-Frequency Synchronization for Space Solar Power LEO Satellites Networs: Perforance and Cost Analysis Mohsen Jaalabdollahi, Reza Zeavat Michigan Technological University Cities in the
More informationTracking using CONDENSATION: Conditional Density Propagation
Tracking using CONDENSATION: Conditional Density Propagation Goal Model-based visual tracking in dense clutter at near video frae rates M. Isard and A. Blake, CONDENSATION Conditional density propagation
More informationn(a B) = n(a - B) + n(a B) + n(b- A) 50 = n(b- A) n(b- A) = n(b- A) =15 Now,n(B) = n(a B) + n(b- A) = = 30
Answer Keys: 1 A A A 4 A 5 B 6 C 7 A 8 D 9 B 10 B 11 B 1 C 1 A 14 A 15 C 16 D 17 A 18 C 19 B 0 B 1 A B B 4 B 5 A 6 D 7 A 8 D 9 C 0 C 1 A C B 4 A 5 B 6 A 7 C 8 B 9 B 40 C 41 C 4 D 4 B 44 A 45 B 46 D 47
More informationPrincipal Components Analysis
Principal Coponents Analysis Cheng Li, Bingyu Wang Noveber 3, 204 What s PCA Principal coponent analysis (PCA) is a statistical procedure that uses an orthogonal transforation to convert a set of observations
More informationChaotic Coupled Map Lattices
Chaotic Coupled Map Lattices Author: Dustin Keys Advisors: Dr. Robert Indik, Dr. Kevin Lin 1 Introduction When a syste of chaotic aps is coupled in a way that allows the to share inforation about each
More informationA Generalized Permanent Estimator and its Application in Computing Multi- Homogeneous Bézout Number
Research Journal of Applied Sciences, Engineering and Technology 4(23): 5206-52, 202 ISSN: 2040-7467 Maxwell Scientific Organization, 202 Subitted: April 25, 202 Accepted: May 3, 202 Published: Deceber
More informationLeast Squares Fitting of Data
Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a
More informationUndersampling (2B) Young Won Lim 4/4/12
Undersapling (2) Copyright (c) 2009-2012 Young W. Li. Perission is granted to copy, distribute and/or odify this docuent under the ters of the GNU Free Docuentation License, Version 1.2 or any later version
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationSpectrally Concentrated Impulses for Digital Multicarrier Modulation
Spectrally Concentrated Impulses for Digital ulticarrier odulation Dipl.-Ing. Stephan Pfletschinger and Prof. Dr.-Ing. Joachim Speidel Institut für Nachrichtenübertragung, Universität Stuttgart, Pfaffenwaldring
More informationA Theoretical Analysis of a Warm Start Technique
A Theoretical Analysis of a War Start Technique Martin A. Zinkevich Yahoo! Labs 701 First Avenue Sunnyvale, CA Abstract Batch gradient descent looks at every data point for every step, which is wasteful
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016/2017 Lessons 9 11 Jan 2017 Outline Artificial Neural networks Notation...2 Convolutional Neural Networks...3
More informationLecture 8: Orthogonal Frequency Division Multiplexing (OFDM)
Communication Systems Lab Spring 2017 ational Taiwan University Lecture 8: Orthogonal Frequency Division Multiplexing (OFDM) Scribe: 謝秉昂 陳心如 Lecture Date: 4/26, 2017 Lecturer: I-Hsiang Wang 1 Outline 1
More informationNational 5 Summary Notes
North Berwick High School Departent of Physics National 5 Suary Notes Unit 3 Energy National 5 Physics: Electricity and Energy 1 Throughout the Course, appropriate attention should be given to units, prefixes
More informationFigure 1: Equivalent electric (RC) circuit of a neurons membrane
Exercise: Leaky integrate and fire odel of neural spike generation This exercise investigates a siplified odel of how neurons spike in response to current inputs, one of the ost fundaental properties of
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationFinite-State Markov Modeling of Flat Fading Channels
International Telecounications Syposiu ITS, Natal, Brazil Finite-State Markov Modeling of Flat Fading Channels Cecilio Pientel, Tiago Falk and Luciano Lisbôa Counications Research Group - CODEC Departent
More informationA Model for the Selection of Internet Service Providers
ISSN 0146-4116, Autoatic Control and Coputer Sciences, 2008, Vol. 42, No. 5, pp. 249 254. Allerton Press, Inc., 2008. Original Russian Text I.M. Aliev, 2008, published in Avtoatika i Vychislitel naya Tekhnika,
More informationPh 20.3 Numerical Solution of Ordinary Differential Equations
Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationReducing Vibration and Providing Robustness with Multi-Input Shapers
29 Aerican Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June -2, 29 WeA6.4 Reducing Vibration and Providing Robustness with Multi-Input Shapers Joshua Vaughan and Willia Singhose Abstract
More informationImplementation of the Digital Phase Vocoder Using the Fast Fourier Transform
EEE TRANSACTONS ON ACOUSTCS, SPEECH, AND SGNAL PROCESSNG, VOL. ASSP-24, NO. 3, JUNE 96 243 signals with low frequencies. The characteristics will be odified due to the changing perforance of delta odulation.
More informationLinear Transformations
Linear Transforations Hopfield Network Questions Initial Condition Recurrent Layer p S x W S x S b n(t + ) a(t + ) S x S x D a(t) S x S S x S a(0) p a(t + ) satlins (Wa(t) + b) The network output is repeatedly
More informationMidterm 1 Sample Solution
Midter 1 Saple Solution NOTE: Throughout the exa a siple graph is an undirected, unweighted graph with no ultiple edges (i.e., no exact repeats of the sae edge) and no self-loops (i.e., no edges fro a
More informationExperimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis
City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna
More informationModule #1: Units and Vectors Revisited. Introduction. Units Revisited EXAMPLE 1.1. A sample of iron has a mass of mg. How many kg is that?
Module #1: Units and Vectors Revisited Introduction There are probably no concepts ore iportant in physics than the two listed in the title of this odule. In your first-year physics course, I a sure that
More informationBALLISTIC PENDULUM. EXPERIMENT: Measuring the Projectile Speed Consider a steel ball of mass
BALLISTIC PENDULUM INTRODUCTION: In this experient you will use the principles of conservation of oentu and energy to deterine the speed of a horizontally projected ball and use this speed to predict the
More informationBandpass Sampling (2B) Young Won Lim 3/27/12
andpass Sapling (2) Copyright (c) 2009-2012 Young W. Li. Perission is granted to copy, distribute and/or odify this docuent under the ters of the GNU Free Docuentation License, Version 1.2 or any later
More informationCommunications and Signal Processing Spring 2017 MSE Exam
Communications and Signal Processing Spring 2017 MSE Exam Please obtain your Test ID from the following table. You must write your Test ID and name on each of the pages of this exam. A page with missing
More informationRESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS
BIT Nuerical Matheatics 43: 459 466, 2003. 2003 Kluwer Acadeic Publishers. Printed in The Netherlands 459 RESTARTED FULL ORTHOGONALIZATION METHOD FOR SHIFTED LINEAR SYSTEMS V. SIMONCINI Dipartiento di
More informationInspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information
Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub
More information3.3 Variational Characterization of Singular Values
3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and
More informationPrerequisites. We recall: Theorem 2 A subset of a countably innite set is countable.
Prerequisites 1 Set Theory We recall the basic facts about countable and uncountable sets, union and intersection of sets and iages and preiages of functions. 1.1 Countable and uncountable sets We can
More informationECE538 Final Exam Fall 2017 Digital Signal Processing I 14 December Cover Sheet
ECE58 Final Exam Fall 7 Digital Signal Processing I December 7 Cover Sheet Test Duration: hours. Open Book but Closed Notes. Three double-sided 8.5 x crib sheets allowed This test contains five problems.
More informationMath 1600A Lecture 3, Section 002
Math 1600 Lecture 3 1 of 5 Math 1600A Lecture 3, Section 002 Announceents: More texts, solutions anuals and packages coing soon. Read Section 1.3 for next class. Work through recoended hoework questions.
More information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
More informationReduced Length Checking Sequences
Reduced Length Checing Sequences Robert M. Hierons 1 and Hasan Ural 2 1 Departent of Inforation Systes and Coputing, Brunel University, Middlesex, UB8 3PH, United Kingdo 2 School of Inforation echnology
More informationCS 179: GPU Programming. Lecture 9 / Homework 3
CS 179: GPU Programming Lecture 9 / Homework 3 Recap Some algorithms are less obviously parallelizable : Reduction Sorts FFT (and certain recursive algorithms) Parallel FFT structure (radix-2) Bit-reversed
More informationMultiple Testing Issues & K-Means Clustering. Definitions related to the significance level (or type I error) of multiple tests
StatsM254 Statistical Methods in Coputational Biology Lecture 3-04/08/204 Multiple Testing Issues & K-Means Clustering Lecturer: Jingyi Jessica Li Scribe: Arturo Rairez Multiple Testing Issues When trying
More informationDistributed Lossy Averaging
Distribute Lossy Averaging Han-I Su Departent of Electrical Engineering Stanfor University Stanfor, CA 94305, USA Eail: hanisu@stanforeu Abbas El Gaal Departent of Electrical Engineering Stanfor University
More informationAlgebraic Approach for Performance Bound Calculus on Transportation Networks
Algebraic Approach for Perforance Bound Calculus on Transportation Networks (Road Network Calculus) Nadir Farhi, Habib Haj-Sale & Jean-Patrick Lebacque Université Paris-Est, IFSTTAR, GRETTIA, F-93166 Noisy-le-Grand,
More informationModified Systematic Sampling in the Presence of Linear Trend
Modified Systeatic Sapling in the Presence of Linear Trend Zaheen Khan, and Javid Shabbir Keywords: Abstract A new systeatic sapling design called Modified Systeatic Sapling (MSS, proposed by ] is ore
More informationma x = -bv x + F rod.
Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous
More informationAutomated Frequency Domain Decomposition for Operational Modal Analysis
Autoated Frequency Doain Decoposition for Operational Modal Analysis Rune Brincker Departent of Civil Engineering, University of Aalborg, Sohngaardsholsvej 57, DK-9000 Aalborg, Denark Palle Andersen Structural
More informationOBJECTIVES INTRODUCTION
M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and
More information1 Identical Parallel Machines
FB3: Matheatik/Inforatik Dr. Syaantak Das Winter 2017/18 Optiizing under Uncertainty Lecture Notes 3: Scheduling to Miniize Makespan In any standard scheduling proble, we are given a set of jobs J = {j
More informationKernel Methods and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic
More informationIntercarrier and Intersymbol Interference Analysis of OFDM Systems on Time-Varying channels
Intercarrier and Intersymbol Interference Analysis of OFDM Systems on Time-Varying channels Van Duc Nguyen, Hans-Peter Kuchenbecker University of Hannover, Institut für Allgemeine Nachrichtentechnik Appelstr.
More informationProc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES
Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co
More informationCS 179: GPU Programming. Lecture 9 / Homework 3
CS 179: GPU Programming Lecture 9 / Homework 3 Recap Some algorithms are less obviously parallelizable : Reduction Sorts FFT (and certain recursive algorithms) Parallel FFT structure (radix-2) Bit-reversed
More informationMassachusetts Institute of Technology Quantum Mechanics I (8.04) Spring 2005 Solutions to Problem Set 4
Massachusetts Institute of Technology Quantu Mechanics I (8.04) Spring 2005 Solutions to Proble Set 4 By Kit Matan 1. X-ray production. (5 points) Calculate the short-wavelength liit for X-rays produced
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics
ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents
More informationLinear Algebra (I) Yijia Chen. linear transformations and their algebraic properties. 1. A Starting Point. y := 3x.
Linear Algebra I) Yijia Chen Linear algebra studies Exaple.. Consider the function This is a linear function f : R R. linear transforations and their algebraic properties.. A Starting Point y := 3x. Geoetrically
More information