On low-complexity space-time coding for quasi-static channels
From MaRDI portal
Publication:4680104
DOI10.1109/TIT.2003.811904zbMATH Open1063.94052MaRDI QIDQ4680104
Giulio Colavolpe, Giuseppe Caire
Publication date: 1 June 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Linear codes (general theory) (94B05) Decoding (94B35) Channel models (including quantum) in information and communication theory (94A40)
Related Items (3)
FULL-RATE AND LOW-COMPLEXITY SPACE-TIME BLOCK CODING CONCATENATED WITH CHANNEL CODES ⋮ Space–Time Codes Achieving the DMD Tradeoff of the MIMO-ARQ Channel ⋮ On the capacity of certain space-time coding schemes
Recommendations
- Title not available (Why is that?) 👍 👎
- Low complexity receiver structures for space-time coded multiple-access systems 👍 👎
- On the capacity of certain space-time coding schemes 👍 👎
- 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 👍 👎
- A Quasi-Random Approach to Space–Time Codes 👍 👎
- Quasi-Orthogonal Time-Reversal Space–Time Block Coding for Frequency-Selective Fading Channels 👍 👎
- On Optimal Quasi-Orthogonal Space–Time Block Codes With Minimum Decoding Complexity 👍 👎
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)
