搜索资源列表
fftshow
- Display fft. A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse.
AArch64TargetMachine
- For order larger than 4, compute Real FFT as Complex FFT of (order - 1).
OFDM-Tx-Rx
- ofdm 传输与接受的各项例子 -OFDM Receiver 1. Initalize the USRP setting the RX parameters and moving the LO outside the transmission band. 2. Generate random data bits (PN Sequence) (125 bits) 3. Use the Van De Beek algorithm to detect the cyclic prefix
sp_gram
- gram - 计算信号向量的频谱图 ％ ％[B，F，T] 频谱图（xx，Nfft，fs，窗口，Noverlap） ％ ％输出： ％B 谱图值 ％F 来自FFT的分析频率（Hz） ％T 窗口位置时间（秒）- gram compute the spectrogram of a signal vector [B,F,T] spectrogram(xx,Nfft,fs,window,Noverlap ) Outputs:
gsl-1.8
- gsl1.8的库 强大的数学计算能力 可以做fft等 带英文说明(the lib of gsl1.8, powerful ability to help you compute)
abc
- 比较DFT和FFT的运算时间。（1）自行选择进行计算的序列（或产生随机序列）。 （2）利用计时函数tic、toc，计算点数N=64、128、256、……(IT IS A SAMPLE.Compare the computing time of DFT and FFT. (1) select the sequence to compute (or generate random sequences). (2) using the timer functions tic and TOC to c