搜索资源列表
sort
- 排序的九种算法（直接插入，折半插入排序，希尔排序，起泡排序，快速排序，简单选择，堆排序，归并，基数）-Sorting nine different algorithm (directly insert, binary insertion sort, hill sorting, blister sorting, quick sort, simple choice, heap sort, merging, radix)
sort
- 实现基本排序算法，可供初学者参考，包括冒牌排序、基数排序、快速排序、简单排序、选择排序、插入排序、堆排序、二路归并排序等-Achieve the basic sorting algorithm reference for beginners, including counterfeit sort, radix sort, quick sort, simple sort, selection sort, insertion sort, heap sort, merge sort etc.
fft-arm
- 基于ARM处理器的基4和基5的FFT算法标准C程序，作者是JDB。-Base on ARM processor about Radix 4/5 FFT routines supporting 16/64/256 and 20/80 calculations. The source originally contributed by JDB
linear_sorting_algorithm
- Sorting algorithms that can run linear time. Including counting sort, radix sort, bucket sort.
BaseSort.tar
- 基数排序法的C实现，基于linux环境实现的基数排序的源代码-C implement radix sorting method, implemented on linux environment, the source code of radix sort
Radixsort
- 基数排序 学习数据结构很好的例子 注释很全-Radix Sort to learn data structures are all good examples of comments
sort
- 各种排序算法 Title: Eight Sorting Algorithms Descr iption: Bubble sort, selection sort, insertion sort, radix exchange sort, quick sort, shell sort, shaker sort. shows number of comparisons, time taken This file came from Planet-Source-Code.com...
gam2
- A Low-power Variable-length FFT Processor Base on Radix-24 Algorithm
gam5
- FPGA Implementation ofLow Power 64-Point Radix-4 FFT Processor for OFDM System
gam6
- FPGA Implementation ofLow Power 64-Point Radix-4 FFT Processor for OFDM System
gam7
- FPGA Implementation ofLow Power 64-Point Radix-4 FFT Processor for OFDM System
modulation-based-on-FPGA
- 本文是基于国标DTM-B的发端系统的调制的FPGA实现，包括非基2点的FFT的实现-This article is based on the national standard DTM-B of the originator of the system to achieve the modulation of the FPGA, including non-point radix-2 FFT implementation
581L6_00
- this program is radix-4 fft for 64 point
All-sort-programmes
- all sort programs eg bubble,bucket,heap,radix,selection, insertion in cpp format
High-Speed-FFT
- 优秀硕士论文，课题采用现场可编程门阵列((FPGA)，设计实现了一种超高速FFT处理器。目前，使用FPGA实现FFT多采用基2和基4结构，随着FPGA规模的不断扩大，使采用更高基数实现FFT变换成为可能。本课题就是采用Alter的Stratix II芯片完成了基16-FFT处理器的设计。在设计实现过程中，以基2-FFT搭建基16-FFT的运算核，合理安排时序，解决了碟形运算、数据传输和存储操作协调一致的问题。由于采用流水线工作方式，使整个系统的数据交换和处理速度得以很大提高。本设计实现了4096
cordic
- we propose a low-cost sequential and high performance architecture for the implementation of CORDIC algorithm in two computation modes. It suited for serial operation that performs conversion between polar and rectangular coordinate systems, essentia
paixu
- 八种排序方法的C++程序实现及比较：直接插入排序 折半插入排序 希尔排序 冒泡排序 快速排序 简单选择排序 堆排序 基数排序-Eight sort method to achieve C++ program and comparison: direct insertion sort binary insertion sort Hill Sort Quick Sort Bubble Sort Selection Sort heap sort simple radix sort
fft_my
- 本程序对输入序列din实现DIT——FFT基2算法，点数取大于等于din长度的2的幂次-The program realization of the input sequence din DIT- FFT radix-2 algorithm, din length greater than or equal points to take a power of 2
MRELFFT
- 执行分裂基(split-radix)频率抽取(DIF)FFT算法,希望为同仁提供便利。-Implementation of split-based (split-radix) decimation in frequency (DIF) FFT algorithm in the hope that my colleagues facilitated.
Sorting1
- C programs for merge sort, merge sort rec, quick sort, selection sort, radix sort