LTE capacity compared to the Shannon bound

被引:292
|
作者
Mogensen, Preben [1 ,2 ]
Na, Wei [1 ]
Kovacs, Istvan Z. [2 ]
Frederiksen, Frank [2 ]
Pokhariyal, Akhilesh [1 ]
Pedersen, Klaus I. [2 ]
Kolding, Troels [2 ]
Hugl, Klaus [3 ]
Kuusela, Markku [3 ]
机构
[1] Aalborg Univ, Aalborg, Denmark
[2] Nokia Networks, Aalborg, Denmark
[3] Nokia Res Ctr, Helsinki, Finland
关键词
OFDMA; MIMO; Shannon capacity; wireless system and link performance; LTE;
D O I
10.1109/VETECS.2007.260
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper we propose a modification to Shannon capacity bound in order to facilitate accurate benchmarking of UTRAN Long Term Evolution (LTE). The method is generally applicable to wireless communication systems, while we have used LTE air-interface technology as a case study. We introduces an adjusted Shannon capacity formula, where we take into account the system bandwidth efficiency and the SNR efficiency of LTE. Separating these issues, allows for simplified parameter extraction. We show that the bandwidth efficiency can be calculated based on system parameters, while the SNR efficiency is extracted from detailed link level studies including advanced features of MIMO and frequency domain packet scheduling (FDPS). We then use the adjusted Shannon capacity formula combined with G-factor distributions for macro and micro cell scenarios to predict LTE cell spectral efficiency (SE). Such LTE SE predictions are compared to LTE cell SE results generated by system level simulations. The results show an excellent match of less that 5-10% deviation.
引用
收藏
页码:1234 / 1238
页数:5
相关论文
共 50 条
  • [1] A Bound on the Shannon Capacity via a Linear Programming Variation
    Hu, Sihuang
    Tamo, Itzhak
    Shayevitz, Ofer
    [J]. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 1063 - 1066
  • [2] A BOUND ON THE SHANNON CAPACITY VIA A LINEAR PROGRAMMING VARIATION
    Hu, Sihuang
    Tamo, Itzhak
    Shayevitz, Ofer
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (03) : 2229 - 2241
  • [3] Improved lower bound on the Shannon capacity of C7
    Vesel, A
    Zerovnik, J
    [J]. INFORMATION PROCESSING LETTERS, 2002, 81 (05) : 277 - 282
  • [4] On the Complexity of Computing the Shannon Outer Bound to a Network Coding Capacity Region
    Liu, Yirui
    Walsh, John MacLaren
    [J]. 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 206 - 210
  • [5] Shannon Capacity Bound on Mobile Station Localization Accuracy in Urban Environments
    Bilik, Igal
    Adhikari, Kaushallya
    Buck, John R.
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2011, 59 (12) : 6206 - 6216
  • [6] MIMO Truncated Shannon bound for system level capacity evaluation of wireless networks
    Burr, Alister
    Papadogiannis, Agisilaos
    Jiang, Tao
    [J]. 2012 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE WORKSHOPS (WCNCW), 2012,
  • [7] New lower bound on the Shannon capacity of C7 from circular graphs
    Polak, Sven C.
    Schrijver, Alexander
    [J]. Information Processing Letters, 2019, 143 : 37 - 40
  • [8] New lower bound on the Shannon capacity of C7 from circular graphs
    Polak, Sven C.
    Schrijver, Alexander
    [J]. INFORMATION PROCESSING LETTERS, 2019, 143 : 37 - 40
  • [9] The Shannon capacity of a union
    Alon, N
    [J]. COMBINATORICA, 1998, 18 (03) : 301 - 310
  • [10] ON THE SHANNON CAPACITY OF A GRAPH
    LOVASZ, L
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (01) : 1 - 7