On Fast-Decodable Algebraic Space--Time Codes
Amaro Barreal, Camilla Hollanti

TL;DR
This paper discusses the design and algebraic construction of fast-decodable space--time codes for future wireless systems, emphasizing reduced decoding complexity and practical implementation.
Contribution
It provides a tutorial on algebraic tools for space--time code design and revisits algebraic techniques for reducing decoding complexity in single-user and multiuser codes.
Findings
Algebraic structures enable parallel ML decoding.
Fast-decodable codes reduce worst-case decoding complexity.
Examples illustrate practical code constructions.
Abstract
In the near future, the generation (5G) wireless systems will be established. They will consist of an integration of different techniques, including distributed antenna systems and massive multiple-input multiple-output systems, and the overall performance will highly depend on the channel coding techniques employed. Due to the nature of future wireless networks, space--time codes are no longer merely an object of choice, but will often appear naturally in the communications setting. However, as the involved communication devices often exhibit a modest computational power, the complexity of the codes to be utilised should be reasonably low for possible practical implementation. Fast-decodable codes enjoy reduced complexity of maximum-likelihood (ML) decoding due to a smart inner structure allowing for parallelisation in the ML search. The complexity reductions considered in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Communication Techniques · Coding theory and cryptography · Cooperative Communication and Network Coding
