搜索资源列表
fft512
- 采用基2算法的512点快速傅里叶变换，可以运用于ofdm等方面-The 512-point fast Fourier transform of the radix-2 algorithm, can be used in ofdm
Blackfin_FftDct General algorithms for Radix-2 and
- 用于数字信号处理快速傅立叶变换的程序--Program for quick Fourier conversion in handling digital signals.
fft
- 基2算法的FFT程序，源码使用了按时间抽取的方式-Radix-2 algorithm the FFT procedure, the use of a time source selection
FFT
- 基于dsp的fft算法，是基2按时间抽取快速fft，对于想熟悉fft算法的朋友很有帮助-Based on the dsp of the fft algorithm, is extracted by time radix-2 fast fft, for want of a friend familiar with the fft algorithm helpful
somesortalgorithm
- 本程序实现了通常我们所用的各种排序算法，是基于1--10000的随机生成数排序，有冒泡排序，合并排序，基数排序，计数排序等算法实现。-This procedure has usually used in a variety of sorting algorithm is based on 1- 10000 sort the randomly generated number, a bubble sort, merge sort, Radix Sort, Counting Sort algorit
MCMPFFT
- 利用经典的Cooley-Tukey基2算法求复序列的DFT-Use of the classic Cooley-Tukey radix-2 algorithm for complex sequence of DFT
sort
- 自己编写的排序算法的代码，有桶排序，计数排序，基数排序，归并排序，堆排序，插入排序，快速排序，选择排序。-Sorting algorithm I have written the code, there are barrels of sorting, counting sort, Radix Sort, Merge Sort, Heap Sort, Insertion Sort, Quick Sort, select Sort.
SRT
- verilog code radix-2 SRT divider input [7:0]Dividend input [3:0]Divisor output [4:0]Quotient output [8:0]Remainder -verilog coderadix-2 SRT dividerinput [7:0] Dividend input [3:0] Divisor output [4:0] Quotient output [8:0] Remainde
fft
- The fft.c file is C code for a function to compute the 16 point real Fast Fourier Transform using the split radix algorithm. -The fft.c file is C code for a function to compute the 16 point real Fast Fourier Transform using the split radix algorithm.
fft
- Radix-2 Fast Fourier Transform, real or complex sin/cos transform -Radix-2 Fast Fourier Transform, real or complex sin/cos transform
splfft
- 分裂基算法，已调试，用C语言实现-Split-radix algorithm, have been debug using C language. . . . . . . . . . . . .
FPGA_4FFT
- 针对高速数字信号处理的要求,提出用FPGA 实现基- 4FFT 算法,并对其整体结构、蝶形单 元进行了分析. 采用蝶算单元输入并行结构和同址运算,能同时提供蝶形运算所需的4 个操作 数,具有最大的数据并行性,能提高处理速度 按照旋转因子存放规则,蝶形运算所需的3 个旋转 因子地址相同,且寻址方式简单 输出采取与输入相似的存储器 运算单元同时采用3 个乘法的 复数运算算法来实现.-In accordance with the requirements of high speed d
sort
- 包括归并排序、基数排序、快速排序、谢尔排序、以及每一种排序的详细ppt实例说明和解释~！ -Including merge sort, Radix Sort, Quick Sort, Shell Sort, and sort each type of detailed examples and explanations ppt ~!
sort
- 这是一段关于四种排序方法的完全源代码及其相互之间的比较,包括:Heap sort,Merge sort,Quick sort,Radix sort-This is a period of about four kinds of methods to sort the complete source code and the comparison between, including: Heap sort, Merge sort, Quick sort, Radix sort
Radix_Sort2142121302009
- the implementation of radix sort algorithm
Impulse_fft_hw
- ImpulseC Codeveloper fft code. This file implements the hardware portion of a 256 sample FFT using a radix-4 algorithm. This implementation demonstrates that results similar to hand-coded HDL can be achieved using the C language, and without using
sort
- 使用java寫的排序法demo包含radix sort和插入排序法-Using java to write the sort method demo contains the radix sort and Insertion Sort
All-kinds-of-sort
- 本代码实现了几乎所有的排序算法，如冒泡排序，选择排序，基数排序，快速排序等。-This source code implements all kinds of basic sorting algorithm, such as bubble sort,radix sort,select sort,quick sort and so on.
BoothMultiplier
- A Scalable Counterflow-Pipelined Asynchronous Radix-4 Booth Multiplier
SPLFFT
- splfft.for（hsplfft.for） 利用分裂基算法求复序列 的DFT -splfft.for（hsplfft.for） Split-radix algorithm for the use of complex DFT sequence