Error Propagation Fourier Transform
Contents |
Download Full-text PDF Propagation of uncertainty in a
Fft Error Propagation
discrete Fourier transform algorithmArticle (PDF Available) in Measurement 27(4):231-239 · June 2000 with 768 fourier transform error function ReadsDOI: 10.1016/S0263-2241(99)00068-8 1st Giovanni Betta2nd Consolatina Liguori31.42 · Università degli Studi di Salerno3rd Antonio Pietrosanto32.52 · Università degli Studi di SalernoAbstractThe problem of evaluating the uncertainty that characterises discrete Fourier transform output data is dealt with, using a method based on a ‘white box’ theoretical approach. The main sources of uncertainty (quantization, time jitter, microprocessor finite wordlength) are analysed obtaining equations useful to evaluate the uncertainty in both module and phase output values, for any hardware configuration and for any algorithm operating condition. The theoretical results, verified by both simulation and experimental tests, can be particularly useful for any designer and user of DFT-based instruments, since they allow the measurement configuration to be optimised with respect to the final uncertainty.Discover the world's research10+ million members100+ million publications100k+ research projectsJoin for free Measurement 27 (2000) 231–239www.elsevier.com/locate/measurementPropagation of uncertainty in a discrete Fourier transformalgorithma, a b*Giovanni Betta , Consolatina Liguori , Antonio PietrosantoaDepartment of Automation,Electromagnetism,Information Engineering and Industrial Mathematics,University of Cassino,Cassino(FR),ItalybDepartment of Information Engineering and Electrical Engineering,University of Salerno,Fisciano(SA),ItalyReceived 15 July 1999; accepted 14 October 1999AbstractThe problem of evaluating the uncertainty that characterises discrete Fourier transform output data is dealt with, using amethod based on a ‘white box’ theoretical approach. The main sou
Tour Start here for a quick overview of the site Help Center Detailed answers to any questions you might have Meta Discuss the workings and policies of this site About Us Learn more about Stack Overflow the company Business Learn more about hiring developers or posting ads with us Signal Processing Questions Tags Users Badges Unanswered Ask Question _ Signal Processing Stack Exchange is a question and answer site for practitioners of the art and science of signal, image and video processing. Join them; it only takes a minute: Sign up Here's how it works: Anybody can ask a question Anybody can https://www.researchgate.net/publication/245222176_Propagation_of_uncertainty_in_a_discrete_Fourier_transform_algorithm answer The best answers are voted up and rise to the top Error Propagation through an IFFT up vote 0 down vote favorite I'm not sure how to approach this problem. I will describe what I am trying to do, and what some of my matlab outputs look like. I'm not trained in signal processing or anything, so please be patient reading. I have a fourier transform of some signal, http://dsp.stackexchange.com/questions/10943/error-propagation-through-an-ifft and its frequency domain covariance matrix. For example, say my signal $x[f]$ is $100$ points long. Its covariance matrix $\Sigma$ is $100 \times 100$. I noticed that its diagonal is real, and when I plot it, it looks like a PSD. All the off diagonal elements are complex. What I wish to do, is take the IFFT of the signal $x[f] \rightarrow x[t]$, and then plot $x[t]$ with error bars from the covariance $\Sigma$. Is this possible? After I take the IFFT of $x[f]$, what do I need to do to $\Sigma?$ Thank you for reading! matlab fourier-transform statistics covariance share|improve this question asked Oct 1 '13 at 22:59 bill_e 1334 add a comment| 1 Answer 1 active oldest votes up vote 1 down vote accepted Maybe it helps you to note that the FFT or IFFT with length $N$ can be realized by multiplication with the Fourier matrix $F$, or its conjugate transpose divided by $N$ respectively. If you have the covariance matrix $\Sigma$ of your signal in frequency domain, the covariance matrix of the signal after IFFT (or multiplication with $F^H/N$) is then given by the usual way to compute the covariance matrix of a linear transform, i.e. $$\Sigma' = 1/N^2 \; F^H \
Aerospace Bioengineering Communication, Networking & Broadcasting Components, Circuits, Devices & Systems Computing & Processing Engineered Materials, Dielectrics & Plasmas Engineering Profession Fields, Waves http://ieeexplore.ieee.org/iel1/20/12599/00582534.pdf & Electromagnetics General Topics for Engineers Geoscience Nuclear Engineering Photonics & Electro-Optics Power, Energy, & Industry Applications Robotics & Control Systems Signal Processing & Analysis Transportation Browse Books & eBooks Conference Publications Courses Journals & Magazines Standards By Topic My Settings Content Alerts My Projects Search Alerts Preferences Purchase History Search History What can error propagation I access? Get Help About IEEE Xplore Feedback Technical Support Resources and Help Terms of Use What Can I Access? Subscribe Enter Search Term First Name / Given Name Family Name / Last Name / Surname Publication Title Volume Issue Start Page Search Basic Search Author Search Publication Search Advanced Search Other Search Options Command error propagation fourier Search Citation Search Search Alerts Search History Sign In Username: Password: Forgot password Other Authentication Options Create an IEEE Account Don't have an IEEE Accountyet? Register now for a free account in order to: Sign in to various IEEE sites with a single account Manage your membership Get member discounts Personalize your experience Manage your profile and order history Personal Sign In Create Account IEEE Account Change Username/Password Update Address Purchase Details Payment Options Order History View Purchased Documents Profile Information Communications Preferences Profession and Education Technical Interests Need Help? US & Canada: +1 800 678 4333 Worldwide: +1 732 981 0060 Contact & Support About IEEE Xplore Contact Us Help Terms of Use Nondiscrimination Policy Sitemap Privacy & Opting Out of Cookies A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.© Copyright 2016 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and c