-
carrier-modulation
多载波调制(Multicarrier Modulation)采用了多个载波信号。它把数据流分解为若干个子数据流,从而使子数据流具有低得多的传输比特速率,利用这些数据分别去调制若干个载波。所以,在多载波调制信道中,数据传输速率相对较低,码元周期加长,只要时延扩展与码元周期相比小于一定的比值,就不会造成码间干扰。因而多载波调制对于信道的时间弥散性不敏感。多载波调制可以通过多种技术途径来实现,如多音实现(Multitone Realization)、正交多载波调制(OFDM)、MC-CDMA和编码MCM(Coded MCM)。其中,OFDM可以抵抗多径干扰,是当前研究的一个热点。(Multi carrier modulation (Multicarrier Modulation) uses multiple carrier signal. It decomposes a data stream into a plurality of sub data stream, so that the sub data stream transmission bit rate is much lower, respectively to a plurality of carrier modulation using these data. )
- 2014-11-26 20:06:23下载
- 积分:1
-
shuju
一个处理化学数据的MATLAB程序,用于处理产生畸变的数据的二次拟合(A chemical treatment data MATLAB procedures for dealing with distortion of data arising from the second fitting)
- 2008-07-31 20:05:25下载
- 积分:1
-
chb1
光伏阵列模型,可以根据光照和温度得到光伏出力情况。(PV array model, you can get the PV output based on light and temperature conditions.)
- 2020-12-11 19:09:18下载
- 积分:1
-
Gauss_Seidel
This code finds the solution to a system of simultaneous linear equation using Gauss_Seidel Method.
- 2012-02-14 06:29:15下载
- 积分:1
-
rlsfilter
rls滤波器设计程序(用matlab编写的程序)(rls filter design process (using Matlab prepared by the procedure))
- 2007-06-14 23:35:39下载
- 积分:1
-
TECH_MEMO-93-07
Longitudinal Control of the Lead Car of a Platoon
- 2021-03-02 15:09:34下载
- 积分:1
-
AACEncode
This program compress audio to AAC encoding format .
It is developed by visual studio 2010.
And written language C++.
- 2014-01-15 09:38:26下载
- 积分:1
-
Helsinki
travel guide to helsinki
- 2010-11-01 17:11:09下载
- 积分:1
-
ga-bp
用遗传算法来改善BP神经网络模型,可以很好的用于最优化、预测等问题的求解(Using genetic algorithms to improve the BP neural network model, can be very good for optimization, forecasting and other problem solving)
- 2011-07-24 13:07:09下载
- 积分:1
-
TSP(TravelingSalesmanProblem)
Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal travel route has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases.
- 2007-11-15 01:44:52下载
- 积分:1