English
Related papers

Related papers: Function Computation Over Multiple Access Channels…

200 papers

We consider sparse superposition codes (SPARCs) over complex AWGN channels. Such codes can be efficiently decoded by an approximate message passing (AMP) decoder, whose performance can be predicted via so-called state evolution in the…

Information Theory · Computer Science 2021-03-09 Haiwen Cao , Pascal O. Vontobel

A novel stochastic optimization method called MAC was suggested. The method is based on the calculation of the objective function at several random points and then an empirical expected value and an empirical covariance matrix are…

Neural and Evolutionary Computing · Computer Science 2023-04-25 Attila László Nagy , Goitom Simret Kidane , Tamás Turányi , János Tóth

In science and engineering, intelligent processing of complex signals such as images, sound or language is often performed by a parameterized hierarchy of nonlinear processing layers, sometimes biologically inspired. Hierarchical systems…

Machine Learning · Computer Science 2012-12-27 Miguel Á. Carreira-Perpiñán , Weiran Wang

We consider channel coding for Gaussian channels with the recently introduced mean and variance cost constraints. Through matching converse and achievability bounds, we characterize the optimal first- and second-order performance. The main…

Information Theory · Computer Science 2025-09-15 Adeel Mahmood , Aaron B. Wagner

In this paper a novel family of codes for modified spectral-amplitude-coding optical code division multiple access (SAC-OCDMA) is introduced. The proposed codes exist for more number of processing gains comparing to the previously reported…

Information Theory · Computer Science 2010-09-24 Mohammad Noshad , Kambiz Jamshidi

We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forward strategy, the relay computes a function of the two…

Information Theory · Computer Science 2016-11-15 Shashank Vatedka , Navin Kashyap , Andrew Thangaraj

We give optimally fast $O(\log p)$ time (per processor) algorithms for computing round-optimal broadcast schedules for message-passing parallel computing systems. This affirmatively answers the questions posed in Tr\"aff (2022). The problem…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-04-03 Jesper Larsson Träff

We consider the problem of distributed joint source-channel coding of correlated Gaussian sources over a Gaussian Multiple Access Channel (GMAC). There may be side information at the decoder and/or at the encoders. First we specialize a…

Information Theory · Computer Science 2009-05-15 R Rajesh , Vinod Sharma

The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random…

Information Theory · Computer Science 2018-10-30 Pinar Sen , Sung Hoon Lim , Young-Han Kim

Stochastic computing (SC) is an emerging computing technique that promises high density, low power, and error tolerant solutions. In SC, values are encoded as unary bitstreams and SC arithmetic circuits operate on one or more bitstreams. In…

Signal Processing · Electrical Eng. & Systems 2018-03-14 Vincent T. Lee , Armin Alaghi , Luis Ceze

Over-the-air computation (AirComp) has emerged as a promising technology that enables simultaneous transmission and computation through wireless channels. In this paper, we investigate the networked AirComp in multiple clusters allowing…

Signal Processing · Electrical Eng. & Systems 2025-05-19 Xiao Tang , Huirong Xiao , Chao Shen , Li Sun , Qinghe Du , Dusit Niyato , Zhu Han

Recently, the ChannelComp framework has proposed digital over-the-air computation by designing digital modulations that enable the computation of arbitrary functions. Unlike traditional analog over-the-air computation, which is restricted…

Machine Learning · Computer Science 2026-02-03 Saeed Razavikia , José Mairton Barros Da Silva Junior , Carlo Fischione

Departing from the classic paradigm of data-centric designs, the 6G networks for supporting edge AI features task-oriented techniques that focus on effective and efficient execution of AI task. Targeting end-to-end system performance, such…

Information Theory · Computer Science 2022-11-03 Dingzhu Wen , Xiang Jiao , Peixi Liu , Guangxu Zhu , Yuanming Shi , Kaibin Huang

Consider a multi-cell mobile edge computing network, in which each user wishes to compute the product of a user-generated data matrix with a network-stored matrix. This is done through task offloading by means of input uploading,…

Information Theory · Computer Science 2021-01-19 Kuikui Li , Meixia Tao , Jingjing Zhang , Osvaldo Simeone

We consider collocated wireless sensor networks, where each node has a Boolean measurement and the goal is to compute a given Boolean function of these measurements. We first consider the worst case setting and study optimal block…

Information Theory · Computer Science 2011-05-09 Hemant Kowshik , P. R. Kumar

We consider in-network computation of MAX in a structure-free random multihop wireless network. Nodes do not know their relative or absolute locations and use the Aloha MAC protocol. For one-shot computation, we describe a protocol in which…

Information Theory · Computer Science 2008-05-06 Sudeep Kamath , D. Manjunath

This paper investigates the performance of open-loop multi-antenna point-to-point links in ad hoc networks with slotted ALOHA medium access control (MAC). We consider spatial multiplexing transmission with linear maximum ratio combining and…

Information Theory · Computer Science 2016-11-18 Raymond H. Y. Louie , Matthew R. McKay , Iain B. Collings

We present a new family of signal constellations, called log constellations, that can be used to design near-capacity coded modulation schemes over additive exponential noise (AEN) channels. Log constellations are designed by geometrically…

Information Theory · Computer Science 2011-11-29 Stéphane Y. Le Goff

Constellation Constrained (CC) capacity regions of two-user Gaussian Multiple Access Channels (GMAC) have been recently reported, wherein an appropriate angle of rotation between the constellations of the two users is shown to enlarge the…

Information Theory · Computer Science 2016-11-15 J. Harshan , B. Sundar Rajan

This paper investigates guesswork over ordered statistics and formulates the achievable guesswork complexity of ordered statistics decoding (OSD) in binary additive white Gaussian noise (AWGN) channels. The achievable guesswork complexity…

Information Theory · Computer Science 2024-12-18 Chentao Yue , Changyang She , Branka Vucetic , Yonghui Li