Universal space-time coding
By Hesham El Gamal, Mohamed Oussama Damen. IEEE Transactions on Information Theory, 2003
542 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/34b05e81ec819a3e72cfe08eb9a2377197af560a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Giuseppe Caire
- Ghaya Rekaya-Ben Othman
- Emanuele Viterbo
- Jean-Claude Belfiore
- Hesham El Gamal
- Mahesh Kumar Varanasi
- Pranav Dayal
- Mohamed Oussama Damen
In Computer Networks and Communications
- Giuseppe Caire
- Hesham El Gamal
- Ghaya Rekaya-Ben Othman
- Emanuele Viterbo
- Mohamed Oussama Damen
- Jean-Claude Belfiore
- Stephan ten Brink
- Mahesh Kumar Varanasi
In Electrical and Electronic Engineering
- Giuseppe Caire
- Hesham El Gamal
- Emanuele Viterbo
- Ghaya Rekaya-Ben Othman
- Mohamed Oussama Damen
- Jean-Claude Belfiore
- Stephan ten Brink
- Alexei E. Ashikhmin
Citations in the corpus
- An optimal two transmit antenna space-time code and its stacked extensions (2003, methodology): “To guarantee full transmit diversity, it was suggested in [4] to choose the parameter to be an algebraic number of degree 2 over Q(i).”
- A unified framework for tree search decoding: rediscovering the sequential decoder (2005, methodology): “For convenience, we follow the setup of Dayal and Varanasi [50], where two variants of the threaded algebraic space–time (TAST) constellations [22] are used in a MIMO channel.”
- On maximum-likelihood detection and the search for the closest lattice point (2003, background): “, L} are the linear dispersion code generators [11], [12], [13].”
- The golden code: a 2 x 2 full-rate space-time code with non-vanishing determinants (2004, background): “This approach was later generalized for any number of transmit antennas M [2], [3], [ 4 ].”
- Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels (2004, methodology): “If no additional constraint beyond the standard average input power (2) is imposed, structured space–time coding schemes achieving “full-rate” and “full-diversity” can be explicitly constructed [8], [7].”
- Perfect Space–Time Block Codes (2006, methodology): “6 and 7, we have plotted respectively the codeword err or rates of the3 × 3 and the4 × 4 PC and the best previously known codes [11], [16] as a function o f Eb/N0.”
- Design of low-density parity-check codes for modulation and detection (2004, background): “STBCs are attractive because they improve diversity and are easy to encode and decode (see [13]–[15] and references therein).”
- Full-diversity, high-rate space-time block codes from division algebras (2003, background): “These codes were extended to give rates up to symbols per channel use, whereis the number of transmit antennas in [31], using the concept of layering.”