Abstract - under the constraints of integer bit allocation and the proportionality among the throughput of different users ， a new subcarrier - power - integer bits allocation scheme is proposed to maximize the throughput of ofdma systems ， the performance of the proposed scheme are verified by the simulation 摘要针对ofdma系统，在整数比特分配及用户吞吐量公平分配的约束下，提出使系统吞吐量达到最大的有效无线资源优化方案，算法的仿真结果表明本文方法的有效性。
The computer simulations show that the harq with the new combining decoding algorithm is obviously superior to the harq without the combining algorithm and also a rather advantage over the harq with traditional chase combining decoding algorithm in terms of the number of retransmissions and the throughput of system 通过计算机模拟仿真，结果表明采用了新算法的harq在改善系统吞吐量和有效减少重传次数方面明显优于采用无组合译码算法的harq ，而且也略优于采用传统chase译码算法的harq 。
The research on df ( decode - and - forword ) cooperation scheme is proposed aferwrds by analysis and simulation , compared with the af scheme in performance and application . at last after research on cc ( coded cooperation ) cooperation scheme , including original cc and space - time cc , an adaptive space - time coded cooperation scheme , which could more efficiently ultilize the resource of cooperation users , is propsed . simulation results have proved the proposed scheme has better performance than space - time cc both in bit error rate and system throughput 最后在对编码前传( cc , codedcooperation )协同分集方式中的普通编码协同和空时编码协同的原理和实现方式进行研究的基础上提出了一种基于空时编码协同的对信道具有自适应能力的自适应空时编码协同方法,并分析了这种方法的优越性,通过计算机仿真证明了新方法带来的误码率性能的改善和系统吞吐量的提升。
Furthermore , analytical model for adaptive coded modulation is proposed , through which channel snr switching thresholds with the aim of throughput maximization of adaptive coded modulation are obtained with the method of lagrange , and then the average throughput performance of the adaptive system is obtained 通过建立自适应编码调制研究模型，本文还应用拉格朗日函数法得到了使自适应编码调制系统吞吐量性能最大的信道信噪比转换门限，进而得到自适应系统的平均吞吐量性能。
Simulation results show that : i ) the m - lwdf algorithm is a viable solution for scheduling streaming flows in hsdpa ; ii ) this algorithm is unfair because it provides a better qos to users under favourable propagation conditions ; and iii ) a maximum node b queuing of 2 ~ 3 seconds represents a good compromise between cell throughput and delay jitter introduced in the node b for streanming 仿真结果表明, m - lwdf算法适合于hsdpa中流用户的调度服务,但它是一种不公平的算法,总是选择为信道条件好的用户提供更好的qos 。当应用于固定比特速率流业务时,对m - lwdf算法作了一些修改,使得修正后的算法在用户公平性上有了改进,但是不可避免地引起了系统吞吐量的下降。
