A novel decentralized time slot allocation algorithm in dynamic TDD system
Young Sil Choi, Illsoo Sohn, Kwang Bok Lee · 2006
This paper proposes the decentralized time slot allocation (DTSA) algorithm in dynamic TDD (DTDD) system to support traffic asymmetry. In D-TDD systems, additional interferences are introduced when one cell is uplink (downlink) and the other cell is downlink (uplink). These kinds of interferences result in severe performance degradation of SIR, which occurs especially to users in cell edge than users in cell center. To reduce additional interferences, DTSA algorithm is applied to D-TDD system. This algorithm assumes decentralized cellular network, so, it operates independently in each cell and has lower complexity than the other systems. Using DTSA algorithm, the outage probability of uplink and downlink at 0dB are decreased about 4.3% and 8.5% compared to conventional D-TDD system, respectively. Also DTSA algorithm increases the system capacity compared to S-TDD system and conventional D-TDD system. Simulation results show that D-TDD system with DTSA algorithm can support more asymmetric traffic than other systems, which increase system capacity.