<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:apple-wallpapers="http://www.apple.com/ilife/wallpapers" xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" xmlns:g-custom="http://base.google.com/cns/1.0" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:media="http://search.yahoo.com/mrss/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:creativeCommons="http://backend.userland.com/creativeCommonsRssModule" xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:cc="http://web.resource.org/cc/" xmlns:georss="http://www.georss.org/georss" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:g-core="http://base.google.com/ns/1.0" version="2.0">
  <channel>
    <title>ORBi&lt;sup&gt;lu&lt;/sup&gt; Collection: Electrical &amp; electronics engineering</title>
    <link>http://hdl.handle.net/10993/86</link>
    <description />
    <textInput>
      <title>The Collection's search engine</title>
      <description>Search this channel</description>
      <name>search</name>
      <link>https://orbilu.uni.lu/simple-search</link>
    </textInput>
    <item>
      <title>Extended Adjacency and Scale-dependent Graph Fourier Transform via Diffusion Distances</title>
      <link>http://hdl.handle.net/10993/43992</link>
      <description>Title: Extended Adjacency and Scale-dependent Graph Fourier Transform via Diffusion Distances
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Elias, Vitor R.M.; Alves Martins, Wallace; Werner, Stefan
&lt;br/&gt;
&lt;br/&gt;Abstract: This paper proposes the augmentation of the adjacency model of networks for graph signal processing. It is assumed that no information about the network is available, apart from the initial adjacency matrix. In the proposed model, additional edges are created according to a Markov relation imposed between nodes. This information is incorporated into the extended-adjacency matrix as a function of the diffusion distance between nodes. The diffusion distance measures similarities between nodes at a certain diffusion scale or time, and is a metric adopted from diffusion maps. Similarly, the proposed extended-adjacency matrix depends on the diffusion scale, which enables the definition of a scale-dependent graph Fourier transform. We conduct theoretical analyses of both the extended adjacency and the corresponding graph Fourier transform and show that different diffusion scales lead to different graph-frequency perspectives. At different scales, the transform discriminates shifted ranges of signal variations across the graph, revealing more information on the graph signal when compared to traditional approaches. The scale-dependent graph Fourier transform is applied for anomaly detection and is shown to outperform the conventional graph Fourier transform.</description>
      <pubDate>Thu, 06 Aug 2020 16:21:13 GMT</pubDate>
    </item>
    <item>
      <title>On the Convergence of Max-Min Fairness Power Allocation in Massive MIMO Systems</title>
      <link>http://hdl.handle.net/10993/43991</link>
      <description>Title: On the Convergence of Max-Min Fairness Power Allocation in Massive MIMO Systems
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Chaves, Rafael S.; Cetin, Ediz; Lima, Markus V.S.; Alves Martins, Wallace
&lt;br/&gt;
&lt;br/&gt;Abstract: Power allocation techniques, among which the max-min fairness power allocation (MMFPA) is one of the most widely used, are essential to guarantee good data throughput for all users in a cell. Recently, an efficient MMFPA algorithm for massive multiple-input multiple-output (MIMO) systems has been proposed. However, this algorithm is susceptible to the initial search interval employed by the underlying bisection search. Even if the optimal point belongs to the initial search interval, this algorithm may fail to converge to such a point. In this paper, we use the Perron-Frobenius theory to explain this issue and provide search intervals that guarantee convergence to the optimal point. Furthermore, we propose the bound test procedure as an efficient way of initializing the search interval. Simulation results corroborate our findings.</description>
      <pubDate>Thu, 06 Aug 2020 15:16:47 GMT</pubDate>
    </item>
    <item>
      <title>Carrier and Power Assignment for Flexible Broadband GEO Satellite Communications System</title>
      <link>http://hdl.handle.net/10993/43973</link>
      <description>Title: Carrier and Power Assignment for Flexible Broadband GEO Satellite Communications System
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Abdu, Tedros Salih; Lagunas, Eva; Kisseleff, Steven; Chatzinotas, Symeon
&lt;br/&gt;
&lt;br/&gt;Abstract: Current multi-beam GEO satellite systems operate&#xD;
under a limited frequency reuse configuration and considering&#xD;
uniform power assignment across beams. The latter has been&#xD;
shown to be inefficient in matching the geographic distribution&#xD;
of the traffic demand. In this context, next generation&#xD;
of broadband GEO satellite systems will be equipped with&#xD;
more flexible and reconfigurable payloads, facilitating on-demand&#xD;
resource allocation. In this paper, we consider both carrier&#xD;
and power assignment to match the requested beam demands&#xD;
while minimizing the total transmit power and the total utilized&#xD;
bandwidth. A novel optimization problem is formulated and,&#xD;
given its non-convex structure, we divide the problem into two&#xD;
tractable sub-problems. First, we estimate the number of adjacent&#xD;
frequency carriers required for each beam to satisfy its demand&#xD;
and, subsequently, we optimize the power allocation based on the&#xD;
previously assigned carriers. We validate the proposed method&#xD;
with extensive numerical results, which demonstrate its efficiency&#xD;
with respect to benchmark strategies.</description>
      <pubDate>Mon, 03 Aug 2020 11:41:44 GMT</pubDate>
    </item>
    <item>
      <title>Resource Allocation for Energy Efficiency in OFDMA-Enabled WPCN</title>
      <link>http://hdl.handle.net/10993/43899</link>
      <description>Title: Resource Allocation for Energy Efficiency in OFDMA-Enabled WPCN
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Nguyen, Tien-Tung; Pham, Quoc-Viet; Nguyen, van Dinh; Lee, Jong-Ho; Kim, Yong-Hwa
&lt;br/&gt;
&lt;br/&gt;Abstract: This letter considers a wireless powered communication network (WPCN), where an energy-constrained device directly uses harvested energy from a power transfer source to transmit independent signals to multiple Internet of Things (IoT) users using orthogonal frequency division multiple access (OFDMA). Our goal is to maximize the system energy efficiency&#xD;
(EE) by jointly optimizing the duration of energy harvesting (EH), subcarrier and power allocation. The formulated problem is a mixed integer nonlinear programming (MINLP) problem due to the presence of binary assignment variables, and thus it is very challenging to solve it directly. By leveraging Dinkelbach method, a very efficient iterative algorithm with closed-form solutions in each iteration is developed, where its convergence is guaranteed. Numerical results show that the proposed algorithm obtains a fast convergence and outperforms baseline algorithms. Notably, they also reveal that the power source should transmit its maximum&#xD;
allowable power to obtain the optimal EE performance.</description>
      <pubDate>Mon, 27 Jul 2020 08:03:17 GMT</pubDate>
    </item>
    <item>
      <title>Unified Framework for Secrecy Characteristics with Mixture of Gaussian (MoG) Distribution</title>
      <link>http://hdl.handle.net/10993/43869</link>
      <description>Title: Unified Framework for Secrecy Characteristics with Mixture of Gaussian (MoG) Distribution
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Kong, Long; Chatzinotas, Symeon; Ottersten, Björn
&lt;br/&gt;
&lt;br/&gt;Abstract: The mixture of Gaussian (MoG) distribution was proposed to model the wireless channels by implementing the completely unsupervised expectation-maximization (EM) learning algorithm. With the high convenience for density estimation applications, the focus of this letter is supposed to investigate the secrecy metrics, including secrecy outage probability (SOP), the lower bound of SOP, the probability of non-zero secrecy capacity (PNZ), and the average secrecy capacity (ASC) from the information-theoretic perspective. The above-mentioned metrics are derived with simple and unified closed-form expressions. The effectiveness of our obtained analytical expressions are successfully examined and compared with Monte-Carlo simulations. One can conclude that this letter provides a simple but effective closed-form secrecy analysis solution exploiting the MoG distribution.</description>
      <pubDate>Sat, 18 Jul 2020 03:30:03 GMT</pubDate>
    </item>
    <item>
      <title>Large Intelligent Surface for Positioning in Millimeter Wave MIMO Systems</title>
      <link>http://hdl.handle.net/10993/43600</link>
      <description>Title: Large Intelligent Surface for Positioning in Millimeter Wave MIMO Systems
&lt;br/&gt;
&lt;br/&gt;Author, co-author: He, Jiguang; Wymeersch, Henk; Kong, Long; Silven, Olli; Juntti, Markku
&lt;br/&gt;
&lt;br/&gt;Abstract: Millimeter-wave (mmWave) multiple-input multiple-output (MIMO) system for the fifth generation (5G) cellular communications can also enable single-anchor positioning and object tracking due to its large bandwidth and inherently high angular resolution. In this paper, we introduce the newly invented concept, large intelligent surface (LIS), to mmWave positioning systems, study the theoretical performance bounds (i.e., Cramér-Rao lower bounds) for positioning, and evaluate the impact of the number of LIS elements and the value of phase shifters on the position estimation accuracy compared to the conventional scheme with one direct link and one non-line-of-sight path. It is verified that better performance can be achieved with a LIS from the theoretical analyses and numerical study.</description>
      <pubDate>Wed, 01 Jul 2020 12:39:43 GMT</pubDate>
    </item>
    <item>
      <title>Decision Triggered Data Transmission and Collection in Industrial Internet of Things</title>
      <link>http://hdl.handle.net/10993/43598</link>
      <description>Title: Decision Triggered Data Transmission and Collection in Industrial Internet of Things
&lt;br/&gt;
&lt;br/&gt;Author, co-author: He, Jiguang; Kong, Long; Frondelius, Tero; Silven, Olli; Juntti, Markku
&lt;br/&gt;
&lt;br/&gt;Abstract: We propose a decision triggered data transmission and collection (DTDTC) protocol for condition monitoring and anomaly detection in the industrial Internet of things (IIoT). In the IIoT, the collection, processing, encoding, and transmission of the sensor readings are usually not for the reconstruction of the original data but for decision making at the fusion center. By moving the decision making process to the local end devices, the amount of data transmission can be significantly reduced, especially when normal signals with positive decisions dominate in the whole life cycle and the fusion center is only interested in collecting the abnormal data. The proposed concept combines compressive sensing, machine learning, data transmission, and joint decision making. The sensor readings are encoded and transmitted to the fusion center only when abnormal signals with negative decisions are detected. All the abnormal signals from the end devices are gathered at the fusion center for a joint decision with feedback messages forwarded to the local actuators. The advantage of such an approach lies in that it can significantly reduce the volume of data to be transmitted through wireless links. Moreover, the introduction of compressive sensing can further reduce the dimension of data tremendously. An exemplary case, i.e., diesel engine condition monitoring, is provided to validate the effectiveness and efficiency of the proposed scheme compared to the conventional ones.</description>
      <pubDate>Wed, 01 Jul 2020 12:31:40 GMT</pubDate>
    </item>
    <item>
      <title>5G Cellular and Fixed Satellite Service Spectrum Coexistence in C-Band</title>
      <link>http://hdl.handle.net/10993/43568</link>
      <description>Title: 5G Cellular and Fixed Satellite Service Spectrum Coexistence in C-Band
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Lagunas, Eva; Tsinos, Christos; Sharma, Shree Krishna; Chatzinotas, Symeon</description>
      <pubDate>Thu, 25 Jun 2020 03:30:02 GMT</pubDate>
    </item>
    <item>
      <title>Designing MPSK Sequences and Doppler Filter Bank in Cognitive Radar Systems</title>
      <link>http://hdl.handle.net/10993/43534</link>
      <description>Title: Designing MPSK Sequences and Doppler Filter Bank in Cognitive Radar Systems
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Raei, Ehsan; Alaeekerahroodi, Mohammad; Shankar, Bhavani; Ottersten, Björn
&lt;br/&gt;
&lt;br/&gt;Abstract: In this paper, we propose an attractive method to&#xD;
jointly design discrete phase radar sequence and receive filter&#xD;
bank with the aim of enhancing Signal to Interference and Noise&#xD;
Ratio (SINR) in a cognitive radar system. Towards this, we&#xD;
consider maximizing the worst case SINR at the output of the&#xD;
filter bank when transmitting M-ary Phase Shift Keying (MPSK)&#xD;
sequences, an exercise hitherto not considered. This maximization&#xD;
results in a max-min optimization problem that is multi-variable&#xD;
and non-convex, where we propose an efficient algorithm based&#xD;
on the Coordinate Descent (CD) framework to address it. The&#xD;
gains demonstrated by the proposed algorithm over the state of&#xD;
the art as well as its discrete phase property render the designed&#xD;
sequences attractive for hardware implementation while enabling&#xD;
efficient utilization of transmit power.</description>
      <pubDate>Sat, 20 Jun 2020 16:06:02 GMT</pubDate>
    </item>
    <item>
      <title>Effective Throughput Analysis of α-η-κ-μ Fading Channels</title>
      <link>http://hdl.handle.net/10993/43518</link>
      <description>Title: Effective Throughput Analysis of α-η-κ-μ Fading Channels
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Ai, Yun; Mathur, Aashish; Kong, Long; Cheffena, Michael
&lt;br/&gt;
&lt;br/&gt;Abstract: The α-η-κ-µ fading model is a very useful instrument to accurately describe various radio&#xD;
wave propagation scenarios. In this paper, we study the effective throughput performance of communication&#xD;
systems over the α-η-κ-µ fading channels. Novel and exact expressions for the effective throughput over&#xD;
α-η-κ-µ channels are derived, and the effective throughput of multiple-input single-output (MISO) and&#xD;
multiple-input multiple-output (MIMO) systems over some widely used small-scale fading models are&#xD;
presented based on the derived results. To obtain more understandings on the impact of physical channel&#xD;
characteristics and system configuration on the effective throughput, closed-form expressions for the&#xD;
asymptotic effective throughput at high signal-to-noise ratio (SNR) regimes are also obtained. The results&#xD;
reveal the underlying connections between different physical channel parameters (e.g., scattering level, phase&#xD;
correlation, channel nonlinearity, multipath clustering, and channel imbalance) and the effective throughput.&#xD;
It is found that the effective throughput improves with the increase of channel nonlinearity and number of&#xD;
multipath clusters, and the high-SNR slope is only dependent on the channel nonlinearity and the number of&#xD;
multipath clusters present in the physical channel.</description>
      <pubDate>Wed, 17 Jun 2020 12:30:41 GMT</pubDate>
    </item>
    <item>
      <title>Cache-aided full-duplex: Delivery time analysis and optimization</title>
      <link>http://hdl.handle.net/10993/43430</link>
      <description>Title: Cache-aided full-duplex: Delivery time analysis and optimization
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Vu, Thang Xuan; Trinh, Anh Vu; Chatzinotas, Symeon; Tran, Xuan Nam
&lt;br/&gt;
&lt;br/&gt;Abstract: Edge caching has received much attention as a promising technique to overcome the stringent latency and data-hungry challenges in the future generation wireless networks. Meanwhile, full-duplex (FD) transmission can improve the spectral efficiency by allowing a node to receive and transmit on the same frequency band simultaneously. In this paper, we investigate the delivery time performance of a cache-aided FD system, in which an edge node, operates in FD mode, serves users via wireless channels and is equipped with a cache memory. Firstly, we derive a closed-form expression for the average delivery time by taking into account the uncertainties of both backhaul and access wireless channels. The derived analysis allows the examination of the impact of the key parameters, e.g., cache size and transmit power. Secondly, a power optimization problem is formulated to minimize the average delivery time. To deal with the non-convexity of the formulated problem, we propose an iterative optimization algorithm based on the bisection method. Finally, numerical results are presented to demonstrate the effectiveness of the proposed algorithm, which can significantly reduce the delivery time compared to the FD reference and the half-duplex counterpart.</description>
      <pubDate>Sat, 06 Jun 2020 03:30:02 GMT</pubDate>
    </item>
    <item>
      <title>MLSE and Spatio-Temporal Interference Rejection Combining with Antenna Arrays</title>
      <link>http://hdl.handle.net/10993/43429</link>
      <description>Title: MLSE and Spatio-Temporal Interference Rejection Combining with Antenna Arrays
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Asztély, David; Ottersten, Björn</description>
      <pubDate>Fri, 05 Jun 2020 21:17:01 GMT</pubDate>
    </item>
    <item>
      <title>Blind Subspace Identification of a BPSK Communication Channel</title>
      <link>http://hdl.handle.net/10993/43428</link>
      <description>Title: Blind Subspace Identification of a BPSK Communication Channel
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Kristensson, Martin; Ottersten, Björn</description>
      <pubDate>Fri, 05 Jun 2020 21:04:40 GMT</pubDate>
    </item>
    <item>
      <title>The Effects of Local Scattering on Direction of Arrival Estimation with MUSIC and ESPRIT</title>
      <link>http://hdl.handle.net/10993/43427</link>
      <description>Title: The Effects of Local Scattering on Direction of Arrival Estimation with MUSIC and ESPRIT
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Asztély, David; Ottersten, Björn</description>
      <pubDate>Fri, 05 Jun 2020 21:03:49 GMT</pubDate>
    </item>
    <item>
      <title>Analysis of Subspace Fitting Based Methods for Sensor Array Processing</title>
      <link>http://hdl.handle.net/10993/43426</link>
      <description>Title: Analysis of Subspace Fitting Based Methods for Sensor Array Processing
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Ottersten, Björn; Viberg, M.</description>
      <pubDate>Fri, 05 Jun 2020 21:01:56 GMT</pubDate>
    </item>
    <item>
      <title>A Generalized Array Manifold Model for Local Scattering in Wireless Communications</title>
      <link>http://hdl.handle.net/10993/43425</link>
      <description>Title: A Generalized Array Manifold Model for Local Scattering in Wireless Communications
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Asztely, David; Ottersten, Björn; Swindlehurst, Andrew Lee
&lt;br/&gt;
&lt;br/&gt;Commentary: 5</description>
      <pubDate>Fri, 05 Jun 2020 20:55:00 GMT</pubDate>
    </item>
    <item>
      <title>Power Allocation and Bit Loading for Spatial Multiplexing in MIMO Systems</title>
      <link>http://hdl.handle.net/10993/43424</link>
      <description>Title: Power Allocation and Bit Loading for Spatial Multiplexing in MIMO Systems
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Zhang, Xi; Ottersten, Björn
&lt;br/&gt;
&lt;br/&gt;Abstract: The power assignment problem is important for Multiple-Input-Multiple-Output (MIMO) systems to achieve high capacity. Although this problem is solved by well-known water filling algorithms, this does not provide an optimal solution if the system is constrained to a fixed raw bit error rate threshold and to discrete modulation s. In this work an approximate approach, called QoS based WF, is proposed to solve the power assignment problem with such constrains. It is shown to outperform quantization of the conventional water filling solution and a well known bit loading algorithm (Chow's algorithm) used in the Digital Subscriber Lines (DSL).</description>
      <pubDate>Fri, 05 Jun 2020 20:54:13 GMT</pubDate>
    </item>
    <item>
      <title>Robust Signal Parameter Estimation in the Presence of Array Perturbations</title>
      <link>http://hdl.handle.net/10993/43423</link>
      <description>Title: Robust Signal Parameter Estimation in the Presence of Array Perturbations
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Wahlberg, B.; Ottersten, Björn; Viberg, M.</description>
      <pubDate>Fri, 05 Jun 2020 20:52:36 GMT</pubDate>
    </item>
    <item>
      <title>A Statistical Perspective on State-Space Modeling Using Subspace Methods</title>
      <link>http://hdl.handle.net/10993/43422</link>
      <description>Title: A Statistical Perspective on State-Space Modeling Using Subspace Methods
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Viberg, M.; Ottersten, Björn; Wahlberg, B.; Ljung, L.</description>
      <pubDate>Fri, 05 Jun 2020 20:50:50 GMT</pubDate>
    </item>
    <item>
      <title>Full Diversity Detection in MIMO Systems with a Fixed-Complexity Sphere Decoder</title>
      <link>http://hdl.handle.net/10993/43421</link>
      <description>Title: Full Diversity Detection in MIMO Systems with a Fixed-Complexity Sphere Decoder
&lt;br/&gt;
&lt;br/&gt;Author, co-author: Jaldén, Joakim; Barbero, Luis G.; Ottersten, Björn; Thompson, John S.</description>
      <pubDate>Fri, 05 Jun 2020 20:49:50 GMT</pubDate>
    </item>
  </channel>
</rss>

