scispace - formally typeset
Open AccessJournal ArticleDOI

Compute-and-Forward: Harnessing Interference Through Structured Codes

TLDR
In this article, the authors proposed a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network by decoding linear functions of transmitted messages according to their observed channel coefficients rather than ignoring the interference as noise.
Abstract
Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The key idea is that relays should decode linear functions of transmitted messages according to their observed channel coefficients rather than ignoring the interference as noise. After decoding these linear equations, the relays simply send them towards the destinations, which given enough equations, can recover their desired messages. The underlying codes are based on nested lattices whose algebraic structure ensures that integer combinations of codewords can be decoded reliably. Encoders map messages from a finite field to a lattice and decoders recover equations of lattice points which are then mapped back to equations over the finite field. This scheme is applicable even if the transmitters lack channel state information.

read more

Citations
More filters
Journal ArticleDOI

Federated Learning in Mobile Edge Networks: A Comprehensive Survey

TL;DR: The concept of federated learning (FL) as mentioned in this paperederated learning has been proposed to enable collaborative training of an ML model and also enable DL for mobile edge network optimization in large-scale and complex mobile edge networks, where heterogeneous devices with varying constraints are involved.
Posted Content

Federated Learning in Mobile Edge Networks: A Comprehensive Survey

TL;DR: In a large-scale and complex mobile edge network, heterogeneous devices with varying constraints are involved, this raises challenges of communication costs, resource allocation, and privacy and security in the implementation of FL at scale.
Book

Interference Alignment: A New Look at Signal Dimensions in a Communication Network

TL;DR: This monograph introduces to the reader the idea of interference alignment, traces its origins, reviews a variety of interference aligned schemes, summarizes the diverse settings where the idea is applicable and highlights the common principles that cut across these diverse applications.
Journal ArticleDOI

Making Cell-Free Massive MIMO Competitive With MMSE Processing and Centralized Implementation

TL;DR: In this paper, the uplink spectral efficiencies of four different cell-free implementations are analyzed, with spatially correlated fading and arbitrary linear processing, and it is shown that a centralized implementation with optimal minimum mean-square error (MMSE) processing not only maximizes the SE but largely reduces the fronthaul signaling compared to the standard distributed approach.
Patent

Network architecture, methods, and devices for a wireless communications network

Stefan Parkvall, +129 more
TL;DR: In this article, the uplink access configuration index is used to identify an uplink AP from among a predetermined plurality of AP configurations, and then the AP is transmitted to the wireless communications network according to the identified AP.
References
More filters
Book

Elements of information theory

TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Journal ArticleDOI

Cooperative diversity in wireless networks: Efficient protocols and outage behavior

TL;DR: Using distributed antennas, this work develops and analyzes low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks and develops performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading.
Journal ArticleDOI

Network information flow

TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
Journal ArticleDOI

Capacity theorems for the relay channel

TL;DR: In this article, the capacity of the Gaussian relay channel was investigated, and a lower bound of the capacity was established for the general relay channel, where the dependence of the received symbols upon the inputs is given by p(y,y) to both x and y. In particular, the authors proved that if y is a degraded form of y, then C \: = \: \max \!p(x,y,x,2})} \min \,{I(X,y), I(X,Y,Y,X,Y

Capacity theorems for the relay channel

TL;DR: An achievable lower bound to the capacity of the general relay channel is established and superposition block Markov encoding is used to show achievability of C, and converses are established.
Related Papers (5)