Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Ebert, Jamison 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
In [1], the linked loop code (LLC) is presented as a promising code for the unsourced A-channel with erasures (UACE). The UACE is an unsourced multiple access channel in which active users' transmitted symbols are erased with a given probability and
Externí odkaz:
http://arxiv.org/abs/2406.08767
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
The A-channel is a noiseless multiple access channel in which users simultaneously transmit Q-ary symbols and the receiver observes the set of transmitted symbols, but not their multiplicities. An A-channel is said to be unsourced if, additionally, u
Externí odkaz:
http://arxiv.org/abs/2312.02160
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
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
Unsourced random access (URA) has emerged as a pragmatic framework for next-generation distributed sensor networks. Within URA, concatenated coding structures are often employed to ensure that the central base station can accurately recover the set o
Externí odkaz:
http://arxiv.org/abs/2112.00270
Autor:
Ebert, Jamison R., Amalladinne, Vamsi K., Rini, Stefano, Chamberland, Jean-Francois, Narayanan, Krishna R.
Unsourced random access is a novel communication paradigm designed for handling a large number of uncoordinated users that sporadically transmit very short messages. Under this model, coded compressed sensing (CCS) has emerged as a low-complexity sch
Externí odkaz:
http://arxiv.org/abs/2104.05686