Search | arXiv e-print repository

<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"/> <meta name="viewport" content="width=device-width, initial-scale=1"/>  <link rel="apple-touch-icon" sizes="180x180" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-16x16.png"> <link rel="manifest" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/site.webmanifest"> <link rel="mask-icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/safari-pinned-tab.svg" color="#b31b1b"> <link rel="shortcut icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon.ico"> <meta name="msapplication-TileColor" content="#b31b1b"> <meta name="msapplication-config" content="images/icons/browserconfig.xml"> <meta name="theme-color" content="#b31b1b">  <title>Search | arXiv e-print repository</title> <script defer src="https://static.arxiv.org/static/base/1.0.0a5/fontawesome-free-5.11.2-web/js/all.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/base/1.0.0a5/css/arxivstyle.css" /> <script type="text/x-mathjax-config"> MathJax.Hub.Config({ messageStyle: "none", extensions: ["tex2jax.js"], jax: ["input/TeX", "output/HTML-CSS"], tex2jax: { inlineMath: [ ['$','$'], ["\$","\$"] ], displayMath: [ ['$$','$$'], ["\\[","\\]"] ], processEscapes: true, ignoreClass: '.*', processClass: 'mathjax.*' }, TeX: { extensions: ["AMSmath.js", "AMSsymbols.js", "noErrors.js"], noErrors: { inlineDelimiters: ["$","$"], multiLine: false, style: { "font-size": "normal", "border": "" } } }, "HTML-CSS": { availableFonts: ["TeX"] } }); </script> <script src='//static.arxiv.org/MathJax-2.7.3/MathJax.js'></script> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/notification.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/bulma-tooltip.min.css" /> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/search.css" /> <script src="https://code.jquery.com/jquery-3.2.1.slim.min.js" integrity="sha256-k2WSCIexGzOj3Euiig+TlR8gA0EmPjuc79OEeY5L45g=" crossorigin="anonymous"></script> <script src="https://static.arxiv.org/static/search/0.5.6/js/fieldset.js"></script> <style> radio#cf-customfield_11400 { display: none; } </style> </head> <body> <header><a href="#main-container" class="is-sr-only">Skip to main content</a>  <div class="attribution level is-marginless" role="banner"> <div class="level-left"> <a class="level-item" href="https://cornell.edu/"><img src="https://static.arxiv.org/static/base/1.0.0a5/images/cornell-reduced-white-SMALL.svg" alt="Cornell University" width="200" aria-label="logo" /></a> </div> <div class="level-right is-marginless"><p class="sponsors level-item is-marginless"><span id="support-ack-url">We gratefully acknowledge support from<br /> the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors. <a href="https://info.arxiv.org/about/donate.html">Donate</a></span></p></div> </div>  <div class="identity level is-marginless"> <div class="level-left"> <div class="level-item"> <a class="arxiv" href="https://arxiv.org/" aria-label="arxiv-logo"> <img src="https://static.arxiv.org/static/base/1.0.0a5/images/arxiv-logo-one-color-white.svg" aria-label="logo" alt="arxiv logo" width="85" style="width:85px;"/> </a> </div> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div>  <div class="container"> <div class="user-tools is-size-7 has-text-right has-text-weight-bold" role="navigation" aria-label="User menu"> <a href="https://arxiv.org/login">Login</a> </div> </div> </header> <main class="container" id="main-container"> <div class="level is-marginless"> <div class="level-left"> <h1 class="title is-clearfix"> Showing 1–12 of 12 results for author: <span class="mathjax">Burr, A G</span> </h1> </div> <div class="level-right is-hidden-mobile">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> <div class="content"> <form method="GET" action="/search/eess" aria-role="search"> Searching in archive <strong>eess</strong>. <a href="/search/?searchtype=author&query=Burr%2C+A+G">Search in all archives.</a> <div class="field has-addons-tablet"> <div class="control is-expanded"> <label for="query" class="hidden-label">Search term or terms</label> <input class="input is-medium" id="query" name="query" placeholder="Search term..." type="text" value="Burr, A G"> </div> <div class="select control is-medium"> <label class="is-hidden" for="searchtype">Field</label> <select class="is-medium" id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> </div> <div class="control"> <button class="button is-link is-medium">Search</button> </div> </div> <div class="field"> <div class="control is-size-7"> <label class="radio"> <input checked id="abstracts-0" name="abstracts" type="radio" value="show"> Show abstracts </label> <label class="radio"> <input id="abstracts-1" name="abstracts" type="radio" value="hide"> Hide abstracts </label> </div> </div> <div class="is-clearfix" style="height: 2.5em"> <div class="is-pulled-right"> <a href="/search/advanced?terms-0-term=Burr%2C+A+G&terms-0-field=author&size=50&order=-announced_date_first">Advanced Search</a> </div> </div> <input type="hidden" name="order" value="-announced_date_first"> <input type="hidden" name="size" value="50"> </form> <div class="level breathe-horizontal"> <div class="level-left"> <form method="GET" action="/search/"> <div style="display: none;"> <select id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> <input id="query" name="query" type="text" value="Burr, A G"> <ul id="abstracts"><li><input checked id="abstracts-0" name="abstracts" type="radio" value="show"> <label for="abstracts-0">Show abstracts</label></li><li><input id="abstracts-1" name="abstracts" type="radio" value="hide"> <label for="abstracts-1">Hide abstracts</label></li></ul> </div> <div class="box field is-grouped is-grouped-multiline level-item"> <div class="control"> <span class="select is-small"> <select id="size" name="size"><option value="25">25</option><option selected value="50">50</option><option value="100">100</option><option value="200">200</option></select> </span> <label for="size">results per page</label>. </div> <div class="control"> <label for="order">Sort results by</label> <span class="select is-small"> <select id="order" name="order"><option selected value="-announced_date_first">Announcement date (newest first)</option><option value="announced_date_first">Announcement date (oldest first)</option><option value="-submitted_date">Submission date (newest first)</option><option value="submitted_date">Submission date (oldest first)</option><option value="">Relevance</option></select> </span> </div> <div class="control"> <button class="button is-small is-link">Go</button> </div> </div> </form> </div> </div> <ol class="breathe-horizontal" start="1"> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2006.11153">arXiv:2006.11153</a> <span> [<a href="https://arxiv.org/pdf/2006.11153">pdf</a>, <a href="https://arxiv.org/format/2006.11153">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Spectral-Energy Efficiency Trade-off-based Beamforming Design for MISO Non-Orthogonal Multiple Access Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Al-Obiedollah%2C+H">Haitham Al-Obiedollah</a>, <a href="/search/eess?searchtype=author&query=Cumanan%2C+K">Kanapathippillai Cumanan</a>, <a href="/search/eess?searchtype=author&query=Thiyagalingam%2C+J">Jeyarajan Thiyagalingam</a>, <a href="/search/eess?searchtype=author&query=Tang%2C+J">Jie Tang</a>, <a href="/search/eess?searchtype=author&query=Burr%2C+A+G">Alister G. Burr</a>, <a href="/search/eess?searchtype=author&query=Ding%2C+Z">Zhiguo Ding</a>, <a href="/search/eess?searchtype=author&query=Dobre%2C+O+A">Octavia A. Dobre</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2006.11153v1-abstract-short" style="display: inline;"> Energy efficiency (EE) and spectral efficiency (SE) are two of the key performance metrics in future wireless networks, covering both design and operational requirements. For previous conventional resource allocation techniques, these two performance metrics have been considered in isolation, resulting in severe performance degradation in either of these metrics. Motivated by this problem, in this… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.11153v1-abstract-full').style.display = 'inline'; document.getElementById('2006.11153v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2006.11153v1-abstract-full" style="display: none;"> Energy efficiency (EE) and spectral efficiency (SE) are two of the key performance metrics in future wireless networks, covering both design and operational requirements. For previous conventional resource allocation techniques, these two performance metrics have been considered in isolation, resulting in severe performance degradation in either of these metrics. Motivated by this problem, in this paper, we propose a novel beamforming design that jointly considers the trade-off between the two performance metrics in a multiple-input single-output non-orthogonal multiple access system. In particular, we formulate a joint SE-EE based design as a multi-objective optimization (MOO) problem to achieve a good tradeoff between the two performance metrics. However, this MOO problem is not mathematically tractable and, thus, it is difficult to determine a feasible solution due to the conflicting objectives, where both need to be simultaneously optimized. To overcome this issue, we exploit a priori articulation scheme combined with the weighted sum approach. Using this, we reformulate the original MOO problem as a conventional single objective optimization (SOO) problem. In doing so, we develop an iterative algorithm to solve this non-convex SOO problem using the sequential convex approximation technique. Simulation results are provided to demonstrate the advantages and effectiveness of the proposed approach over the available beamforming designs. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.11153v1-abstract-full').style.display = 'none'; document.getElementById('2006.11153v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 19 June, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2020. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted in IEEE TWC, June 2020</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2005.00320">arXiv:2005.00320</a> <span> [<a href="https://arxiv.org/pdf/2005.00320">pdf</a>, <a href="https://arxiv.org/format/2005.00320">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Design and Convergence Analysis of an IIC-based BICM-ID Receiver for FBMC-QAM Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Mahama%2C+S">Sumaila Mahama</a>, <a href="/search/eess?searchtype=author&query=Harbi%2C+Y+J">Yahya J. Harbi</a>, <a href="/search/eess?searchtype=author&query=Burr%2C+A+G">Alister G. Burr</a>, <a href="/search/eess?searchtype=author&query=Grace%2C+D">David Grace</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2005.00320v1-abstract-short" style="display: inline;"> In this paper, an iterative interference cancellation (IIC) based BICM-ID receiver is designed to cancel the intrinsic interference in FBMC-QAM systems. The proposed receiver consist of an inner decoder, which combines iterative demodulation and interference cancellation, and an outer decoder which is a low density parity check (LDPC) channel decoder. To evaluate the convergence behaviour of the p… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2005.00320v1-abstract-full').style.display = 'inline'; document.getElementById('2005.00320v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2005.00320v1-abstract-full" style="display: none;"> In this paper, an iterative interference cancellation (IIC) based BICM-ID receiver is designed to cancel the intrinsic interference in FBMC-QAM systems. The proposed receiver consist of an inner decoder, which combines iterative demodulation and interference cancellation, and an outer decoder which is a low density parity check (LDPC) channel decoder. To evaluate the convergence behaviour of the proposed receiver, extrinsic information transfer (EXIT) chart analysis is employed, where EXIT curves for the components of the iterative decoder are derived. Numerical results show that the intrinsic interference in FBMC-QAM systems can be removed by adopting the proposed IIC-based BICM-ID receiver. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2005.00320v1-abstract-full').style.display = 'none'; document.getElementById('2005.00320v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 1 May, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1908.08719">arXiv:1908.08719</a> <span> [<a href="https://arxiv.org/pdf/1908.08719">pdf</a>, <a href="https://arxiv.org/format/1908.08719">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> On Energy Harvesting of Hybrid TDMA-NOMA Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Al-Obiedollah%2C+H">Haitham Al-Obiedollah</a>, <a href="/search/eess?searchtype=author&query=Cumanan%2C+K">Kanapathippillai Cumanan</a>, <a href="/search/eess?searchtype=author&query=Burr%2C+A+G">Alister G. Burr</a>, <a href="/search/eess?searchtype=author&query=Tang%2C+J">Jie Tang</a>, <a href="/search/eess?searchtype=author&query=Rahulamathavan%2C+Y">Yogachandran Rahulamathavan</a>, <a href="/search/eess?searchtype=author&query=Ding%2C+Z">Zhiguo Ding</a>, <a href="/search/eess?searchtype=author&query=Dobre%2C+O+A">Octavia A. Dobre</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1908.08719v1-abstract-short" style="display: inline;"> In this paper, we investigate energy harvesting capabilities of non-orthogonal multiple access (NOMA) scheme integrated with the conventional time division multiple access (TDMA) scheme, which is referred to as hybrid TDMA-NOMA system. In a such hybrid scheme, users are divided into a number of groups, with the total time allocated for transmission is shared between these groups through multiple t… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1908.08719v1-abstract-full').style.display = 'inline'; document.getElementById('1908.08719v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1908.08719v1-abstract-full" style="display: none;"> In this paper, we investigate energy harvesting capabilities of non-orthogonal multiple access (NOMA) scheme integrated with the conventional time division multiple access (TDMA) scheme, which is referred to as hybrid TDMA-NOMA system. In a such hybrid scheme, users are divided into a number of groups, with the total time allocated for transmission is shared between these groups through multiple time slots. In particular, a time slot is assigned to serve each group, whereas the users in the corresponding group are served based on power-domain NOMA technique. Furthermore, simultaneous wireless power and information transfer technique is utilized to simultaneously harvest energy and decode information at each user. Therefore, each user splits the received signal into two parts, namely, energy harvesting part and information decoding part. In particular, we jointly determine the power allocation and power splitting ratios for all users to minimize the transmit power under minimum rate and minimum energy harvesting requirements at each user. Furthermore, this joint design is a non-convex problem in nature. Hence, we employ successive interference cancellation to overcome these non-convexity issues and determine the design parameters (i.e., the power allocations and the power splitting ratios). In simulation results, we demonstrate the performance of the proposed hybrid TDMA-NOMA design and show that it outperforms the conventional TDMA scheme in terms of transmit power consumption. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1908.08719v1-abstract-full').style.display = 'none'; document.getElementById('1908.08719v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 August, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2019. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1907.01865">arXiv:1907.01865</a> <span> [<a href="https://arxiv.org/pdf/1907.01865">pdf</a>, <a href="https://arxiv.org/ps/1907.01865">ps</a>, <a href="https://arxiv.org/format/1907.01865">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Evaluation of Low Complexity Massive MIMO Techniques Under Realistic Channel Conditions </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Bashar%2C+M">Manijeh Bashar</a>, <a href="/search/eess?searchtype=author&query=Burr%2C+A+G">Alister G. Burr</a>, <a href="/search/eess?searchtype=author&query=Haneda%2C+K">Katsuyuki Haneda</a>, <a href="/search/eess?searchtype=author&query=Cumanan%2C+K">Kanapathippillai Cumanan</a>, <a href="/search/eess?searchtype=author&query=Molu%2C+M+M">Mehdi M. Molu</a>, <a href="/search/eess?searchtype=author&query=Khalily%2C+M">Mohsen Khalily</a>, <a href="/search/eess?searchtype=author&query=Xiao%2C+P">Pei Xiao</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1907.01865v1-abstract-short" style="display: inline;"> A low complexity massive multiple-input multiple-output (MIMO) technique is studied with a geometry-based stochastic channel model, called COST 2100 model. We propose to exploit the discrete-time Fourier transform of the antenna correlation function to perform user scheduling. The proposed algorithm relies on a trade off between the number of occupied bins of the eigenvalue spectrum of the channel… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1907.01865v1-abstract-full').style.display = 'inline'; document.getElementById('1907.01865v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1907.01865v1-abstract-full" style="display: none;"> A low complexity massive multiple-input multiple-output (MIMO) technique is studied with a geometry-based stochastic channel model, called COST 2100 model. We propose to exploit the discrete-time Fourier transform of the antenna correlation function to perform user scheduling. The proposed algorithm relies on a trade off between the number of occupied bins of the eigenvalue spectrum of the channel covariance matrix for each user and spectral overlap among the selected users. We next show that linear precoding design can be performed based only on the channel correlation matrix. The proposed scheme exploits the angular bins of the eigenvalue spectrum of the channel covariance matrix to build up an "approximate eigenchannels" for the users. We investigate the reduction of average system throughput with no channel state information at the transmitter (CSIT). Analysis and numerical results show that while the throughput slightly decreases due to the absence of CSIT, the complexity of the system is reduced significantly. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1907.01865v1-abstract-full').style.display = 'none'; document.getElementById('1907.01865v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 3 July, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">IEEE TVT 2019, 7 pages, 4 figures,</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1902.05849">arXiv:1902.05849</a> <span> [<a href="https://arxiv.org/pdf/1902.05849">pdf</a>, <a href="https://arxiv.org/format/1902.05849">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Energy Efficient Beamforming Design for MISO Non-Orthogonal Multiple Access Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Al-Obiedollah%2C+H">Haitham Al-Obiedollah</a>, <a href="/search/eess?searchtype=author&query=Cumanan%2C+K">Kanapathippillai Cumanan</a>, <a href="/search/eess?searchtype=author&query=Thiyagalingam%2C+J">Jeyarajan Thiyagalingam</a>, <a href="/search/eess?searchtype=author&query=Burr%2C+A+G">Alister G. Burr</a>, <a href="/search/eess?searchtype=author&query=Ding%2C+Z">Zhiguo Ding</a>, <a href="/search/eess?searchtype=author&query=Dobre%2C+O+A">Octavia A. Dobre</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1902.05849v1-abstract-short" style="display: inline;"> When considering the future generation wireless networks, non-orthogonal multiple access (NOMA) represents a viable multiple access technique for improving the spectral efficiency. The basic performance of NOMA is often enhanced using downlink beamforming and power allocation techniques. Although downlink beamforming has been previously studied with different performance criteria, such as sum-rate… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1902.05849v1-abstract-full').style.display = 'inline'; document.getElementById('1902.05849v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1902.05849v1-abstract-full" style="display: none;"> When considering the future generation wireless networks, non-orthogonal multiple access (NOMA) represents a viable multiple access technique for improving the spectral efficiency. The basic performance of NOMA is often enhanced using downlink beamforming and power allocation techniques. Although downlink beamforming has been previously studied with different performance criteria, such as sum-rate and max-min rate, it has not been studied in the multiuser, multiple-input single-output (MISO) case, particularly with the energy efficiency criteria. In this paper, we investigate the design of an energy efficient beamforming technique for downlink transmission in the context of a multiuser MISO-NOMA system. In particular, this beamforming design is formulated as a global energy efficiency (GEE) maximization problem with minimum user rate requirements and transmit power constraints. By using the sequential convex approximation (SCA) technique and the Dinkelbach's algorithm to handle the non-convex nature of the GEE-Max problem, we propose two novel algorithms for solving the downlink beamforming problem for the MISO-NOMA system. Our evaluation of the proposed algorithms shows that they offer similar optimal designs and are effective in offering substantial energy efficiencies compared to the designs based on conventional methods. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1902.05849v1-abstract-full').style.display = 'none'; document.getElementById('1902.05849v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 15 February, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted at IEEE Transaction on Communication</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1902.05735">arXiv:1902.05735</a> <span> [<a href="https://arxiv.org/pdf/1902.05735">pdf</a>, <a href="https://arxiv.org/format/1902.05735">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Sum Rate Fairness Trade-off-based Resource Allocation Technique for MISO NOMA Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Al-Obiedollah%2C+H">Haitham Al-Obiedollah</a>, <a href="/search/eess?searchtype=author&query=Cumanan%2C+K">Kanapathippillai Cumanan</a>, <a href="/search/eess?searchtype=author&query=Thiyagalingam%2C+J">Jeyarajan Thiyagalingam</a>, <a href="/search/eess?searchtype=author&query=Burr%2C+A+G">Alister G. Burr</a>, <a href="/search/eess?searchtype=author&query=Ding%2C+Z">Zhiguo Ding</a>, <a href="/search/eess?searchtype=author&query=Dobre%2C+O+A">Octavia A. Dobre</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1902.05735v1-abstract-short" style="display: inline;"> In this paper, we propose a beamforming design that jointly considers two conflicting performance metrics, namely the sum rate and fairness, for a multiple-input single-output non-orthogonal multiple access system. Unlike the conventional rate-aware beamforming designs, the proposed approach has the flexibility to assign different weights to the objectives (i.e., sum rate and fairness) according t… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1902.05735v1-abstract-full').style.display = 'inline'; document.getElementById('1902.05735v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1902.05735v1-abstract-full" style="display: none;"> In this paper, we propose a beamforming design that jointly considers two conflicting performance metrics, namely the sum rate and fairness, for a multiple-input single-output non-orthogonal multiple access system. Unlike the conventional rate-aware beamforming designs, the proposed approach has the flexibility to assign different weights to the objectives (i.e., sum rate and fairness) according to the network requirements and the channel conditions. In particular, the proposed design is first formulated as a multi-objective optimization problem, and subsequently mapped to a single objective optimization (SOO) problem by exploiting the weighted sum approach combined with a prior articulation method. As the resulting SOO problem is non-convex, we use the sequential convex approximation technique, which introduces multiple slack variables, to solve the overall problem. Simulation results are provided to demonstrate the performance and the effectiveness of the proposed approach along with detailed comparisons with conventional rate-aware-based beamforming designs. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1902.05735v1-abstract-full').style.display = 'none'; document.getElementById('1902.05735v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 15 February, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">IEEE WCNC 2019</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1902.05732">arXiv:1902.05732</a> <span> [<a href="https://arxiv.org/pdf/1902.05732">pdf</a>, <a href="https://arxiv.org/format/1902.05732">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Energy Efficiency Fairness Beamforming Designs for MISO NOMA Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Al-Obiedollah%2C+H">Haitham Al-Obiedollah</a>, <a href="/search/eess?searchtype=author&query=Cumanan%2C+K">Kanapathippillai Cumanan</a>, <a href="/search/eess?searchtype=author&query=Thiyagalingam%2C+J">Jeyarajan Thiyagalingam</a>, <a href="/search/eess?searchtype=author&query=Burr%2C+A+G">Alister G. Burr</a>, <a href="/search/eess?searchtype=author&query=Ding%2C+Z">Zhiguo Ding</a>, <a href="/search/eess?searchtype=author&query=Dobre%2C+O+A">Octavia A. Dobre</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1902.05732v1-abstract-short" style="display: inline;"> In this paper, we propose two beamforming designs for a multiple-input single-output non-orthogonal multiple access system considering the energy efficiency (EE) fairness between users. In particular, two quantitative fairness-based designs are developed to maintain fairness between the users in terms of achieved EE: max-min energy efficiency (MMEE) and proportional fairness (PF) designs. While th… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1902.05732v1-abstract-full').style.display = 'inline'; document.getElementById('1902.05732v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1902.05732v1-abstract-full" style="display: none;"> In this paper, we propose two beamforming designs for a multiple-input single-output non-orthogonal multiple access system considering the energy efficiency (EE) fairness between users. In particular, two quantitative fairness-based designs are developed to maintain fairness between the users in terms of achieved EE: max-min energy efficiency (MMEE) and proportional fairness (PF) designs. While the MMEE-based design aims to maximize the minimum EE of the users in the system, the PF-based design aims to seek a good balance between the global energy efficiency of the system and the EE fairness between the users. Detailed simulation results indicate that our proposed designs offer many-fold EE improvements over the existing energy-efficient beamforming designs. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1902.05732v1-abstract-full').style.display = 'none'; document.getElementById('1902.05732v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 15 February, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">IEEE WCNC 2019</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1809.00386">arXiv:1809.00386</a> <span> [<a href="https://arxiv.org/pdf/1809.00386">pdf</a>, <a href="https://arxiv.org/ps/1809.00386">ps</a>, <a href="https://arxiv.org/format/1809.00386">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> A Study of Dynamic Multipath Clusters at 60 GHz in a Large Indoor Environment </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Bashar%2C+M">Manijeh Bashar</a>, <a href="/search/eess?searchtype=author&query=Haneda%2C+K">Katsuyuki Haneda</a>, <a href="/search/eess?searchtype=author&query=Burr%2C+A+G">Alister G. Burr</a>, <a href="/search/eess?searchtype=author&query=Cumanan%2C+K">Kanapathippillai Cumanan</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1809.00386v1-abstract-short" style="display: inline;"> The available geometry-based stochastic channel models (GSCMs) at millimetre-wave (mmWave) frequencies do not necessarily retain spatial consistency for simulated channels, which is essential for small cells with ultra-dense users. In this paper, we work on cluster parameterization for the COST 2100 channel model using mobile channel simulations at 61 GHz in Helsinki Airport. The paper considers a… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1809.00386v1-abstract-full').style.display = 'inline'; document.getElementById('1809.00386v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1809.00386v1-abstract-full" style="display: none;"> The available geometry-based stochastic channel models (GSCMs) at millimetre-wave (mmWave) frequencies do not necessarily retain spatial consistency for simulated channels, which is essential for small cells with ultra-dense users. In this paper, we work on cluster parameterization for the COST 2100 channel model using mobile channel simulations at 61 GHz in Helsinki Airport. The paper considers a ray-tracer which has been optimized to match measurements, to obtain double-directional channels at mmWave frequencies. A joint clustering-tracking framework is used to determine cluster parameters for the COST 2100 channel model. The KPowerMeans algorithm and the Kalman filter are exploited to identify the cluster positions and to predict and track cluster positions respectively. The results confirm that the joint clustering-and-tracking is a suitable tool for cluster identification and tracking for our ray-tracer results. The movement of cluster centroids, cluster lifetime and number of clusters per snapshot are investigated for this set of ray-tracer results. Simulation results show that the multipath components (MPCs) are grouped into clusters at mmWave frequencies. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1809.00386v1-abstract-full').style.display = 'none'; document.getElementById('1809.00386v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 2 September, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2018. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">7 pages, 12 figures, The IEEE GLOBECOM 2018 Workshops: Channel models and measurements for mmWave bands</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1805.05786">arXiv:1805.05786</a> <span> [<a href="https://arxiv.org/pdf/1805.05786">pdf</a>, <a href="https://arxiv.org/ps/1805.05786">ps</a>, <a href="https://arxiv.org/format/1805.05786">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> An Adaptive Optimal Mapping Selection Algorithm for PNC using Variable QAM Modulation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Peng%2C+T">Tong Peng</a>, <a href="/search/eess?searchtype=author&query=Wang%2C+Y">Yi Wang</a>, <a href="/search/eess?searchtype=author&query=Burr%2C+A+G">Alister G. Burr</a>, <a href="/search/eess?searchtype=author&query=Shikh-Bahaei%2C+M">Mohammad Shikh-Bahaei</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1805.05786v1-abstract-short" style="display: inline;"> Fifth generation (5G) wireless networks will need to serve much higher user densities than existing 4G networks, and will therefore require an enhanced radio access network (RAN) infrastructure. Physical layer network coding (PNC) has been shown to enable such high densities with much lower backhaul load than approaches such as Cloud-RAN and coordinated multipoint (CoMP). In this letter, we presen… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1805.05786v1-abstract-full').style.display = 'inline'; document.getElementById('1805.05786v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1805.05786v1-abstract-full" style="display: none;"> Fifth generation (5G) wireless networks will need to serve much higher user densities than existing 4G networks, and will therefore require an enhanced radio access network (RAN) infrastructure. Physical layer network coding (PNC) has been shown to enable such high densities with much lower backhaul load than approaches such as Cloud-RAN and coordinated multipoint (CoMP). In this letter, we present an engineering applicable PNC scheme which allows different cooperating users to use different modulation schemes, according to the relative strength of their channels to a given access point. This is in contrast with compute-and-forward and previous PNC schemes which are designed for two-way relay channel. A two-stage search algorithm to identify the optimum PNC mappings for given channel state information and modulation is proposed in this letter. Numerical results show that the proposed scheme achieves low bit error rate with reduced backhaul load. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1805.05786v1-abstract-full').style.display = 'none'; document.getElementById('1805.05786v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 15 May, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2018. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1805.00436">arXiv:1805.00436</a> <span> [<a href="https://arxiv.org/pdf/1805.00436">pdf</a>, <a href="https://arxiv.org/ps/1805.00436">ps</a>, <a href="https://arxiv.org/format/1805.00436">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> A Physical Layer Network Coding Design for 5G Network MIMO </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Peng%2C+T">Tong Peng</a>, <a href="/search/eess?searchtype=author&query=Wang%2C+Y">Yi Wang</a>, <a href="/search/eess?searchtype=author&query=Burr%2C+A+G">Alister G. Burr</a>, <a href="/search/eess?searchtype=author&query=Shikh-Bahaei%2C+M">Mohammad Shikh-Bahaei</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1805.00436v1-abstract-short" style="display: inline;"> This paper presents a physical layer network coding (PNC) approach for network MIMO (N-MIMO) systems to release the heavy burden of backhaul load. The proposed PNC approach is applied for uplink scenario in binary systems, and the design guideline serves multiple mobile terminals (MTs) and guarantees unambiguous recovery of the message from each MT. We present a novel PNC design criterion first ba… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1805.00436v1-abstract-full').style.display = 'inline'; document.getElementById('1805.00436v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1805.00436v1-abstract-full" style="display: none;"> This paper presents a physical layer network coding (PNC) approach for network MIMO (N-MIMO) systems to release the heavy burden of backhaul load. The proposed PNC approach is applied for uplink scenario in binary systems, and the design guideline serves multiple mobile terminals (MTs) and guarantees unambiguous recovery of the message from each MT. We present a novel PNC design criterion first based on binary matrix theories, followed by an adaptive optimal mapping selection algorithm based on the proposed design criterion. In order to reduce the real-time computational complexity, a two-stage search algorithm for the optimal binary PNC mapping matrix is developed. Numerical results show that the proposed scheme achieves lower outage probability with reduced backhaul load compared to practical CoMP schemes which quantize the estimated symbols from a log-likelihood ratio (LLR) based multiuser detector into binary bits at each access point (AP). <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1805.00436v1-abstract-full').style.display = 'none'; document.getElementById('1805.00436v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 1 May, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2018. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">arXiv admin note: text overlap with arXiv:1801.07061</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1804.08425">arXiv:1804.08425</a> <span> [<a href="https://arxiv.org/pdf/1804.08425">pdf</a>, <a href="https://arxiv.org/ps/1804.08425">ps</a>, <a href="https://arxiv.org/format/1804.08425">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> </div> </div> <p class="title is-5 mathjax"> Mixed Quality of Service in Cell-Free Massive MIMO </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Bashar%2C+M">Manijeh Bashar</a>, <a href="/search/eess?searchtype=author&query=Cumanan%2C+K">Kanapathippillai Cumanan</a>, <a href="/search/eess?searchtype=author&query=Burr%2C+A+G">Alister G. Burr</a>, <a href="/search/eess?searchtype=author&query=Ngo%2C+H+Q">Hien Quoc Ngo</a>, <a href="/search/eess?searchtype=author&query=Poor%2C+H+V">H. Vincent Poor</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1804.08425v4-abstract-short" style="display: inline;"> Cell-free massive multiple-input multiple-output (MIMO) is a potential key technology for fifth generation wireless communication networks. A mixed quality-of-service (QoS) problem is investigated in the uplink of a cell-free massive MIMO system where the minimum rate of non-real time users is maximized with per user power constraints whilst the rate of the real-time users (RTUs) meet their target… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1804.08425v4-abstract-full').style.display = 'inline'; document.getElementById('1804.08425v4-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1804.08425v4-abstract-full" style="display: none;"> Cell-free massive multiple-input multiple-output (MIMO) is a potential key technology for fifth generation wireless communication networks. A mixed quality-of-service (QoS) problem is investigated in the uplink of a cell-free massive MIMO system where the minimum rate of non-real time users is maximized with per user power constraints whilst the rate of the real-time users (RTUs) meet their target rates. First an approximated uplink user rate is derived based on available channel statistics. Next, the original mixed QoS problem is formulated in terms of receiver filter coefficients and user power allocations which can iteratively be solved through two sub-problems, namely, receiver filter coefficient design and power allocation, which are dealt with using a generalized eigenvalue problem and geometric programming, respectively. Numerical results show that with the proposed scheme, while the rates of RTUs meet the QoS constraints, the $90\%$-likely throughput improves significantly, compared to a simple benchmark scheme. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1804.08425v4-abstract-full').style.display = 'none'; document.getElementById('1804.08425v4-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 19 June, 2018; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 19 April, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2018. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">2 figures. arXiv admin note: text overlap with arXiv:1801.10188, arXiv:1801.10190</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1801.07061">arXiv:1801.07061</a> <span> [<a href="https://arxiv.org/pdf/1801.07061">pdf</a>, <a href="https://arxiv.org/ps/1801.07061">ps</a>, <a href="https://arxiv.org/format/1801.07061">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Wireless Network Coding in Network MIMO: A New Design for 5G and Beyond </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Peng%2C+T">Tong Peng</a>, <a href="/search/eess?searchtype=author&query=Wang%2C+Y">Yi Wang</a>, <a href="/search/eess?searchtype=author&query=Burr%2C+A+G">Alister G. Burr</a>, <a href="/search/eess?searchtype=author&query=Shikh-Bahaei%2C+M">Mohammad Shikh-Bahaei</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1801.07061v3-abstract-short" style="display: inline;"> Physical layer network coding (PNC) has been studied to serve wireless network MIMO systems with much lower backhaul load than approaches such as Cloud Radio Access Network (Cloud-RAN) and coordinated multipoint (CoMP). In this paper, we present a design guideline of engineering applicable PNC to fulfil the request of high user densities in 5G wireless RAN infrastructure. Unlike compute-and-forwar… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1801.07061v3-abstract-full').style.display = 'inline'; document.getElementById('1801.07061v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1801.07061v3-abstract-full" style="display: none;"> Physical layer network coding (PNC) has been studied to serve wireless network MIMO systems with much lower backhaul load than approaches such as Cloud Radio Access Network (Cloud-RAN) and coordinated multipoint (CoMP). In this paper, we present a design guideline of engineering applicable PNC to fulfil the request of high user densities in 5G wireless RAN infrastructure. Unlike compute-and-forward and PNC design criteria for two-way relay channels, the proposed guideline is designed for uplink of network MIMO (N-MIMO) systems. We show that the proposed design criteria guarantee that 1) the whole system operates over binary system; 2) the PNC functions utilised at each access point overcome all singular fade states; 3) the destination can unambiguously recover all source messages while the overall backhaul load remains at the lowest level. We then develop a two-stage search algorithm to identify the optimum PNC mapping functions which greatly reduces the real-time computational complexity. The impact of estimated channel information and reduced number of singular fade states in different QAM modulation schemes is studied in this paper. In addition, a sub-optimal search method based on lookup table mechanism to achieve further reduced computational complexity with limited performance loss is presented. Numerical results show that the proposed schemes achieve low outage probability with reduced backhaul load. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1801.07061v3-abstract-full').style.display = 'none'; document.getElementById('1801.07061v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 May, 2018; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 22 January, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2018. </p> </li> </ol> <div class="is-hidden-tablet">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> </main> <footer> <div class="columns is-desktop" role="navigation" aria-label="Secondary">  <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul class="nav-spaced"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div>   <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div>  </div> </footer> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/member_acknowledgement.js"></script> </body> </html>

CINXE.COM

Search | arXiv e-print repository