A superposition scheme for downlink multicell processing with finite backhaul capacity  

有限容量回程链路的下行链路多小区处理的叠加编码策略（英文）

作　　者：Yi Xiao Wu Mingzhan Liu Nan 

机构地区：[1]National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China

出　　处：《Journal of Southeast University(English Edition)》2017年第3期253-259,共7页东南大学学报（英文版）

基　　金：The National Natural Science Foundation of China(No.61571123,61521061);the Research Fund of National Mobile Communications Research Laboratory of Southeast University(No.2017A03);Qing Lan Project

摘　　要：In the scenario of downlink multicell processing with finite backhaul capacity in the case of two base stations and two mobile users, by regarding the channel as a multiple access diamond channel with two destinations, an achievability scheme that sends correlated codewords through the multiple access channel with common data is proposed. By considering the superposition structure, fully correlated codewords can be supported by the proposed scheme, which can benefit the system throughput in the case of a relatively-large-capacity backhaul. First, an achievable region for the achievable theory is given and it is proved from the perspective of information theory. Then, in the Gaussian scenario, a simulation combining dirty-paper coding and power allocating is provided for the achievable region. Simulation results demonstrate that when the backhaul capacity is relatively large, the proposed scheme outperforms the existing achievability scheme without the superposition structure.In the scenario of downlink multicell processing withfinite backhaul capacity in the case of two base stations andtwo mobile users, by regarding the channel as a multipleaccess diamond channel with two destinations, an achievabilityscheme that sends correlated codewords through the multipleaccess channel with common data is proposed. By consideringthe superposition structure, fully correlated codewords can besupported by the proposed scheme, which can benefit thesystem throughput in the case of a relatively-large-capacitybackhaul. First, an achievable region for the achievable theoryis given and it is proved from the perspective of informationtheory. Then, in the Gaussian scenario, a simulationcombining dirty-paper coding and power allocating is providedfor the achievable region. Simulation results demonstrate thatwhen the backhaul capacity is relatively large, the proposedscheme outperforms the existing achievability scheme withoutthe SUlaerlaosition structure.

关 键 词：MULTICELL PROCESSING FINITE BACKHAUL capacity SUPERPOSITION dirty-paper coding power allocating 

分 类 号：N0[自然科学总论—科学技术哲学]