메뉴 건너뛰기




Volumn 10, Issue 11, 2011, Pages 3675-3687

Diversity-multiplexing tradeoff in OFDMA systems: An H-matching approach

Author keywords

constraint H matching; correlated random bipartite graph; diversity multiplexing tradeoff; OFDMA; outage probability

Indexed keywords

BIPARTITE GRAPHS; CONSTRAINT H-MATCHING; DIVERSITY-MULTIPLEXING TRADE-OFF; OFDMA; OUTAGE PROBABILITY;

EID: 83555163950     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2011.092011.101114     Document Type: Article
Times cited : (25)

References (38)
  • 1
    • 0022088892 scopus 로고
    • Analysis and simulation of a digital mobile channel using orthogonal frequency division multiplexing
    • L. Cimini, "Analysis and simulation of a digital mobile channel using orthogonal frequency division multiplexing," IEEE Trans. Commun., vol. 33, no. 7, pp. 665-675, 1985.
    • (1985) IEEE Trans. Commun. , vol.33 , Issue.7 , pp. 665-675
    • Cimini, L.1
  • 3
    • 0032646667 scopus 로고    scopus 로고
    • Multiuser OFDM with adaptive subcarrier, bit, and power allocation
    • C. Wong, R. Cheng, K. Letaief, and R. Murch, "Multiuser OFDM with adaptive subcarrier, bit, and power allocation," IEEE J. Sel. Areas Commun., vol. 17, no. 10, pp. 1747-1758, 1999.
    • (1999) IEEE J. Sel. Areas Commun. , vol.17 , Issue.10 , pp. 1747-1758
    • Wong, C.1    Cheng, R.2    Letaief, K.3    Murch, R.4
  • 4
    • 0033732297 scopus 로고    scopus 로고
    • Wireless multicarrier communications: Where Fourier meets
    • Shannon
    • Z. Wang and G. Giannakis, "Wireless multicarrier communications: Where Fourier meets Shannon," IEEE Signal Process. Mag., vol. 17, no. 3, pp. 29-48, 2000.
    • (2000) IEEE Signal Process. Mag. , vol.17 , Issue.3 , pp. 29-48
    • Wang, Z.1    Giannakis, G.2
  • 9
    • 3142765492 scopus 로고    scopus 로고
    • Multiuser transmit optimization for multicarrier broadcast channels: Asymptotic FDMA capacity region and algorithms
    • L. M. C. Hoo, B. Halder, J. Tellado, and J. M. Cioffi, "Multiuser transmit optimization for multicarrier broadcast channels: Asymptotic FDMA capacity region and algorithms," IEEE Trans. Commun., vol. 52, no. 6, pp. 922-930, 2004.
    • (2004) IEEE Trans. Commun. , vol.52 , Issue.6 , pp. 922-930
    • Hoo, L.M.C.1    Halder, B.2    Tellado, J.3    Cioffi, J.M.4
  • 10
    • 0037328385 scopus 로고    scopus 로고
    • Transmit power adaptation for multiuser OFDM systems
    • J. Jang and K. B. Lee, "Transmit power adaptation for multiuser OFDM systems," IEEE J. Sel. Areas Commun., vol. 21, no. 2, pp. 171-178, 2003.
    • (2003) IEEE J. Sel. Areas Commun. , vol.21 , Issue.2 , pp. 171-178
    • Jang, J.1    Lee, K.B.2
  • 12
    • 4544359877 scopus 로고    scopus 로고
    • Diversity-multiplexing tradeoff in multiple-access channels
    • D. Tse, P. Viswanath, and L. Zheng, "Diversity-multiplexing tradeoff in multiple-access channels," IEEE Trans. Inf. Theory, vol. 50, no. 9, pp. 1859-1874, 2004.
    • (2004) IEEE Trans. Inf. Theory , vol.50 , Issue.9 , pp. 1859-1874
    • Tse, D.1    Viswanath, P.2    Zheng, L.3
  • 13
    • 33746911145 scopus 로고    scopus 로고
    • Approximately universal codes over slow-fading channels
    • DOI 10.1109/TIT.2006.876226
    • S. Tavildar and P. Viswanath, "Approximately universal codes over slowfading channels," IEEE Trans. Inf. Theory, vol. 52, no. 7, pp. 3233-3258, 2006. (Pubitemid 44192978)
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.7 , pp. 3233-3258
    • Tavildar, S.1    Viswanath, P.2
  • 14
    • 58249134514 scopus 로고    scopus 로고
    • Diversity-multiplexing tradeoff in ISI channels
    • L. Grokop and D. Tse, "Diversity-multiplexing tradeoff in ISI channels," IEEE Trans. Inf. Theory, vol. 55, no. 1, pp. 109-135, 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.1 , pp. 109-135
    • Grokop, L.1    Tse, D.2
  • 15
    • 0035270116 scopus 로고    scopus 로고
    • Capacity and optimal resource allocation for fading broadcast channels-Part I: Ergodic capacity
    • DOI 10.1109/18.915665, PII S0018944801013530
    • L. Li and A. J. Goldsmith, "Capacity and optimal resource allocation for fading broadcast channels-part I: Ergodic capacity," IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 1083-1102, 2001. (Pubitemid 32425438)
    • (2001) IEEE Transactions on Information Theory , vol.47 , Issue.3 , pp. 1083-1102
    • Li, L.1    Goldsmith, A.J.2
  • 16
    • 0035271101 scopus 로고    scopus 로고
    • Capacity and optimal resource allocation for fading broadcast channels-part II: Outage capacity
    • Capacity and optimal resource allocation for fading broadcast channels-part II: Outage capacity," IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 1103-1127, 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.3 , pp. 1103-1127
  • 18
    • 0031145907 scopus 로고    scopus 로고
    • A New Path-Gain/Delay-Spread Propagation Model for Digital Cellular Channels
    • PII S0018954597031265
    • L. J. Greenstein, V. Erceg, Y. S. Yeh, and M. V. Clark, "A new pathgain/delay-spread propagation model for digital cellular channels," IEEE Trans. Veh. Technol., vol. 46, no. 2, pp. 477U? 485, 1997. (Pubitemid 127827287)
    • (1997) IEEE Transactions on Vehicular Technology , vol.46 , Issue.2 , pp. 477-485
    • Greenstein, L.J.1    Erceg, V.2
  • 21
    • 83555170767 scopus 로고    scopus 로고
    • Air interface for fixed and mobile broadband wireless access systems
    • Air Interface for Fixed and Mobile Broadband Wireless Access Systems, IEEE Std. 802.16TM-2009, 2009.
    • (2009) IEEE Std. 802.16TM-2009
  • 22
    • 11944253901 scopus 로고    scopus 로고
    • 2nd edition Cambridge University Press
    • B. Bollobàs, Random Graphs, 2nd edition. Cambridge University Press, 2001.
    • (2001) Random Graphs
    • Bollobàs, B.1
  • 25
    • 0028386368 scopus 로고
    • AX SNP-complete
    • DOI 10.1016/0020-0190(94)90105-8
    • V. Kann, "Maximum bounded H-matching is MAX SNP-complete," Inf. Process. Lett., vol. 49, no. 6, pp. 309-318, 1994. (Pubitemid 124013129)
    • (1994) Information Processing Letters , vol.49 , Issue.6 , pp. 309-318
    • Kann, V.1
  • 26
    • 0026366408 scopus 로고
    • Optimization, approximation, and complexity classes
    • C. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," J. Comp. Sys. Sci., vol. 43, no. 6, pp. 425-440, 1991.
    • (1991) J. Comp. Sys. Sci. , vol.43 , Issue.6 , pp. 425-440
    • Papadimitriou, C.1    Yannakakis, M.2
  • 27
    • 70449504329 scopus 로고    scopus 로고
    • Optimal diversitymultiplexing tradeoff in OFDMA sytems
    • June
    • B. Bai, W. Chen, Z. Cao, and K. Letaief, "Optimal diversitymultiplexing tradeoff in OFDMA sytems," in Proc. IEEE ICC, June 2009.
    • (2009) Proc. IEEE ICC
    • Bai, B.1    Chen, W.2    Cao, Z.3    Letaief, K.4
  • 28
    • 83555163296 scopus 로고    scopus 로고
    • Diversity-multiplexing tradeoff in OFDMA systems with coherence bandwidth splitting
    • Nov
    • Diversity-multiplexing tradeoff in OFDMA systems with coherence bandwidth splitting," in Proc. IEEE Globecom, Nov. 2009.
    • (2009) Proc. IEEE Globecom
  • 29
    • 0028427058 scopus 로고
    • Information theoretic considerations for cellular mobile radio
    • L. Ozarow, S. Shamai, and A. Wyner, "Information theoretic considerations for cellular mobile radio," IEEE Trans. Veh. Technol., vol. 43, no. 2, pp. 359-378, 1994.
    • (1994) IEEE Trans. Veh. Technol. , vol.43 , Issue.2 , pp. 359-378
    • Ozarow, L.1    Shamai, S.2    Wyner, A.3
  • 32
    • 77950598718 scopus 로고    scopus 로고
    • Max-matching diversity in OFDMA systems
    • B. Bai, W. Chen, Z. Cao, and K. Letaief, "Max-matching diversity in OFDMA systems," IEEE Trans. Commun., vol. 58, no. 4, pp. 1161-1171, 2010.
    • (2010) IEEE Trans. Commun. , vol.58 , Issue.4 , pp. 1161-1171
    • Bai, B.1    Chen, W.2    Cao, Z.3    Letaief, K.4
  • 34
    • 83555163297 scopus 로고    scopus 로고
    • Outage exponent for OFDM channels
    • Outage exponent for OFDM channels," in Proc. IEEE Globecom, Dec. 2010.
    • (2010) Proc. IEEE Globecom, Dec
  • 35
    • 0026366408 scopus 로고
    • Optimization, approximation, and complexity classes
    • C. H. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," J. Computer and System Sciences, vol. 43, no. 3, pp. 425-440, 1991.
    • (1991) J. Computer and System Sciences , vol.43 , Issue.3 , pp. 425-440
    • Papadimitriou, C.H.1    Yannakakis, M.2
  • 36
    • 0001009871 scopus 로고
    • 5/2 algorithm for maximum matchings in bipartite graphs
    • SIAM
    • 5/2 algorithm for maximum matchings in bipartite graphs," SIAM J. Comp., vol. 2, no. 4, pp. 225-231, 1973.
    • (1973) J. Comp. , vol.2 , Issue.4 , pp. 225-231
    • Hopcroft, J.1    Karp, R.2
  • 38
    • 0001261128 scopus 로고
    • Maximal flow through a network
    • L. Ford and D. Fulkerson, "Maximal flow through a network," Canad. J. Math., vol. 8, pp. 399-404, 1956.
    • (1956) Canad. J. Math. , vol.8 , pp. 399-404
    • Ford, L.1    Fulkerson, D.2


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