Results 241 to 250 of about 1,055,903 (287)
Some of the next articles are maybe not open access.
On the performance of space-time codes
Proceedings of the IEEE Information Theory Workshop, 2003This paper provides an overview of the results in a recent journal submission by the same authors. The first part of that paper studies the pairwise error probability of codewords (PEP) of a space-time code over a quasistatic channel, using an approach that allows both known and unknown channel cases to be considered simultaneously.
Hsiao-feng Lu +3 more
openaire +1 more source
IEEE Transactions on Information Theory, 2003
Summary: A universal framework is developed for constructing full-rate and full-diversity coherent space-time codes for systems with arbitrary numbers of transmit and receive antennas. The proposed framework combines space-time layering concepts with algebraic component codes optimized for single-input-single-output (SISO) channels. Each component code
Hesham El Gamal, Mohamed Oussama Damen
openaire +1 more source
Summary: A universal framework is developed for constructing full-rate and full-diversity coherent space-time codes for systems with arbitrary numbers of transmit and receive antennas. The proposed framework combines space-time layering concepts with algebraic component codes optimized for single-input-single-output (SISO) channels. Each component code
Hesham El Gamal, Mohamed Oussama Damen
openaire +1 more source
Lattice code decoder for space-time codes
IEEE Communications Letters, 2000We explore the lattice sphere packing representation of a multi-antenna system and the algebraic space-time (ST) codes. We apply the sphere decoding (SD) algorithm to the resulted lattice code. For the uncoded system, SD yields, with small increase in complexity, a huge improvement over the well-known V-BLAST detection algorithm.
Mohamed Oussama Damen +2 more
openaire +1 more source
Effective Coding Gain for Space-Time Codes
2006 IEEE International Symposium on Information Theory, 2006The performance of space-time codes is evaluated in terms of diversity gain and coding gain, two measures which describe the worst-case pairwise error probability between codewords at high signal-to-noise ratio (SNR). We introduce the concept of effective coding gain to provide an estimate on the bit error rate (BER) at low-to-moderate SNR.
Jimmy Chui, A. Robert Calderbank
openaire +1 more source
IEEE Transactions on Wireless Communications, 2003
It is shown that the separation between space-time code matrices can be described in terms of a metric of Euclidean type, which is defined via the singular values of difference code matrices, and arises naturally from a minimization of the pairwise error probability.
openaire +1 more source
It is shown that the separation between space-time code matrices can be described in terms of a metric of Euclidean type, which is defined via the singular values of difference code matrices, and arises naturally from a minimization of the pairwise error probability.
openaire +1 more source
Physical Review, 1969
It is known that the entire geometry of many relativistic space-times can be summed up in two concepts, a space-time measure $\ensuremath{\mu}$ and a space-time causal or chronological order relation $C$, defining a causal measure space. On grounds of finiteness, unity, and symmetry, we argue that macroscopic space-time may be the classical-geometrical
openaire +2 more sources
It is known that the entire geometry of many relativistic space-times can be summed up in two concepts, a space-time measure $\ensuremath{\mu}$ and a space-time causal or chronological order relation $C$, defining a causal measure space. On grounds of finiteness, unity, and symmetry, we argue that macroscopic space-time may be the classical-geometrical
openaire +2 more sources
On orthogonal designs and space-time codes
Proceedings IEEE International Symposium on Information Theory,, 2003Two aspects of orthogonal designs are explored in this paper. The first relates to the existence of restricted-alphabet orthogonal designs. While orthogonal designs yield efficient space-time codes, real orthogonal designs exist only for sizes n=2, 4, 8.
Hsiao-feng Lu +2 more
openaire +1 more source
Trace-Orthogonal Space-Time Coding
IEEE Transactions on Signal Processing, 2008In this paper, we prove that, in MIMO systems affected by flat fading, when the channel is unknown at the transmitter and known at the receiver side, a space-time code does not induce any information loss, regardless of the channel realization, if and only if it is a trace-orthogonal design (TOD).
Antonio Fasano, BARBAROSSA, Sergio
openaire +2 more sources
Performance of space-time block coding and space-time trellis coding for impulse radio
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04., 2005Ultra wideband (UWB) systems have attracted a lot of research interest lately, owing to their appealing features in short-range mobile communications. These features include low power peer-to-peer transmissions, multiple access communications, high data rates, and precise positioning capabilities.
Heliot, F +3 more
openaire +2 more sources
Universal space-time trellis codes
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE, 2003This article gives practical examples of space-time trellis codes performing as predicted by Root and Varaiya's (1968) compound channel theorem. Specifically, 32-state and 64-state 2/spl times/2 space-time trellis codes are presented that provide a bit-error rate (BER) of 10/sup -5/ on all 2/spl times/2 matrix channels with an excess mutual information
Cenk Köse, Richard D. Wesel
openaire +1 more source