Opendata, web and dolomites

DUALITY SIGNED

Theoretical Foundations of Memory Micro-Insertions in Wireless Communications

Total Cost €

0

EC-Contrib. €

0

Partnership

0

Views

0

 DUALITY project word cloud

Explore the words cloud of the DUALITY project. It provides you a very rough idea of what is the project "DUALITY" about.

variety    links    surprisingly    splash    distributed    structure    discovered    rendering    mathematical    structurally    throughput    bottleneck    networks    informational    network    memory    looming    convergence    algorithms    reveal    translate    rates    life    time    duality    channel    storage    volumes    managed    promise    pursue    disconnected    architectures    doubly    mostly    aided    theoretical    data    surprising    ramifications    deep    motivated    scientific    unearthed    avert    downlink    simpler    gains    invent    efficient    pass    principles    indefinite    mac    unprecedented    ultra    preemptive    wired    explore    lasting    communication    layer    exploratory    solutions    transforming    alter    indications    transmission    fast    theory    foundations    surgically    faster    configuration    basic    scales    consequently    stands    exceptional    prompts    unbounded    feedback    ultimately    reduce    size    practical    thought    wireless    promises    hidden    exponentially    caused    bypassing    phy    nodes    dreaded    capacity    overload    receiving    envisioned   

Project "DUALITY" data sheet

The following table provides information about the project.

Coordinator
EURECOM 

Organization address
address: ROUTE DES CHAPPES 450 CAMPUS SOPHIATECH
city: BIOT
postcode: 6410
website: www.eurecom.fr

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country France [FR]
 Total cost 1˙978˙777 €
 EC max contribution 1˙978˙777 € (100%)
 Programme 1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
 Code Call ERC-2016-COG
 Funding Scheme ERC-COG
 Starting year 2017
 Duration (year-month-day) from 2017-04-01   to  2022-03-31

 Partnership

Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    EURECOM FR (BIOT) coordinator 1˙978˙777.00

Map

 Project objective

We propose to develop the theoretical foundations of transforming memory into data rates, and to explore their practical ramifications in wireless communication networks.

Motivated by the long-lasting open challenge to invent a communication technology that scales with the network size, we have recently discovered early indications of how preemptive use of distributed data-storage at the receiving communication nodes (well before transmission), can offer unprecedented throughput gains by surprisingly bypassing the dreaded bottleneck of real-time channel-feedback. For an exploratory downlink configuration, we unearthed a hidden duality between feedback and preemptive use of memory, which managed to doubly-exponentially reduce the needed memory size, and consequently offered unbounded throughput gains compared to all existing solutions with the same resources. This was surprising because feedback and memory were thought to be mostly disconnected; one is used on the wireless PHY layer, the other on the wired MAC.

This development prompts our key scientific challenge which is to pursue the mathematical convergence between feedback-information-theory and preemptive distributed data-storage, and to then design ultra-fast memory-aided communication algorithms that pass real-life testing. This is a structurally new approach, which promises to reveal deep links between feedback information theory and memory, for a variety of envisioned wireless-network architectures of exceptional promise. In doing so, our new proposed theory stands to identify the basic principles of how a splash of memory can surgically alter the informational-structure of these networks, rendering them faster, simpler and more efficient. In the end, this study has the potential to directly translate the continuously increasing data-storage capabilities, into gains of wireless network capacity, and to ultimately avert the looming network-overload caused by these same indefinite increases of data volumes.

 Publications

year authors and title journal last update
List of publications.
2018 E. Parrinello, A. Ünsal, and P. Elia
Optimal coded caching in heterogeneous networks with uncoded prefetching
published pages: , ISSN: , DOI:
IEEE Information Theory Workshop (ITW), Nov. 2018 2019-12-16
2019 K. Avrachenkov, J. Goseling and B. Serbetci
Distributed Cooperative Caching for VoD with Geographic Constraints
published pages: , ISSN: , DOI:
IEEE International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WIOPT), June 2019 2019-12-16
2019 E. Lampiris, D. Jiménez Zorrilla, and P. Elia
Mapping heterogeneity does not affect wireless Coded MapReduce
published pages: , ISSN: , DOI:
IEEE International Symposium on Information Theory (ISIT), 2019 2019-12-16
2017 E. Lampiris, J. Zhang, and P. Elia
Cache-aided cooperation with no CSIT
published pages: , ISSN: , DOI:
IEEE International Symposium on Information Theory (ISIT), June 2017. 2019-12-16
2018 E. Lampiris and P. Elia
Full coded caching gains for cache-less users
published pages: , ISSN: , DOI:
IEEE Information Theory Workshop (ITW), Nov 2018 2019-12-16
2019 E. Lampiris, A. E. Gamal, and P. Elia
Wyner’s network on caches: Combining receiver caching with a flexible backhaul
published pages: , ISSN: , DOI:
IEEE International Symposium on Information Theory (ISIT), 2019 2019-12-16
2019 E. Parrinello, A. Ünsal, and P. Elia
Optimal coded caching under statistical QoS information
published pages: , ISSN: , DOI:
IEEE International Symposium on Information Theory (ISIT), July 2019. 2019-12-16
2019 E. Lampiris and P. Elia
Bridging two extremes: Multi-antenna coded caching with reduced subpacketization and CSIT
published pages: , ISSN: , DOI:
IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2019. 2019-12-16
2019 E. Parrinello and P. Elia
Coded caching with optimized shared-cache sizes
published pages: , ISSN: , DOI:
IEEE Information Theory Workshop (ITW), Aug. 2019 2019-12-16
2018 Lampiris, Eleftherios; Elia, Petros
Adding transmitters dramatically boosts coded-caching gains for finite file sizes
published pages: , ISSN: , DOI:
2019-04-18
2018 Emanuele Parrinello, Eleftherios Lampiris, Petros Elia
Coded Distributed Computing with Node Cooperation Substantially Increases Speedup Factors
published pages: , ISSN: , DOI:
2019-04-18
2018 Emanuele Parrinello ; Eleftherios Lampiris ; Petros Elia
Coded Distributed Computing with Node Cooperation Substantially Increases Speedup Factors
published pages: 1291 - 1295, ISSN: , DOI:
2018 IEEE International Symposium on Information Theory (ISIT) 2019-04-18
2018 Eleftherios Lampiris ; Petros Elia
Adding Transmitters Allows Unbounded Coded-Caching Gains with Bounded File Sizes
published pages: 1435 - 1439, ISSN: , DOI:
2018 IEEE International Symposium on Information Theory (ISIT) 2019-04-18
2018 Lampiris, Eleftherios; Elia, Petros
Full Coded Caching Gains for Cache-less Users
published pages: , ISSN: , DOI:
1 2019-04-18
2018 Emanuele Parrinello, Ayse Unsal, Petros Elia
Fundamental Limits of Caching in Heterogeneous Networks with Uncoded Prefetching
published pages: , ISSN: , DOI:
Submitted Transactions in Information Theory 2019-04-18
2018 Eleftherios Lampiris ; Petros Elia Page s: 1440 - 1444
Achieving Full Multiplexing and Unbounded Caching Gains with Bounded Feedback Resources
published pages: , ISSN: , DOI:
2018 IEEE International Symposium on Information Theory (ISIT) 2019-04-18
2018 Emanuele Parrinello, Ayşe Ünsal, Petros Elia
Coded Caching with Shared Caches: Fundamental Limits with Uncoded Prefetching
published pages: , ISSN: , DOI:
2019-04-18
2017 Jingjing Zhang, Petros Elia
Fundamental Limits of Cache-Aided Wireless BC: Interplay of Coded-Caching and CSIT Feedback
published pages: 1-1, ISSN: 0018-9448, DOI: 10.1109/TIT.2017.2674668
IEEE Transactions on Information Theory 2019-04-18
2018 Eleftherios Lampiris ; Petros Elia
Adding Transmitters Dramatically Boosts Coded-Caching Gains for Finite File SizesPage s: 1176 - 1188
published pages: , ISSN: 0733-8716, DOI:
IEEE Journal on Selected Areas in Communications 2019-04-18

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "DUALITY" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "DUALITY" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.1.)

ERC VP CSA (2018)

Support to the Vice-Presidents of the ERC Scientific Council 2018

Read More  

AST (2019)

Automatic System Testing

Read More  

CHIPTRANSFORM (2018)

On-chip optical communication with transformation optics

Read More