메뉴 건너뛰기




Volumn , Issue , 2008, Pages 242-246

Optimal user pairing for multiuser MIMO

Author keywords

Assignment problem; Capacity; Hungarian method; MIMO; Multiuser uplink; Scheduling

Indexed keywords

BLOCK CODES; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; ERROR DETECTION; MIM DEVICES; MULTIPLEXING; SEMICONDUCTOR QUANTUM DOTS; SPECTRUM ANALYSIS; TRAVELING SALESMAN PROBLEM;

EID: 57849084829     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISSSTA.2008.50     Document Type: Conference Paper
Times cited : (16)

References (13)
  • 1
    • 27244436294 scopus 로고    scopus 로고
    • An overview of scheduling algorithms in MIMO-based fourth-generation wireless systems
    • Sept/Oct
    • W, Ajib and D. Hoccoun, "An overview of scheduling algorithms in MIMO-based fourth-generation wireless systems," IEEE Network, Sept/Oct. 2005.
    • (2005) IEEE Network
    • Ajib, W.1    Hoccoun, D.2
  • 2
    • 78649405270 scopus 로고    scopus 로고
    • Low-complexity space-time-frequency scheduling for M1MO systems with SDMA
    • Sept
    • M. Fuchs, G. Del Galdo, and M. Haardt, "Low-complexity space-time-frequency scheduling for M1MO systems with SDMA," IEEE Tr. Vehic. Tech., Vol. 56, No. 5, pp. 2775-2784, Sept. 2005.
    • (2005) IEEE Tr. Vehic. Tech , vol.56 , Issue.5 , pp. 2775-2784
    • Fuchs, M.1    Del Galdo, G.2    Haardt, M.3
  • 4
    • 57849113942 scopus 로고    scopus 로고
    • Subcarrier allocation in a multiuser MIMO channel using linear programming
    • Florence, Italy, Sept
    • A. Hottinen, T. Heikkinen, "Subcarrier allocation in a multiuser MIMO channel using linear programming," Proc. EUSIPCO 2006, Florence, Italy, Sept. 2006.
    • (2006) Proc. EUSIPCO 2006
    • Hottinen, A.1    Heikkinen, T.2
  • 5
    • 57849166211 scopus 로고    scopus 로고
    • Optimal user pairing in downlink MU-MIMO with transmit precoding
    • Berlin, Germany, March
    • A. Hottinen and E. Viterbo, "Optimal user pairing in downlink MU-MIMO with transmit precoding," Proc. RAWNET, Berlin, Germany, March 2008.
    • (2008) Proc. RAWNET
    • Hottinen, A.1    Viterbo, E.2
  • 7
    • 57849119215 scopus 로고    scopus 로고
    • http://www.research.att.com/~njas/sequences/A001147
  • 8
    • 57849109838 scopus 로고    scopus 로고
    • http://www.research.att.com/~njas/sequences/A000085
  • 10
    • 0002719797 scopus 로고
    • The Hungarian Method for the assignment problem
    • H.W. Kuhn, "The Hungarian Method for the assignment problem," Naval Research Logistic Quarterly, 2:83-97, 1955.
    • (1955) Naval Research Logistic Quarterly , vol.2 , pp. 83-97
    • Kuhn, H.W.1
  • 11
    • 0002719797 scopus 로고
    • Variants of the Hungarian method for assignment problems
    • H.W. Kuhn, "Variants of the Hungarian method for assignment problems," Naval Research Logistic Quarterly, 3: 253-258, 1956.
    • (1956) Naval Research Logistic Quarterly , vol.3 , pp. 253-258
    • Kuhn, H.W.1
  • 13
    • 57849139709 scopus 로고    scopus 로고
    • IEEE Std 802.16e, IEEE Standard for Local and metropolitan area networks, Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems, February 28 2006
    • IEEE Std 802.16e, IEEE Standard for Local and metropolitan area networks, Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems, February 28 2006


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