chazhi

contourlet变换的mmatlab工具包 (the contourlet transform the mmatlab of Kit)

MATLAB利用线性矩阵不等式解决控制系统的观测器设计问题并求解出了正定矩阵 (MATLAB linear matrix inequality solve observer design the control system and solved a positive definite matrix)

访问控制课设报告，自主访问控制和基于角色的访问控制(Report class-based access control, discretionary access control and role-based access control)

这是激光猝发信号的信号模拟，他是信号模拟的基础，也是信号调制与解调的信号源。(This is a laser burst signal analog signal, he is the basis of signal simulation is the signal modulation and demodulation of the signal source.)

此程序为地震数据处理中的反褶积，用于提高纵向分辨率。此程序构建在简单褶积模型上，分为脉冲和预测反褶积两种，参数可自调。(This procedure for seismic data processing deconvolution, used to improve the vertical resolution. This program is built on a simple convolution model is divided into pulses and predictive deconvolution two parameters can be self-adjusting.)

介绍了相关的说明文档及应用手册，及其机械构造，尺寸等(Introduce the relevant documentation and application manual, and its mechanical construction, size, etc.)

这个是多相滤波的MATLAB程序，做接收机的同学可以参考的(this is a polyphase programme)

一个用c语言编的潮流程序,希望对大家有用，大家一起学习(Trend of the program, a series of MATLAB language containing transformer branch, automatically reads the data file program)

用镜像矩阵求出矩阵的QR分解（正交三角分解），并求解线性方程组，该方法不必选主元，但其计算过程非常稳定。也可用于求矩阵的广义逆和求解线性最小二乘问题。子过程QRDCMP用镜像矩阵求m*n矩阵A的QR分解，A=Q^TR,其中Q是m*m正交矩阵，R为m*n上三角矩阵；子过程QRBKSB用矩阵的QR分解求解线性方程组Ax=b，其中A为n阶非奇异方阵。(Matrix obtained with the mirror matrix QR decomposition (orthogonal triangular decomposition), and solving linear equations, the method does not have to choose the main element, but its calculation process is very stable. Can also be used to find the generalized inverse matrix and solving linear least squares problems. Sub-process of the mirror matrix QRDCMP m* n matrix A QR decomposition, A = Q ^ TR, wherein Q is a m* m orthogonal matrix, R is m* n upper triangular matrix subprocess QRBKSB a QR decomposition to solve the matrix linear equations Ax = b, where A is non-singular square matrix of order n.)

good code good code good code good code good code good code good code good code good code (good code good code good code good code good code good code good code good code good code)