Technical Program

Paper Detail

Paper IDW.5.4
Paper Title Rate–Diversity Optimal Multiblock Space–Time Codes via Sum-Rank Codes
Authors Mohannad Shehadeh, Frank R. Kschischang, University of Toronto, Canada
Session W.5: Wireless Communications
Presentation Lecture
Track Wireless Communications
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract Just as rank-metric or Gabidulin codes may be used to construct rate–diversity tradeoff optimal space–time codes, a recently introduced generalization for the sum-rank metric, linearized Reed–Solomon codes, accomplishes the same in the case of multiple fading blocks. We provide the first explicit construction of minimal-delay rate–diversity optimal multiblock space–time codes as an application of linearized Reed–Solomon codes. We then demonstrate in simulation an example of a 2-block 2-by-2 code which, with a small performance penalty—less than 1 dB at a codeword error rate of 1e-4—matches the bit rate of a full diversity alternative while using a much smaller transmitted constellation. A stack decoder for this code is then suggested.

Plan Ahead

IEEE ISIT 2021

2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!