在有限回程链路容量的下行链路多小区处理的场景中,针对2个基站2个用户的情况,通过将信道视为带有2个接收端的多址接入菱形信道,提出了一种可达性策略,将带有公共数据的相关码字传送到信道中.由于考虑了叠加编码的结构,该策略能够支持完全相关的码字,这使得在回程链路容量相对较大的情况下,系统吞吐量能够得到提升.首先给出了该可达性策略的可达域并从信息论的角度进行了证明.然后在高斯场景下,结合脏纸编码方法和功率分配方法,对可达域进行了仿真计算.仿真结果显示,当回程链路容量相对较大时,所提出的策略性能在某些情况下优于已知的未引入叠加编码的可达性策略.%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.
展开▼
