搜索资源列表
radix-2FFT
- 基2FFT,是DFT(离散傅立叶变换)的快速算法-radix 2 FFT, DFT (Discrete Fourier Transform) Fast Algorithm
FFTandIFFT
- 三类FFT变换(时域基2，频域基2，分裂基)及其反变换-Three FFT transform (radix-2 time-domain and frequency domain-based 2, Split-radix) and its inverse transform
VLSIFFTRadix2forDSP
- VLSI implementation of high speed and high resolution FFT algorithm based on Radix 2 for DSP application
fft64
- 64-point radix-2 fft module
fft256
- 256-point radix-2 fft
Radix-4FFTforTMS320C6000
- 用TI DSP芯片TMS320C6000实现FFT算法 内含程序代码和说明 The radix-4 FFT-Fixed-point digital signal processors (DSPs) have limited dynamic range to deal with digital data. This application report proposes a scheme to test and scale the
DSPFFT
- 介绍了基2时域抽取法FFT的原理和算法,并在MATLAB仿真软件的辅助下、在数字信号处理 DSP上实现。 -Describes the radix-2 time-domain extraction principle and FFT algorithms, and the aid of MATLAB simulation software, in digital signal processing DSP to achieve.
FFT_Implementation_in_FPGA
- This book is ERICSSON documentation "FFT, REALIZATION AND IMPLEMENTATION IN FPGA". Book includes some theoretical information about FFT Radix-2 and Radix-4, and also VHDL and Matlab code.
RadixSort
- c语言单链表实现的基数排序也就是桶排（卡式排序）-c language to achieve single list radix sort is a barrel row (card-sorting)
ustrfmt
- Fills in a UChar string with the radix-based representation of a uint32_t number padded with zeroes to minwidth. The result will be null terminated if there is room.
rtree
- Size of each radix tree node (must be a power of 2). This impacts tree depth.
e
- 假设有n个待排序记录，记录Ri的关键字为Keyi, Keyi由d位十进制数字组成，即Keyi=Ki1 Ki2 Ki3 … Kid ,试分别采用链式存储结构和顺序存储结构实现基数排序。-Suppose there are n number of records to be sorted, records Ri of keywords Keyi, Keyi by the d decimal digits, namely Keyi = Ki1
restsnew
- Convert an integer, positive or negative, to a character string radix 10.
quoted
- Convert an integer, positive or negative, to a character string radix 10.
sort2
- 北京大学数据结构与算法课程的排序算法实例。包括直接选择排序，直接插入排序，基数排序和快速排序。-Sorting algorithm instance Peking data structures and algorithms courses. Including direct selection sort, direct insertion sort, radix sort, and quick sort.
coding
- 《数据结构》 第8次上机题目 ( 排序 练习 ) 1．实现插入、交换、选择、归并等简单排序算法； 2．实现快速排序算法； 3．实现堆排序算法； 4．实现基数排序算法 (选做题)。 - Data Structure eighth title on the machine (sorted exercises) 1. Achieve insertion, exchange, selection, merging an
mabna
- a program in C++ for calculate radix(base) of numbers.
hw3
- Binary quicksort (Radix-exchange sort)
sort
- 基数排序 基数排序（radix sort）属于“分配式排序”（distribution sort），又称“桶子法”（bucket sort）或bin sort，顾名思义，它是透过键值的部份资讯，将要排序的元素分配至某些“桶”中，藉以达到排序的作用，基数排序法是属于稳定性的排序，其时间复杂度为O (nlog(r)m)，其中r为所采取的基数，而m为堆数，在某些时候，基数排序法的效率高于其它的稳定性排序法。 快速排序 快速排序由
Sort
- 几个排序函数的实现，冒泡、选择、插入、快排、希尔、堆排、归并、基数(The implementation of several sorting functions, bubble, select, insert, fast row, Hill, heap row, merge, Radix)