文件名称:cp0101_bandwidth
介绍说明－－下载内容均来自于网络，请自行研究使用
第一步是计算输人信号单边功率谱密度（ESD）。使用快
％速傅里叶（FFr）算法将信号从时域转换到频域。因为FFr算法的输出是离散谱，而这
％里我们需要的是连续谱，因此需要引人不同的比例因子来实现从离散谱到连续谱的转换。
％在第二步中，我们利用迭代算法计算出相对于特定阂值的ESD的最高和最低频率，从而
％估算出被检测信号所占用的带宽。这种算法同时适用于基带信号和已调制信号。最后，
％在第三步中，我们给出了输出图形的原代码。-The first step is calculating the input signal unilateral power spectral density (ESD). The use of fast Fourier speed (FFr) algorithm for the signal conversion from time domain to frequency domain. FFR algorithm because the output is a discrete spectrum, which we need is a continuous spectrum, so the need for food of different scale factor to achieve from the discrete spectrum to continuous spectrum conversion. In the second step, we use iterative algorithm to calculate a specific threshold in relation to the ESD of the highest and lowest frequency, thus estimated to be occupied by the signal detection bandwidth. This algorithm applies to both baseband signal and modulation signals. Finally, in the third step, we give the graphical output of the original code.
％速傅里叶（FFr）算法将信号从时域转换到频域。因为FFr算法的输出是离散谱，而这
％里我们需要的是连续谱，因此需要引人不同的比例因子来实现从离散谱到连续谱的转换。
％在第二步中，我们利用迭代算法计算出相对于特定阂值的ESD的最高和最低频率，从而
％估算出被检测信号所占用的带宽。这种算法同时适用于基带信号和已调制信号。最后，
％在第三步中，我们给出了输出图形的原代码。-The first step is calculating the input signal unilateral power spectral density (ESD). The use of fast Fourier speed (FFr) algorithm for the signal conversion from time domain to frequency domain. FFR algorithm because the output is a discrete spectrum, which we need is a continuous spectrum, so the need for food of different scale factor to achieve from the discrete spectrum to continuous spectrum conversion. In the second step, we use iterative algorithm to calculate a specific threshold in relation to the ESD of the highest and lowest frequency, thus estimated to be occupied by the signal detection bandwidth. This algorithm applies to both baseband signal and modulation signals. Finally, in the third step, we give the graphical output of the original code.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
cp0101_bandwidth.m