Diagonal algebraic space-time block codes
By Mohamed Oussama Damen, Karim Abed-Meraim, Jean-Claude Belfiore. IEEE Transactions on Information Theory, 2002
343 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/ce6b714142866cd9d16dd65ee94d8ad4e2632dfd
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
- Mahesh Kumar Varanasi
- Pranav Dayal
- Hesham El Gamal
- Mohamed Oussama Damen
- B. Rajan
- M. Khan
- Vummintala Shashidhar
- Bharat Al Sethuraman
In Computer Networks and Communications
- Hesham El Gamal
- Mahesh Kumar Varanasi
- Pranav Dayal
- Mohamed Oussama Damen
- B. Rajan
- Suhas N. Diggavi
- A. Robert Calderbank
- Anastasios Stamoulis
In Electrical and Electronic Engineering
- Hesham El Gamal
- Mahesh Kumar Varanasi
- Pranav Dayal
- Naofal Al-Dhahir
- Mohamed Oussama Damen
- B. Rajan
- A. Robert Calderbank
- Suhas N. Diggavi
Citations in the corpus
- Full-diversity, high-rate space-time block codes from division algebras (2003, background): “In [30], Damen et al. constructed diagonal algebraic STBCs (DAST) which have rate-one symbol per channel use and full rank if the signal set is a subset of an integer lattice.”
- Multiple-antenna techniques for wireless communications - a comprehensive literature survey (2009, background): “A family of non-orthogonal full-rate linear STBCs, called diagonal algebraic STBCs, was constructed in [68].”
- Great expectations: the value of spatial diversity in wireless networks (2004, background): “For example, transmit diversity using such rotated constellations is described in [77] and [91] and space–time codes designed using rotated constellations are given in [75].”
- Single-symbol maximum likelihood decodable linear STBCs (2006, methodology): “Therefore the coding gain of rate-COD for NILC is given by and that of CIOD is given by Theorem 34 as .”
- Improved quasi-orthogonal codes through constellation rotation (2002, background): “Constellation rotation has been discussed before in the context of design of space‐time codes in [12]‐[ 14 ].”
- An optimal two transmit antenna space-time code and its stacked extensions (2003, methodology): “The full diversity layered space–time codes for two transmit antennas proposed in [3], [4], [13] are all obtained by forming nonoverlapping layers of FMD lattice constellations of dimension n = 2.”
- Universal space-time coding (2003, methodology): “1“Algebraic” in TAST refers to the use of algebraic component codes and not only the thoroughly investigated algebraically rotated constellations from [19]; see Theorem 4.”