登录
首页 » Visual C++ » FFT

FFT

于 2016-07-21 发布 文件大小:100KB
0 213
下载积分: 1 下载次数: 4

代码说明:

  在DSP5509A的平台下,对信号进行FFT处理,观察信号频域变化。(Under the platform of DSP5509A, the signal is processed by FFT, and the change of the signal frequency domain is observed.)

文件列表:

FFT
...\1.DAT,530,2005-04-13
...\c5509.h,2803,2003-12-12
...\cc_build_Debug.log,134,2005-07-12
...\clk_init.c,503,2005-01-07
...\csedu.h,23658,2005-02-25
...\Debug
...\.....\clk_init.obj,1060,2005-04-13
...\.....\FFT.obj,29629,2005-06-20
...\.....\Fir.map,19378,2005-06-20
...\.....\Fir.out,38856,2005-06-20
...\.....\sdram_init.obj,1054,2005-04-13
...\Debug.lkf,285,2005-06-20
...\Debug.lkv,285,2005-06-20
...\FFT.c,2259,2006-03-28
...\FFT.c.bak,1468,2005-03-08
...\FFT.paf,1617,2006-02-01
...\FFT.pjt,878,2006-02-01
...\FFT.wks,9561,2005-07-12
...\func.h,192,2004-11-18
...\myapp.h,65,2004-11-18
...\peripherals.h,30,2003-12-12
...\scancode.h,447,2004-05-09
...\sdram_init.c,1535,2004-11-18
...\test.cmd,753,2005-01-24
...\ͼƬ.doc,1805824,2006-02-01

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • WMFJPGGIF_display
    VC++程序中采用OLE技术显示GIF,JPG,WMF,BMP图片(VC++ Procedures showed that the use of OLE technology GIF, JPG, WMF, BMP picture)
    2007-08-07 15:23:16下载
    积分:1
  • checker
    USACO(checker challenge) 1.搜索+对称剪枝 2.搜索+位运算(USACO (checker challenge) 1. Search+ symmetric pruning 2. Search+ bit operation)
    2020-11-16 06:29:46下载
    积分:1
  • medo
    设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组,每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n(n<=200),表示每个数组有n个数。接下来的两行分别是X,Y数组的元素。结果输出 程序运行结束时,将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
    2021-03-22 16:29:16下载
    积分:1
  • 20103521287041
    说明:  XP控件库,有一定参考价值 资源类别: VC源码¦用户界面 文件大小: 170KB (XP Control Library, a certain reference value resource categories: VC Source &brvbar user interface file size: 170KB)
    2011-04-11 21:39:02下载
    积分:1
  • mm1n
    M/M/1/N 排队模型仿真,计算DRAM刷新能量,以及包丢失率理论值和仿真值的比较。(M/M/1/N queuing model simulation, computational power DRAM refresh, and the packet loss rate of the theoretical values and simulation values of the comparison.)
    2020-11-21 01:29:36下载
    积分:1
  • WinSockUDP
    VC UDP通讯,后台服务器 FileMana.cpp FileMana.h Login.cpp Login.h resource.h SocketUdp.cpp SocketUdp.h StdAfx.cpp StdAfx.h WinSockUDP.aps WinSockUDP.clw WinSockUDP.cpp WinSockUDP.dsp WinSockUDP.dsw WinSockUDP.h WinSockUDP.ncb WinSockUDP.opt WinSockUDP.plg WinSockUDP.rc WinSockUDP.sln WinSockUDP.vcproj WinSockUDP.vcproj.T400-CKX.Administrator.user WinSockUDPDlg.cpp WinSockUDPDlg.h( FileMana.cpp FileMana.h Login.cpp Login.h resource.h SocketUdp.cpp SocketUdp.h StdAfx.cpp StdAfx.h WinSockUDP.aps WinSockUDP.clw WinSockUDP.cpp WinSockUDP.dsp WinSockUDP.dsw WinSockUDP.h WinSockUDP.ncb WinSockUDP.opt WinSockUDP.plg WinSockUDP.rc WinSockUDP.sln WinSockUDP.vcproj WinSockUDP.vcproj.T400-CKX.Administrator.user WinSockUDPDlg.cpp WinSockUDPDlg.h)
    2012-05-24 14:41:07下载
    积分:1
  • GPS-application-program-code
    完整的gps应用程序,包括前端数据采集程序 读取星历程序、单点定位程序,差分定位程序、RTCM电文编码译码程序等(GPS application software)
    2015-11-03 16:26:17下载
    积分:1
  • USBPort
    USB通信编程,获取USB设备信息,如果编译不通过,你需要下载NTDDK中的hidsdi.h 和 hid.lib文件等。(USB communication programming,get the USB devices informateion ,if there have link errors,you have to download the header files hidsdi. H, the library file hid. Lib,etc in the NTDDK.)
    2012-06-27 11:13:14下载
    积分:1
  • OFDM103
    基于深度限幅的OFDM峰均比抑制器的设计(限幅法是最简单直接的一种,以降低误码率性能 频谱畸变和计算复杂度为主要代价。)(matlab OFDM)
    2014-09-22 06:23:37下载
    积分:1
  • lisanduishu
    设p是素数,a是p的本原根,即a1,a2,a3,…,ap-1在mod p下产生1到p-1的所有值,所以对任何b属于{1,…,p-1},有唯一的i属于{1,…,p-1}使得ai mod p 等于p。称i为模p下以a为底b的离散对数。(P is a prime number based, a is the primitive root p, that is, a1, a2, a3, ..., ap-1 in the mod p under 1 to p-1 for all values, so for any b belongs to (1, ..., p-1), there are only i belong to (1, ..., p-1) makes ai mod p equivalent to p. Said i was under the modulus p to a for b at the end of the discrete logarithm.)
    2009-06-16 17:44:18下载
    积分:1
  • 696516资源总数
  • 106428会员总数
  • 7今日下载