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.
Recommendations
- Construction of low delay maximal rate single-symbol decodable distributed STBC with channel phase information
- Space-time block codes from orthogonal designs
- Distributed space-time codes with low ML decoding complexity
- On fast-decodable algebraic space-time codes
- Delay-Tolerant Distributed-TAST Codes for Cooperative Diversity
Cites work
- Fast-Decodable Asymmetric Space-Time Codes From Division Algebras
- Iterated Space-Time Code Constructions From Cyclic Algebras
- On Fast-Decodable Space–Time Block Codes
- Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel
- The Golden Code: A<tex>$2,times,2$</tex>Full-Rate Space–Time Code With Nonvanishing Determinants
Cited in
(3)
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)