搜索资源列表
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
radix_sort
- java 动态实现基数排序， 实现过程的动画展示-java radix sort
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
project
- project in data structure good for making radix sort
radix2
- fft The radix-2 algorithms are the simplest FFT algorithms. The decimation-in-time (DIT) radix-2 FFT recursively partitions a DFT into two half-length DFTs of the even-indexed and odd-indexed time samples. The outputs of these shorter FFTs ar
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
exp1
- 算法基础的实验 排序算法的比较 包括冒泡、快排、计数排序、基数排序等-Algorithm based on the comparison experiments, including bubble sort algorithm, fast row, counting sort, radix sort, etc.
sort
- Achieve insertion sort, merge sort, selection sort, heap sort, radix sort, bucket sort. And sort more than 6 compared to the running time
RADIXSORT
- 通过c++实现数据结构RADIXSORT-radix sort