Space-time codes for wireless optical channels
Journal articles
- Journal Article
Haas, SM; Shapiro, JH; Tarokh, V
Published in: IEEE International Symposium on Information Theory Proceedings
January 1, 2001
A space-time channel coding technique is presented for overcoming turbulence-induced fading in an atmospheric optical communication system that uses multiple transmit and receive apertures. In particular, a design criterion for minimizing the pairwise probability of codeword error in a space-time code (STC) is developed from a central limit theorem approximation. This design criterion maximizes the ratio of mean to standard deviation of the received energy difference between codewords. It leads to STCs that are a subset of the previously reported STCs for Rayleigh channels, namely those created from orthogonal designs.
Duke Scholars
Altmetric Attention Stats
Dimensions Citation Stats
Published In
IEEE International Symposium on Information Theory Proceedings
DOI
ISSN
2157-8095
Publication Date
January 1, 2001
Start / End Page
244
Citation
APA
Chicago
ICMJE
MLA
NLM
Haas, S. M., Shapiro, J. H., & Tarokh, V. (2001). Space-time codes for wireless optical channels. IEEE International Symposium on Information Theory Proceedings, 244. https://doi.org/10.1109/ISIT.2001.936107
Haas, S. M., J. H. Shapiro, and V. Tarokh. “Space-time codes for wireless optical channels.” IEEE International Symposium on Information Theory Proceedings, January 1, 2001, 244. https://doi.org/10.1109/ISIT.2001.936107.
Haas SM, Shapiro JH, Tarokh V. Space-time codes for wireless optical channels. IEEE International Symposium on Information Theory Proceedings. 2001 Jan 1;244.
Haas, S. M., et al. “Space-time codes for wireless optical channels.” IEEE International Symposium on Information Theory Proceedings, Jan. 2001, p. 244. Scopus, doi:10.1109/ISIT.2001.936107.
Haas SM, Shapiro JH, Tarokh V. Space-time codes for wireless optical channels. IEEE International Symposium on Information Theory Proceedings. 2001 Jan 1;244.
Published In
IEEE International Symposium on Information Theory Proceedings
DOI
ISSN
2157-8095
Publication Date
January 1, 2001
Start / End Page
244