-
MUSIC-algorithm
matlab实现MUSIC算法,信号样本数1000,估计自相关矩阵为八阶。(matlab to realize music algorithm)
- 2011-06-17 22:32:18下载
- 积分:1
-
3
说明: 地震数据时频分析与分频处理,需要的带走吧,很不错的(Time-frequency analysis and seismic data processing division, need take it away, it is good)
- 2013-09-08 08:46:13下载
- 积分:1
-
41695062kuaidaixinhaoDOA
针对稀疏圆阵的波达方向估计问题,提出了解相干求根MUSIC算法(Sparse UCA Decorrelation Root-MUSIC,SDR)。通过改进传统的波束变换方法,进行相位校正,并在波束域进行误差补偿,得到具有共轭对称结构的波束域导向矢量。在波束域进行前后向平均处理和使用求根MUSIC算法(In order to solve the direction of arrival estimation of sparse circular arrays, a new understanding of the Sparse UCA Decorrelation Root-MUSIC (SDR) algorithm is proposed. By improving the traditional beam transform method, phase correction, and error compensation in the beam domain, a beam-domain steering vector with a conjugate symmetry structure is obtained. Averaging forward and backward in the beam domain and using the root-finding MUSIC algorithm)
- 2018-06-27 15:32:42下载
- 积分:1
-
matlab_imagematching
基于灰度的归一化匹配算法;
基于灰度的快速模板匹配算法。
(Based on the normalized intensity matching Based on Gray' s fast template matching algorithm.)
- 2021-03-28 20:09:11下载
- 积分:1
-
matlab
这是MATLAB图形界面设计(英文原版),有需要的下下来看吧(MATLAB graphical interface design (English original), there is a need in the next down and see)
- 2013-02-04 16:40:22下载
- 积分:1
-
mixart_mixer
Driver for Digigram miXart soundcards.
- 2014-08-20 11:20:58下载
- 积分:1
-
FFT_3octave_A
说明: 1/3倍频程的实现,先fft然后计算上下限频率。(The realization of 1 / 3 octave, FFT first and then calculate the upper and lower frequency.)
- 2020-05-29 10:14:05下载
- 积分:1
-
kalman
详细的kalman滤波程序,对于初学者很有用(kalman filter)
- 2009-03-05 21:16:39下载
- 积分:1
-
matlab
说明: matlab实现经典功率谱估计,xiwangdajia xuexi(matlab gonglvpugyujichengxu)
- 2010-03-31 10:18:50下载
- 积分:1
-
huffman
霍夫曼编码的具体方法:先按出现的概率大小排队,把两个最小的概率相加,作为新的概率 和剩余的概率重新排队,再把最小的两个概率相加,再重新排队,直到最后变成1。每次相 加时都将“0”和“1”赋与相加的两个概率,读出时由该符号开始一直走到最后的“1”, 将路线上所遇到的“0”和“1”按最低位到最高位的顺序排好,就是该符号的霍夫曼编码。(Specific methods Huffman coding: the probability of emergence of the size press line, the two smallest sum probability, as a new probability and the probability of re-queue the remaining, then the minimum of two probabilities are added, and then re-queue, until finally become one. Each time the sum will be 0 and 1 Fu added two probabilities, when read by the symbol has come to begin the final 1 , the route will encounter a 0 and 1 at the lowest to the highest bit of the right order, that is the symbol of the Huffman coding.)
- 2015-04-04 20:34:08下载
- 积分:1