## Abstrakti

This paper investigates the design of codes for multiple-input multiple-output (MIMO) multiple access channel (MAC). If a joint maximum-likelihood decoding is to be performed at the receiver, then every MIMO-MAC code can be regarded as a single-user code, where the minimum determinant criterion proposed by Tarokh et al. is useful for designing such codes and for upper bounding the maximum pairwise error probability (PEP), whenever the codes are of finite rate and operate in finite signal-to-noise ratio range. Unlike the case of single-user codes where the minimum determinant can be lower bounded by a fixed constant as code-rate grows, it was proved by Lahtonen et al. that the minimum determinant of MIMO-MAC codes decays as a function of the rates. This decay phenomenon is further investigated in this paper, and upper bounds for the decays of minimum determinant corresponding to each error event are provided. Lower bounds for the optimal decay are established and are based on an explicit construction of codes using algebraic number theory and Diophantine approximation. For some error profiles, the constructed codes are shown to meet the aforementioned upper bounds, hence they are optimal finite-rate codes in terms of PEPs associated with such error events. An asymptotic diversity-multiplexing gain tradeoff (DMT) analysis of the proposed codes is also given. It is shown that these codes are DMT optimal when the values of multiplexing gains are small.

Alkuperäiskieli | Englanti |
---|---|

Artikkeli | 7271098 |

Sivut | 5931-5947 |

Sivumäärä | 17 |

Julkaisu | IEEE Transactions on Information Theory |

Vuosikerta | 61 |

Numero | 11 |

DOI - pysyväislinkit | |

Tila | Julkaistu - 1 marraskuuta 2015 |

OKM-julkaisutyyppi | A1 Julkaistu artikkeli, soviteltu |