搜索资源列表
FPGA-based-FFT-implementation
- 基于FPGA的FFT算法硬件实现 设计了一 种基于 FPGA 的 1 024点 16位 FFT算法, 采用了基 4蝶形算法和流水线处理方式, 提高了 系统 的处理速度, 改善了系统的性能 -FPGA-based FFT algorithm hardware design of a 1024 16-bit FPGA-based FFT algorithm using a radix-4 butterfly algorithm and pipelined approach to improv
radix_sort
- 在linux环境下运用多线程实现的基数排序算法。-In the Linux environment, the use of multi-threaded implementation of radix sort algorithm.
sort_number
- 主要实现各种数字的排序功能, 使用快速排序\计数排序\基数排序等4种排序方法, 并且计时进行比较, 有一个比较友好的界面-Sort of a variety of digital functions, quicksort \ counting the sorting \ radix sort sort method, and timing are compared, there is a more friendly interface
sort
- 排序实验 基数排序 冒泡排序 选择排序 等等发 。-The sort experiment radix sort bubble sort selection sort, and so sent.
paixu
- 按以下给出的基数排序算法思想为整数链表编写一个排序函数，基数排序是按表元键值的各位值进行排序。-Write a sort function in the following given radix sort algorithm Thought for the linked list of integers, radix sort to sort the table element key you value.
jishupaixu
- 基数排序，用链表的存储结构，实现数的排序。共有十组随机数据，还能够计算出每组数据的处理时间，最终得到平均时间。-Radix sort, linked list storage structure to achieve a number of sort. Ten set of random data, but also be able to calculate the processing time of each data, and eventually obtain the average t
InsertSort
- 各种排序算法的比较，包括1、插入排序 2、希尔排序 3、冒泡排序 4、快速排序 5、简单选择排序 6、堆排序 7、归并排序8、基数排序等等 -Comparison of various sorting algorithms, including insertion sort 2, Hill sorting, bubbling to sort 4 quicksort 5, simple selection sort, heap sort, merge sort 8, radix sort
old_yasoda_code
- Jul 11, 2012 – Design of Efficient Multiplier Using Vhdl - download or read online. ... presents an efficient implementation of high speed multiplier using the array multiplier,shift & add algorithm,Booth ..... VHDL code for booth multiplier radix 4
akila
- Jul 11, 2012 – Design of Efficient Multiplier Using Vhdl - download or read online. ... presents an efficient implementation of high speed multiplier using the array multiplier,shift & add algorithm,Booth ..... VHDL code for booth multiplier radix 4
alarm_clock
- File Format: PDF/Adobe Acrobat - Quick View by K Bickerff - 2007 - Related articles With delay proportional to the logarithm of the multiplier word length, column compression .... 2.1 A square version of a 4 by 4 array multiplier (after [23]) . .
boothradix4
- VHDL code for Radix 4 booth multiplier
sort
- 基于链式存储的基数排序算法，很好用的。很不错的，参考书籍。-Radix Sort algorithm based on chain store, easy to use.
radix_sort
- linux系统下 基数排序算法实现 并获得中间值-linux system radix sort algorithm and obtain intermediate values
sort
- opencl实现的基数排序算法，大家可以参考参考，跟sdk中的sample比对一下性能-OpenCL achieve radix sort algorithm, we can refer to the reference with sdk sample than on performance
RadixSort
- 基数排序： 使用10个辅助队列，假设最大数的数字位数为 x， 则一共做 x次，从个位数开始往前，以第i位数字的大小为依据，将数据放进辅助队列，搞定之后回收。下次再以高一位开始的数字位为依据。 以Vector作辅助队列，基数排序的Java代码-Radix sort: 10 auxiliary queue, assuming the maximum number of digits for x, made a total of x times
Sorting
- Sorting (Quick and Radix) performance test
seven_kind_sorting
- 七种排序方法的综合实现 包括1.快速排序2.插入排序3.选择排序4.冒泡排序5.堆排序6.归并排序7.基数排序-Seven sorting method to achieve quick sort, insertion sort selection sort bubble sort 5. Heap sort, merge sort 7. Radix sort
fft256_512_1024
- 基于基2的并行256，1024深度的FFT源代码verilog-Based on radix-2 FFT parallel 256,1024 depth verilog source code
fft4096_8192
- 基于基2的并行4096，8192深度的FFT源代码verilog-Based on radix-2 FFT parallel 4096,8192 depth verilog source code
srfft
- 计算复序列的分裂基快速傅里叶变换，分裂基快速算法是将基2和基4分解组合而成。在基2M类快速算法中，分裂基算法具有最少的运算量，且仍保留结构规则、原位计算等优点。-Calculate complex sequence of split radix fast Fourier transform, fast algorithm is to split the base base 2 and base 4 decomposition combination. 2M fast algorithm in t