TY - GEN
T1 - Joint Base Station selection and linear precoding for cellular networks with multi-cell processing
AU - Zeng, Yong
AU - Gunawan, Erry
AU - Guan, Yong Liang
AU - Liu, Jin
PY - 2010
Y1 - 2010
N2 - Multi-cell processing (MCP) is regarded as an effective way for interference mitigation in cellular networks. We propose a joint Base Station (BS) selection and linear precoding design algorithm for the downlink transmission in MCP enabled networks. The algorithm solves a regularized utility maximization problem to find a sparse solution for the precoding matrix. The BS selection is thus based on the sparsity pattern of the resulted precoding matrix. With the joint design, the proposed algorithm rigorously takes into account and optimizes the effect of BS selection on the overall system performance. The problem of total power minimization for target SINR, which can be cast as a Second Order Cone Program (SOCP) is used as an example for illustration. Simulation is performed to compare the proposed algorithm with the BS selection schemes in literature. It shows that our joint algorithm not only requires less power for target SINR, but also dramatically reduces the computational complexity.
AB - Multi-cell processing (MCP) is regarded as an effective way for interference mitigation in cellular networks. We propose a joint Base Station (BS) selection and linear precoding design algorithm for the downlink transmission in MCP enabled networks. The algorithm solves a regularized utility maximization problem to find a sparse solution for the precoding matrix. The BS selection is thus based on the sparsity pattern of the resulted precoding matrix. With the joint design, the proposed algorithm rigorously takes into account and optimizes the effect of BS selection on the overall system performance. The problem of total power minimization for target SINR, which can be cast as a Second Order Cone Program (SOCP) is used as an example for illustration. Simulation is performed to compare the proposed algorithm with the BS selection schemes in literature. It shows that our joint algorithm not only requires less power for target SINR, but also dramatically reduces the computational complexity.
UR - http://www.scopus.com/inward/record.url?scp=79951620455&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79951620455&partnerID=8YFLogxK
U2 - 10.1109/TENCON.2010.5686541
DO - 10.1109/TENCON.2010.5686541
M3 - Conference contribution
AN - SCOPUS:79951620455
SN - 9781424468904
T3 - IEEE Region 10 Annual International Conference, Proceedings/TENCON
SP - 1976
EP - 1981
BT - TENCON 2010 - 2010 IEEE Region 10 Conference
T2 - 2010 IEEE Region 10 Conference, TENCON 2010
Y2 - 21 November 2010 through 24 November 2010
ER -