Location:
Search - radix 3
Search list
Description: 本软件是由作者经过数字图像处理课程的学习，采用vc++.net将其基本算法实现，其算法主要包括： 1.点运算（灰度直方图，直方图均衡处理，线性运算，二值化，灰度化等） 2.几何运算（旋转，放缩，镜像，平移） 3.几何空间增强（均值，中值滤波器，k近邻均值，中值滤波器，Roberts,sobel,priwitt,laplacian,wallis锐化算子等） 4.频率域增强（基2FFT进行空间域到频率域的转换，高斯，理想，巴特沃斯高低通滤波器） 5.形态学（膨胀，腐蚀，开，闭运算，边缘提取） 6.图像复原（加躁）----- 由于时间关系这部分为完成 7.另外加上一个用于读取24位dib的类。-the software is the author of Digital Image Processing courses of study, using vc. Net to its basic algorithm, the algorithm include : 1. Point Operators (histogram, histogram equalization, linear operation, two values, such as Gray) 2. Geometric Operational (rotation, scaling, mirror and translation) 3. geometric space enhancement (mean, median filter, k neighbors Mean, Median Filter, Roberts, segmentation, priwitt, Laplacian, Wallis Sharpening operator, etc.) 4. frequency Domain Enhancement (radix 2 FFT space frequency domain to the domain conversion, Gaussian, ideals, Butterworth High-Low Pass Filter) 5. Morphology (expansion, corrosion, open and close operations, edge extraction) 6. Image Restoration (plus impatient Hoffmann because of the time this is completed seven. Added to read fo
Platform: |
Size: 3416061 |
Author: 王晗 |
Hits:
Description: 基于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
Platform: |
Size: 79064 |
Author: 李国龙 |
Hits:
Description: 目录:
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
Platform: |
Size: 382707 |
Author: 少华 |
Hits:
Description: 1）实现以下常用的内部排序算法并对它们的时间效率进行比较：
必做（6种）：起泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序；
选做：折半插入、二路归并、基数排序等等；
2）函数首部要求：void XXXXSort(char **list, int len, int n, int *c, int *s)
其中：
a) XXXXSort为排序函数名，具体如下：
起泡排序BubbleSort
直接插入排序InsertSort
简单选择排序SelectSort
快速排序QuickSort
希尔排序ShellSort
堆排序HeapSort
折半插入BInsertSort
二路归并Merge2Sort
基数排序RadixSort
b) list为二维字符数组的头指针，该二维数组的规格为：char list[n][len] 每行用于存放一个字符串（最大长度为len-1），共n行；
c) c用于返回关键字比较次数；
d) s用于返回移动次数；
3）要求把各种排序函数做成函数库（文件名统一为：sort.c），用统一提供的主程序进行调用和测评。
-a) achieve the following commonly used internal sorting algorithm as well as their time efficiency comparison : regimen (6) : bubble sort, direct insertion sequence and simple choice sorting, quick sort, Hill, ranked Heap Sort; elected to do : half of insertion, two-way merge. Sort base, and so on; 2) function first requirement : void XXXXSort (char ** list, int len, int n, int * c, int * s) which : a) XXXXSort sort of a function name, as follows : bubble sort BubbleSort direct insertion sort InsertSort simple choice ranking Sele ctSort Quick Sort QuickSort Hill Sorting ShellSort Heap Sort HeapS ort half insert BInsertSort two-way merge Merge2Sort radix sort Radi xSort b) list for the two-dimensional array of characters in the first indicator, the two-dimensional array specifications : cha
Platform: |
Size: 10289 |
Author: 战天 |
Hits:
Description: 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.
Platform: |
Size: 2904 |
Author: dairy |
Hits:
Description: 輕易學好C++編程技巧 - 進楷 (香港科技大學筆記 19課) 內容包括
1) base C++ review,
2) Pointers and Dynamic Objects,
3) Recursion,Linked Lists,
4) Stacks and Queues,
5) Algorithm Analysis,
6) Insertion Sort and Mergesort,
7) Quicksort,
8) Heaps and Heapsort,
9) Lower Bound of Sorting and Radix Sort,
10) Binary Trees and Binary Search Trees
11) AVL Trees,
12) B+ Trees
13) Graphs and Breadth-First Search
14) Depth-First Search
15) Connected Components, Directed Graphs,
16) Topological Sort
17) Hashing
18) Pattern Matching
19) Additional Review
Platform: |
Size: 3752380 |
Author: chan kindfish |
Hits:
Description: 主題 :
Low power Modified Booth Multiplier
介紹 : 為了節省乘法器面積、加快速度等等，許多文獻根據乘法器中架構提出改進的方式，而其中在1951年，A. D. Booth教授提出了一種名為radix-2 Booth演算法，演算法原理是在LSB前一個位元補上“0”，再由LSB至MSB以每兩個位元為一個Group，而下一個Group的LSB會與上一個Group的MSB重疊(overlap)，Group中的位元。
Booth編碼表進行編碼(Booth Encoding)後再產生部分乘積進而得到最後的結果。
Radix-2 Booth演算法在1961年由O. L. Macsorley教授改良後，提出了radix-4 Booth演算法(modified Booth algorithm)，此演算法的差異為Group所涵括的位元由原先的2個位元變為3個位元。
Platform: |
Size: 14123 |
Author: stanly |
Hits:
Description: 基数（radix）树 的设计
Platform: |
Size: 240640 |
Author: hustzhbo@163.com |
Hits:
Description: A very useful program that includes the following sort algorithms: Merge, Insertion, Radix, Heap, Bucket, Quick, Counting
Platform: |
Size: 3317 |
Author: besoyal@yahoo.gr |
Hits:
Description: 本软件是由作者经过数字图像处理课程的学习，采用vc++.net将其基本算法实现，其算法主要包括： 1.点运算（灰度直方图，直方图均衡处理，线性运算，二值化，灰度化等） 2.几何运算（旋转，放缩，镜像，平移） 3.几何空间增强（均值，中值滤波器，k近邻均值，中值滤波器，Roberts,sobel,priwitt,laplacian,wallis锐化算子等） 4.频率域增强（基2FFT进行空间域到频率域的转换，高斯，理想，巴特沃斯高低通滤波器） 5.形态学（膨胀，腐蚀，开，闭运算，边缘提取） 6.图像复原（加躁）----- 由于时间关系这部分为完成 7.另外加上一个用于读取24位dib的类。-the software is the author of Digital Image Processing courses of study, using vc. Net to its basic algorithm, the algorithm include : 1. Point Operators (histogram, histogram equalization, linear operation, two values, such as Gray) 2. Geometric Operational (rotation, scaling, mirror and translation) 3. geometric space enhancement (mean, median filter, k neighbors Mean, Median Filter, Roberts, segmentation, priwitt, Laplacian, Wallis Sharpening operator, etc.) 4. frequency Domain Enhancement (radix 2 FFT space frequency domain to the domain conversion, Gaussian, ideals, Butterworth High-Low Pass Filter) 5. Morphology (expansion, corrosion, open and close operations, edge extraction) 6. Image Restoration (plus impatient Hoffmann because of the time this is completed seven. Added to read fo
Platform: |
Size: 3416064 |
Author: 王晗 |
Hits:
Description: 基于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
Platform: |
Size: 78848 |
Author: |
Hits:
Description: 目录:
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
Platform: |
Size: 381952 |
Author: 少华 |
Hits:
Description: 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.
Platform: |
Size: 3072 |
Author: dairy |
Hits:
Description: 基数排序：思想:先从数据的低位开始,进行分配,分成10个空间,分别存储位为,0,1,2,3...9
重复的对次地位操作,知道预定的高位,排序完成-Radix Sort: thinking: from data low starting distribution, divided into 10 space, storage spaces, respectively, for 0,1,2,3 ... repeated 9 times the status of the operation, to know the scheduled high ranking completed
Platform: |
Size: 1024 |
Author: 朱洁 |
Hits:
Description: This paper shows the development of a 1024-point
radix-4 FFT VHDL core for applications in hardware signal processing, targeting low-cost FPGA technologies. The developed core is targeted into a Xilinx庐 Spartan鈩?3 XC3S200 FPGA with the inclusion of a VGA display interface and an external 16-bit data acquisition system for performance evaluation purposes. Several tests were performed in order to verify FFT core functionality, besides the time performance analysis highlights the core advantages over commercially available DSPs and Pentium-based PCs. The core is compared with similar third party IP cores targeting resourceful FPGA technologies. The novelty of this work is to provide a lowcost, resource efficient core for spectrum analysis
applications.
Platform: |
Size: 456704 |
Author: alex |
Hits:
Description: A gate level implementation of a Booth Encoded Radix-4 24 bit multiplier with VHDL code in structural form. Carry-save adder and hierarchical CLA adder is used for the component adders in the design. The 12 partial products is a Wallace Adder Tree built from Carry-save adder using 3 to 2 reduction. A hierarchical CLA ( Carry-look-Ahead Adder ) adder is used for the final product generation.
-A gate level implementation of a Booth Encoded Radix-4 24 bit multiplier with VHDL code in structural form. Carry-save adder and hierarchical CLA adder is used for the component adders in the design. The 12 partial products is a Wallace Adder Tree built from Carry-save adder using 3 to 2 reduction. A hierarchical CLA ( Carry-look-Ahead Adder ) adder is used for the final product generation.
Platform: |
Size: 7168 |
Author: Michael Lee |
Hits:
Description: a radix-2,3 and 5 FFT, hopefully this is new and helpful :)
Platform: |
Size: 1024 |
Author: sisi |
Hits:
Description: A radix-3 FFT for any N points. N is not limited to power of 3.
Platform: |
Size: 1024 |
Author: zi |
Hits:
Description: A spilt radix - 3 algorithm for any N. N is limited to power of 3.-A spilt radix- 3 algorithm for any N. N is limited to power of 3.
Platform: |
Size: 1024 |
Author: zi |
Hits:
Description: 集中常见的排序算法，冒泡排序，快速排序，选择排序，堆排序，插入排序，Shell排序，归并排序，基数排序-Focus on common sorting algorithms, bubble sort, quick sort, selection sort, heap sort, insertion sort, Shell sort, merge sort, radix sort
Platform: |
Size: 377856 |
Author: 蓝宇 |
Hits: