-
Alamouti
说明: 利用matlab对空时编码的多天线系统中的alamouti空时编码进行了仿真,信道为瑞利衰落信道(Matlab using space-time coding on the multi-antenna system of space-time coding alamouti the simulation, channel for Rayleigh fading channels)
- 2005-09-11 10:53:28下载
- 积分:1
-
OFDM程序
说明: OFDM的接收和发射,是用Matlab编程实现的,希望供大家参考学习!(OFDM receiver and launch, using Matlab programming, I hope for your reference learning!)
- 2005-09-12 23:28:53下载
- 积分:1
-
DS_CDMA_communication_system
这个仿真程序用于实现DS-CDMA通信系统仿真(The simulation program used to implement DS-CDMA Communication System Simulation)
- 2010-05-13 09:27:41下载
- 积分:1
-
L02VT09_MATLAB_intro
intro to matlab.contains basic matlab commands
- 2013-11-28 09:29:02下载
- 积分:1
-
probability-statistical-birthday
matlab语言做一个求一定人数生日相同概率仿真分析的源代码,可以直接下载并使用,只是需要添加初始的人数(Matlab language do a certain number for the same probability birthday simulation analysis of the source code, and can directly download and use, just need to add the number of initial)
- 2012-06-03 17:39:40下载
- 积分:1
-
OFDM-communication-system
《MATLABSimulink通信系统建模与仿真实例精讲》OFDM通信系统(" MATLABSimulink communications system modeling and simulation examples succinctly" OFDM communication system)
- 2013-10-24 15:09:41下载
- 积分:1
-
fd2d.tar
二维声波传播过程模拟,采用一定合适的吸收边界条件(2D acoustic propagation simulation with PML boundary)
- 2014-01-16 11:27:38下载
- 积分:1
-
Yagi-Uda
Yagiuda antenna pattern by matlab
- 2012-01-23 06:47:08下载
- 积分:1
-
MatchFilterLFM
高分辨率雷达 距离向压缩算法滤波器设计 三种方法 全面设计(clc
clear all
close all
2013年9月28日
---------------参数----------
Tr=42e-6
fs=9.5e6
K=0.7e11
Nfft=2048
-------------匹配滤波 时域生成--------------
t=(-Tr/2+1/fs:1/fs:Tr/2-1/fs)
w = kaiser(length(t),2.5)
w=w
w = ones(1,length(t))
ht1=w.*exp(-1i*pi*K*t.^2)
ht2=w.*exp(1i*pi*K*t.^2)
hf1=fft(ht1,Nfft)
hf2=fft(ht2,Nfft)
figure
subplot(211)
plot(abs(hf1))
title( 匹配滤波器1 幅频响应 )
subplot(212)
plot(phase(hf1))
title( 匹配滤波器1 相位 )
figure
subplot(211)
plot(abs(hf2))
title( 匹配滤波器2 幅频响应 )
)
- 2013-10-12 22:32:06下载
- 积分:1
-
101259363Desktop
传统的K-medoids聚类算法的聚类结果随初始中心点的 不同而波动,且计算复杂度较高不适宜处理大规模数据集; 快速K-medoids聚类算法通过选择合适的初始聚类中心改进 了传统K-medoids聚类算法,但是快速K-medoids聚类算法 的初始聚类中心有可能位于同一类簇。为了克服传统的K- medoids聚类算法和快速K-medoids聚类算法的缺陷,提出 一种基于粒计算的K-medoids聚类算法。(The traditional K-medoids clustering algorithm clustering results with different initial center points and volatility, and high computational complexity is not suitable for processing large data sets; K-medoids clustering algorithm by choosing proper initial cluster centers to improve the traditional K-medoids clustering algorithm, but the initial cluster center of K-medoids clustering algorithm can be located in the same cluster. In order to overcome the shortcomings of the traditional K- medoids clustering algorithm and the fast K-medoids clustering algorithm, a K-medoids clustering algorithm based on granular computing is proposed.)
- 2017-07-18 12:05:32下载
- 积分:1