It is known that the Alamouti code is the only Complex Orthogonal Design (COD) which achieves capacity and that only for the case of two transmit and one receive antennas. M.O. Damen et al. (see IEEE Trans. Inform. Theory, vol.48, no.3, p.753-60, 2002) gave a design for 2 transmit antennas, which achieves capacity for any number of receive antennas, calling it an information lossless STBC. We construct capacity achieving designs using cyclic division algebras for an arbitrary number of transmit and receive antennas. For the STBCs obtained using these designs, we present simulation results for those numbers of transmit and receive antennas for which Damen et al. also gave results, and show that our STBCs perform better than their's
Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Ave...
We present some general techniques for constructing full-rank, minimal-delay, rate at least one spac...
International audienceThis work addresses the question of achieving capacity with lattice codes in m...
It is known that the Alamouti code is the only complex orthogonal design (COD) which achieves capaci...
We construct full-rank, rate-n space-time block codes (STBC), over any a priori specified signal set...
Abstract — We construct full-rank, rate-n Space-Time Block Codes (STBC), over any a priori specified...
Abstract — This paper presents a systematic technique for constructing STBC-schemes (Space-Time Bloc...
This paper shows that the codes from division algebras (Sethuraman et al. 2003) achieve the optimal ...
A space-time block-code scheme (STBC-scheme) is a family of STBCs {{C(SNR)}}, indexed by the signal-...
It is well known, that the Alamouti scheme is the only space-time code from orthogonal design achiev...
A space–time block-code scheme (STBC-scheme)is a family of STBCs {C(S N R)}, indexed by the signal-...
We show that the codes from division algebras [1] achieve the optimal diversity-multiplexing tradeo....
It is well known, that the Alamouti scheme is the only space-time code from orthogonal design achiev...
Orthogonal space-time block coding proposed recently by Alamouti and Tarokh, Jafarkhani, and Calderb...
Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Avera...
Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Ave...
We present some general techniques for constructing full-rank, minimal-delay, rate at least one spac...
International audienceThis work addresses the question of achieving capacity with lattice codes in m...
It is known that the Alamouti code is the only complex orthogonal design (COD) which achieves capaci...
We construct full-rank, rate-n space-time block codes (STBC), over any a priori specified signal set...
Abstract — We construct full-rank, rate-n Space-Time Block Codes (STBC), over any a priori specified...
Abstract — This paper presents a systematic technique for constructing STBC-schemes (Space-Time Bloc...
This paper shows that the codes from division algebras (Sethuraman et al. 2003) achieve the optimal ...
A space-time block-code scheme (STBC-scheme) is a family of STBCs {{C(SNR)}}, indexed by the signal-...
It is well known, that the Alamouti scheme is the only space-time code from orthogonal design achiev...
A space–time block-code scheme (STBC-scheme)is a family of STBCs {C(S N R)}, indexed by the signal-...
We show that the codes from division algebras [1] achieve the optimal diversity-multiplexing tradeo....
It is well known, that the Alamouti scheme is the only space-time code from orthogonal design achiev...
Orthogonal space-time block coding proposed recently by Alamouti and Tarokh, Jafarkhani, and Calderb...
Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Avera...
Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Ave...
We present some general techniques for constructing full-rank, minimal-delay, rate at least one spac...
International audienceThis work addresses the question of achieving capacity with lattice codes in m...