메뉴 건너뛰기




Volumn 56, Issue 1, 2008, Pages 424-430

Four-group decodable space-time block codes

Author keywords

Orthogonal designs; Performance analysis; Quasi orthogonal space time block codes; Space time block codes (STBC)

Indexed keywords

DECODING; ERROR DETECTION; MAXIMUM LIKELIHOOD ESTIMATION; OPTIMIZATION; SIGNAL ENCODING; TRANSMITTERS;

EID: 37749035861     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2007.906729     Document Type: Article
Times cited : (79)

References (24)
  • 1
    • 0032183752 scopus 로고    scopus 로고
    • A simple transmitter diversity scheme for wireless communication
    • Oct
    • S. M. Alamouti, "A simple transmitter diversity scheme for wireless communication," IEEE J. Sel. Areas Commun., vol. 16, pp. 1451-1458, Oct. 1998.
    • (1998) IEEE J. Sel. Areas Commun , vol.16 , pp. 1451-1458
    • Alamouti, S.M.1
  • 2
    • 0032656952 scopus 로고    scopus 로고
    • Space-time block codes from orthogonal designs
    • Jul
    • V. Tarokh, H. Jafarkhani, and A. R. Calderbank, "Space-time block codes from orthogonal designs," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1456-1466, Jul. 1999.
    • (1999) IEEE Trans. Inf. Theory , vol.45 , Issue.5 , pp. 1456-1466
    • Tarokh, V.1    Jafarkhani, H.2    Calderbank, A.R.3
  • 3
    • 0242334039 scopus 로고    scopus 로고
    • Orthogonal designs with maximal rates
    • Oct
    • X.-B. Liang, "Orthogonal designs with maximal rates," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2468-2503, Oct. 2003.
    • (2003) IEEE Trans. Inf. Theory , vol.49 , Issue.10 , pp. 2468-2503
    • Liang, X.-B.1
  • 4
    • 0035119053 scopus 로고    scopus 로고
    • A quasi-orthogonal space-time block code
    • Jan
    • H. Jafarkhani, "A quasi-orthogonal space-time block code," IEEE Trans. Commun., vol. 49, no. 1, pp. 1-4, Jan. 2001.
    • (2001) IEEE Trans. Commun , vol.49 , Issue.1 , pp. 1-4
    • Jafarkhani, H.1
  • 6
    • 5144223772 scopus 로고    scopus 로고
    • Signal constellations for quasi-orthogonal space-time block codes with full diversity
    • Oct
    • W. Su and X.-G. Xia, "Signal constellations for quasi-orthogonal space-time block codes with full diversity," IEEE Trans. Inf. Theory vol. 50, no. 10, pp. 2331-2347, Oct. 2004.
    • (2004) IEEE Trans. Inf. Theory , vol.50 , Issue.10 , pp. 2331-2347
    • Su, W.1    Xia, X.-G.2
  • 8
    • 6344229888 scopus 로고    scopus 로고
    • Full-rate full-diversity linear quasi-orthogonal space-time codes for any number of transmit antennas
    • Aug
    • N. Sharma and C. B. Papadias, "Full-rate full-diversity linear quasi-orthogonal space-time codes for any number of transmit antennas," EURASIP J. Appl. Signal Process., vol. 9, pp. 1246-1256, Aug. 2004.
    • (2004) EURASIP J. Appl. Signal Process , vol.9 , pp. 1246-1256
    • Sharma, N.1    Papadias, C.B.2
  • 9
    • 19544384363 scopus 로고    scopus 로고
    • On the outage probability of quasi-orthogonal space-time codes
    • San Antonio, TX, Oct
    • A. Sezgin and T. J. Oechtering, "On the outage probability of quasi-orthogonal space-time codes," in Proc. IEEE Inf. Theory Workshop (ITW), San Antonio, TX, Oct. 2004, pp. 381-386.
    • (2004) Proc. IEEE Inf. Theory Workshop (ITW) , pp. 381-386
    • Sezgin, A.1    Oechtering, T.J.2
  • 10
    • 33846574790 scopus 로고    scopus 로고
    • Capacity-approaching semi-orthogonal space-time block codes
    • presented at the, St. Louis, MO, Nov./Dec
    • D. N. Dào and C. Tellambura, "Capacity-approaching semi-orthogonal space-time block codes," presented at the IEEE GLOBECOM, St. Louis, MO, Nov./Dec. 2005.
    • (2005) IEEE GLOBECOM
    • Dào, D.N.1    Tellambura, C.2
  • 11
    • 0242365586 scopus 로고    scopus 로고
    • On maximum-likelihood detection and the search for the closest lattice point
    • Oct
    • M. O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2389-2402, Oct. 2003.
    • (2003) IEEE Trans. Inf. Theory , vol.49 , Issue.10 , pp. 2389-2402
    • Damen, M.O.1    El Gamal, H.2    Caire, G.3
  • 12
    • 28444434832 scopus 로고    scopus 로고
    • Quasi-orthogonal STBC with minimum decoding complexity
    • Sep
    • C. Yuen, Y. L. Guan, and T. T. Tjhung, "Quasi-orthogonal STBC with minimum decoding complexity," IEEE Trans. Wireless Commun., vol. 4, no. 5, pp. 2089-2094, Sep. 2005.
    • (2005) IEEE Trans. Wireless Commun , vol.4 , Issue.5 , pp. 2089-2094
    • Yuen, C.1    Guan, Y.L.2    Tjhung, T.T.3
  • 14
    • 0036649525 scopus 로고    scopus 로고
    • High-rate codes that are linear in space and time
    • Jul
    • B. Hassibi and B. M. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1804-1824, Jul. 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , Issue.7 , pp. 1804-1824
    • Hassibi, B.1    Hochwald, B.M.2
  • 15
    • 0032023863 scopus 로고    scopus 로고
    • Space-time codes for high data rate wireless communication: Performance analysis and code construction
    • Mar
    • V. Tarokh, N. Seshadri, and A. R. Calderbank, "Space-time codes for high data rate wireless communication: Performance analysis and code construction," IEEE Trans. Inf. Theory, vol. 44, pp. 744-765, Mar. 1998.
    • (1998) IEEE Trans. Inf. Theory , vol.44 , pp. 744-765
    • Tarokh, V.1    Seshadri, N.2    Calderbank, A.R.3
  • 16
    • 33750011522 scopus 로고    scopus 로고
    • On the search for high-rate quasi-orthogonal space-time block code
    • Oct
    • C. Yuen, Y. L. Guan, and T. T. Tjhung, "On the search for high-rate quasi-orthogonal space-time block code," Int. J. Wireless Information Network (IJWIN), vol. 13, pp. 329-340, Oct. 2006.
    • (2006) Int. J. Wireless Information Network (IJWIN) , vol.13 , pp. 329-340
    • Yuen, C.1    Guan, Y.L.2    Tjhung, T.T.3
  • 17
    • 33646066276 scopus 로고    scopus 로고
    • Single-symbol maximum likelihood decodable linear STBCs
    • May
    • M. Z. A. Khan and B. S. Rajan, "Single-symbol maximum likelihood decodable linear STBCs," IEEE Trans. Inf. Theory, vol. 52, no. 5, pp. 2062-2091, May 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.5 , pp. 2062-2091
    • Khan, M.Z.A.1    Rajan, B.S.2
  • 18
    • 34047127443 scopus 로고    scopus 로고
    • A class of four-group quasi-orthogonal space-time block code achieving full rate and full diversity for any number of antennas
    • Berlin, Germany, Sep
    • C. Yuen, Y. L. Guan, and T. T. Tjhung, "A class of four-group quasi-orthogonal space-time block code achieving full rate and full diversity for any number of antennas," in Proc. IEEE Personal, Indoor, Mobile Radio Communications Symp. (PIMRC), Berlin, Germany, Sep. 2005, pp. 92-96.
    • (2005) Proc. IEEE Personal, Indoor, Mobile Radio Communications Symp. (PIMRC) , pp. 92-96
    • Yuen, C.1    Guan, Y.L.2    Tjhung, T.T.3
  • 20
    • 0026394677 scopus 로고    scopus 로고
    • J. W. Craig, A new, simple and exact result for calculating the probability of error for two-dimensional signal constellations, in Proc. IEEE Military Communications Conf. (MILCOM), Boston, Nov. 1991, pp. 25.5.1-25.5.5.
    • J. W. Craig, "A new, simple and exact result for calculating the probability of error for two-dimensional signal constellations," in Proc. IEEE Military Communications Conf. (MILCOM), Boston, Nov. 1991, pp. 25.5.1-25.5.5.
  • 23
    • 37749030623 scopus 로고    scopus 로고
    • Multi-group decodable STBCs from clifford algebras
    • Chengdu, China, Oct
    • S. Karmakar and B. S. Rajan, "Multi-group decodable STBCs from clifford algebras," in Proc. IEEE Inf. Theory Workshop (ITW , Chengdu, China, Oct. 2006, pp. 448-452.
    • (2006) Proc. IEEE Inf. Theory Workshop (ITW , pp. 448-452
    • Karmakar, S.1    Rajan, B.S.2
  • 24
    • 12444310251 scopus 로고    scopus 로고
    • A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates
    • Jan
    • H. Kan and H. Shen, "A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 355-359, Jan. 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.1 , pp. 355-359
    • Kan, H.1    Shen, H.2


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