Code Directory
 Visual Basic & VB.NET
New Code
VB.Net PDF 4.4.7
SuiteCRM Survey Rocket Plugin 1.0
Airbnb Clone Script | Airbnb Clone 4.3.1
IP2Location Geolocation Database 2018
ODBC Driver for Salesforce 1.5
Rapid PHP 2018 15.0
Bytescout BarCode Generator SDK
Data Puppy Lite (32-bit) 1.0
ProZ clone script 1.0.3
VideoCap Live Streaming SDK ActiveX 8.5
Magento Web to Print 1.0
dbForge Data Compare for MySQL 5.4
dbForge Query Builder for MySQL 4.3
ODBC Driver for NetSuite 1.2
Rapid CSS 2018 15.0
Top Code
Mann-Kendall Tau-b with Sen's Method (enhanced) 1.0
OpenCV Delphi wrapper 1.0
Fuzzy k means 1.0
ABBYY FineReader Engine 9.0
Online Food Ordeing System 1.0
Advance Auto Index-DjAmolWap 10.4
Djamolwap 13
GnuWin64 64
Advanced Forced Matrix Script 1.0
Etsy Clone Script v 2.0
BMI Calculator Widget 1.3
ECG Beat Calculation 1.0
Wasted Money Calculator
Panel Method Based 2-D Potential Flow Simulator 1.0
AdvPL Harbour Compiler 1.0
Top Rated
Output Messenger 1.8.0
Aliexpress Clone- Ec21 Script 1
Indiegogo Clone 3.0
Online Food Ordeing System 1.0
PHP Image Resize Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
Travel Portal Script 9.29
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Extended DFT 1.0
File ID: 78092

Extended DFT 1.0
Download Extended DFT 1.0http://www.mathworks.comReport Error Link
License: Freeware
File Size: 235.5 KB
Downloads: 29
Submit Rating:
Extended DFT 1.0 Description
Description: EDFT (Extended Discrete Fourier Transform) algorithm produces N-point DFT of sequence X where N is greater than the length of input data. Unlike the Fast Fourier Transform (FFT), where unknown readings outside of X are zero-padded, the EDFT algorithm for calculation of the DFT using only available data and the extended frequency set (therefore, named 'Extended DFT'). EDFT function application is simple and similar to the FFT, besides EDFT have the following additional features:

1. EDFT can extrapolate input sequence X to length N. That is, if apply EDFT for N>length(X), get the results:
F=edft(X,N)=edft(Y)=fft(Y); Y=ifft(F),
where Y is X plus non-zero forward and backward extrapolation of X to length N and/or interpolation if unknown data inside of X have been replaced by NaN (Not-a-Number).

2. EDFT can increase frequency resolution up to 1/(N*T), where T is sampling period. It is well known, that zero-padding do not increase frequency resolution of DFT, therefore the resolution of FFT algorithm is limited by the length of sequence length(X)*T. Of course, there is no magic, just FFT resolution is equal on all N frequencies, while EDFT is able to increase the resolution on some frequencies and decrease on others. The sum of resolutions along the frequency axis for both algorithms remain equal to N*length(X)*T.

3. EDFT can estimate amplitudes and phases of sinusoidal components in sequence X. Like as FFT output fft(X,N)/length(X) is proportional to amplitudes of sinusoids in X, also adding a second output argument for EDFT return the amplitude spectrum S of sequence X:

4. Input sequence of EDFT may contain NaN. The proposed algorithm can interpolate and reconstruct of missing readings or even data segments (gaps) inside of sequence X. You just need to replace unknown readings by NaN and run edft(X) or edft(X,N).

5. EDFT can run with limit to maximum number of iterations (input argument I) or either in non-iterative (I=1) mode
[F,S]=edft(X,N,I) or
where W is weight vector and consisting of specific weights for each frequency in F. W is proportional to the amplitude spectrum of the signal. So, a`priori knowledge about form of the input sequence amplitude spectrum S can be used to setup appropriate weight vector W, otherwise default (equal) weight W=ones(size(F)) will be applied. 'Stopit' is an informative (optional) output parameter. The first row of 'Stopit' showing the number of performed iteration, the second row indicate breaking of iteration reason (see EDFT help).

6. Is it possible to estimate DFT of nonuniformly (irregularly) sampled input sequence by proposed algorithm? Yes, it is. As result, the Nonuniform EDFT (NEDFT) program introduced for processing of input sequence X sampled at arbitrary time moments tk. NEDFT call line: [F,S]=nedft(X,tk,fn) will perform DFT of sequence X(tk) and return outputs F(fn) and S(fn). If frequencies fn are on different grid then used by FFT and EDFT algorithms, a simple Inverse NEDFT (INEDFT) program should be applied to reconstruct Y(tn), call line: Y=inedft(F,fn,tn).

7. Two-dimensional EDFT of array X can be calculated by applying function edft2.m, call line F=edft2(X,mrows,ncols).
See programs edft.m, nedft.m, inedft.m and edft2.m help for detailed info.
Launch also DEMO programs. Demoedft.m and Demonedft.m allows to verify the proposed algorithm's performance over iterations for the simulated test signal.
Read attached ExtendedDFT.pdf to get more comprehensive insight into suggested algorithm. Run programs edft_f2.m and edft_f3.m to recreate computer simulation results presented in the ExtendedDFT.pdf file.

License: Freeware

Related: showing, performed, iteration, Parameter, optional, donessizef, applied, stopit, informative, breaking, sampled, Algorithm, result, nonuniform, irregularly, nonuniformly, reason, help6

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 235.5 KB

Downloads: 29

More Similar Code

Extended compact genetic algorithm (ECGA) is an algorithm that can solve hard problems
in the binary domain. ECGA is reliable and accurate because of the capability of
detecting building blocks, but certain difficulties are encountered when we directly apply
ECGA to problems in the integer domain. In this paper, we propose a new algorithm that
extends ECGA, called integer extended compact genetic algorithm (iECGA). iECGA...

Extended HTML is an extension to HTML based on XML, PHP, SQL and javascript technologies.

The compiler is written in PHP 5 (so it can be deployed on a web page) and allows the developper to create in one file objets used both on client...

Tango Smileys Extended (TSE) disables the built-in WordPress smileys and extends the number of available smileys from 18 to 202. The extended smileys can be input using standard emoticon shorthand, or through the CTI (Click to Insert) interface....

XAMS - eXtended Account Management System - allows Administration of Unix-, Web-, FTP-, DNS and Mail- accounts.

Easily create accounts, set aliases and with PHP MySQL / PostgreSQL as backend you can let admins, resellers or customers...

Links 2.0 Extended is multi-platform compatible. Allows you to run a complex link directory without being overwhelmed by editing and updating HTML pages. Also it contained some features as ADS system, stats system, unlimited mailing lists support,...

Write Extended Stored Procedures for Microsoft SQL Server with ease: Supported control over input/output procedure parameters. Supported returning of arbitrary number of recordsets. .....

Extended sample of threads execution (Basic sample modified) to show how the number of threads can be changed (by user) to execute a concrete task. A maximum number (by the user) is defined and sendt to the threads. When first are finishing the...

The Warecase eXtended Task Monitor (XTM) is a powerful auxiliary tool designed for simplifying the environment of the software developer. XTM is an extended task monitoring and troubleshooting tool for Microsoft Windows 2000 OS and later versions...

Computes the DFT of N real values and returns the first
N/2+1 DFT coefficients. N is an integral power of two.

Toolbox for MMSE estimators of DFT coefficients under the generalized Gamma density

The toolbox can also be downloaded from:

The matlab files enclosed in this toolbox can be used to...

User Review for Extended DFT
- required fields

Please enter text on the image