搜索资源列表
MCMPFFT
- 利用经典的Cooley-Tukey基2算法求复序列x(n)的DFT X(k)-Use of the classic Cooley-Tukey radix-2 algorithm for complex sequence x (n) of the DFT X (k)
re
- 快速傅里叶变换(FFT)算法。FFT - Fast Fourier transform. The length of X must be a power of two, for a fast radix-2 fast-Fourier transform algorithm is used-Fast Fourier Transform (FFT) algorithm. FFT- Fast Fourier transform. The le
sine_fft
- 通过读取已有的由matlab产生的数据文件进行1024点浮点fft运算的c程序.其中,radix2()实现基2算法,ChangeOrder()实现变址运算.-By reading existing data generated by the matlab file for 1024-point floating-point fft computing c procedures. Which, radix2 () realize radi
paixu
- 包含8种常用的排序。如快速排序,堆排序,冒泡排序,选择排序,基数排序,希尔排序,插入排序,归并排序。-Contains 8 kinds of commonly used sorting. Such as Quick Sort, Heap Sort, Bubble Sort, Selection Sort, Radix Sort, Hill sort, insertion sort, merge sort.
FFT
- FFT算法应用与C6000系列,基2算法。需要使用CCS-FFT algorithm application and C6000 series, radix-2 algorithm. Need to use the CCS
sixsortmethods
- 数据结构中的排序方法,包括:希尔排序,非递归的快速排序,递归的快速排序,堆排序,归并排序,基数排序-Sort of data structure, including: Hill sorted, non-recursive quicksort, recursive Quick Sort, Heap Sort, Merge Sort, Radix Sort
all_sort
- 用C++实现各种排序算法:如冒泡排序、选择排序、插入排序、希尔排序、快速排序、归并排序、基数排序和堆排序,并带有源代码说明-With C++ Realize a variety of sorting algorithms: such as Bubble Sort, Selection Sort, Insertion Sort, Hill sort, quick sort, merge sort, Radix Sort and Heap
Low_power_Modified_Booth_Multiplier
- 主題 : Low power Modified Booth Multiplier 介紹 : 為了節省乘法器面積、加快速度等等,許多文獻根據乘法器中架構提出改進的方式,而其中在1951年,A. D. Booth教授提出了一種名為radix-2 Booth演算法,演算法原理是在LSB前一個位元補上“0”,再由LSB至MSB以每兩個位元為一個Group,而下一個Group的LSB會與上一個Group的MSB重疊(overlap),G
SortAlgorithmComparison
- 直接插入排序,折半插入排序,起泡排序 ,快速排序,简单选择排序,堆排序 ,基数排序 七种排序方法的实现和速度对比-Direct Insertion Sort, Insertion Sort half, bubbling sort, quick sort, the simple choice of sequencing, Heap Sort, Radix Sort Sort seven methods to achieve and the
multiply
- 这是我用verilog hdl语言写的浮点乘法器,用的是基4的booth算法,对于部分积使用了5-2压缩和3-2压缩,欢迎大家指点,也欢迎大家把它改成流水线以提高速度.-This is my verilog hdl language used to write floating-point multiplier, using a Radix-4 algorithm for the booth for part of the plot u
fft
- 基2算法的FFT程序,源码使用了按时间抽取的方式-Radix-2 algorithm the FFT procedure, the use of a time source selection
nbpx
- 对十种内部排序的比较.有直接排序,快速排序,折半排序,基数排序,堆排序,等.-Sort of dozens of internal comparison. Have a direct sort, quick sort, binary sort, Radix Sort, Heap Sort, et al.
fft_flp32_C
- ADSP-TS101S and ADSP-TS201S Real and Complex radix-2 C-callable FFT
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, Rad
fft2
- 按时间抽取的基2快速傅立叶变换,详细的讲解了编程的思维并有源代码!-Time taken by the radix-2 fast Fourier transform, in detail the thinking and programming source code!
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]
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 us