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

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 |

### Fingerprint

### Cite this

*Proceedings of the 2013 Australian Communications Theory Workshop: AusCTW 2013 : January 29 - February 1, 2013 in Adelaide, Australia*(pp. 164-169). Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/AusCTW.2013.6510063

}

*Proceedings of the 2013 Australian Communications Theory Workshop: AusCTW 2013 : January 29 - February 1, 2013 in Adelaide, Australia.*Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 164-169, Australian Communications Theory Workshop (14th : 2013), Adelaide, Australia, 29/01/13. https://doi.org/10.1109/AusCTW.2013.6510063

**Transmitter optimization for the network MIMO downlink with finite-alphabet and QoS constraints.** / Li, Min; Liu, Chunshan; Hanly, Stephen V.; Collings, Iain B.

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

TY - GEN

T1 - Transmitter optimization for the network MIMO downlink with finite-alphabet and QoS constraints

AU - Li, Min

AU - Liu, Chunshan

AU - Hanly, Stephen V.

AU - Collings, Iain B.

PY - 2013

Y1 - 2013

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

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

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

U2 - 10.1109/AusCTW.2013.6510063

DO - 10.1109/AusCTW.2013.6510063

M3 - Conference proceeding contribution

SN - 9781467346733

SP - 164

EP - 169

BT - Proceedings of the 2013 Australian Communications Theory Workshop

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

ER -