메뉴 건너뛰기




Volumn 88, Issue 8, 2008, Pages 2030-2062

An insight into space-time block codes using Hurwitz-Radon families of matrices

Author keywords

Diversity analysis; Hurwitz Radon families of matrices; Non orthogonal STBC; Orthogonal STBC; Quasi orthogonal STBC; Space time block codes (STBC)

Indexed keywords

DISPERSION (WAVES); SPACE TIME ADAPTIVE PROCESSING;

EID: 43049088412     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sigpro.2008.02.011     Document Type: Article
Times cited : (3)

References (37)
  • 1
    • 0032183752 scopus 로고    scopus 로고
    • A simple transmit diversity technique for wireless communications
    • Alamouti S.M. A simple transmit diversity technique for wireless communications. IEEE J. Selected Area Comm. 16 (October 1998) 1451-1458
    • (1998) IEEE J. Selected Area Comm. , vol.16 , pp. 1451-1458
    • Alamouti, S.M.1
  • 2
    • 0032023863 scopus 로고    scopus 로고
    • Space-time codes for high data rate wireless communication: performance criterion and code construction
    • Tarokh V., Seshadri N., and Calderbank A.R. Space-time codes for high data rate wireless communication: performance criterion and code construction. IEEE Trans. Inform. Theory 44 (March 1998) 744-765
    • (1998) IEEE Trans. Inform. Theory , vol.44 , pp. 744-765
    • Tarokh, V.1    Seshadri, N.2    Calderbank, A.R.3
  • 3
    • 85143189560 scopus 로고    scopus 로고
    • P.A. Anghel, G. Leus, M. Kaveh, Multi-user space-time coding in cooperative networks, in: Proceedings of the IEEE ICASSP'2003, Hong Kong, vol. IV, April 2003, pp. 73-77.
    • P.A. Anghel, G. Leus, M. Kaveh, Multi-user space-time coding in cooperative networks, in: Proceedings of the IEEE ICASSP'2003, Hong Kong, vol. IV, April 2003, pp. 73-77.
  • 4
    • 0242302539 scopus 로고    scopus 로고
    • Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
    • Laneman J.N., and Wornell G.W. Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks. IEEE Trans. Inform. Theory 49 (October 2003) 2415-2425
    • (2003) IEEE Trans. Inform. Theory , vol.49 , pp. 2415-2425
    • Laneman, J.N.1    Wornell, G.W.2
  • 6
    • 17044380887 scopus 로고    scopus 로고
    • A networking perspective of mobile parallel relays
    • Taos Ski Valley, NM
    • Hua Y., Chang Y., and Mei Y. A networking perspective of mobile parallel relays. IEEE Workshop on Digital Signal Processing. Taos Ski Valley, NM (August 2004) 249-253
    • (2004) IEEE Workshop on Digital Signal Processing , pp. 249-253
    • Hua, Y.1    Chang, Y.2    Mei, Y.3
  • 10
    • 0242365534 scopus 로고    scopus 로고
    • Upper bounds of rates of complex orthogonal space-time block codes
    • Wang H., and Xia X.G. Upper bounds of rates of complex orthogonal space-time block codes. IEEE Trans. Inform. Theory 49 10 (October 2003) 2788-2796
    • (2003) IEEE Trans. Inform. Theory , vol.49 , Issue.10 , pp. 2788-2796
    • Wang, H.1    Xia, X.G.2
  • 11
    • 0035119053 scopus 로고    scopus 로고
    • A quasi-orthogonal space-time block code
    • Jafarkhani H. A quasi-orthogonal space-time block code. IEEE Trans. Comm. 49 1 (January 2001) 1-4
    • (2001) IEEE Trans. Comm. , vol.49 , Issue.1 , pp. 1-4
    • Jafarkhani, H.1
  • 12
    • 19544384363 scopus 로고    scopus 로고
    • On the outage probability of quasi-orthogonal space-time codes
    • San Antonio, TX
    • Sezgin A., and Oechtering T.J. On the outage probability of quasi-orthogonal space-time codes. Proceedings of the IEEE ITW'2004. San Antonio, TX (October 2004)
    • (2004) Proceedings of the IEEE ITW'2004
    • Sezgin, A.1    Oechtering, T.J.2
  • 13
    • 0037721667 scopus 로고    scopus 로고
    • Improved quasi-orthogonal codes through constellation rotation
    • Sharma N., and Papadias C.B. Improved quasi-orthogonal codes through constellation rotation. IEEE Trans. Comm. 51 3 (March 2003) 332-335
    • (2003) IEEE Trans. Comm. , vol.51 , Issue.3 , pp. 332-335
    • Sharma, N.1    Papadias, C.B.2
  • 14
    • 85143189838 scopus 로고    scopus 로고
    • A. Sezgin, E.A. Jorswieck, On optimal constellation for quasi-orthogonal space-time codes, in: Proceedings of IEEE ICASSP'2003, vol. IV, Hong Kong, April 2003, pp. 345-348.
    • A. Sezgin, E.A. Jorswieck, On optimal constellation for quasi-orthogonal space-time codes, in: Proceedings of IEEE ICASSP'2003, vol. IV, Hong Kong, April 2003, pp. 345-348.
  • 16
    • 5144223772 scopus 로고    scopus 로고
    • Signal constellations for quasi-orthogonal space-time block codes with full diversity
    • Su W., and Xia X.G. Signal constellations for quasi-orthogonal space-time block codes with full diversity. IEEE Trans. Inform. Theory 50 10 (October 2004) 2331-2347
    • (2004) IEEE Trans. Inform. Theory , vol.50 , Issue.10 , pp. 2331-2347
    • Su, W.1    Xia, X.G.2
  • 17
    • 3042742561 scopus 로고    scopus 로고
    • A class of nonorthogonal rate-one space-time block codes with controlled interference
    • Boariu A., and Ionescu D.M. A class of nonorthogonal rate-one space-time block codes with controlled interference. IEEE Trans. Wireless Comm. 2 2 (March 2003) 270-276
    • (2003) IEEE Trans. Wireless Comm. , vol.2 , Issue.2 , pp. 270-276
    • Boariu, A.1    Ionescu, D.M.2
  • 18
    • 0038087315 scopus 로고    scopus 로고
    • Space-time diversity systems based on linear constellation precoding
    • Xin Y., Wang Z., and Giannakis G.B. Space-time diversity systems based on linear constellation precoding. IEEE Trans. Wireless Comm. 2 2 (March 2003) 294-309
    • (2003) IEEE Trans. Wireless Comm. , vol.2 , Issue.2 , pp. 294-309
    • Xin, Y.1    Wang, Z.2    Giannakis, G.B.3
  • 21
    • 0242334070 scopus 로고    scopus 로고
    • Full-diversity full-rate complex-field space-time coding
    • Ma X., and Giannakis G.B. Full-diversity full-rate complex-field space-time coding. IEEE Trans. Signal Process. 51 11 (November 2003) 2917-2930
    • (2003) IEEE Trans. Signal Process. , vol.51 , Issue.11 , pp. 2917-2930
    • Ma, X.1    Giannakis, G.B.2
  • 23
    • 28444434832 scopus 로고    scopus 로고
    • Quasi-orthogonal STBC with minimum decoding complexity
    • Yuen C., Guan Y.L., and Tjhung T.T. Quasi-orthogonal STBC with minimum decoding complexity. IEEE Trans. Wireless Comm. 4 5 (September 2005) 2089-2094
    • (2005) IEEE Trans. Wireless Comm. , vol.4 , Issue.5 , pp. 2089-2094
    • Yuen, C.1    Guan, Y.L.2    Tjhung, T.T.3
  • 24
    • 35448984864 scopus 로고    scopus 로고
    • A new design of differential space-time block code allowing symbol-wise decoding
    • Chang Y., Hua Y., and Sadler B.M. A new design of differential space-time block code allowing symbol-wise decoding. IEEE Trans. Wireless Comm. 6 9 (September 2007) 3197-3201
    • (2007) IEEE Trans. Wireless Comm. , vol.6 , Issue.9 , pp. 3197-3201
    • Chang, Y.1    Hua, Y.2    Sadler, B.M.3
  • 25
    • 85143190668 scopus 로고    scopus 로고
    • C.B. Papadias, G.J. Foschini, A space-time coding approach for systems employing four transmit antennas, in: Proceedings of the IEEE ICASSP'2001, Salt Lake City, UT, vol. 4, 2001, pp. 2481-2484.
    • C.B. Papadias, G.J. Foschini, A space-time coding approach for systems employing four transmit antennas, in: Proceedings of the IEEE ICASSP'2001, Salt Lake City, UT, vol. 4, 2001, pp. 2481-2484.
  • 26
    • 0042388399 scopus 로고    scopus 로고
    • Matrices analysis of quasi-orthogonal space-time block codes
    • Hou J., Lee M.H., and Park J.Y. Matrices analysis of quasi-orthogonal space-time block codes. IEEE Comm. Lett. 7 8 (August 2003) 385-387
    • (2003) IEEE Comm. Lett. , vol.7 , Issue.8 , pp. 385-387
    • Hou, J.1    Lee, M.H.2    Park, J.Y.3
  • 29
    • 0036649525 scopus 로고    scopus 로고
    • High-rate codes that are linear in space and time
    • Hassibi B., and Hochwald B.M. High-rate codes that are linear in space and time. IEEE Trans. Inform. Theory 48 7 (July 2002) 1804-1824
    • (2002) IEEE Trans. Inform. Theory , vol.48 , Issue.7 , pp. 1804-1824
    • Hassibi, B.1    Hochwald, B.M.2
  • 30
    • 43049089820 scopus 로고    scopus 로고
    • A.V. Geramita, J. Seberry, Orthogonal Designs, Quadratic Forms and Hardamard Matrices, Lecture Notes in Pure and Applied Mathematics, vol. 43, Marcel Dekker, New York, Basel, 1979.
    • A.V. Geramita, J. Seberry, Orthogonal Designs, Quadratic Forms and Hardamard Matrices, Lecture Notes in Pure and Applied Mathematics, vol. 43, Marcel Dekker, New York, Basel, 1979.
  • 31
    • 0345872214 scopus 로고    scopus 로고
    • A new full-rate full-diversity orthogonal space-time block coding scheme
    • He L., and Ge H. A new full-rate full-diversity orthogonal space-time block coding scheme. IEEE Comm. Lett. 7 12 (December 2003) 990-992
    • (2003) IEEE Comm. Lett. , vol.7 , Issue.12 , pp. 990-992
    • He, L.1    Ge, H.2
  • 32
    • 33646810881 scopus 로고    scopus 로고
    • A complete family of quasi-orthogonal space-time codes
    • Philadelphia, PA
    • Chang Y., and Hua Y. A complete family of quasi-orthogonal space-time codes. Proceedings of IEEE ICASSP'05. Philadelphia, PA (March 2005)
    • (2005) Proceedings of IEEE ICASSP'05
    • Chang, Y.1    Hua, Y.2
  • 33
    • 19644362399 scopus 로고    scopus 로고
    • Super-quasi-orthogonal space-time Trellis codes for four transmit antennas
    • Jafarkhani H., and Hassanpour N. Super-quasi-orthogonal space-time Trellis codes for four transmit antennas. IEEE Trans. Comm. 4 1 (January 2005) 215-227
    • (2005) IEEE Trans. Comm. , vol.4 , Issue.1 , pp. 215-227
    • Jafarkhani, H.1    Hassanpour, N.2
  • 34
    • 0036794286 scopus 로고    scopus 로고
    • Linear dispersion codes for MIMO systems based on frame theory
    • Heath Jr. R.W., and Paulraj A.J. Linear dispersion codes for MIMO systems based on frame theory. IEEE Trans. Signal Process 50 10 (October 2002) 2429-2441
    • (2002) IEEE Trans. Signal Process , vol.50 , Issue.10 , pp. 2429-2441
    • Heath Jr., R.W.1    Paulraj, A.J.2
  • 35
    • 0035574496 scopus 로고    scopus 로고
    • B. Hassibi, H. Vikalo, On the expected complexity of sphere decoding, in: 35th Asilomar Conference on Signals, Systems, and Computers, vol. 2, Asilomar, CA, November 2001, pp. 1051-1055.
    • B. Hassibi, H. Vikalo, On the expected complexity of sphere decoding, in: 35th Asilomar Conference on Signals, Systems, and Computers, vol. 2, Asilomar, CA, November 2001, pp. 1051-1055.
  • 36
    • 0032636505 scopus 로고    scopus 로고
    • A universal lattice code decoder for fading channels
    • Viterbo E., and Boutros J. A universal lattice code decoder for fading channels. IEEE Trans. Inform. Theory 45 5 (July 1999) 1639-1642
    • (1999) IEEE Trans. Inform. Theory , vol.45 , Issue.5 , pp. 1639-1642
    • Viterbo, E.1    Boutros, J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.