How to get inverse discrete time Fourier transform (IDTFT) of an array?
53 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
Palguna Gopireddy
le 23 Juil 2022
Commenté : Palguna Gopireddy
le 27 Juil 2022
Apparently, there is no function to get IDTFT of an array. Is there any?
I used 'freqz(array,1)' to find the DTFT of an array from '0' to 'pi-pi/512'.
I also developed a code for DTFT for ab array A of length N from '-pi' to 'pi'
i=1
for wval=-pi:pi/512:pi
DFT(i)=sum(a.*exp(-1j*(0:N-1).*wval));
i=i+1;
end
But I do not know how to find IDTFT, when applied on a DTFT giving the original array.
0 commentaires
Réponse acceptée
Abderrahim. B
le 23 Juil 2022
Hi!
Are you trying to implement DFT and its IDFT based on their equations ?
There are optimized algorithms to calculate these equations, the very well known one is the Fast Fourier Transform(FFT) and its inverse (IFFT). You may need to refer to this link for more explanation .
Demo:
Array = [1 2 3 4 5] % Sequence
arrFFT = fft(Array) % DFT based FFT
Array = ifft(arrFFT )
Hope this helps
9 commentaires
Abderrahim. B
le 27 Juil 2022
Modifié(e) : Abderrahim. B
le 27 Juil 2022
Use fft2 and ifft2.
A = [1,2,3; 4,5,6] ;
[n_row, n_col ] = size(A) ;
A_2Dfft = fft2(A, 512, 512) ;
A_ifft2 = ifft2(A_2Dfft) ;
reconst_A = A_ifft2(1:n_row, 1:n_col) ;
isequal(reconst_A , A)
Plus de réponses (0)
Voir également
Catégories
En savoir plus sur Fourier Analysis and Filtering dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!