English
Related papers

Related papers: Multiple Access Analog Fountain Codes

200 papers

This work studies point-to-point, multiple access, and random access lossless source coding in the finite-blocklength regime. In each scenario, a random coding technique is developed and used to analyze third-order coding performance.…

Information Theory · Computer Science 2020-10-13 Shuqing Chen , Michelle Effros , Victoria Kostina

We propose a novel multipath multi-hop adaptive and causal random linear network coding (AC-RLNC) algorithm with forward error correction. This algorithm generalizes our joint optimization coding solution for point-to-point communication…

Information Theory · Computer Science 2020-10-27 Alejandro Cohen , Guillaume Thiran , Vered Bar Bracha , Muriel Médard

With the emergence of machine-driven communi- cation, there is a renewed interest in the design of random multiple access schemes for networks with large number of active devices. Many of the recently proposed access paradigms are…

Information Theory · Computer Science 2018-01-12 Arman Hasanzadeh , Jean-Francois Chamberland , Krishna Narayanan

A multiple access relay channel (MARC) is considered in which an analogue-like network coding is implemented in the relay node. This analogue coding is a simple addition of the received signals at the relay node. Using "nulling detection"…

Information Theory · Computer Science 2013-03-05 Mohammad Shahrokh Esfahani , Masoumeh Nasiri-Kenari

In this paper, we present new achievability bounds on the maximal achievable rate of variable-length stop-feedback (VLSF) codes operating over a binary erasure channel (BEC) at a fixed message size $M = 2^k$. We provide new bounds for VLSF…

Information Theory · Computer Science 2023-07-31 Hengjie Yang , Richard D. Wesel

This paper proposes a fountain coding system which has lower space decoding complexity and lower decoding erasure rate than the Raptor coding systems. The main idea of the proposed fountain code is employing shift and exclusive OR to…

Information Theory · Computer Science 2017-08-30 Takayuki Nozaki

A new achievable rate for bit-metric decoding (BMD) is derived using random coding arguments. The rate expression can be evaluated for any input distribution, and in particular the bit-levels of binary input labels can be stochastically…

Information Theory · Computer Science 2016-05-31 Georg Böcherer

This paper proposes a heterogenous density fusion approach to scalable multisensor multitarget tracking where the inter-connected sensors run different types of random finite set (RFS) filters according to their respective capacity and…

Systems and Control · Electrical Eng. & Systems 2025-02-25 Tiancheng Li , Ruibo Yan , Kai Da , Hongqi Fan

The flexibility and reconfigurability at the radio frequency (RF) front-end offered by the fluid antenna system (FAS) make this technology promising for providing remarkable diversity gains in networks with small and constrained devices.…

This paper proposes a novel scheme, based on progressive fountain codes, for broadcasting JPEG 2000 multimedia. In such a broadcast scheme, progressive resolution levels of images/video have been unequally protected when transmitted using…

Information Theory · Computer Science 2017-08-16 Zhao Chen , Mai Xu , Luiguo Yin , Jianhua Lu

We propose a novel distributed random access scheme for wireless networks based on slotted ALOHA, motivated by the analogies between successive interference cancellation and iterative belief-propagation decoding on erasure channels. The…

Information Theory · Computer Science 2016-11-15 Cedomir Stefanovic , Petar Popovski , Dejan Vukobratovic

This letter proposes a novel hybrid automatic repeat request with chase combining assisted sparse code multiple access (HARQ-CC-SCMA) scheme. Depending on whether the same superimposed packet are retransmitted, synchronous and asynchronous…

Information Theory · Computer Science 2024-04-16 Man Wang , Zheng Shi , Yunfei Li , Xianda Wu , Weiqiang Tan , Xinrong Ye

Fluid antenna enables position reconfigurability that gives transceiver access to a high-resolution spatial signal and the ability to avoid interference through the ups and downs of fading channels. Previous studies investigated this fluid…

Signal Processing · Electrical Eng. & Systems 2025-04-30 Tianyu Han , Yongxu Zhu , Kai-Kit Wong , Gan Zheng , Hyundong Shin

In this paper, a random access scheme is introduced which relies on the combination of packet erasure correcting codes and successive interference cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph representation…

Information Theory · Computer Science 2016-11-15 Enrico Paolini , Gianluigi Liva , Marco Chiani

This work focuses on studying the half-duplex (HD) relaying in the Multiple Access Relay Channel (MARC) and the Compound Multiple Access Channel with a Relay (cMACr). A generalized Quantize-and-Forward (GQF) has been proposed to establish…

Information Theory · Computer Science 2014-01-15 Ming Lei , Mohammad Reza Soleymani

We study a two-user state-dependent generalized multiple-access channel (GMAC) with correlated states. It is assumed that each encoder has \emph{noncausal} access to channel state information (CSI). We develop an achievable rate region by…

Information Theory · Computer Science 2014-09-09 Mohammad Javad Emadi , Majid Nasiri Khormuji , Mikael Skoglund , Mohammad Reza Aref

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

Information Theory · Computer Science 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

A multi-antenna broadcast channel scenario is considered where a base station delivers contents to cache-enabled user terminals. A joint design of coded caching (CC) and multigroup multicast beamforming is proposed to benefit from spatial…

Information Theory · Computer Science 2020-01-03 Antti Tölli , Seyed Pooya Shariatpanahi , Jarkko Kaleva , Babak Khalaj

Compute-forward multiple access (CFMA) is a multiple access transmission scheme based on Compute-and-Forward (CF) which allows the receiver to first decode linear combinations of the transmitted signals and then solve for individual…

Information Theory · Computer Science 2023-05-29 Lanwei Zhang , Jamie Evans , Jingge Zhu

In this paper, we investigate achievable rates on the multiple access channel with feedback and correlated sources (MACFCS). The motivation for studying the MACFCS stems from the fact that in a sensor network, sensors collect and transmit…

Information Theory · Computer Science 2010-04-15 Lawrence Ong , Mehul Motani
‹ Prev 1 3 4 5 6 7 10 Next ›