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–31 of 31 results for author: <span class="mathjax">Shikh-Bahaei, M</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=Shikh-Bahaei%2C+M">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="Shikh-Bahaei, M"> </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=Shikh-Bahaei%2C+M&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="Shikh-Bahaei, M"> <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/2412.20937">arXiv:2412.20937</a> <span> [<a href="https://arxiv.org/pdf/2412.20937">pdf</a>, <a href="https://arxiv.org/format/2412.20937">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"> Generative AI Empowered Semantic Feature Multiple Access (SFMA) Over Wireless Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Wang%2C+J">Jiaxiang Wang</a>, <a href="/search/eess?searchtype=author&query=Yang%2C+Y">Yinchao Yang</a>, <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Huang%2C+C">Chongwen Huang</a>, <a href="/search/eess?searchtype=author&query=Chen%2C+M">Mingzhe Chen</a>, <a href="/search/eess?searchtype=author&query=Zhang%2C+Z">Zhaoyang Zhang</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="2412.20937v1-abstract-short" style="display: inline;"> This paper investigates a novel generative artificial intelligence (GAI) empowered multi-user semantic communication system called semantic feature multiple access (SFMA) for video transmission, which comprises a base station (BS) and paired users. The BS generates and combines semantic information of several frames simultaneously requested by paired users into a single signal. Users recover their… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.20937v1-abstract-full').style.display = 'inline'; document.getElementById('2412.20937v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.20937v1-abstract-full" style="display: none;"> This paper investigates a novel generative artificial intelligence (GAI) empowered multi-user semantic communication system called semantic feature multiple access (SFMA) for video transmission, which comprises a base station (BS) and paired users. The BS generates and combines semantic information of several frames simultaneously requested by paired users into a single signal. Users recover their frames from this combined signal and input the recovered frames into a GAI-based video frame interpolation model to generate the intermediate frame. To optimize transmission rates and temporal gaps between simultaneously transmitted frames, we formulate an optimization problem to maximize the system sum rate while minimizing temporal gaps. Since the standard signal-to-interference-plus-noise ratio (SINR) equation does not accurately capture the performance of our semantic communication system, we introduce a weight parameter into the SINR equation to better represent the system's performance. Due to its dependence on transmit power, we propose a three-step solution. First, we develop a user pairing algorithm that pairs two users with the highest preference value, a weighted combination of semantic transmission rate and temporal gap. Second, we optimize inter-group power allocation by formulating an optimization problem that allocates proper transmit power across all user groups to maximize system sum rates while satisfying each user's minimum rate requirement. Third, we address intra-group power allocation to enhance each user's performance. Simulation results demonstrate that our method improves transmission rates by up to 24.8%, 45.8%, and 66.1% compared to fixed-power non-orthogonal multiple access (F-NOMA), orthogonal joint source-channel coding (O-JSCC), and orthogonal frequency division multiple access (OFDMA), respectively. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.20937v1-abstract-full').style.display = 'none'; document.getElementById('2412.20937v1-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> 30 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2024. </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">13 pages, 11 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/2409.20472">arXiv:2409.20472</a> <span> [<a href="https://arxiv.org/pdf/2409.20472">pdf</a>, <a href="https://arxiv.org/format/2409.20472">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"> Fluid Antenna-Assisted Near-Field System </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Zhou%2C+J">Jingxuan Zhou</a>, <a href="/search/eess?searchtype=author&query=Yang%2C+Y">Yinchao Yang</a>, <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</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="2409.20472v1-abstract-short" style="display: inline;"> This paper proposes a fluid antenna (FA)-assisted near-field integrated sensing and communications (ISAC) system enabled by the extremely large-scale simultaneously transmitting and reflecting surface (XL-STARS). By optimizing the communication beamformer, the sensing signal covariance matrix, the XL-STARS phase shift, and the FA position vector, the Cram茅r-Rao bound (CRB), as a metric for sensing… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2409.20472v1-abstract-full').style.display = 'inline'; document.getElementById('2409.20472v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2409.20472v1-abstract-full" style="display: none;"> This paper proposes a fluid antenna (FA)-assisted near-field integrated sensing and communications (ISAC) system enabled by the extremely large-scale simultaneously transmitting and reflecting surface (XL-STARS). By optimizing the communication beamformer, the sensing signal covariance matrix, the XL-STARS phase shift, and the FA position vector, the Cram茅r-Rao bound (CRB), as a metric for sensing performance, is minimized while ensuring the standard communication performance. A double-loop iterative algorithm based on the penalty dual decomposition (PDD) and block coordinate descent (BCD) methods is proposed to solve the non-convex minimization problem by decomposing it into three subproblems and optimizing the coupling variables for each subproblem iteratively. Simulation results validate the superior performance of the proposed algorithm. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2409.20472v1-abstract-full').style.display = 'none'; document.getElementById('2409.20472v1-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> 30 September, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2409.20453">arXiv:2409.20453</a> <span> [<a href="https://arxiv.org/pdf/2409.20453">pdf</a>, <a href="https://arxiv.org/format/2409.20453">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"> E-Healthcare Systems: Integrated Sensing, Computing, and Semantic Communication with Physical Layer Security </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Yang%2C+Y">Yinchao Yang</a>, <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Yuan%2C+W">Weijie Yuan</a>, <a href="/search/eess?searchtype=author&query=Liu%2C+F">Fan Liu</a>, <a href="/search/eess?searchtype=author&query=Cao%2C+X">Xiaowen Cao</a>, <a href="/search/eess?searchtype=author&query=Huang%2C+C">Chongwen Huang</a>, <a href="/search/eess?searchtype=author&query=Zhang%2C+Z">Zhaoyang Zhang</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="2409.20453v1-abstract-short" style="display: inline;"> This paper introduces an integrated sensing, computing, and semantic communication (ISCSC) framework tailored for smart healthcare systems. The framework is evaluated in the context of smart healthcare, optimising the transmit beamforming matrix and semantic extraction ratio for improved data rates, sensing accuracy, and general data protection regulation (GDPR) compliance, while considering IoRT… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2409.20453v1-abstract-full').style.display = 'inline'; document.getElementById('2409.20453v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2409.20453v1-abstract-full" style="display: none;"> This paper introduces an integrated sensing, computing, and semantic communication (ISCSC) framework tailored for smart healthcare systems. The framework is evaluated in the context of smart healthcare, optimising the transmit beamforming matrix and semantic extraction ratio for improved data rates, sensing accuracy, and general data protection regulation (GDPR) compliance, while considering IoRT device computing capabilities. Semantic metrics such as semantic transmission rate and semantic secrecy rate are derived to evaluate data rate performance and GDPR risk, respectively, while the Cram茅r-Rao Bound (CRB) assesses sensing performance. Simulation results demonstrate the framework's effectiveness in ensuring reliable sensing, high data rates, and secure communication. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2409.20453v1-abstract-full').style.display = 'none'; document.getElementById('2409.20453v1-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> 30 September, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2024. </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">This paper has been accepted by GLOBECOM 2024</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2408.00248">arXiv:2408.00248</a> <span> [<a href="https://arxiv.org/pdf/2408.00248">pdf</a>, <a href="https://arxiv.org/format/2408.00248">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Systems and Control">eess.SY</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/JIOT.2024.3420774">10.1109/JIOT.2024.3420774 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Joint Vehicle Connection and Beamforming Optimization in Digital Twin Assisted Integrated Sensing and Communication Vehicular Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Ding%2C+W">Weihang Ding</a>, <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Chen%2C+M">Mingzhe Chen</a>, <a href="/search/eess?searchtype=author&query=Liu%2C+Y">Yuchen Liu</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="2408.00248v1-abstract-short" style="display: inline;"> This paper introduces an approach to harness digital twin (DT) technology in the realm of integrated sensing and communications (ISAC) in the sixth-generation (6G) Internet-of-everything (IoE) applications. We consider moving targets in a vehicular network and use DT to track and predict the motion of the vehicles. After predicting the location of the vehicle at the next time slot, the DT designs… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.00248v1-abstract-full').style.display = 'inline'; document.getElementById('2408.00248v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2408.00248v1-abstract-full" style="display: none;"> This paper introduces an approach to harness digital twin (DT) technology in the realm of integrated sensing and communications (ISAC) in the sixth-generation (6G) Internet-of-everything (IoE) applications. We consider moving targets in a vehicular network and use DT to track and predict the motion of the vehicles. After predicting the location of the vehicle at the next time slot, the DT designs the assignment and beamforming for each vehicle. The real time sensing information is then utilized to update and refine the DT, enabling further processing and decision-making. This model incorporates a dynamic Kalman gain, which is updated at each time slot based on the received echo signals. The state representation encompasses both vehicle motion information and the error matrix, with the posterior Cram茅r-Rao bound (PCRB) employed to assess sensing accuracy. We consider a network with two roadside units (RSUs), and the vehicles need to be allocated to one of them. To optimize the overall transmission rate while maintaining an acceptable sensing accuracy, an optimization problem is formulated. Since it is generally hard to solve the original problem, Lagrange multipliers and fractional programming are employed to simplify this optimization problem. To solve the simplified problem, this paper introduces both greedy and heuristic algorithms through optimizing both vehicle assignments and predictive beamforming. The optimized results are then transferred back to the real space for ISAC applications. Recognizing the computational complexity of the greedy and heuristic algorithms, a bidirectional long short-term memory (LSTM)-based recurrent neural network (RNN) is proposed for efficient beamforming design within the DT. Simulation results demonstrate the effectiveness of the DT-based ISAC network. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.00248v1-abstract-full').style.display = 'none'; document.getElementById('2408.00248v1-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> 31 July, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> IEEE Internet of Things Journal (2024) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2401.17108">arXiv:2401.17108</a> <span> [<a href="https://arxiv.org/pdf/2401.17108">pdf</a>, <a href="https://arxiv.org/format/2401.17108">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Joint Semantic Communication and Target Sensing for 6G Communication System </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Yang%2C+Y">Yinchao Yang</a>, <a href="/search/eess?searchtype=author&query=Shikh-Bahaei%2C+M">Mohammad Shikh-Bahaei</a>, <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Huang%2C+C">Chongwen Huang</a>, <a href="/search/eess?searchtype=author&query=Xu%2C+W">Wei Xu</a>, <a href="/search/eess?searchtype=author&query=Zhang%2C+Z">Zhaoyang Zhang</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="2401.17108v1-abstract-short" style="display: inline;"> This paper investigates the secure resource allocation for a downlink integrated sensing and communication system with multiple legal users and potential eavesdroppers. In the considered model, the base station (BS) simultaneously transmits sensing and communication signals through beamforming design, where the sensing signals can be viewed as artificial noise to enhance the security of communicat… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.17108v1-abstract-full').style.display = 'inline'; document.getElementById('2401.17108v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2401.17108v1-abstract-full" style="display: none;"> This paper investigates the secure resource allocation for a downlink integrated sensing and communication system with multiple legal users and potential eavesdroppers. In the considered model, the base station (BS) simultaneously transmits sensing and communication signals through beamforming design, where the sensing signals can be viewed as artificial noise to enhance the security of communication signals. To further enhance the security in the semantic layer, the semantic information is extracted from the original information before transmission. The user side can only successfully recover the received information with the help of the knowledge base shared with the BS, which is stored in advance. Our aim is to maximize the sum semantic secrecy rate of all users while maintaining the minimum quality of service for each user and guaranteeing overall sensing performance. To solve this sum semantic secrecy rate maximization problem, an iterative algorithm is proposed using the alternating optimization method. The simulation results demonstrate the superiority of the proposed algorithm in terms of secure semantic communication and reliable detection. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.17108v1-abstract-full').style.display = 'none'; document.getElementById('2401.17108v1-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> 30 January, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2401.05898">arXiv:2401.05898</a> <span> [<a href="https://arxiv.org/pdf/2401.05898">pdf</a>, <a href="https://arxiv.org/format/2401.05898">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Systems and Control">eess.SY</span> </div> </div> <p class="title is-5 mathjax"> A Partial Compress-and-Forward Strategy for Relay-assisted Wireless Networks Based on Rateless Coding </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Ding%2C+W">Weihang Ding</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="2401.05898v1-abstract-short" style="display: inline;"> In this work, we propose a novel partial compress-and-forward (PCF) scheme for improving the maximum achievable transmission rate of a diamond relay network with two noisy relays. PCF combines conventional compress-and-forward (CF) and amplify-and-forward (AF) protocols, enabling one relay to operate alternately in the CF or the AF mode, while the other relay works purely in the CF mode. As the di… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.05898v1-abstract-full').style.display = 'inline'; document.getElementById('2401.05898v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2401.05898v1-abstract-full" style="display: none;"> In this work, we propose a novel partial compress-and-forward (PCF) scheme for improving the maximum achievable transmission rate of a diamond relay network with two noisy relays. PCF combines conventional compress-and-forward (CF) and amplify-and-forward (AF) protocols, enabling one relay to operate alternately in the CF or the AF mode, while the other relay works purely in the CF mode. As the direct link from the source to the destination is unavailable, and there is no noiseless relay in the diamond network, messages received from both relays must act as side information for each other and must be decoded jointly. We propose a joint decoder to decode two Luby transform (LT) codes received from both relays corresponding to the same original message. Numerical results show that PCF can achieve significant performance improvements compared to decode-and-forward (DF) and pure CF protocols when at least the channels connected to one of the relays are of high quality. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.05898v1-abstract-full').style.display = 'none'; document.getElementById('2401.05898v1-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> 11 January, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2305.02962">arXiv:2305.02962</a> <span> [<a href="https://arxiv.org/pdf/2305.02962">pdf</a>, <a href="https://arxiv.org/ps/2305.02962">ps</a>, <a href="https://arxiv.org/format/2305.02962">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Systems and Control">eess.SY</span> </div> </div> <p class="title is-5 mathjax"> An Efficient Relay Selection Scheme for Relay-assisted HARQ </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Ding%2C+W">Weihang Ding</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="2305.02962v1-abstract-short" style="display: inline;"> In wireless communication networks, relays are required when the quality of the direct link between the source and the destination is not high enough to support reliable transmission because of long distances or obstacles. Selecting the proper relay node (RN) to support hybrid automatic repeat request (HARQ) is of great importance in such a relay-assisted network. Different from previous works, wh… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2305.02962v1-abstract-full').style.display = 'inline'; document.getElementById('2305.02962v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2305.02962v1-abstract-full" style="display: none;"> In wireless communication networks, relays are required when the quality of the direct link between the source and the destination is not high enough to support reliable transmission because of long distances or obstacles. Selecting the proper relay node (RN) to support hybrid automatic repeat request (HARQ) is of great importance in such a relay-assisted network. Different from previous works, whether to participate in the transmission is determined by each RN itself in this work, thus reducing the overhead. As RNs do not need to obtain channel state information about the whole network, there is no significant overhead in the system. Using the numbers of transmission attempts required by both channels calculated from the obtained channel state information, each RN sets a timer and forwards the packet when time-out occurs. Simulation results show that our proposed method significantly improves the performance of the system. When the channels are of relatively high quality, the performance of our method is close to the optimal relay selection which requires full information about the network. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2305.02962v1-abstract-full').style.display = 'none'; document.getElementById('2305.02962v1-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> 4 May, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2023. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2305.02948">arXiv:2305.02948</a> <span> [<a href="https://arxiv.org/pdf/2305.02948">pdf</a>, <a href="https://arxiv.org/ps/2305.02948">ps</a>, <a href="https://arxiv.org/format/2305.02948">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Systems and Control">eess.SY</span> </div> </div> <p class="title is-5 mathjax"> HARQ Delay Minimization of 5G Wireless Network with Imperfect Feedback </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Ding%2C+W">Weihang Ding</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="2305.02948v1-abstract-short" style="display: inline;"> 5G new radio (NR) technology is introduced to satisfy more demanding services. Ultra-Reliable Low Latency Communication (URLLC) requires very low delay compared with the previous techniques. This is hard to achieve when hybrid automatic repeat request (HARQ) is applied and especially when the feedback channel is erroneous. In this work, we consider various delay components in incremental redundanc… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2305.02948v1-abstract-full').style.display = 'inline'; document.getElementById('2305.02948v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2305.02948v1-abstract-full" style="display: none;"> 5G new radio (NR) technology is introduced to satisfy more demanding services. Ultra-Reliable Low Latency Communication (URLLC) requires very low delay compared with the previous techniques. This is hard to achieve when hybrid automatic repeat request (HARQ) is applied and especially when the feedback channel is erroneous. In this work, we consider various delay components in incremental redundancy (IR) HARQ systems and minimize the average delay by applying asymmetric feedback detection (AFD) and find the optimal transmission length for each transmission attempt. A M/G/1 queuing model is used in this work to analyze the queuing delay in 5G NR when there are multiple uses in the system. Numerical results show that significant performance gains and lower outage probability can be achieved by applying AFD. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2305.02948v1-abstract-full').style.display = 'none'; document.getElementById('2305.02948v1-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> 4 May, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2023. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2103.13791">arXiv:2103.13791</a> <span> [<a href="https://arxiv.org/pdf/2103.13791">pdf</a>, <a href="https://arxiv.org/format/2103.13791">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"> AoA-Based Pilot Assignment in Massive MIMO Systems Using Deep Reinforcement Learning </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Omid%2C+Y">Yasaman Omid</a>, <a href="/search/eess?searchtype=author&query=Hosseini%2C+S+M">Seyed MohammadReza Hosseini</a>, <a href="/search/eess?searchtype=author&query=Shahabi%2C+S+M">Seyyed MohammadMahdi Shahabi</a>, <a href="/search/eess?searchtype=author&query=Shikh-Bahaei%2C+M">Mohammad Shikh-Bahaei</a>, <a href="/search/eess?searchtype=author&query=Nallanathan%2C+A">Arumugam Nallanathan</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="2103.13791v1-abstract-short" style="display: inline;"> In this paper, the problem of pilot contamination in a multi-cell massive multiple input multiple output (M-MIMO) system is addressed using deep reinforcement learning (DRL). To this end, a pilot assignment strategy is designed that adapts to the channel variations while maintaining a tolerable pilot contamination effect. Using the angle of arrival (AoA) information of the users, a cost function,… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2103.13791v1-abstract-full').style.display = 'inline'; document.getElementById('2103.13791v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2103.13791v1-abstract-full" style="display: none;"> In this paper, the problem of pilot contamination in a multi-cell massive multiple input multiple output (M-MIMO) system is addressed using deep reinforcement learning (DRL). To this end, a pilot assignment strategy is designed that adapts to the channel variations while maintaining a tolerable pilot contamination effect. Using the angle of arrival (AoA) information of the users, a cost function, portraying the reward, is presented, defining the pilot contamination effects in the system. Numerical results illustrate that the DRL-based scheme is able to track the changes in the environment, learn the near-optimal pilot assignment, and achieve a close performance to that of the optimum pilot assignment performed by exhaustive search, while maintaining a low computational complexity. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2103.13791v1-abstract-full').style.display = 'none'; document.getElementById('2103.13791v1-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> 25 March, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2021. </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">submitted to IEEE Communication Letters</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2009.11560">arXiv:2009.11560</a> <span> [<a href="https://arxiv.org/pdf/2009.11560">pdf</a>, <a href="https://arxiv.org/ps/2009.11560">ps</a>, <a href="https://arxiv.org/format/2009.11560">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"> Beamforming Design for Multiuser Transmission Through Reconfigurable Intelligent Surface </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Xu%2C+W">Wei Xu</a>, <a href="/search/eess?searchtype=author&query=Huang%2C+C">Chongwen Huang</a>, <a href="/search/eess?searchtype=author&query=Shi%2C+J">Jianfeng Shi</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="2009.11560v1-abstract-short" style="display: inline;"> This paper investigates the problem of resource allocation for multiuser communication networks with a reconfigurable intelligent surface (RIS)-assisted wireless transmitter. In this network, the sum transmit power of the network is minimized by controlling the phase beamforming of the RIS and transmit power of the BS. This problem is posed as a joint optimization problem of transmit power and RIS… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2009.11560v1-abstract-full').style.display = 'inline'; document.getElementById('2009.11560v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2009.11560v1-abstract-full" style="display: none;"> This paper investigates the problem of resource allocation for multiuser communication networks with a reconfigurable intelligent surface (RIS)-assisted wireless transmitter. In this network, the sum transmit power of the network is minimized by controlling the phase beamforming of the RIS and transmit power of the BS. This problem is posed as a joint optimization problem of transmit power and RIS control, whose goal is to minimize the sum transmit power under signal-to-interference-plus-noise ratio (SINR) constraints of the users. To solve this problem, a dual method is proposed, where the dual problem is obtained as a semidefinite programming problem. After solving the dual problem, the phase beamforming of the RIS is obtained in the closed form, while the optimal transmit power is obtained by using the standard interference function. Simulation results show that the proposed scheme can reduce up to 94% and 27% sum transmit power compared to the maximum ratio transmission (MRT) beamforming and zero-forcing (ZF) beamforming techniques, respectively. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2009.11560v1-abstract-full').style.display = 'none'; document.getElementById('2009.11560v1-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> 24 September, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 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">RIS as transmitter for multiuser transmission, accepted in IEEE Transactions on Communications</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2007.03462">arXiv:2007.03462</a> <span> [<a href="https://arxiv.org/pdf/2007.03462">pdf</a>, <a href="https://arxiv.org/ps/2007.03462">ps</a>, <a href="https://arxiv.org/format/2007.03462">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="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> Delay Minimization for Federated Learning Over Wireless Communication Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Chen%2C+M">Mingzhe Chen</a>, <a href="/search/eess?searchtype=author&query=Saad%2C+W">Walid Saad</a>, <a href="/search/eess?searchtype=author&query=Hong%2C+C+S">Choong Seon Hong</a>, <a href="/search/eess?searchtype=author&query=Shikh-Bahaei%2C+M">Mohammad Shikh-Bahaei</a>, <a href="/search/eess?searchtype=author&query=Poor%2C+H+V">H. Vincent Poor</a>, <a href="/search/eess?searchtype=author&query=Cui%2C+S">Shuguang Cui</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="2007.03462v1-abstract-short" style="display: inline;"> In this paper, the problem of delay minimization for federated learning (FL) over wireless communication networks is investigated. In the considered model, each user exploits limited local computational resources to train a local FL model with its collected data and, then, sends the trained FL model parameters to a base station (BS) which aggregates the local FL models and broadcasts the aggregate… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2007.03462v1-abstract-full').style.display = 'inline'; document.getElementById('2007.03462v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2007.03462v1-abstract-full" style="display: none;"> In this paper, the problem of delay minimization for federated learning (FL) over wireless communication networks is investigated. In the considered model, each user exploits limited local computational resources to train a local FL model with its collected data and, then, sends the trained FL model parameters to a base station (BS) which aggregates the local FL models and broadcasts the aggregated FL model back to all the users. Since FL involves learning model exchanges between the users and the BS, both computation and communication latencies are determined by the required learning accuracy level, which affects the convergence rate of the FL algorithm. This joint learning and communication problem is formulated as a delay minimization problem, where it is proved that the objective function is a convex function of the learning accuracy. Then, a bisection search algorithm is proposed to obtain the optimal solution. Simulation results show that the proposed algorithm can reduce delay by up to 27.3% compared to conventional FL methods. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2007.03462v1-abstract-full').style.display = 'none'; document.getElementById('2007.03462v1-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> 5 July, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 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">arXiv admin note: substantial text overlap with arXiv:1911.02417</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2006.02555">arXiv:2006.02555</a> <span> [<a href="https://arxiv.org/pdf/2006.02555">pdf</a>, <a href="https://arxiv.org/format/2006.02555">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"> Cooperative Rate-Splitting for Secrecy Sum-Rate Enhancement in Multi-antenna Broadcast Channels </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Li%2C+P">Ping Li</a>, <a href="/search/eess?searchtype=author&query=Chen%2C+M">Ming Chen</a>, <a href="/search/eess?searchtype=author&query=Mao%2C+Y">Yijie Mao</a>, <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Clerckx%2C+B">Bruno Clerckx</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="2006.02555v1-abstract-short" style="display: inline;"> In this paper, we employ Cooperative Rate-Splitting (CRS) technique to enhance the Secrecy Sum Rate (SSR) for the Multiple Input Single Output (MISO) Broadcast Channel (BC), consisting of two legitimate users and one eavesdropper, with perfect Channel State Information (CSI) available at all nodes. For CRS based on the three-node relay channel, the transmitter splits and encodes the messages of le… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.02555v1-abstract-full').style.display = 'inline'; document.getElementById('2006.02555v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2006.02555v1-abstract-full" style="display: none;"> In this paper, we employ Cooperative Rate-Splitting (CRS) technique to enhance the Secrecy Sum Rate (SSR) for the Multiple Input Single Output (MISO) Broadcast Channel (BC), consisting of two legitimate users and one eavesdropper, with perfect Channel State Information (CSI) available at all nodes. For CRS based on the three-node relay channel, the transmitter splits and encodes the messages of legitimate users into common and private streams based on Rate-Splitting (RS). With the goal of maximizing SSR, the proposed CRS strategy opportunistically asks the relaying legitimate user to forward its decoded common message. During the transmission, the eavesdropper keeps wiretapping silently. To ensure secure transmission, the common message is used for the dual purpose, serving both as a desired message and Artificial Noise (AN) without consuming extra transmit power comparing to the conventional AN design. Taking into account the total power constraint and the Physical Layer (PHY) security, the precoders and time-slot allocation are jointly optimized by solving the non-convex SSR maximization problem based on Sequential Convex Approximation (SCA) algorithm. Numerical results show that the proposed CRS secure transmission scheme outperforms existing Multi-User Linear Precoding (MU-LP) and Cooperative Non-Orthogonal Multiple Access (C-NOMA) strategies. Therefore, CRS is a promising strategy to enhance the PHY security in multi-antenna BC systems. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.02555v1-abstract-full').style.display = 'none'; document.getElementById('2006.02555v1-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 June, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2005.10559">arXiv:2005.10559</a> <span> [<a href="https://arxiv.org/pdf/2005.10559">pdf</a>, <a href="https://arxiv.org/format/2005.10559">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"> Reflections in the Sky: Joint Trajectory and Passive Beamforming Design for Secure UAV Networks with Reconfigurable Intelligent Surface </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Long%2C+H">Hui Long</a>, <a href="/search/eess?searchtype=author&query=Chen%2C+M">Ming Chen</a>, <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Wang%2C+B">Bao Wang</a>, <a href="/search/eess?searchtype=author&query=Li%2C+Z">Zhiyang Li</a>, <a href="/search/eess?searchtype=author&query=Yun%2C+X">Xu Yun</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="2005.10559v2-abstract-short" style="display: inline;"> This paper investigates the problem of secure energy efficiency maximization for a reconfigurable intelligent surface (RIS) assisted uplink wireless communication system, where an unmanned aerial vehicle (UAV) equipped with an RIS works as a mobile relay between the base station (BS) and a group of users. We focus on maximizing the secure energy efficiency of the system via jointly optimizing the… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2005.10559v2-abstract-full').style.display = 'inline'; document.getElementById('2005.10559v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2005.10559v2-abstract-full" style="display: none;"> This paper investigates the problem of secure energy efficiency maximization for a reconfigurable intelligent surface (RIS) assisted uplink wireless communication system, where an unmanned aerial vehicle (UAV) equipped with an RIS works as a mobile relay between the base station (BS) and a group of users. We focus on maximizing the secure energy efficiency of the system via jointly optimizing the UAV's trajectory, the RIS's phase shift, users' association and transmit power. To tackle this problem, we divide the original problem into three sub-problems, and propose an efficient iterative algorithm. In particular, the successive convex approximation method (SCA) is applied to solve the nonconvex UAV trajectory, the RIS's phase shift, and transmit power optimization sub-problems. We further provide two schemes to simplify the solution of phase and trajectory sub-problem. Simulation results demonstrate that the proposed algorithm converges fast, and the proposed design can enhance the secure energy efficiency by up to 38\% gains, as compared to the traditional schemes without any RIS. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2005.10559v2-abstract-full').style.display = 'none'; document.getElementById('2005.10559v2-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> 5 June, 2020; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 21 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/2005.00269">arXiv:2005.00269</a> <span> [<a href="https://arxiv.org/pdf/2005.00269">pdf</a>, <a href="https://arxiv.org/ps/2005.00269">ps</a>, <a href="https://arxiv.org/format/2005.00269">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"> Energy-Efficient Wireless Communications with Distributed Reconfigurable Intelligent Surfaces </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Chen%2C+M">Mingzhe Chen</a>, <a href="/search/eess?searchtype=author&query=Saad%2C+W">Walid Saad</a>, <a href="/search/eess?searchtype=author&query=Xu%2C+W">Wei Xu</a>, <a href="/search/eess?searchtype=author&query=Shikh-Bahaei%2C+M">Mohammad Shikh-Bahaei</a>, <a href="/search/eess?searchtype=author&query=Poor%2C+H+V">H. Vincent Poor</a>, <a href="/search/eess?searchtype=author&query=Cui%2C+S">Shuguang Cui</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.00269v1-abstract-short" style="display: inline;"> This paper investigates the problem of resource allocation for a wireless communication network with distributed reconfigurable intelligent surfaces (RISs). In this network, multiple RISs are spatially distributed to serve wireless users and the energy efficiency of the network is maximized by dynamically controlling the on-off status of each RIS as well as optimizing the reflection coefficients m… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2005.00269v1-abstract-full').style.display = 'inline'; document.getElementById('2005.00269v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2005.00269v1-abstract-full" style="display: none;"> This paper investigates the problem of resource allocation for a wireless communication network with distributed reconfigurable intelligent surfaces (RISs). In this network, multiple RISs are spatially distributed to serve wireless users and the energy efficiency of the network is maximized by dynamically controlling the on-off status of each RIS as well as optimizing the reflection coefficients matrix of the RISs. This problem is posed as a joint optimization problem of transmit beamforming and RIS control, whose goal is to maximize the energy efficiency under minimum rate constraints of the users. To solve this problem, two iterative algorithms are proposed for the single-user case and multi-user case. For the single-user case, the phase optimization problem is solved by using a successive convex approximation method, which admits a closed-form solution at each step. Moreover, the optimal RIS on-off status is obtained by using the dual method. For the multi-user case, a low-complexity greedy searching method is proposed to solve the RIS on-off optimization problem. Simulation results show that the proposed scheme achieves up to 33\% and 68\% gains in terms of the energy efficiency in both single-user and multi-user cases compared to the conventional RIS scheme and amplify-and-forward relay scheme, respectively. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2005.00269v1-abstract-full').style.display = 'none'; document.getElementById('2005.00269v1-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/2003.02631">arXiv:2003.02631</a> <span> [<a href="https://arxiv.org/pdf/2003.02631">pdf</a>, <a href="https://arxiv.org/format/2003.02631">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="Machine Learning">cs.LG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">stat.ML</span> </div> </div> <p class="title is-5 mathjax"> Machine Learning for Predictive Deployment of UAVs with Multiple Access </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Lu%2C+L">Linyan Lu</a>, <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Chen%2C+M">Mingzhe Chen</a>, <a href="/search/eess?searchtype=author&query=Zang%2C+Z">Zelin Zang</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="2003.02631v2-abstract-short" style="display: inline;"> In this paper, a machine learning based deployment framework of unmanned aerial vehicles (UAVs) is studied. In the considered model, UAVs are deployed as flying base stations (BS) to offload heavy traffic from ground BSs. Due to time-varying traffic distribution, a long short-term memory (LSTM) based prediction algorithm is introduced to predict the future cellular traffic. To predict the user ser… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2003.02631v2-abstract-full').style.display = 'inline'; document.getElementById('2003.02631v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2003.02631v2-abstract-full" style="display: none;"> In this paper, a machine learning based deployment framework of unmanned aerial vehicles (UAVs) is studied. In the considered model, UAVs are deployed as flying base stations (BS) to offload heavy traffic from ground BSs. Due to time-varying traffic distribution, a long short-term memory (LSTM) based prediction algorithm is introduced to predict the future cellular traffic. To predict the user service distribution, a KEG algorithm, which is a joint K-means and expectation maximization (EM) algorithm based on Gaussian mixture model (GMM), is proposed for determining the service area of each UAV. Based on the predicted traffic, the optimal UAV positions are derived and three multi-access techniques are compared so as to minimize the total transmit power. Simulation results show that the proposed method can reduce up to 24\% of the total power consumption compared to the conventional method without traffic prediction. Besides, rate splitting multiple access (RSMA) has the lower required transmit power compared to frequency domain multiple access (FDMA) and time domain multiple access (TDMA). <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2003.02631v2-abstract-full').style.display = 'none'; document.getElementById('2003.02631v2-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> 30 July, 2020; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 1 March, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2002.03381">arXiv:2002.03381</a> <span> [<a href="https://arxiv.org/pdf/2002.03381">pdf</a>, <a href="https://arxiv.org/ps/2002.03381">ps</a>, <a href="https://arxiv.org/format/2002.03381">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="Systems and Control">eess.SY</span> </div> </div> <p class="title is-5 mathjax"> Resource Allocation for UAV Assisted Wireless Networks with QoS Constraints </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Ding%2C+W">Weihang Ding</a>, <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Chen%2C+M">Mingzhe Chen</a>, <a href="/search/eess?searchtype=author&query=Hou%2C+J">Jiancao Hou</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="2002.03381v1-abstract-short" style="display: inline;"> For crowded and hotspot area, unmanned aerial vehicles (UAVs) are usually deployed to increase the coverage rate. In the considered model, there are three types of services for UAV assisted communication: control message, non-realtime communication, and real-time communication, which can cover most of the actual demands of users in a UAV assisted communication system. A bandwidth allocation proble… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2002.03381v1-abstract-full').style.display = 'inline'; document.getElementById('2002.03381v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2002.03381v1-abstract-full" style="display: none;"> For crowded and hotspot area, unmanned aerial vehicles (UAVs) are usually deployed to increase the coverage rate. In the considered model, there are three types of services for UAV assisted communication: control message, non-realtime communication, and real-time communication, which can cover most of the actual demands of users in a UAV assisted communication system. A bandwidth allocation problem is considered to minimize the total energy consumption of this system while satisfying the requirements. Two techniques are introduced to enhance the performance of the system. The first method is to categorize the ground users into multiple user groups and offer each group a unique RF channel with different bandwidth. The second method is to deploy more than one UAVs in the system. Bandwidth optimization in each scheme is proved to be a convex problem. Simulation results show the superiority of the proposed schemes in terms of energy consumption. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2002.03381v1-abstract-full').style.display = 'none'; document.getElementById('2002.03381v1-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> 9 February, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 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">Submitted to IEEE WCNC 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/2001.03952">arXiv:2001.03952</a> <span> [<a href="https://arxiv.org/pdf/2001.03952">pdf</a>, <a href="https://arxiv.org/format/2001.03952">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="Machine Learning">cs.LG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">stat.ML</span> </div> </div> <p class="title is-5 mathjax"> Channel Assignment in Uplink Wireless Communication using Machine Learning Approach </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Jia%2C+G">Guangyu Jia</a>, <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Lam%2C+H">Hak-Keung Lam</a>, <a href="/search/eess?searchtype=author&query=Shi%2C+J">Jianfeng Shi</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="2001.03952v1-abstract-short" style="display: inline;"> This letter investigates a channel assignment problem in uplink wireless communication systems. Our goal is to maximize the sum rate of all users subject to integer channel assignment constraints. A convex optimization based algorithm is provided to obtain the optimal channel assignment, where the closed-form solution is obtained in each step. Due to high computational complexity in the convex opt… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2001.03952v1-abstract-full').style.display = 'inline'; document.getElementById('2001.03952v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2001.03952v1-abstract-full" style="display: none;"> This letter investigates a channel assignment problem in uplink wireless communication systems. Our goal is to maximize the sum rate of all users subject to integer channel assignment constraints. A convex optimization based algorithm is provided to obtain the optimal channel assignment, where the closed-form solution is obtained in each step. Due to high computational complexity in the convex optimization based algorithm, machine learning approaches are employed to obtain computational efficient solutions. More specifically, the data are generated by using convex optimization based algorithm and the original problem is converted to a regression problem which is addressed by the integration of convolutional neural networks (CNNs), feed-forward neural networks (FNNs), random forest and gated recurrent unit networks (GRUs). The results demonstrate that the machine learning method largely reduces the computation time with slightly compromising of prediction accuracy. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2001.03952v1-abstract-full').style.display = 'none'; document.getElementById('2001.03952v1-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> 12 January, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1912.07112">arXiv:1912.07112</a> <span> [<a href="https://arxiv.org/pdf/1912.07112">pdf</a>, <a href="https://arxiv.org/ps/1912.07112">ps</a>, <a href="https://arxiv.org/format/1912.07112">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Joint Beamforming, User Association, and Height Control for Cellular-Enabled UAV Communications </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Hou%2C+J">Jiancao Hou</a>, <a href="/search/eess?searchtype=author&query=Deng%2C+Y">Yansha Deng</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="1912.07112v2-abstract-short" style="display: inline;"> Supporting reliable and seamless mobility for aerial users, such as unmanned aerial vehicles (UAVs), is a key challenge for the next-generation cellular systems. To tackle this challenge, we propose a joint beamforming, user association, and UAV-height control framework for cellular-connected multi-UAV networks with multiple antenna base stations (BSs). With the aim of maximizing the minimum achie… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1912.07112v2-abstract-full').style.display = 'inline'; document.getElementById('1912.07112v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1912.07112v2-abstract-full" style="display: none;"> Supporting reliable and seamless mobility for aerial users, such as unmanned aerial vehicles (UAVs), is a key challenge for the next-generation cellular systems. To tackle this challenge, we propose a joint beamforming, user association, and UAV-height control framework for cellular-connected multi-UAV networks with multiple antenna base stations (BSs). With the aim of maximizing the minimum achievable rate for UAVs subject to co-existed terrestrial user equipment's rate constraints, we devise a hierarchical bi-layer iterative algorithm to optimize BSs' beamforming vectors, UAV association matrix, and the height of UAVs jointly. With the aid of projection gradient method in inner layer iteration and geometric program modelling plus convex-concave procedure in outer layer iteration, our proposed algorithm is proved to converge to a local optimum. Taking mobility characteristics of UAVs into account, we also exploit our proposed algorithm for imperfect channel estimation scenario. Numerical results show that our proposed algorithm can achieve improved UAVs' minimum achievable rate compared with that of the conventional nearest association of UAVs for both perfect and imperfect channel estimation scenarios. Moreover, we also examine the trade-off between the UAVs' minimum achievable rate and the frequency for updating optimization variables with single moving UAV. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1912.07112v2-abstract-full').style.display = 'none'; document.getElementById('1912.07112v2-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> 16 February, 2020; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 15 December, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 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">30 pages, 8 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/1911.00351">arXiv:1911.00351</a> <span> [<a href="https://arxiv.org/pdf/1911.00351">pdf</a>, <a href="https://arxiv.org/ps/1911.00351">ps</a>, <a href="https://arxiv.org/format/1911.00351">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 UAV Communication with Energy Harvesting </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Xu%2C+W">Wei Xu</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="1911.00351v2-abstract-short" style="display: inline;"> This paper investigates an unmanned aerial vehicle (UAV)-enabled wireless communication system with energy harvesting, where the UAV transfers energy to the users in half duplex or full duplex, and the users harvest energy for data transmission to the UAV. We minimize the total energy consumption of the UAV while accomplishing the minimal data transmission requests of the users. The original optim… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1911.00351v2-abstract-full').style.display = 'inline'; document.getElementById('1911.00351v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1911.00351v2-abstract-full" style="display: none;"> This paper investigates an unmanned aerial vehicle (UAV)-enabled wireless communication system with energy harvesting, where the UAV transfers energy to the users in half duplex or full duplex, and the users harvest energy for data transmission to the UAV. We minimize the total energy consumption of the UAV while accomplishing the minimal data transmission requests of the users. The original optimization problem is decomposed into two subproblems: path planning subproblem and energy minimization subproblem with fixed path planning. For path planning subproblem, the optimal visiting order is obtained by using the dual method and the trajectory is optimized via the successive convex approximation technique. For energy minimization subproblem with fixed path planning, we firstly obtain the optimal portion of data transmission time within the entire procedure and the optimal transmission power of each user. Then, the the energy minimization subproblem is greatly simplified and it is efficiently solved via a one-dimensional search method. Simulation results are illustrated to verify the theoretical findings. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1911.00351v2-abstract-full').style.display = 'none'; document.getElementById('1911.00351v2-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> 24 December, 2019; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 1 November, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 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">14 pages, 10 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/1909.03919">arXiv:1909.03919</a> <span> [<a href="https://arxiv.org/pdf/1909.03919">pdf</a>, <a href="https://arxiv.org/format/1909.03919">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Collision Avoidance in V2X Communication Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Zang%2C+J">Junwei Zang</a>, <a href="/search/eess?searchtype=author&query=Towhidlou%2C+V">Vahid Towhidlou</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="1909.03919v1-abstract-short" style="display: inline;"> In this paper we investigate collision detection and avoidance in a vehicular network of full duplex (FD) operating nodes. Each vehicle in this network senses the energy level of the channel before and during its transmission. The measured energy is compared against a dynamic threshold which is preset based on the target detection probability, transmitter's power, sensing time and self-interferenc… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1909.03919v1-abstract-full').style.display = 'inline'; document.getElementById('1909.03919v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1909.03919v1-abstract-full" style="display: none;"> In this paper we investigate collision detection and avoidance in a vehicular network of full duplex (FD) operating nodes. Each vehicle in this network senses the energy level of the channel before and during its transmission. The measured energy is compared against a dynamic threshold which is preset based on the target detection probability, transmitter's power, sensing time and self-interference cancellation (SIC) capability of the vehicles' on board units (OBU). Probabilities of detection and false alarm, detection threshold before and during transmission, and effect of residual self interference (SI) on these metrics have been formulated. It is shown that the proposed scheme would experience a shorter collision duration. Meanwhile, it also requires a minimum SIC capability for acceptable operation, below which, system throughput would be poor due to high false alarm probability. Numerical simulations verify the accuracy of our analysis. They also illustrate that the proposed model perform better than the fixed threshold strategy. A trade-off between half duplex (HD) and FD has been found and the scheme would be applicable even if SIC capability of OBUs is relatively poor, with no need for complicated and expensive devices for future vehicular communication. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1909.03919v1-abstract-full').style.display = 'none'; document.getElementById('1909.03919v1-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> 9 September, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 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">This paper is accepted on WCNC 2019, Workshop on Smart Spectrum Marrakech, Morocco, Apr. 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/1908.04689">arXiv:1908.04689</a> <span> [<a href="https://arxiv.org/pdf/1908.04689">pdf</a>, <a href="https://arxiv.org/ps/1908.04689">ps</a>, <a href="https://arxiv.org/format/1908.04689">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Theory">cs.IT</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Signal Processing">eess.SP</span> </div> </div> <p class="title is-5 mathjax"> Efficient Resource Allocation for Mobile-Edge Computing Networks with NOMA: Completion Time and Energy Minimization </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Pan%2C+C">Cunhua Pan</a>, <a href="/search/eess?searchtype=author&query=Hou%2C+J">Jiancao Hou</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="1908.04689v1-abstract-short" style="display: inline;"> This paper investigates an uplink non-orthogonal multiple access (NOMA)-based mobile-edge computing (MEC) network. Our objective is to minimize a linear combination of the completion time of all users' tasks and the total energy consumption of all users including transmission energy and local computation energy subject to computation latency, uploading data rate, time sharing and edge cloud capaci… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1908.04689v1-abstract-full').style.display = 'inline'; document.getElementById('1908.04689v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1908.04689v1-abstract-full" style="display: none;"> This paper investigates an uplink non-orthogonal multiple access (NOMA)-based mobile-edge computing (MEC) network. Our objective is to minimize a linear combination of the completion time of all users' tasks and the total energy consumption of all users including transmission energy and local computation energy subject to computation latency, uploading data rate, time sharing and edge cloud capacity constraints. This work can significantly improve the energy efficiency and end-to-end delay of the applications in future wireless networks. For the general minimization problem, it is first transformed into an equivalent form. Then, an iterative algorithm is accordingly proposed, where closed-form solution is obtained in each step. For the special case with only minimizing the completion time, we propose a bisection-based algorithm to obtain the optimal solution. Also for the special case with infinite cloud capacity, we show that the original minimization problem can be transformed into an equivalent convex one. Numerical results show the superiority of the proposed algorithms compared with conventional algorithms in terms of completion time and energy consumption. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1908.04689v1-abstract-full').style.display = 'none'; document.getElementById('1908.04689v1-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> 12 August, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 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">30 pages, 9 figures. arXiv admin note: text overlap with arXiv:1809.01084</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1904.06222">arXiv:1904.06222</a> <span> [<a href="https://arxiv.org/pdf/1904.06222">pdf</a>, <a href="https://arxiv.org/format/1904.06222">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 Neural Network Prediction Based Adaptive Mode Selection Scheme in Full-Duplex Cognitive Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Zhang%2C+Y">Yirun Zhang</a>, <a href="/search/eess?searchtype=author&query=Wu%2C+Q">Qirui Wu</a>, <a href="/search/eess?searchtype=author&query=Hou%2C+J">Jiancao Hou</a>, <a href="/search/eess?searchtype=author&query=Towhidlou%2C+V">Vahid Towhidlou</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="1904.06222v1-abstract-short" style="display: inline;"> We propose a neural network (NN) predictor and an adaptive mode selection scheme for the purpose of both improving secondary user's (SU's) throughput and reducing collision probability to the primary user (PU) in full-duplex (FD) cognitive networks. SUs can adaptively switch between FD transmission-and-reception (TR) and transmission-and-sensing (TS) modes based on the NN prediction results for ea… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1904.06222v1-abstract-full').style.display = 'inline'; document.getElementById('1904.06222v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1904.06222v1-abstract-full" style="display: none;"> We propose a neural network (NN) predictor and an adaptive mode selection scheme for the purpose of both improving secondary user's (SU's) throughput and reducing collision probability to the primary user (PU) in full-duplex (FD) cognitive networks. SUs can adaptively switch between FD transmission-and-reception (TR) and transmission-and-sensing (TS) modes based on the NN prediction results for each transmission duration. The prediction performance is then analysed in terms of prediction error probability. We also compare the performance of our proposed scheme with conventional TR and TS modes in terms of SUs average throughput and collision probability, respectively. Simulation results show that our proposed scheme achieves even better SUs average throughput compared with TR mode. Meanwhile, the collision probability can be reduced close to the level of TS mode. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1904.06222v1-abstract-full').style.display = 'none'; document.getElementById('1904.06222v1-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> 12 April, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 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">7 pages, 6 figures, conference</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1903.08068">arXiv:1903.08068</a> <span> [<a href="https://arxiv.org/pdf/1903.08068">pdf</a>, <a href="https://arxiv.org/ps/1903.08068">ps</a>, <a href="https://arxiv.org/format/1903.08068">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"> Optimization of Rate Allocation and Power Control for Rate Splitting Multiple Access (RSMA) </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Chen%2C+M">Mingzhe Chen</a>, <a href="/search/eess?searchtype=author&query=Saad%2C+W">Walid Saad</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="1903.08068v1-abstract-short" style="display: inline;"> In this paper, the sum-rate maximization problem is studied for wireless networks that use downlink rate splitting multiple access (RSMA). In the considered model, each base station (BS) divides the messages that must be transmitted to its users into a `private' part and a `common' part. Here, the common message is a message that all users want to receive and the private message is a message that… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1903.08068v1-abstract-full').style.display = 'inline'; document.getElementById('1903.08068v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1903.08068v1-abstract-full" style="display: none;"> In this paper, the sum-rate maximization problem is studied for wireless networks that use downlink rate splitting multiple access (RSMA). In the considered model, each base station (BS) divides the messages that must be transmitted to its users into a `private' part and a `common' part. Here, the common message is a message that all users want to receive and the private message is a message that is dedicated to only a specific user. The RSMA mechanism enables a BS to adjust the split of common and private messages so as to control the interference by decoding and treating interference as noise and, thus optimizing the data rate of users. To maximize the users' sum-rate, the network can determine the rate allocation for the common message to meet the rate demand, and adjust the transmit power for the private message to reduce the interference. This problem is formulated as an optimization problem whose goal is to maximize the sum-rate of all users. To solve this nonconvex maximization problem, the optimal power used for transmitting the private message to the users is first obtained in closed form for a given rate allocation and common message power. Based on the optimal private message transmission power, the optimal rate allocation is then derived under a fixed common message transmission power. Subsequently, a one-dimensional search algorithm is proposed to obtain the optimal solution of common message transmission power. Simulation results show that the RSMA can achieve up to 15.6\% and 21.5\% gains in terms of data rate compared to non-orthogonal multiple access (NOMA) and orthogonal frequency-division multiple access (OFDMA), respectively. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1903.08068v1-abstract-full').style.display = 'none'; document.getElementById('1903.08068v1-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 March, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2019. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1902.03003">arXiv:1902.03003</a> <span> [<a href="https://arxiv.org/pdf/1902.03003">pdf</a>, <a href="https://arxiv.org/ps/1902.03003">ps</a>, <a href="https://arxiv.org/format/1902.03003">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"> Joint Time-Frequency Splitting for Multiuser SWIPT OFDM Networks </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Xu%2C+W">Wei Xu</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="1902.03003v1-abstract-short" style="display: inline;"> In this paper, we propose a joint time-frequency splitting (TFS) strategy for a multiuser orthogonal frequency division multiplexing (OFDM) system with simultaneous wireless information and power transfer (SWIPT). In TFS, the time sharing factors for each user on different subcarriers are optimized via maximizing the sum rate of users with both information and energy quality of service (QoS) const… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1902.03003v1-abstract-full').style.display = 'inline'; document.getElementById('1902.03003v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1902.03003v1-abstract-full" style="display: none;"> In this paper, we propose a joint time-frequency splitting (TFS) strategy for a multiuser orthogonal frequency division multiplexing (OFDM) system with simultaneous wireless information and power transfer (SWIPT). In TFS, the time sharing factors for each user on different subcarriers are optimized via maximizing the sum rate of users with both information and energy quality of service (QoS) constraints. Though the original problem is nonconvex, we first transform it into an equivalent convex problem through an appropriate variable transformation. Then, we present an iterative algorithm based on semi closed form with low complexity. Numerical results show that the proposed TFS outperforms the conventional time-sharing and subcarrier-separation strategies. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1902.03003v1-abstract-full').style.display = 'none'; document.getElementById('1902.03003v1-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> 8 February, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2019. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1811.10134">arXiv:1811.10134</a> <span> [<a href="https://arxiv.org/pdf/1811.10134">pdf</a>, <a href="https://arxiv.org/format/1811.10134">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 Data Collection and Wireless Power Transfer Using A MIMO Full-Duplex UAV </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Hou%2C+J">Jiancao Hou</a>, <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</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="1811.10134v1-abstract-short" style="display: inline;"> In this paper, we propose a novel energy-efficient data collection and wireless power transfer (WPT) framework for internet of things (IoT) applications, via a multiple-input multiple-output (MIMO) full-duplex (FD) unmanned aerial vehicle (UAV). To exploit the benefits of UAV-enabled WPT and MIMO FD communications, we allow the MIMO FD UAV charge low-power IoT devices while at the same time collec… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1811.10134v1-abstract-full').style.display = 'inline'; document.getElementById('1811.10134v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1811.10134v1-abstract-full" style="display: none;"> In this paper, we propose a novel energy-efficient data collection and wireless power transfer (WPT) framework for internet of things (IoT) applications, via a multiple-input multiple-output (MIMO) full-duplex (FD) unmanned aerial vehicle (UAV). To exploit the benefits of UAV-enabled WPT and MIMO FD communications, we allow the MIMO FD UAV charge low-power IoT devices while at the same time collect data from them. With the aim of saving the total energy consumed at the UAV, we formulate an energy minimization problem by taking the FD hardware impairments, the number of uploaded data bits, and the energy harvesting causality into account. Due to the non-convexity of the problem in terms of UAV trajectory and transmit beamforming for WPT, tracking the global optimality is quite challenge. Alternatively, we find a local optimal point by implementing the proposed iterative search algorithm combining with successive convex approximation techniques. Numerical results show that the proposed approach can lead to superior performance compared with other benchmark schemes with low computational complexity and fast convergence. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1811.10134v1-abstract-full').style.display = 'none'; document.getElementById('1811.10134v1-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> 22 November, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 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, 3 figures, submitted conference paper</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.01084">arXiv:1809.01084</a> <span> [<a href="https://arxiv.org/pdf/1809.01084">pdf</a>, <a href="https://arxiv.org/ps/1809.01084">ps</a>, <a href="https://arxiv.org/format/1809.01084">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 Resource Allocation for Mobile-Edge Computation Networks with NOMA </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Yang%2C+Z">Zhaohui Yang</a>, <a href="/search/eess?searchtype=author&query=Hou%2C+J">Jiancao Hou</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="1809.01084v2-abstract-short" style="display: inline;"> This paper investigates an uplink non-orthogonal multiple access (NOMA)-based mobile-edge computing (MEC) network. Our objective is to minimize the total energy consumption of all users including transmission energy and local computation energy subject to computation latency and cloud computation capacity constraints. We first prove that the total energy minimization problem is a convex problem, a… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1809.01084v2-abstract-full').style.display = 'inline'; document.getElementById('1809.01084v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1809.01084v2-abstract-full" style="display: none;"> This paper investigates an uplink non-orthogonal multiple access (NOMA)-based mobile-edge computing (MEC) network. Our objective is to minimize the total energy consumption of all users including transmission energy and local computation energy subject to computation latency and cloud computation capacity constraints. We first prove that the total energy minimization problem is a convex problem, and it is optimal to transmit with maximal time. Then, we accordingly proposed an iterative algorithm with low complexity, where closed-form solutions are obtained in each step. The proposed algorithm is successfully shown to be globally optimal. Numerical results show that the proposed algorithm achieves better performance than the conventional methods. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1809.01084v2-abstract-full').style.display = 'none'; document.getElementById('1809.01084v2-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> 14 February, 2019; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 4 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 5 figures. arXiv admin note: text overlap with arXiv:1807.11846</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/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> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1711.10556">arXiv:1711.10556</a> <span> [<a href="https://arxiv.org/pdf/1711.10556">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Image and Video Processing">eess.IV</span> </div> </div> <p class="title is-5 mathjax"> Edge Computing and Dynamic Vision Sensing for Low Delay Access to Visual Medical Information </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Chen%2C+Z">Ziyang Chen</a>, <a href="/search/eess?searchtype=author&query=Shikh-Bahaei%2C+T">Tamanna Shikh-Bahaei</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="1711.10556v1-abstract-short" style="display: inline;"> A new method is proposed to decrease the transmission delay of visual and non-visual medical records by using edge computing and Dynamic Vision Sensing (DVS) technologies. The simulation results show that the proposed scheme can decrease the transmission delay by 89.15% to 93.23%. The maximum number of patients who can be served by edge devices is analysed. </span> <span class="abstract-full has-text-grey-dark mathjax" id="1711.10556v1-abstract-full" style="display: none;"> A new method is proposed to decrease the transmission delay of visual and non-visual medical records by using edge computing and Dynamic Vision Sensing (DVS) technologies. The simulation results show that the proposed scheme can decrease the transmission delay by 89.15% to 93.23%. The maximum number of patients who can be served by edge devices is analysed. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1711.10556v1-abstract-full').style.display = 'none'; document.getElementById('1711.10556v1-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> 10 November, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2017. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1710.04507">arXiv:1710.04507</a> <span> [<a href="https://arxiv.org/pdf/1710.04507">pdf</a>, <a href="https://arxiv.org/ps/1710.04507">ps</a>, <a href="https://arxiv.org/format/1710.04507">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"> Performance Analysis of Energy Consumption in Cache-Enabled Multicast D2D Communications </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/eess?searchtype=author&query=Wenhuan%2C+B">Bao Wenhuan</a>, <a href="/search/eess?searchtype=author&query=Naslcheraghi%2C+M">Mansour Naslcheraghi</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="1710.04507v1-abstract-short" style="display: inline;"> Device-to-Device (D2D) communication as a promising technology in 5G cellular networks provides the communication of the users in the vicinity and thereby decreases end-to-end delay and power consumption. In addition to the aforementioned advantages, it also supports the high-speed data transmission services such as content delivery. In this paper, we consider the D2D multicast communications oppo… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1710.04507v1-abstract-full').style.display = 'inline'; document.getElementById('1710.04507v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1710.04507v1-abstract-full" style="display: none;"> Device-to-Device (D2D) communication as a promising technology in 5G cellular networks provides the communication of the users in the vicinity and thereby decreases end-to-end delay and power consumption. In addition to the aforementioned advantages, it also supports the high-speed data transmission services such as content delivery. In this paper, we consider the D2D multicast communications opportunity in the D2D-cellular hybrid network, in which that one transmitter targets multiple receivers at the same time. We provide the analysis for the proposed system by using tools from stochastic geometry, to calculate the cache hitting probability of the receivers as well as the energy consumption of the hybrid network aiming to seek the optimal number of caching contents in the D2D multicast opportunities. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1710.04507v1-abstract-full').style.display = 'none'; document.getElementById('1710.04507v1-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> 11 October, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2017. </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