19
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      An Outage Exponent Region based Coded f-Matching Framework for Channel Allocation in Multi-carrier Multi-access Channels

      Preprint
      , , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The multi-carrier multi-access technique is widely adopt in future wireless communication systems, such as IEEE 802.16m and 3GPP LTE-A. The channel resources allocation in multi-carrier multi-access channel, which can greatly improve the system throughput with QoS assurance, thus attracted much attention from both academia and industry. There lacks, however, an analytic framework with a comprehensive performance metric, such that it is difficult to fully exploit the potentials of channel allocation. This paper will propose an analytic coded fmatching framework, where the outage exponent region (OER) will be defined as the performance metric. The OER determines the relationship of the outage performance among all of the users in the full SNR range, and converges to the diversity-multiplexing region (DMR) when SNR tends to infinity. To achieve the optimal OER and DMR, the random bipartite graph (RBG) approach, only depending on 1 bit CSI, will be proposed to formulate this problem. Based on the RBG formulation, the optimal frequency-domain coding based maximum f-matching method is then proposed. By analyzing the combinatorial structure of the RBG based coded f-matching with the help of saddlepoint approximation, the outage probability of each user, OER, and DMR will be derived in closed-form formulas. It will be shown that all of the users share the total multiplexing gain according to their rate requirements, while achieving the full frequency diversity, i.e., the optimal OER and DMR. Based on the principle of parallel computations, the parallel vertices expansion & random rotation based Hopcroft-Karp (PVER2HK) algorithm, which enjoys a logarithmic polynomial complexity, will be proposed. The simulation results will not only verify the theoretical derivations, but also show the significant performance gains.

          Related collections

          Most cited references17

          • Record: found
          • Abstract: not found
          • Article: not found

          Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Analysis and Simulation of a Digital Mobile Channel Using Orthogonal Frequency Division Multiplexing

              L. Cimini (1985)
                Bookmark

                Author and article information

                Journal
                16 July 2013
                Article
                1307.4462
                956c8d1c-288c-4c78-94e0-ba91a6dbf227

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                19pages, 13 figures
                cs.IT math.IT

                Comments

                Comment on this article