High-rate codes that are linear in space and time

By Babak Hassibi, Bertrand M. Hochwald. IEEE Transactions on Information Theory, 2002

1,452 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/e123f79c923e4e1ed773af3f5f1eb324ce181f4e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

A unified framework for tree search decoding: rediscovering the sequential decoder (2005, methodology): “More specifically, in our simulation experiments, we apply the tree search decoding framework to uncoded vertical Bell Labs layered space–time architecture (V-BLAST) [11], linear dispersion space–time codes [12], algebraic space–time codes [13]–[15], and trellis codes over ISI channels [16].”
An optimal two transmit antenna space-time code and its stacked extensions (2003, methodology): “Moreover, the V2(Cr) code leads to a significant improvement in performance compared to the optimum decoding of the uncoded Bell Labs layered space–time (BLAST) scheme [2].”
On the complexity of sphere decoding in digital communications (2005, methodology): “Such hard instances of the detection problem arise in for example multiuser detection (MUD) problems in code division multiple access (CDMA) [2], [3] and linear dispersive space time block coding (LD-STBC) [4].”
On the sphere-decoding algorithm I. Expected complexity (2005, background): “The equivalent channel matrix (see [7]) has min rows and columns.”
Single-symbol maximum likelihood decodable linear STBCs (2006, background): “1Also referred to as a Linear Dispersion code [36] 2Note that if the signal set is of size 2b the throughput rateR in bits per second per Hertz is related to the rate of the design R asR = Rb.”
Perfect Space–Time Block Codes (2006, methodology): “Note that, in building a cyclic algebra A = ( K/F, σ, γ ) for STBCs, the choice of γ is critical since it determines whether A is a division algebra.”
On the capacity of spatially correlated MIMO Rayleigh-fading channels (2003, background): “The analysis of capacity distribution for multiple-input–multiple-output (MIMO) channels in [3], [4] suggested practical structures to obtain large spectral efficiency, leading to the Bell Laboratories layered space–time (BLAST) architecture and to space–time codes [5], [6].”
A robust maximin approach for MIMO communications with imperfect channel state information based on convex optimization (2006, background): “According to this, the transmitted signal can be formulated as follows (similarly to linear dispersion codes [42] and OSTBC [4], [5]):”
Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels (2004, methodology): “After proper scaling and translation, the matrix codewords in an LD code can be written as [16]”
Multiple-antenna techniques for wireless communications - a comprehensive literature survey (2009, background): “SD Diversity reception (MRC) [4] Rx Rx N low DIV Alamouti’s scheme [2]/OSTBCs [55] Tx (Rx optional) —- ” —- N low DIV Delay diversity [51], [52] —- ” ——- ” —- N moderate/high DIV STTCs [3] —- ” ——- ” —- N high DIV & COD Quasi-orthogonal STBCs [71] —- ” ——- ” —- N low DIV Super-orthogonal STTCs [78],”
Design Guidelines for Spatial Modulation (2015, background): “This constraint makes SM rather different from classic Space Time Block Codes (STBC) [35] designed for achieving a diversity gain or from Spatial Division Multiplexing (SDM) [36] conceived for attaining a multiplexing gain as well as from the hybrid SDM-STBC schemes [37] aiming for striking a compro”
Space-time diversity systems based on linear constellation precoding (2003, methodology): “We also construct UCP codes adhering to a lower bound on the coding gain, for any . In addition to diversity and coding criteria [27], we also employ the maximum average mutual information criterion [ 14 ] to evaluate the performance and compare ST-LCP with the ST-OD codes of [1], [26], the so-calle”