Shashidhar, V. ; Rajan, B. S. ; Sethuraman, B. A. (2003) STBCs using capacity achieving designs from cyclic division algebras In: IEEE Global Telecommunications Conference, 2003 GLOBECOM '03, 1-5 December 2003, San Francisco, USA.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/1258579/
Related URL: http://dx.doi.org/10.1109/GLOCOM.2003.1258579
Abstract
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 111228 |
| Deposited On: | 08 Dec 2017 10:37 |
| Last Modified: | 08 Dec 2017 10:37 |
Repository Staff Only: item control page
