Upper bounds of rates of space-time block codes from complex orthogonal designs

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2002, Pages 303-

  Wang, Haiquan ^a   Xia, Xiang Gen ^a  

^a UNIVERSITY OF DELAWARE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX ORTHOGONAL SPACE-TIME (COST) BLOCK CODES;

BROADCASTING ANTENNAS; DECODING; PHASE SHIFT KEYING; VECTORS;

BLOCK CODES;

EID: 0036350203     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. A simple transmit diversity technique for wireless communications
2. Space-time block codes from orthogonal designs
3. A transmitter diversity scheme for wideband CDMA systems based on space-time spreading
4. Space-time block codes: A maximum SNR approach
5. Square-matrix embeddable space-time block codes for complex signal constellations
6. Nonexistence of rate one spacetime block codes from generalized complex linear processing orthogonal designs for more than two transmit antennas
7. Two generalized complex orthogonal space-time block codes of rates 7/11 and 3/5 for 5 and 6 transmit antennas
8. Realization of Hurwitz-Radon matrices
9. Amicable orthogonal designs - Existence
10. Orthogonal designs, quadratic forms and hadamard matrices