Distributed base station cooperation with finite alphabet and QoS constraints

Min Li, Chunshan Liu, Stephen V. Hanly

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

3 Citations (Scopus)

Abstract

This work studies a novel power-efficient precoder design problem for a linear cellular array with base station (BS) cooperation: data symbols intended for mobile stations (MSs) are drawn from discrete finite alphabets, precoding is performed among BSs to produce appropriate signals transmitted over the channel, symbol-by-symbol detection is performed at each MS, and a minimum Symbol Error Probability (SEP) for detection is introduced as the Quality-of-Service (QoS) metric at each MS. With regular constellations such as 16-QAM deployed as system data inputs, the SEP constraints are formulated and characterized by a set of convex relaxations on the received signals. A convex power optimization problem is then formulated subject to the SEP constraints. By the primal-dual decomposition approach, a distributed algorithm is developed to solve the problem in which only local communication among BSs is required. Our scheme is shown to significantly outperform linear zero-forcing precoder in terms of transmit power consumption.

Original languageEnglish
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1157-1161
Number of pages5
ISBN (Electronic)9781479904464
ISBN (Print)9781479904440
DOIs
Publication statusPublished - 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: 7 Jul 201312 Jul 2013

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/07/1312/07/13

Fingerprint Dive into the research topics of 'Distributed base station cooperation with finite alphabet and QoS constraints'. Together they form a unique fingerprint.

Cite this