Constructions of Fast-Decodable Distributed Space-Time Codes
classification
💻 cs.IT
math.IT
keywords
codesfast-decodabledistributedspace-timeconstructionsadaptingalongsideantenna
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.