Institution
University of Luxembourg
Education•Luxembourg, Luxembourg•
About: University of Luxembourg is a education organization based out in Luxembourg, Luxembourg. It is known for research contribution in the topics: Population & European union. The organization has 4744 authors who have published 22175 publications receiving 381824 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this study, using the fluctuation theorem, universal features of efficiency fluctuations are identified and it is found that the Carnot efficiency is, surprisingly, the least likely in the long time limit.
Abstract: Carnot efficiency is the highest theoretically possible efficiency that a heat engine can have. Verley et al. use the fluctuation theorem to show that the Carnot value is the least likely efficiency in the long time limit.
205 citations
••
TL;DR: The authors re-examine the existence of an Environmental Kuznets Curve (EKC) across countries using a semi-parametric regression estimator, which places no restrictions on the functional form.
204 citations
••
TL;DR: A maximum ratio transmission (MRT) based algorithm that jointly exploits DI and CSI to glean the benefits from constructive multiuser interference and novel constructive interference precoding techniques that tackle the transmit power minimization with individual SINR constraints at each user's receivers are proposed.
Abstract: This paper investigates the problem of interference among the simultaneous multiuser transmissions in the downlink of multiple-antenna systems Using symbol-level precoding, a new approach to exploit the multiuser interference is discussed The concept of exploiting the interference between spatial multiuser transmissions by jointly utilizing data information (DI) and channel state information (CSI), in order to design symbol-level precoders, is proposed To this end, the interference between data streams is transformed under certain conditions into useful signal that can improve the signal to interference noise ratio (SINR) of the downlink transmissions We propose a maximum ratio transmission (MRT) based algorithm that jointly exploits DI and CSI to glean the benefits from constructive multiuser interference Subsequently, a relation between the constructive interference downlink transmission and physical layer multicasting is established In this context, novel constructive interference precoding techniques that tackle the transmit power minimization (min-power) with individual SINR constraints at each user's receivers is proposed Furthermore, fairness through maximizing the weighted minimum SINR (max-min SINR) of the users is addressed by finding the link between the min power and max min SINR problems Moreover, heuristic precoding techniques are proposed to tackle the weighted sum rate problem Finally, extensive numerical results show that the proposed schemes outperform other state of the art techniques
204 citations
••
29 Nov 2012TL;DR: A novel Traffic Aware Scheduling Algorithm (TASA) is conceived by extending the theoretically well-established graph theory methods of matching and coloring by means of an innovative approach based on network topology and traffic load to support emerging industrial applications requiring low latency at low duty cycle and power consumption.
Abstract: The Time Synchronized Channel Hopping (TSCH) protocol is part of the newly defined IEEE 802.15.4e standard and represents the latest generation of highly reliable low-power MAC protocols. With implementation details left open, we conceive here a novel Traffic Aware Scheduling Algorithm (TASA) by extending the theoretically well-established graph theory methods of matching and coloring by means of an innovative approach based on network topology and traffic load. TASA is able to support emerging industrial applications requiring low latency at low duty cycle and power consumption. Preliminary simulation results have also been reported to highlight the effectiveness of the proposed algorithm.
204 citations
••
TL;DR: This survey paper provides a detailed review of the state of the art related to the application of CS in CR communications and provides a classification of the main usage areas based on the radio parameter to be acquired by a wideband CR.
Abstract: Compressive sensing (CS) has received much attention in several fields such as digital image processing, wireless channel estimation, radar imaging, and cognitive radio (CR) communications. Out of these areas, this survey paper focuses on the application of CS in CR communications. Due to the under-utilization of the allocated radio spectrum, spectrum occupancy is usually sparse in different domains such as time, frequency, and space. Such a sparse nature of the spectrum occupancy has inspired the application of CS in CR communications. In this regard, several researchers have already applied the CS theory in various settings considering the sparsity in different domains. In this direction, this survey paper provides a detailed review of the state of the art related to the application of CS in CR communications. Starting with the basic principles and the main features of CS, it provides a classification of the main usage areas based on the radio parameter to be acquired by a wideband CR. Subsequently, we review the existing CS-related works applied to different categories such as wideband sensing, signal parameter estimation and radio environment map (REM) construction, highlighting the main benefits and the related issues. Furthermore, we present a generalized framework for constructing the REM in compressive settings. Finally, we conclude this survey paper with some suggested open research challenges and future directions.
204 citations
Authors
Showing all 4893 results
Name | H-index | Papers | Citations |
---|---|---|---|
Jun Wang | 166 | 1093 | 141621 |
Leroy Hood | 158 | 853 | 128452 |
Andreas Heinz | 108 | 1078 | 45002 |
Philippe Dubois | 101 | 1098 | 48086 |
John W. Berry | 97 | 351 | 52470 |
Michael Müller | 91 | 333 | 26237 |
Bart Preneel | 82 | 844 | 25572 |
Bjorn Ottersten | 81 | 1058 | 28359 |
Sander Kersten | 79 | 246 | 23985 |
Alexandre Tkatchenko | 77 | 271 | 26863 |
Rudi Balling | 75 | 238 | 19529 |
Lionel C. Briand | 75 | 380 | 24519 |
Min Wang | 72 | 716 | 19197 |
Stephen H. Friend | 70 | 184 | 53422 |
Ekhard K. H. Salje | 70 | 581 | 19938 |