Zobrazeno 1 - 10
of 256
pro vyhledávání: '"Narayanan, Krishna R."'
This article introduces a novel non-orthogonal multiple access (NOMA) scheme for coordinated uplink channels. The scheme builds on the recently proposed sparse-regression low-density parity-check (SR-LDPC) code, and extends the underlying notions to
Externí odkaz:
http://arxiv.org/abs/2408.11165
Novel sparse regression LDPC (SR-LDPC) codes exhibit excellent performance over additive white Gaussian noise (AWGN) channels in part due to their natural provision of shaping gains. Though SR-LDPC-like codes have been considered within the context o
Externí odkaz:
http://arxiv.org/abs/2402.06881
This article introduces a novel concatenated coding scheme called sparse regression LDPC (SR-LDPC) codes. An SR-LDPC code consists of an outer non-binary LDPC code and an inner sparse regression code (SPARC) whose respective field size and section si
Externí odkaz:
http://arxiv.org/abs/2311.07720
Cell-Free Massive MIMO systems aim to expand the coverage area of wireless networks by replacing a single high-performance Access Point (AP) with multiple small, distributed APs connected to a Central Processing Unit (CPU) through a fronthaul. Anothe
Externí odkaz:
http://arxiv.org/abs/2304.06105
We explore a scheme that enables the training of a deep neural network in a Federated Learning configuration over an additive white Gaussian noise channel. The goal is to create a low complexity, linear compression strategy, called PolarAir, that red
Externí odkaz:
http://arxiv.org/abs/2301.10110
Belief propagation applied to iterative decoding and sparse recovery through approximate message passing (AMP) are two research areas that have seen monumental progress in recent decades. Inspired by these advances, this article introduces sparse reg
Externí odkaz:
http://arxiv.org/abs/2301.01899
Unsourced random access (URA) has emerged as a candidate paradigm for massive machine-type communication (MTC) in next-generation wireless networks. While many excellent uplink schemes have been developed for URA, these schemes do not specify a mecha
Externí odkaz:
http://arxiv.org/abs/2206.01684
We introduce two generalizations to the paradigm of using Random Khatri-Rao Product (RKRP) codes for distributed matrix multiplication. We first introduce a class of codes called Sparse Random Khatri-Rao Product (SRKRP) codes which have sparse genera
Externí odkaz:
http://arxiv.org/abs/2205.06162
Autor:
Ebert, Jamison R., Amalladinne, Vamsi K., Rini, Stefano, Chamberland, Jean-Francois, Narayanan, Krishna R.
Publikováno v:
IEEE Transactions on Signal Processing, vol. 70, pp. 2972-2984, 2022
Unsourced random access (URA) is a recently proposed multiple access paradigm tailored to the uplink channel of machine-type communication networks. By exploiting a strong connection between URA and compressed sensing, the massive multiple access pro
Externí odkaz:
http://arxiv.org/abs/2203.00239
Group testing has recently attracted significant attention from the research community due to its applications in diagnostic virology. An instance of the group testing problem includes a ground set of individuals which includes a small subset of infe
Externí odkaz:
http://arxiv.org/abs/2202.12284