Search - radix - CodeBus

Search - radix - List

[Other resource] radix-2FFT DL : 0: 基2FFT,是DFT(离散傅立叶变换)的快速算法-radix 2 FFT, DFT (Discrete Fourier Transform) Fast Algorithm
Update : 2008-10-13 Size : 1.17kb Publisher : Terry
[VHDL-FPGA-Verilog] verilog fft_64_12 DL : 0: radix-4,利用cordic算法实现复乘单元
Update : 2010-05-30 Size : 12.93kb Publisher : mikehonour@126.com
[Documents] 基数（radix）树 DL : 0: 基数（radix）树的设计
Update : 2010-09-21 Size : 235kb Publisher : hustzhbo@163.com
[Mathimatics-Numerical algorithms] radixsort DL : 0: radix排序法-Radix sorting method
Update : 2025-02-17 Size : 1kb Publisher : 站长
[Mathimatics-Numerical algorithms] MultiSort DL : 0: Merge, Insertion, Radix, Heap, Bucket, Quick, Counting排序算法-Sort Algorithm about Merge, Insertion, Radix, Heap, Bucket, Quick, Counting
Update : 2025-02-17 Size : 5kb Publisher : 站长
[CSharp] fft1b1 DL : 0: 基4快速傅立叶变换的实现方法 ,有多种,没有加密-Radix-4 Fast Fourier Transform method, a combination of factors, not encrypted
Update : 2025-02-17 Size : 162kb Publisher : 鼎鼎
[Communication] fft_基2基4基8 DL : 0: 基2基4基8以及分裂基的fft算法，代码效率很高。是难得一见的好代码。应用范围很广。-Radix-2-4-based 8 and split fft-based algorithm, a high code efficiency. Is a rare good code. Application of a very wide scope.
Update : 2025-02-17 Size : 75kb Publisher : 张强
[DSP program] ligl-fft DL : 0: 基于tms320vc55*系列DSP常用算法，包括： 1. Experiment 7A - Radix-2 Complex FFT in C 2. Experiment 7B - Radix-2 Complex FFT in C55x Assembly Language 3. Experiment 7C - Radix-2 Complex FFT and IFFT 4. Experiment 7C - Fast Convolution 5. matlab 源码- Based on tms320vc55* series DSP commonly used algorithm, including: 1. Experiment 7A- Radix-2 Complex FFT in C 2. Experiment 7B- Radix-2 Complex FFT in C55x Assembly Language 3. Experiment 7C- Radix-2 Complex FFT and IFFT 4. Experiment 7C- Fast Convolution 5. matlab source code
Update : 2025-02-17 Size : 77kb Publisher :
[Software Engineering] dingdianchengfaqisheji DL : 0: 目录: 0、约定 1、无符号数一位乘法 2、符号数一位乘法 3、布思算法(Booth algorithm) 4、高基(High Radix)布思算法 5、迭代算法 6、乘法运算的实现——迭代 7、乘法运算的实现——阵列 8、乘加运算 9、设计示例1 —— 8位、迭代 1、实现方案1 —— 一位、无符号 2、实现方案2 —— 一位、布思 3、实现方案3 —— 二位 10、设计示例2 —— 16位、阵列 11、设计示例3 —— 32位、迭代、阵列 1、实现方案1 —— 乘、加一步走 2、实现方案2 —— 乘、加两步走-Contents : 0, an agreement, an unsigned multiplication number two, a few multiplication symbols 3, Andrew Bruce algorithm (Booth algorithm) 4. Gao (High Radix), Andrew Bruce algorithm 5, 6 iterative algorithm, the realization of multiplication-- iterative 7, Implementation of multiplication-- Array 8, multiply-add nine, design examples 1-- 8 spaces, an iterative, Implementation 1-- one, two unsigned achieve program 2-- 1, 3, Andrew Bruce, Implementation 3-- 2 10 design examples 2-- 16 spaces, 11 arrays, design examples 3-- 32 spaces, iterative, an array achieve program 1-- x, plus step two, achieving program 2-- x, plus two-step
Update : 2025-02-17 Size : 373kb Publisher : 少华
[Other] sort-all DL : 0: 本程序完成实验要求的全部功能直接插入排序、SHELL排序、冒泡排序、快速排序、简单选择排序、堆排序、归并排序、基数排序，程序代码符合书写规范，实验报告叙述清晰完整，有详尽的分析和总结。在实验过程中，积极配合本团队分工合作的精神，努力学习，总算不负众望，将程序编好，在此，我更想感谢的是老师的教导，在她的帮助下，我才顺利完成了本次的任务。 -the experimental procedures are completed all the functional requirements of the direct insertion sort, Shell sort, bubble sort, Quick Sort, the simple choice of sequencing, heap sort, merge sort, radix sort, code written with norms, Experimental report describes a distinct and comprehensive, detailed analysis and summary. In the course of the experiment, the team actively cooperate with the division of labor, study hard, and finally delivered to the completion of procedures, in this, I also want to thank the teacher is teaching, in her help, I will have completed this task.
Update : 2025-02-17 Size : 95kb Publisher : 马全
[Algorithm] fix_fft DL : 0: 定点基2FFT，并且具有将定点FFT与浮点FFT比对的功能-sentinel radix 2 FFT, and will be positioned with floating-point FFT and FFT functions to the
Update : 2025-02-17 Size : 3kb Publisher : 林凌
[matlab] radix-2FFT DL : 0: 基2FFT,是DFT(离散傅立叶变换)的快速算法-radix 2 FFT, DFT (Discrete Fourier Transform) Fast Algorithm
Update : 2025-02-17 Size : 1kb Publisher : Terry
[Algorithm] 2FFandIFFT DL : 0: 时间抽选基2FFT及IFFT算法C语言实现-time selected radix 2 FFT and IFFT algorithm C Language
Update : 2025-02-17 Size : 2kb Publisher : jia
[Other] all_Radix_FFT DL : 0: 此程式具有三种FFT演算法,分别是radix-2 radix-4 radix-8,可选择其中一种演算法,接着输入FFT点数,程式就会执行FFT/IFFT,可以藉此知道是否正确-This program has three FFT algorithms are radix-2 radix-4 radix-8, can choose one algorithm, and then enter the FFT points, the program will be the implementation of FFT/IFFT, can take this know whether this is correct
Update : 2025-02-17 Size : 2kb Publisher : 陈荣
[Communication-Mobile] MRELFFT DL : 0: 利用分裂基算法求实序列的DFT,虚部赋值为零,这些程序是用C来实现的-Split-radix algorithm for the use of realistic sequence of DFT, the imaginary part of the assignment of zero, these procedures are used to achieve the C
Update : 2025-02-17 Size : 1kb Publisher : dh
[Algorithm] fft_radix2 DL : 0: 用FFT 计算离散傅里叶变化，时间抽取（DIT）基2算法。-Calculated using FFT Discrete Fourier changes, the time taken (DIT) radix-2 algorithm.
Update : 2025-02-17 Size : 1kb Publisher : Ming Zhao
[Windows Develop] FastFourierTransform DL : 0: This function is written to understand and/or explain an fft algorithm and usage of radix2 procedure. This function take the signal which you want to find FFT, for m bit you can also call the function without entering a signal or number of points, because there is default values for y and m which are y = sin(2*pi*50*t)+sin(2*pi*120*t) m=3 you can see the steps of order reversing used as built-in function but non others. you will also see the taking butterfly tree steps. for more information read the help file of function. in future this can be improve as selective radix or any other feature you suggest please notice me for any sugestion.
Update : 2025-02-17 Size : 3kb Publisher : dairy
[Algorithm] FFTandIFFT DL : 0: 三类FFT变换(时域基2，频域基2，分裂基)及其反变换-Three FFT transform (radix-2 time-domain and frequency domain-based 2, Split-radix) and its inverse transform
Update : 2025-02-17 Size : 197kb Publisher : pangyimin
[DSP program] Radix-4FFTforTMS320C6000 DL : 0: 用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 result output from each Fast Fourier Transform (FFT) stage in order to fix the accumulation overflow. The radix-4 FFT algorithm is selected since it provides fewer stages than radix-2 algorithm. Thus, the scaling operations are minimized. This application report is organized as follows:
Update : 2025-02-17 Size : 52kb Publisher : 防止
[Documents] Counting radix DL : 0: Counting radix just try it
Update : 2025-02-17 Size : 59kb Publisher : neo123456789

« 12 3 4 5 6 7 8 9 10 ... 23 »