On low-complexity space-time coding for quasi-static channels
From MaRDI portal
Recommendations
- A low-complexity approach to space-time coding for multipath fading channels
- On the Performance Analysis of Space–Time Codes in Quasi-Static Rayleigh-Fading Channels
- On Optimal Quasi-Orthogonal Space–Time Block Codes With Minimum Decoding Complexity
- A Quasi-Random Approach to Space–Time Codes
- Low complexity suboptimal decode algorithms for quasi-orthogonal space time block codes
- Quasi-Orthogonal Time-Reversal Space–Time Block Coding for Frequency-Selective Fading Channels
- Low complexity receiver structures for space-time coded multiple-access systems
- On the capacity of certain space-time coding schemes
Cited in
(13)- On the capacity of certain space-time coding schemes
- A low-complexity approach to space-time coding for multipath fading channels
- Low complexity suboptimal decode algorithms for quasi-orthogonal space time block codes
- FULL-RATE AND LOW-COMPLEXITY SPACE-TIME BLOCK CODING CONCATENATED WITH CHANNEL CODES
- On the Performance Analysis of Space–Time Codes in Quasi-Static Rayleigh-Fading Channels
- A Quasi-Random Approach to Space–Time Codes
- scientific article; zbMATH DE number 2065314 (Why is no real title available?)
- scientific article; zbMATH DE number 2154509 (Why is no real title available?)
- Performance of space-time codes for a large number of antennas
- High-rate codes that are linear in space and time
- Space–Time Codes Achieving the DMD Tradeoff of the MIMO-ARQ Channel
- Suboptimum receiver interfaces and space-time codes
- A simple differential modulation scheme for quasi-orthogonal space-time block codes with partial transmit diversity
This page was built for publication: On low-complexity space-time coding for quasi-static channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680104)