TD-HSDPA即TD-SCDMA高速下行分组接入是第三代移动通信标准TD-SCDMA的增强型技术，引入其的目的是为了应对日益增长的数据通信业务，提高第三代移动通信标准的竞争力。为了实现高速数据通信的目标，除了改进系统结构以及引入AMC、HARQ等新技术，分组调度技术发挥着十分重要的作用。分组调度技术控制着系统资源的分配，在很大程度上决定着系统的行为。 本文首先分析了HSDPA系统中与分组调度有关的技术，总结了这些技术在TD-HSDPA和W-HSDPA中的异同，推导出多载波TD-HSDPA所能实现的理论最高速率，进一步证明TD-HSDPA相比W-HSDPA在频谱利用率方面具有优势。接着从无线信道衰落理论入手，通过理论分析和仿真论证了以CQI为参数实施调度的合理性和有效性，给出了分组调度失效的理论临界速率和调度模型。本文重点研究了三种典型的非实时业务调度算法，理论分析和仿真表明经典的比例公平算法相比其他两种算法在吞吐量和公平性之间取得折衷，是一种较优的算法。针对经典比例公平算法在新用户加入系统时造成的用户间不公平性，本文提出了一种改进算法，理论分析和仿真表明改进算法有效地改善了用户间的不公平性并且吞吐量性能有所提升。最后本文对比例公平算法的时间窗选取原则进行了一些讨论，针对分组调度算法的实施提出两点设想。

TD-HSDPA which stands for high speed downlink packet access in TD-SCDMA is an enhanced technique of the 3rd generation mobile communication standard. The purpose of introducing this technique is facing the increasing data communication service and strengthening the competition of the standard. For achieving high data rate communication, besides the improved architecture and techniques such as AMC and HARQ, the packet scheduling technique plays a very important role. It controls the allocation of the system resource and determines the system behavior. First, the dissertation analyses the elements related to the packet scheduling in HSDPA system, and summarizes the similarities and differences of these elements in the TD-HSDPA and W-HSDPA. The highest rate that could be achieved in multi-carrier TD-HSDPA is deduced and furthermore the spectrum efficiency advantage of TD-HSDPA compared to W-HSDPA is proved. Then the rationality and validity of scheduling based on the CQI parameter is deduced and proved by mobile fading channel theory. The threshold rate in theory of invalid scheduling is deduced and a scheduling model is proposed. The dissertation mainly studies the scheduling algorithms which support the non-real time service, and the analysis and simulation results prove that PF algorithm gets the balance of fairness and throughput. The PF algorithm is better than the RR and Max C/I algorithms. A modified algorithm is proposed based on the classical PF algorithm according to the unfairness made by the new user and the theoretical analysis and simulation results prove the modified algorithm improves the fairness of the users, and at the same time the performance of the system throughput has improved. At last, the principles of the selection about the time window in PF algorithm are discussed and two schemes are proposed for the implementation of the packet scheduling algorithms.