A superposition scheme for downlink multicell processing with finite backhaul capacity

摘要

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.