Constructions of Complex Codebooks Asymptotically Meeting the Welch Bound: A Graph Theoretic Approach

Shohei Satake, Yujie Gu

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

Complex codebooks with small inner-product correlation have many applications such as in code-division multiple access communications and compressed sensing. It is desirable but difficult to construct optimal codebooks achieving the well-known Welch bound. In this paper, complex codebooks are investigated from a graph theoretic perspective. A connection between codebooks and Cayley sum graphs is established. Based on this, many infinite families of complex codebooks are explicitly constructed, which are asymptotically optimal with respect to the Welch bound. These constructions not only include some known constructions as special cases but also provide flexible new parameters.

本文言語英語
ホスト出版物のタイトル2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
出版社Institute of Electrical and Electronics Engineers Inc.
ページ48-53
ページ数6
ISBN(電子版)9781728164328
DOI
出版ステータス出版済み - 6 2020
外部発表はい
イベント2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, 米国
継続期間: 7 21 20207 26 2020

出版物シリーズ

名前IEEE International Symposium on Information Theory - Proceedings
2020-June
ISSN(印刷版)2157-8095

会議

会議2020 IEEE International Symposium on Information Theory, ISIT 2020
国/地域米国
CityLos Angeles
Period7/21/207/26/20

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • 情報システム
  • モデリングとシミュレーション
  • 応用数学

フィンガープリント

「Constructions of Complex Codebooks Asymptotically Meeting the Welch Bound: A Graph Theoretic Approach」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル