SISO_simulation

逆短时傅立叶变换源代码.适合于非稳态的时频联合分析,可直接用于MATLAB编程,无解压密码.(inverse Fourier transform source code. Suited to the non-steady-state joint time-frequency analysis can be used directly in MATLAB programming, without extracting passwords.)

An ad-hoc network with a sender, a destination and a third station act- ing as a relay is analysed. The channels are modelled containing thermal noise, Rayleigh fading and path loss. Di® erent combining methods and di- versity protocols are compared. The amplify and forward protocol shows a better performance than the decode and forward protocol, unless an error correcting code is simulated. To combine the incoming signals the chan- nel quality should be estimated as well as possible. Information about the average quality shows nice bene¯ ts, and a rough approximation about the variation of the channel quality increases the performance even more.

说明：  4096阶QAM调制解调 matlab仿真(matlab 4096 QAM modulation)

说明：  matlab高级统计工具箱，做统计很方便，也很实用(Matlab Toolbox, do the statistics very convenient and practical)

通信原理课程设计，matlab仿真-BPSK信号，方便大家，方便自己(communication principle curriculum design, Matlab simulation-BPSK signals to facilitate, convenience)

How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments. (How the K-mean Cluster workStep 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (Nk) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3. Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4. Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.)

一个报童从报刊发行中心订报后零售，每卖一份报纸可赚钱a元；若报纸卖不出去，则退回发行处，每退一份要赔钱b元。每天报童卖出的份数是随机的，但报童可以根据以往卖报情况统计得到每天卖k份报纸的概率密度p(k)。 （1） 求报童每天期望收益达到最大（或损失达到最小）的定报量z。 （2） 改变参数a/b的值，观察订报量的最优值变化，画出变化曲线。 试画出仿真流程图，进行程序实现，并对仿真结果进行分析。 (A newsboy subscribe from the press after the retail distribution centers, each sale of a newspaper can make money a million if newspapers can not be sold, then returned to Issue Department, each retire to a loss of a b element. Newsboy sold shares in a day is random, but the newsboy can sell based on past statistics reported to be selling daily newspaper k the probability density p (k). (1) seeking newsboy expected profit per day to maximize (or minimize loss) reported that the volume of fixed-z. (2) change the parameters a/b values, subscribe to observe changes in the volume of the optimal value, draw curve. Simulation test to draw a flow chart for program realization, and simulation results for analysis.)

sfcl superconducting fault current limiter

Tracking control of a mobile robot with kinematic and dynamic

说明：  两个信号的DOA估计，用4阶累积量方法。(Two signal DOA estimation, using 4-order cumulant method.)