### 摘要

This work considers inverse determinant sums, which arise from the union bound on the error probability, as a tool for designing and analyzing algebraic space-time block codes. A general framework to study these sums is established, and the connection between asymptotic growth of inverse determinant sums and the diversity-multiplexing gain tradeoff is investigated. It is proven that the growth of the inverse determinant sum of a division algebra-based space-time code is completely determined by the growth of the unit group. This reduces the inverse determinant sum analysis to studying certain asymptotic integrals in Lie groups. Using recent methods from ergodic theory, a complete classification of the inverse determinant sums of the most well-known algebraic space-time codes is provided. The approach reveals an interesting and tight relation between diversity-multiplexing gain tradeoff and point counting in Lie groups.

原文 | English |
---|---|

文章編號 | 6523963 |

頁（從 - 到） | 6060-6082 |

頁數 | 23 |

期刊 | IEEE Transactions on Information Theory |

卷 | 59 |

發行號 | 9 |

DOIs | |

出版狀態 | Published - 5 九月 2013 |

## 指紋 深入研究「Inverse determinant sums and connections between fading channel information theory and algebra」主題。共同形成了獨特的指紋。

## 引用此

*IEEE Transactions on Information Theory*,

*59*(9), 6060-6082. [6523963]. https://doi.org/10.1109/TIT.2013.2266396