메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Low-complexity, information-lossless STBCs for two-user MISO-MAC with partial CSIT

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY VALUES; COMPLEX DESIGNS; DECODING COMPLEXITY; FREQUENCY-FLAT FADING; LOSSLESS; LOW-COMPLEXITY; MAXIMUM-LIKELIHOOD DECODING; MULTIPLE ACCESS CHANNELS; MULTIPLE INPUT SINGLE OUTPUTS; ORTHOGONAL DESIGN; PARTIAL CSIT; REAL-ORTHOGONAL DESIGN; SPACE-TIME BLOCK CODE; TRANSMIT ANTENNA;

EID: 77952222123     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NCC.2010.5430212     Document Type: Conference Paper
Times cited : (1)

References (11)
  • 3
    • 65749086465 scopus 로고    scopus 로고
    • High-Rate, Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks
    • May.
    • J. Harshan and B. Sundar Rajan, "High-Rate, Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks," IEEE Transactions on Information Theory, Vol. 55, No. 05, May. 2009, pp. 2004-2015.
    • (2009) IEEE Transactions on Information Theory , vol.55 , Issue.5 , pp. 2004-2015
    • Harshan, J.1    Sundar Rajan, B.2
  • 5
    • 0242334039 scopus 로고    scopus 로고
    • Orthogonal designs with maximal rates
    • X Liang, "Orthogonal designs with maximal rates", IEEE Transactions on Information theory, vol.49, no.10, 2003, pp. 2468-2503.
    • (2003) IEEE Transactions on Information Theory , vol.49 , Issue.10 , pp. 2468-2503
    • Liang, X.1
  • 6
    • 0004083131 scopus 로고    scopus 로고
    • Capacity of multi-antenna Gaussian channels
    • E. Telatar, "Capacity of multi-antenna Gaussian channels", European Transactions on Telecommunications, Vol. 10, no. 06, 1999, pp. 585-595.
    • (1999) European Transactions on Telecommunications , vol.10 , Issue.6 , pp. 585-595
    • Telatar, E.1
  • 7
    • 33748525203 scopus 로고    scopus 로고
    • Information-lossless space-time block codes from crossed-product algebras
    • DOI 10.1109/TIT.2006.880049
    • V. Shashidhar, B. Sundar Rajan and B. A. Sethuraman, "Information- Lossless Space-Time Block Codes from Crossed-Product Algebras," IEEE Transactions on Information theory, Vol.52, No.9, Sept., 2006, pp.3913-3935. (Pubitemid 44363825)
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.9 , pp. 3913-3935
    • Shashidhar, V.1    Rajan, B.S.2    Sethuraman, B.A.3
  • 8
    • 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 Transactions on Information theory, vol.48, no.7, Jul. 2002, pages 1804-1824
    • (2002) IEEE Transactions on Information Theory , vol.48 , Issue.7 , pp. 1804-1824
    • Hassibi, B.1    Hochwald, B.M.2
  • 9
    • 61349168521 scopus 로고    scopus 로고
    • On fast-decodable space-time block codes
    • Feb
    • E.Biglieri, Yi Hong and E. Viterbo, "On fast-decodable space-time block codes", IEEE Trans. Inform. Theory, vol. 55, no. 2, pp. 524-530, Feb 2009.
    • (2009) IEEE Trans. Inform. Theory , vol.55 , Issue.2 , pp. 524-530
    • Biglieri, E.1    Hong, Y.2    Viterbo, E.3
  • 10
    • 77951526055 scopus 로고    scopus 로고
    • STBCs with minimum sphere decoding complexity for two user MIMO MAC
    • Honolulu, Hawai, USA, Nov. 30- Dec. 04
    • J. Harshan and B. Sundar Rajan, "STBCs with minimum sphere decoding complexity for two user MIMO MAC," in the Proceedings of IEEE GLOBECOM 2009, (GLOBECOM'09), Honolulu, Hawai, USA, Nov. 30- Dec. 04, 2009.
    • (2009) Proceedings of IEEE GLOBECOM 2009, (GLOBECOM'09)
    • Harshan, J.1    Sundar Rajan, B.2


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