Re: Search for DFT application

Article View: cn.bbs.comp.program

Article #273

Back to cn.bbs.comp.program Previous Next

#273

From: ��
Date: Wed, 13 Oct 1999 00:00

19 lines
1016 bytes

> [1;36m==> Lee_L(Ineffective Brake)                 ˵��: [37;40m[0m
> Attention! not FFT, but the primitive DFT. 
> Or, you can tell me if I have N samples, 
> N not the power of 2, for instance, N=120, 
> then, I make the FFT on the time series, 
> whether I must make it up with zero value 
> to N=128? If must do so, I think DFT may 
> be better.  
> Who can give me a DFT program. Codes are better. 
> ThanX. 
 
  I am puzzled that you think in this case DFT needn't

add some zeros(there's a word for "adding zeors" but i forgor it//shy)

 

--
�� ��Դ: �й�ƴ�BBSվ [bbs.ustc.edu.cn]

Technical Details

Message-ID: <991013.11bIft$PBBS@bbs.ustc.edu.cn>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII
X-Google-Thread: fc86e,5633d104a98d7387
X-Google-Attributes: gidfc86e,public
From: Seins_Dasein@bbs.ustc.edu.cn (����)
Subject: Re: Search for DFT application
Date: 1999/10/13
Message-ID: <991013.11bIft$PBBS@bbs.ustc.edu.cn>
X-Deja-AN: 536367880
Distribution: ustc
Organization: �й�ƴ�BBSվ
Newsgroups: cn.bbs.comp.program