- Category:
- Data Mining
- Tags:
-
- File Size:
- 26kb
- Update:
- 2017-11-28
- Downloads:
- 0 Times
- Uploaded by:
- Maggim
Description: FFT is just a computer fast algorithm of DFT. The results are the same as DFT. They are widely used in signal processing and have relevant examples in the program. I hope to help you
To Search:
File list (Check if you may need any files):
Filename | Size | Date |
---|
Matrix.h | 10546 | 2003-03-17
|
OComm.h | 2117 | 2002-05-31
|
Transform.h | 1294 | 2002-05-31
|
举例\FourierSeriesApproach.cpp | 686 | 2002-11-26
|
举例\FourierTransform.cpp | 1519 | 2002-11-26
|
举例\SievingABR.cpp | 1198 | 2002-11-26
|
举例\SievingKalman.cpp | 2057 | 2002-11-26
|
举例\Smooth5_3.cpp | 507 | 2002-11-26
|
举例\WalshTransform.cpp | 405 | 2002-11-26
|
举例\Chap15.dsp | 4501 | 2002-10-27
|
举例\Chap15.dsw | 535 | 2002-07-17
|
Comm.inl | 2220 | 2002-05-31
|
Matrix.inl | 26598 | 2002-05-31
|
Transform.inl | 8414 | 2002-05-31
|
举例\Chap15.ncb | 107520 | 2002-10-27
|
举例\Chap15.opt | 54784 | 2002-10-27
|
举例\Debug
|
举例 |