### 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.

Language | English |
---|---|

Title of host publication | 2013 IEEE International Symposium on Information Theory, ISIT 2013 |

Place of Publication | Piscataway, NJ |

Publisher | Institute of Electrical and Electronics Engineers (IEEE) |

Pages | 1157-1161 |

Number of pages | 5 |

ISBN (Electronic) | 9781479904464 |

ISBN (Print) | 9781479904440 |

DOIs | |

Publication status | Published - 2013 |

Event | 2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey Duration: 7 Jul 2013 → 12 Jul 2013 |

### Other

Other | 2013 IEEE International Symposium on Information Theory, ISIT 2013 |
---|---|

Country | Turkey |

City | Istanbul |

Period | 7/07/13 → 12/07/13 |

### Fingerprint

### Cite this

*2013 IEEE International Symposium on Information Theory, ISIT 2013*(pp. 1157-1161). [6620408] Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/ISIT.2013.6620408

}

*2013 IEEE International Symposium on Information Theory, ISIT 2013.*, 6620408, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 1157-1161, 2013 IEEE International Symposium on Information Theory, ISIT 2013, Istanbul, Turkey, 7/07/13. https://doi.org/10.1109/ISIT.2013.6620408

**Distributed base station cooperation with finite alphabet and QoS constraints.** / Li, Min; Liu, Chunshan; Hanly, Stephen V.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › Research › peer-review

TY - GEN

T1 - Distributed base station cooperation with finite alphabet and QoS constraints

AU - Li, Min

AU - Liu, Chunshan

AU - Hanly, Stephen V.

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84890419452&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2013.6620408

DO - 10.1109/ISIT.2013.6620408

M3 - Conference proceeding contribution

SN - 9781479904440

SP - 1157

EP - 1161

BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

ER -