Fast fourier transform
Hiérarchie des fichiers
Téléchargements | ||||||
Fichiers hébergés | (15021) | |||||
TI-Nspire | (2483) | |||||
Cours et Formulaires | (528) |
Actions
Vote :
Informations
Auteur Author: redsharp
Type : Classeur 4.5
Taille Size: 3.41 Ko KB
Mis en ligne Uploaded: 19/11/2019 - 09:48:53
Uploadeur Uploader: redsharp (Profil)
Téléchargements Downloads: 101
Visibilité Visibility: Archive publique
Shortlink : http://ti-pla.net/a2432225
Type : Classeur 4.5
Taille Size: 3.41 Ko KB
Mis en ligne Uploaded: 19/11/2019 - 09:48:53
Uploadeur Uploader: redsharp (Profil)
Téléchargements Downloads: 101
Visibilité Visibility: Archive publique
Shortlink : http://ti-pla.net/a2432225
Description
discrete time fast fourier transform. input must be only power of 2 (2^n).
its only calculate 16 point fft. but if you write reverse bit arrays in the program . You can calculate the fft up to the point you want
its only calculate 16 point fft. but if you write reverse bit arrays in the program . You can calculate the fft up to the point you want