zoukankan      html  css  js  c++  java
  • DFT 离散傅里叶变换 与 补零运算

    function [Xk] = dft(xn,N)
    %computes discrete fourier transform
    %---------------------------------------------
    %[Xk] = dft(xn,N)
    %Xk = DFT coeff. array over 0<= k<=N-1
    %xn = one period of periodic signal over 0<= n<= N-1
    % N = Fundamental period of xn
    %
    n = [0:1:N-1];             
    k = [0:1:N-1];             
    WN = exp(-j*2*pi/N);       
    nk = n'*k;                 
    WNnk = WN .^ nk;           
    Xk = xn * WNnk;        

    %~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~   

    x = [1,1,1,1,zeros(1,32)];
    N = 36;
    X = dft(x,N);
    magX = abs(X);
    angleX = angle(X);

    image

    image

    x = [1,1,1,1,zeros(1,8)];
    N = 12;
    X = dft(x,N);
    magX = abs(X);
    angleX = angle(X);

    image

    image

  • 相关阅读:
    ubuntu安装后要做什么
    JavaScript错误处理
    jQuery 事件
    display的用法
    百度排名的原理
    什么是ajax?
    CSS文档流
    引用CSS的方法
    jQuery的安装方式
    禁止WPS2019开机自启动
  • 原文地址:https://www.cnblogs.com/sleepy/p/2095951.html
Copyright © 2011-2022 走看看