On optimal message assignments for interference channels with CoMP transmission

摘要: The degrees of freedom (DoF) number the fully connected K-user Gaussian interference channel is known to be K over 2 (see [3]). In [4], DoF for same model was studied while allowing each message available at its own transmitter as well M − 1 successive transmitters. particular, it shown that gain through cooperation does not scale with users a fixed value M, i.e., per user 2. this work, we relax constraint such can assigned transmitters without imposing further constraints on their location. Under new constraint, study properties different assignments in terms achieved cooperation. show local confines transmit set within o(K) radius cannot achieve greater than Moreover, conclusion about holds any assignment messages more two Finally, case where > 2, do know whether achievable. However, identify candidate class could potentially lead positive answer.