资源列表
sdf_fft_8pt
- 8pt sdf fft pipelined
NewtonSolution
- 牛顿法解线性方程组，c语言代码，欢迎指正错误-Newton' s method for solving linear equations, c language code, please correct me wrong
beam_weight
- 加权的波束形成程序，均匀线列阵，可以扩展到各种阵形，各种加权情况-weighted beamforming procedures, uniform linear array, can be extended to the various camps, all kinds of weighted
gauss
- 数值分析高斯——列主元消去法主程序 说明如下： ％ a----input,matrix of coefficient ％ b----input,right vector ％ sol----output,returns the solution of linear equation-Gauss numerical analysis- out PCA elimination main program as follows: a---- input, matrix of coeffi
FIR
- FFT和FIR 快速傅里叶变换和FIR滤波器实验程序-Fast Fourier Transform FFT and FIR and FIR filter experimental procedure
C.
- 判断101-200之间有多少个素数，并输出所有素数。 1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。 -Between 101-200 to determine the number of primes, and prints out all prime numbers. 1 program analysis: methods to determine the prime numbers: a numb
remove_inrange_nodes_bst
- Change Color of matrixC hange Color of matrixC hange Color of matrix-Change Color of matrixChange Color of matrixChange Color of matrixChange Color of matrixChange Color of matrix
1111
- 解决小孩搬砖问题，男搬5块，女搬砖3块，三个小孩抬一块-Solve the problem of child moving bricks, moving five men, three women moving bricks, three children carry a
FastICA
- 快速分析独立主成分算法，可以分离信号和混合数据-Fast ICA algorithm, the signal can be separated and mixed data
VM_KURS
- finite difference method
3.
- 这是一个斐波那契数列，完全数和排序用C++编程的源代码，希望共享-This is a Fibonacci sequence, complete number, and sort of programming with C++ source code, want to share
complex
- 输入两个复数，计算出两个数的和，并用复数表示形式输出。-Input 2 complex numbers, figure out the total result of them, and them output the result with complex.