搜索资源列表
CodePrallAcQure
- 本人做的GPS并行码捕获的算法.用的是1024点FFT,原始数据可以假如不同功率的噪声.-GPS parallel code acquisition algorithm. Using a 1024-point FFT. If the original data can be different noise power.
ofdm-program()
- 仿真参数:800个载波，1024点IFFT，载波间频1，无多径和有延迟个码片仿真。调制方式是BPSK和QPSK-simulation parameters : 800 Carrier, the 1024-point IFFT, a carrier frequency between, No multi-path and the delay-chip simulation. BPSK modulation is QPSK
sound
- 定点分析：已知一个语音信号，数据采样频率为100Hz，试分别绘制N＝128点DFT的幅频图和N＝1024点DFT幅频图。-Fixed-point analysis: a voice signal is known, the data sampling frequency is 100Hz, try drawing N = 128 points, respectively, DFT amplitude-frequency diagram and N = 1024-point DFT amplitu
ModuleC
- this module C that I wrote for FFT radix 2-2 1024 point.-this is module C that I wrote for FFT radix 2-2 1024 point.
sim1024fft
- 基-2的1024点FFT算法，并与理论FFT结果比较，改程序是正确的.-1024-point radix-2 FFT algorithm, and compared with the theoretical results of the FFT, to change the program is correct.
exercise317_1
- Plot the log-magnitude of the Fourier transform of the signal over the interval [0, π], using a 1024-point FFT. The signal should be windowed with a Hamming window of two different durations: 25 ms and 10 ms with the window placed at the signal’s
FFT
- 1.x=0.5*sin(2*pi*15*t)+2*sin(2*pi*40*t)。采样频率fs=100Hz，分别绘制N=128、1024点幅频图。 2.x=0.5*sin(2*pi*15*t)+2*sin(2*pi*40*t),fs=100Hz,绘制： （1）数据个数N=32，FFT所用的采样点数NFFT=32； （2）N=32，NFFT=128； （3）N=136，NFFT=128； （4）N=136，NFFT=512。-1. X = 0.5* sin (2* PI* 15*