-
LDA_coil
线性鉴别分析方法,数据降维,图像处理,模式识别(LDA)
- 2010-12-23 15:00:29下载
- 积分:1
-
macthed_filter_2
说明: 线性调频信号的匹配滤波器的设计与实现第二款(LFM matched filter design and implementation of paragraph)
- 2011-03-22 16:44:31下载
- 积分:1
-
fuzzy-GPC
模糊广义预测控制及其应用,对传统广义预测控制的改进。(Fuzzy generalized predictive control and its applications, improvement of traditional generalized predictive control.)
- 2012-06-10 11:13:08下载
- 积分:1
-
17686393RS_coding
RS码是一种纠错能力很强的编码,对RS码具有进一步分析(RS code is a very strong error correction coding, with a further analysis of the RS code)
- 2011-10-31 19:25:05下载
- 积分:1
-
MAssive-MIMO
MAssive MiMO in which it shows its performance in terms of BER
- 2020-08-13 11:18:33下载
- 积分:1
-
zhang-calibration
张正友标定法用于相机标定内含源代码和3篇论文(zhengyou zhang
camera calibration)
- 2016-04-13 19:01:17下载
- 积分:1
-
chengxu
我这儿有一组若干年份的数据,是按一定时间顺序排的,想用曲线拟合法得到2010年的人均国内生产总值,不知怎么用matlab,高手赐教!!!!!!可加分
年份 人均国内生产总值(元)
1996 27000
1997 30619
1998 33282
1999 33689
2000 41020
2001 43344
2002 46030
2003 53887
2004 59271
2005 64507
2006 70597
07.1季 20505
07.2季 19619
07.3季 19874
07.4季 19223
08.1季 19703(I have a group here, a number of years of data are ranked by order of a certain period of time, and want to use curve fitting to be in 2010 the per capita gross domestic product, I do not know how to use matlab, you let us know! ! ! ! ! ! Add points to the year the per capita GDP (Yuan) 1996 27000 1997 30619 1998 33282 1999 33689 2000 41020 2001 43344 2002 46030 2003 53887 2004 59271 2005 64507 2006 70597 07.1 quarter 19,619 07.3 quarter 20,505 07.2 quarter 19,223 08.1 quarter 19,874 07.4 quarter 19,703)
- 2009-04-03 20:18:40下载
- 积分:1
-
linear_focus_beamform_fft
聚焦波束形成 线阵波束形成算法实现:包括非FFT算法和采用FFT算法的程序(Focused beamforming line array beamforming algorithm: including non-FFT algorithm and uses FFT algorithm procedures)
- 2020-09-08 19:28:04下载
- 积分:1
-
013362822yuanzhen
对均匀圆阵和均匀线阵的方向图指向进行描述 matlab(UCA ULA MATLAB)
- 2010-11-30 10:11:43下载
- 积分:1
-
K_Means_image_compression
- K means algorithm is performed with different initial centroids in order to get the best clustering.
- The total cost is calculated by summing the distance of each point to its cluster centre and then summing over all the clusters.Based on the minimum overall cost achieved during each iteration of iterKMeans the pixel assignment to their respective clusters are made and final compressed image is obtained. This algorithm will run slower as the number of clusters , size of the image and number of iterations increase.
- 2013-07-26 15:49:00下载
- 积分:1