Expanding the compute-and-forward framework: Unequal powers, signal levels, and multiple linear combinations
The compute-and-forward framework permits each receiver in a Gaussian network to directly
decode a linear combination of the transmitted messages. The resulting linear combinations …
decode a linear combination of the transmitted messages. The resulting linear combinations …
Gaussian and fading multiple access using linear physical-layer network coding
Q Chen, F Yu, T Yang, R Liu - IEEE Transactions on Wireless …, 2022 - ieeexplore.ieee.org
This paper concerns with efficient communication over Gaussian and fading multiple-access
channels (MACs). Existing orthogonal multiple-access (OMA) and power-domain …
channels (MACs). Existing orthogonal multiple-access (OMA) and power-domain …
Optimal coefficient selection in Compute and Forward relaying using improved Schnorr–Euchner search algorithm
V Jeyalakshmi, ST Selvi - Physical Communication, 2023 - Elsevier
Abstract Physical layer Network Coding with Compute and Forward relaying (CF) is a
promising transmission strategy that effectively exploits the natural linear computation of the …
promising transmission strategy that effectively exploits the natural linear computation of the …
The magic of superposition: A survey on simultaneous transmission based wireless systems
In conventional communication systems, any interference between two communicating
points is regarded as unwanted noise since it distorts the received signals. On the other …
points is regarded as unwanted noise since it distorts the received signals. On the other …
Distributed lossy computation with structured codes: from discrete to continuous sources
This paper considers the problem of distributed lossy compression where the goal is to
recover one or more linear combinations of the sources at the decoder, subject to distortion …
recover one or more linear combinations of the sources at the decoder, subject to distortion …
Compute-forward for DMCs: Simultaneous decoding of multiple combinations
Algebraic network information theory is an emerging facet of network information theory,
studying the achievable rates of random code ensembles that have algebraic structure, such …
studying the achievable rates of random code ensembles that have algebraic structure, such …
A unified discretization approach to compute–forward: From discrete to continuous inputs
Compute–forward is a coding technique that enables receiver (s) in a network to directly
decode one or more linear combinations of the transmitted codewords. Initial efforts focused …
decode one or more linear combinations of the transmitted codewords. Initial efforts focused …
Compute-and-forward in large relaying systems: Limitations and asymptotically optimal scheduling
Compute and Forward (CF) is a coding scheme which enables receivers to decode linear
combinations of simultaneously transmitted messages while exploiting the linear properties …
combinations of simultaneously transmitted messages while exploiting the linear properties …
On Lattice-based Broadcasting for Massive-user MIMO: Practical Algorithms and Optimization
X Qiu, T Yang, J Thompson - IEEE Transactions on Wireless …, 2024 - ieeexplore.ieee.org
This paper studies a lattice-based broadcasting (LBC) scheme for a single-cell downlink
system. The base station (BS) has N antennas and the K user-equipments (UEs) have a …
system. The base station (BS) has N antennas and the K user-equipments (UEs) have a …
Homologous codes for multiple access channels
P Sen, YH Kim - IEEE Transactions on Information Theory, 2019 - ieeexplore.ieee.org
Building on recent development by Padakandla and Pradhan, and by Lim, Feng, Pastore,
Nazer, and Gastpar, this paper studies the potential of structured coset coding as a complete …
Nazer, and Gastpar, this paper studies the potential of structured coset coding as a complete …