Simultaneous Computation and Communication over MAC
IEEE Transactions on Information Theory (Early Access), vol. 71(5), 2025 We study communication over a Gaussian multiple-access channel (MAC) with two types of transmitters: Digital transmitters hold a message from a discrete set that needs to be communicated to the receiver with vanishing error pro...
Saved in:
Main Authors | , , , |
---|---|
Format | Journal Article |
Language | English |
Published |
30.01.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | IEEE Transactions on Information Theory (Early Access), vol.
71(5), 2025 We study communication over a Gaussian multiple-access channel (MAC) with two
types of transmitters: Digital transmitters hold a message from a discrete set
that needs to be communicated to the receiver with vanishing error probability.
Analog transmitters hold sequences of analog values. Some functions of these
distributed values (but not the values themselves) need to be conveyed to the
receiver, subject to a fidelity criterion such as mean squared error (MSE) or a
certain maximum error with given confidence. For the case in which the computed
function for the analog transmitters is a sum of values in [-1,1], we derive
inner and outer bounds for the tradeoff of digital and analog rates of
communication under peak and average power constraints for digital transmitters
and a peak power constraint for analog transmitters. We then extend the
achievability result to a class of functions that includes all linear and some
non-linear functions. This extended scheme works over fading channels as long
as full channel state information is available at the transmitter. The
practicality of our proposed communication scheme is shown in channel
simulations that use a version of the scheme based on low density parity check
(LDPC) coding. We evaluate the system performance for different block lengths
and Gaussian as well as non-Gaussian noise distributions. |
---|---|
DOI: | 10.48550/arxiv.2401.16751 |