搜索资源列表
FLch3RLSeg3
- 最小二乘法递推算法辨识程序,输入u,输出y, 输出结果中的c矩阵中最后一列为参数估计值.-Recursive least squares algorithm for identification procedures, input u, output y, the output matrix c of the last one as the estimated value of parameters.
hannuota
- 汉诺塔非递归程序，包含详细的解析、代码、结果及心得-Tower of Hanoi non-recursive procedures, contains a detailed analysis, code, results and experiences
leastsquaresmethod
- 用不加权的递推最小二乘法进行参数估计，用于系统辩适、仿真-Using non-weighted recursive least squares parameter estimation method for systems dialectical relevance, simulation
HANOI
- 很多朋友都久等了,这是我做了很久的程序!一个非递归的汗诺塔代码,很好的!-Many of my friends are waiting, this is my procedure to do for a long time! A non-recursive Khan, Tower of code, very good!
adaptive_anisotropic_2D_gaussian_filter
- Gaussian filtering in one, two or three dimensions is among the most commonly needed tasks in signal and image processing. Finite impulse response filters in the time domain with Gaussian masks are easy to implemen
RLS
- 递归式最小均方（RLS）算法的基本思想是力图使在每个时刻对所有已输入信号而言重估的平方误差的加权和最小，这使得RLS算法对非平稳信号的适应性要好。与LMS算法相比，RLS算法采用时间平均，因此，所得出的最优滤波器依赖于用于计算平均值的样本数，而LMS（NLMS）算法是基于集平均而设计的，因此稳定环境下LMS（NLMS）算法在不同计算条件下的结果是一致的-Recursive least-mean-square (RLS) algorith
fft
- 分四种情况实现fft 分别是时间抽取递归 、时间抽取循环、频率抽取递归和频率抽取循环 以及附带dft的算法描述-Fft realize sub-four cases were collected recursive time, time taken from the cycle, frequency and frequency of samples taken from recursive cycle, as well as i
HANOI_I
- 著名的世界末日问题-河内之塔(Towers of Hanoi) 的递归算法很容易实现,但效率不过,但非递归算法会写的人却很少,这个非递归算法不但高效,并且简短-The end of the world well-known problem- Hanoi Tower (Towers of Hanoi) of the recursive algorithm is very easy to realize, but efficiency, h
games
- 数据结构算法中一些经典的小游戏的算法，如魔法矩阵，八皇后问题，骑士游历问题，环游世界问题，一笔画问题，非递归的汉诺塔问题等-Data structure algorithm some classic game of algorithms, such as magic matrix, 8 Queen s problem, the issue of Cavalier traveled, round-the-world problem, th
sixsortmethods
- 数据结构中的排序方法，包括：希尔排序，非递归的快速排序，递归的快速排序，堆排序，归并排序，基数排序-Sort of data structure, including: Hill sorted, non-recursive quicksort, recursive Quick Sort, Heap Sort, Merge Sort, Radix Sort
TSP
- 旅行商问题，两种方法实现，分别是递归回溯和用栈来代替递归的功能的程序-Traveling salesman problem, two methods to achieve, namely, retrospective and the use of recursive stack instead of recursive function procedures
Recursive_systematic-case
- Generate trellis of a rate-1/n recursive convolutional code，生成网格图（对码率为1/n的递归卷积码）-Generate trellis of a rate-1/n recursive convolutional code, generated grid (on the rate for 1/n Recursive Convolutional Code)
duobuyuce
- 多部预测自校正控制的算法仿真程序，用matlab写的。用的RLS带遗忘的最小二乘法递推。-Forecast for more than self-tuning control algorithm simulation program, written using matlab. Used in the RLS with forgetting recursive least square method.
QuickSort
- 快速排序法，基于分治策略的一个排序算法 3个步骤1分解，2递归求解，3合并 使用随机划分挑选哨兵，期望划分较对称-Quick Sort law governing strategy based on a sorting algorithm 3 Step 1 decomposition, 2 Recursive Solution, 3 combined divided randomly selected sentinel to e
Recursive_Least_Squares_Constant_Modulus_Algorithm
- 盲自适应算法--递推最小二乘恒模算法Recursive Least Squares Constant Modulus Algorithm for Blind Adaptive Array-Recursive Least Squares Constant Modulus Algorithm for Blind Adaptive Array2004
rls
- contains documents about new insights into the recursive least squares algorithm and a sample matlab code for rls algorithm
sudoku
- 用C++编写的数独游戏，采用回溯法，非递归，计算超快，代码精炼，注解详细-Using C++ Game Sudoku prepared using retrospective law, non-recursive calculation of ultrafast, code refining, detailed comments
Recursive
- 格雷码问题 1.问题描述 对于给定的正整数n，格雷码为满足如下条件的一个编码序列： (1) 序列由2n个编码组成，每个编码都是长度为n的二进制位串。 (2) 序列中无相同的编码。 (3) 序列中位置相邻的两个编码恰有一位不同。 例如：n=2时的格雷码为：{00, 01, 11, 10}。 设计求格雷码的递归算法并实现。 -Gray-code problem 1. Problem descr iption
rename
- 实现在指定目录及其子目录中搜索指定扩展名的文件，并更新为新的扩展名的程序reext 程序功能： 1．程序带有三个命令行参数dir、old和new，用法为： reext dir old new 其中Dir是一个全路径名，old和new是文件扩展名，如： Reext c:\ASM\TEST txt doc 2．程序实现的功能为：在路径Dir中搜索文件扩展名为txt的所有文件，如果找到，将其扩展名改为doc，
quicksort
- 用非递归实现快速排序 主要思想： 利用栈来消除递归-Non-recursive quicksort implementation the main idea: to eliminate the use of recursive stack