메뉴 건너뛰기




Volumn 1, Issue , 2005, Pages 483-488

Quasi-orthogonal STBC with minimum decoding complexity: Further results

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECODING; GAIN MEASUREMENT; PARAMETER ESTIMATION; SPACE TIME ADAPTIVE PROCESSING;

EID: 24944535007     PISSN: 15253511     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (31)

References (18)
  • 2
    • 0035335425 scopus 로고    scopus 로고
    • Space-time block codes: A maximum SNR approach
    • May
    • Ganesan, G.; Stoica, P., "Space-time block codes: a maximum SNR approach", IEEE Trans. on Information Theory, vol:47, May 2001, pp: 1650-1656.
    • (2001) IEEE Trans. on Information Theory , vol.47 , pp. 1650-1656
    • Ganesan, G.1    Stoica, P.2
  • 3
    • 5044252167 scopus 로고    scopus 로고
    • Close forms designs of complex orthogonal space-time block codes of rates (k+1)/(2k) for 2k-1 or 2k transmit antennas
    • K. Lu; S. Fu; X. Xia, "Close Forms Designs of Complex Orthogonal Space-Time Block Codes of Rates (k+1)/(2k) for 2k-1 or 2k Transmit Antennas", ISIT 2004, pp: 307.
    • ISIT 2004 , pp. 307
    • Lu, K.1    Fu, S.2    Xia, X.3
  • 4
    • 0035119053 scopus 로고    scopus 로고
    • A quasi-orthogonal space-time block code
    • Jan.
    • Jafarkhani, H., "A quasi-orthogonal space-time block code", IEEE Trans. on Communications, vol:49, Jan. 2001, pp: 1-4.
    • (2001) IEEE Trans. on Communications , vol.49 , pp. 1-4
    • Jafarkhani, H.1
  • 5
    • 0033710770 scopus 로고    scopus 로고
    • Minimal non-orthogonality rate 1 space-time block code for 3+ Tx antennas
    • Tirkkonen, O.; Boariu, A.; Hottinen, A., "Minimal non-orthogonality rate 1 space-time block code for 3+ Tx antennas", ISSSTA 2000, pp:429-432.
    • ISSSTA 2000 , pp. 429-432
    • Tirkkonen, O.1    Boariu, A.2    Hottinen, A.3
  • 6
    • 0037355198 scopus 로고    scopus 로고
    • Capacity-approaching space-time codes for systems employing four transmitter antennas
    • Mar
    • Papadias, C.B.; Foschini, G.J., "Capacity-approaching space-time codes for systems employing four transmitter antennas", IEEE Transactions on Information Theory, vol:49, Mar 2003, pp: 726-733.
    • (2003) IEEE Transactions on Information Theory , vol.49 , pp. 726-733
    • Papadias, C.B.1    Foschini, G.J.2
  • 7
    • 0012845465 scopus 로고    scopus 로고
    • Optimizing space-time block codes by constellation rotations
    • Tirkkonen, O., "Optimizing Space-Time Block Codes by Constellation Rotations", FWCW 2001, pp:59-60.
    • FWCW 2001 , pp. 59-60
    • Tirkkonen, O.1
  • 8
    • 0037721667 scopus 로고    scopus 로고
    • Improved quasi-orthogonal codes through constellation rotation
    • March
    • Sharma, N.; Papadias, C.B., "Improved quasi-orthogonal codes through constellation rotation", IEEE Transactions on Communications, vol:51, March 2003, pp: 332-335.
    • (2003) IEEE Transactions on Communications , vol.51 , pp. 332-335
    • Sharma, N.1    Papadias, C.B.2
  • 9
    • 0036971942 scopus 로고    scopus 로고
    • Quasi-orthogonal space-time block codes with full diversity
    • Su, W.; Xia, X., "Quasi-Orthogonal Space-Time Block Codes with Full Diversity". Globecom 2002, pp: 1098 -1102.
    • Globecom 2002 , pp. 1098-1102
    • Su, W.1    Xia, X.2
  • 10
    • 0042973746 scopus 로고    scopus 로고
    • Full-rate full-diversity STBC with constellation rotation
    • C. Yuen; Y. L. Guan; T. T. Tjhung, "Full-Rate Full-Diversity STBC with Constellation Rotation", VTC 2003-Spring, pp: 296-300.
    • VTC 2003-spring , pp. 296-300
    • Yuen, C.1    Guan, Y.L.2    Tjhung, T.T.3
  • 11
    • 18144418975 scopus 로고    scopus 로고
    • Improved quasi-orthogonal STBC with group-constrained linear transformation
    • C. Yuen; Y. L. Guan; T. T. Tjhung, "Improved Quasi-Orthogonal STBC with Group-Constrained Linear Transformation", Globecom 2004.
    • Globecom 2004
    • Yuen, C.1    Guan, Y.L.2    Tjhung, T.T.3
  • 12
    • 5044241876 scopus 로고    scopus 로고
    • Construction of quasi-orthogonal STBC with minimum decoding complexity
    • C. Yuen; Y. L. Guan; T. T. Tjhung, "Construction of Quasi-Orthogonal STBC with Minimum Decoding Complexity". ISIT 2004, pp:309.
    • ISIT 2004 , pp. 309
    • Yuen, C.1    Guan, Y.L.2    Tjhung, T.T.3
  • 14
    • 0036351546 scopus 로고    scopus 로고
    • Space-time block codes from Co-ordinate interleaved orthogonal designs
    • Zafar Ali Khan; B.Sundar Rajan, "Space-Time Block Codes from Co-ordinate Interleaved Orthogonal Designs", ISIT 2002, pp: 275.
    • ISIT 2002 , pp. 275
    • Khan, Z.A.1    Rajan, B.S.2
  • 15
    • 0842289310 scopus 로고    scopus 로고
    • Rectangular Co-ordinate interleaved orthogonal designs
    • Md. Zafar Ali Khan; B. Sundar Rajan; Moon Ho Lee, "Rectangular Co-ordinate Interleaved Orthogonal Designs", Globecomm 2003, pp. 2004-2009.
    • Globecomm 2003 , pp. 2004-2009
    • Khan, M.Z.A.1    Rajan, B.S.2    Lee, M.H.3
  • 16
    • 0036649525 scopus 로고    scopus 로고
    • High-rate codes that are linear in space and time
    • Jul
    • B. Hassibi; B. M. Hochwald, "High-Rate Codes that are Linear in Space and Time", IEEE Trans. on Information Theory, vol:48, Jul 2002, pp: 1804-1824.
    • (2002) IEEE Trans. on Information Theory , vol.48 , pp. 1804-1824
    • Hassibi, B.1    Hochwald, B.M.2
  • 17
    • 0032023863 scopus 로고    scopus 로고
    • Space-time codes for high data rate wireless communication: Performance criterion and code construction
    • Mar.
    • Tarokh, V.; Seshadri, N.; Calderbank, A.R., "Space-time codes for high data rate wireless communication: performance criterion and code construction", IEEE Trans. on Information Theory, vol: 44, Mar. 1998, pp:744-765.
    • (1998) IEEE Trans. on Information Theory , vol.44 , pp. 744-765
    • Tarokh, V.1    Seshadri, N.2    Calderbank, A.R.3


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