Constructions of fast-decodable distributed space-time codes

From MaRDI portal




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 page was built for publication: Constructions of fast-decodable distributed space-time codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460447)