## Abstract

We consider a network MIMO downlink communication where base stations (BSs) can cooperate on transmission of data symbols to their intended mobile stations (MSs). We assume the data symbols for each user come from a finite alphabet. We formulate a novel power optimization problem for the downlink communication starting with the binary inputs: we take a symbol detection point of view, impose minimum Symbol Error Probability (SEP) as Quality-of-Service (QoS) constraints at the MSs, and show that the resulting problem is convex. We first tackle the problem via centralized approaches and then propose a distributed algorithm to solve the power optimization problem, where only local communication among the base stations is required. We compare with state of the art linear precoding techniques, and demonstrate significant reduction in consumed transmit power attained by the proposed schemes. We also provide an extension of the problem to general finite-alphabet inputs.

Original language | English |
---|---|

Title of host publication | Proceedings of the 2013 Australian Communications Theory Workshop |

Subtitle of host publication | AusCTW 2013 : January 29 - February 1, 2013 in Adelaide, Australia |

Place of Publication | Piscataway, NJ |

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

Pages | 164-169 |

Number of pages | 6 |

ISBN (Electronic) | 9781467346757 |

ISBN (Print) | 9781467346733 |

DOIs | |

Publication status | Published - 2013 |

Event | Australian Communications Theory Workshop (14th : 2013) - Adelaide, Australia Duration: 29 Jan 2013 → 1 Feb 2013 Conference number: 14th |

### Other

Other | Australian Communications Theory Workshop (14th : 2013) |
---|---|

Country | Australia |

City | Adelaide |

Period | 29/01/13 → 1/02/13 |