搜索资源列表
booth_multiplier
- Booth Multiplier Radix-2
radix3fft.m
- A radix-3 FFT for any N points. N is not limited to power of 3.
radix3.m
- A spilt radix - 3 algorithm for any N. N is limited to power of 3.-A spilt radix- 3 algorithm for any N. N is limited to power of 3.
8paixu
- 关于C语言的各种排序方法汇总。冒泡排序、直接选择排序、直接插入排序、 快速排序、堆排序、谢尔排序、归并排序和基数排序 -On the C language of the various sorting method summary. Bubble sort, direct selection sort, direct insertion sort, Quick sort, heap sort, Shell sort, merge sort, radix sort
pro_001
- 这个一个自己写的关于基数排序的算法 感觉还不错 希望有需要的同学下载-This a radix sort algorithm feeling good hope that the students need to download
RadixSort
- 基数排序,初学者,欢迎大家批评指正,学习交流!-Radix sort, beginners, welcome criticism and learning exchange!
jishupaixu
- 基数排序数据结构的一种算法基数排序数据结构的一种算法-Radix sort the data structure of an algorithm
sort
- 常见的排序算法,包括:希尔排序、冒泡排序、选择排序、插入排序、快速排序、堆排序、基数排序、归并排序。-Common sorting algorithms, including: Hill sort, bubble sort, selection sort, insertion sort, quick sort, heap sort, radix sort, merge sort.
FFT
- An Elementary Introduction to the Discrete Fourier Transform 1.1 ComplexNumbers 1.3 Analyzing the Series 1.5 Filtering a Signal 1.6 How Often Does One Sample? 1.7 Notes and References 1.2 Trigonometric Interpolation 1.4 Fourier Frequenc
FFT_Twiddles_Find_DSPrelated
- 下面是找到了基2 FFT蝴蝶旋转因子的Matlab代码。代码计算的 A 相角,在图1(c)和图2(c)所示,旋转因子的因素。我建议你开始8点DIT的FFT图1(a)通过运行代码然后运行图2中的代码为16点DIF FFT(一)。-Below is the Matlab code to find radix-2 FFT butterfly twiddle factors. The code computes the A phase angle factors that are used in t
fft4
- 对于基4的fft的描述,一些不错的文章,大家看看啊-For a descr iption of the radix-4 fft, some good articles, we look at
Booth-co-so-2
- Radix Booh 2.nice to see u.i uploaded this file to download the file that i need actually
sort
- 该文件为各排序算法的代码,你可以了解到各种算法的 思想和方法,其中包括插入排序、选择排序、希尔排序、堆排序、冒泡、双向冒泡、快速排序、归并排序、递归的归并排序、基数排序,进一步掌握各种排序的优劣-The file the code for the sorting algorithm, you can learn ideas and methods of the various algorithms, including insertion sort, selection sort, Hill s
MRELFFT
- C scr ipt for performing split-radix DIF fft algorithm.
1
- 数据结构 归并排序、基数排序算法比较-Data structures merge sort, radix sort algorithm
paixu
- 使用简单数组实现下面各种排序算法,并进行比较。 排序算法: 1、插入排序 2、希尔排序 3、冒泡排序 4、快速排序 5、简单选择排序 6、堆排序 7、归并排序 8、基数排序 要求: 1、测试数据分成三类:正序、逆序、随机数据 2、对于这三类数据,比较上述排序算法中关键字的比较次数和移动次数(其中关键字交换计为3次移动)。 3、对于这三类数据,比较上述排序算法中不同算法的执行时间,精确到微秒-Using a simple ar
FFT
- 在TI公司的TMS320C6416 DSP上做FFT变换的实现与探索。功能主要包括如下5个方面: 1. 16点基2 FFT 2. 将基2FFT结果写入SD_RAM,并读取出来 3. 对FFT的结果进行IFFT 4. 原采样点扩展为32点,做32点基2 FFT 5. 对原16点序列做基4 FFT -TI' s TMS320C6416 DSP to do the FFT transform and explore. Features include the follo
experimental-reports
- 算法导论实验报告 各种排序算法的实现 插入排序、冒泡排序、堆排序、快速排序、归并排序、基数排序、计数排序-Introduction to Algorithms, experiment reports a variety of sorting algorithms for insertion sort, bubble sort, heap sort, quick sort, merge sort, radix sort, counting sort
radix_sort
- 本人亲自用C语言编写的基数排序代码,准确无误。基数排序的算法复杂度为O(d*n),d为最大数值的位数。-Radix Sort personally written in C code is correct. Radix Sort algorithm complexity is O (d* n), d is the maximum value of the median.
64point_FFT
- 64点FFT代码 基4算法 Verilog-64-point FFT code radix-4 algorithm Verilog