Research And Realization On Parallel Processing Of Uplink And Downlink Scheduling

Along with the wireless communication system presenting the development trend ofmobile, broadband and IP.3G mobile couldn’t meet the growing demand, then the4Gmobile communication emerges. LTE will be the most important standardin the future,which points out the direction of the future4G evolutionIn the early stage of LTE mobile communication system, it usually used serialscheduling, due to the limitation of hardware conditions. In the method of serial scheduling,it only has1millisecond to complete uplink and downlink scheduling. This paper putsforward the parallel scheduling processing, which completes uplink and downlinkscheduling separately. This way, the uplink and downlink scheduling both have1millisecond processing time, their respective scheduler have enough time to finish theirprocessing tasks.Of course, the uplink scheduling and the downlink scheduling is not entirely withoutcontact, inside there are a lot offactors affect one another, which called coupling. So, wecan’t simply change serial scheduling into parallel scheduling. Main purpose of this articleis to study the parallel scheduling, put forward the new scheduling algorithm, analyze theparallel scheduling theory reason, and put forward the corresponding solutions. Theexperiment and simulation verify the feasibility of the scheme, which ensures theprocessing of parallel scheduling.This paper firstly studies LTE commonly used scheduling algorithm. It puts forward anew scheduling algorithm of the parallel scheduling. Based on the protocol and realization,this paper finds three couplings: the first one is the random access message3ascendingresource allocation and message2descending resource allocation processing. The secondis in the distribution of the CCE has scheduling. The third is the parallel scheduling triggermode in1millisecond. According to the analysis of the reason in theory, it puts forward thesolution to these three couplings. In this paper, it takes a set of benchmark time recordingmechanism and count statistics mechanism, which can get the value of scheduling time andstatistics, to verify the feasibility of various schemes.This paper verifies the three kinds of commonly used scheduling algorithm throughthe simulation results. It puts forward a proportion fair scheduling algorithm based on QOS.It uses experimental to verify the necessity of the existence of parallel scheduling. According to the scheduling time recorded on the mechanism of benchmark and count, itfinds solutions to coupling scheme. Problem1is solved by delaying1millisecond whileprocessing message2. In this way, message3will not have a conflict with message2inuplink distribution, which resoles the problem of disable to access. Problem2is solved byusing signal quantity plan to guarantee CCE distribution and will not affect the processingof parallel scheduling. Problem3is solved by using the hardware interruption or themessage to trigger parallel scheduling.Parallel scheduling saves scheduling time. For the later evolution, it provides aguarantee to more complex scheduling strategy and scheduling algorithm.