Constructions of Fast-Decodable Distributed Space-Time Codes
Amaro Barreal, Camilla Hollanti, Nadya Markin
TL;DR
This paper introduces the first fast-decodable distributed space-time codes for multi-antenna relay channels, providing explicit constructions and performance comparisons to existing codes.
Contribution
It adapts an iterative code construction method to N-relay MIMO channels, creating the first such codes that are fast-decodable with multiple antennas per user.
Findings
Explicit code constructions are provided.
Fast-decodability is achieved for multi-antenna relay channels.
Performance comparisons show advantages over non-fast-decodable codes.
Abstract
Fast-decodable distributed space-time codes are constructed by adapting the iterative code construction introduced in [1] to the N -relay multiple-input multiple-output channel, leading to the first fast-decodable distributed space-time codes for more than one antenna per user. Explicit constructions are provided alongside with a performance comparison to non-iterated (non-) fast-decodable codes.
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
TopicsCooperative Communication and Network Coding · Advanced Wireless Communication Techniques · Wireless Communication Networks Research