English
Related papers

Related papers: Performance-Complexity-Latency Trade-offs of Conca…

200 papers

In this paper we propose a new construction method for rate-1 Fast-Group-Decodable (FGD) Space-Time-Block Codes (STBC)s for 2^a transmit antennas. We focus on the case of a=2 and we show that the new FGD rate-1 code has the lowest…

Information Theory · Computer Science 2016-11-17 Amr Ismail , Jocelyn Fiorina , Hikmet Sari

A class of rate-adaptive protograph MacKay-Neal (MN) codes is introduced and analyzed. The code construction employs an outer distribution matcher (DM) to adapt the rate of the scheme. The DM is coupled with an inner protograph-based…

Information Theory · Computer Science 2023-03-22 Ayman Zahr , Balazs Matuz , Gianluigi Liva

Efficient decoding is crucial to high-throughput and power-sensitive wireless communication scenarios. A theoretical analysis of the performance-complexity tradeoff toward low-complexity decoding is required for a better understanding of…

Information Theory · Computer Science 2025-11-12 Qingqing Peng , Dawei Yin , Dongxu Chang , Yuan Li , Huazi Zhang , Guiying Yan , Guanghui Wang

This paper designs a helper-assisted resource allocation strategy in non-orthogonal multiple access (NOMA)-enabled mobile edge computing (MEC) systems, in order to guarantee the quality of service (QoS) of the energy/delay-sensitive user…

Information Theory · Computer Science 2023-01-26 Mengmeng Ren , Long Yang , Hai Jiang , Jian Chen , Yuchen Zhou

Products codes (PCs) are conventionally decoded with efficient iterative bounded-distance decoding (iBDD) based on hard-decision channel outputs which entails a performance loss compared to a soft-decision decoder. Recently, several hybrid…

Information Theory · Computer Science 2022-11-22 Sisi Miao , Lukas Rapp , Laurent Schmalen

One popular approach to soft-decision decoding of Reed-Solomon (RS) codes is based on using multiple trials of a simple RS decoding algorithm in combination with erasing or flipping a set of symbols or bits in each trial. This paper…

Information Theory · Computer Science 2015-03-17 Phong S. Nguyen , Henry D. Pfister , Krishna R. Narayanan

Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate the tradeoff between reliability, throughput, and latency in the transmission of information over multiple-antenna Rayleigh…

Information Theory · Computer Science 2016-11-17 Giuseppe Durisi , Tobias Koch , Johan Östman , Yury Polyanskiy , Wei Yang

In this paper, we design the joint decoding (JD) of non-orthogonal multiple access (NOMA) systems employing short block length codes. We first proposed a low-complexity soft-output ordered-statistics decoding (LC-SOSD) based on a decoding…

In this paper, we analyze the coding delay and the average coding delay of random linear network codes (a.k.a. dense codes) and chunked codes (CC), which are an attractive alternative to dense codes due to their lower complexity, over line…

Information Theory · Computer Science 2012-07-26 Anoosheh Heidarzadeh , Amir H. Banihashemi

The majority of modern communication systems adopts quadrature amplitude modulation (QAM) constellations as transmission schemes. Due to their square structure, however, QAM do not provide satisfying protection to phase noise effects as the…

Information Theory · Computer Science 2018-12-07 Paul Ferrand , Marco Maso , Valerio Bioglio

In this work, the design of robust, protograph-based low-density parity-check (LDPC) codes for rate-adaptive communication via probabilistic shaping is considered. Recently, probabilistic amplitude shaping (PAS) by B\"ocherer et al. has…

Information Theory · Computer Science 2016-07-04 Fabian Steiner , Patrick Schulte

When solving the American options with or without dividends, numerical methods often obtain lower convergence rates if further treatment is not implemented even using high-order schemes. In this article, we present a fast and explicit…

Computational Finance · Quantitative Finance 2022-04-14 Chinonso Nwankwo , Weizhong Dai

The long-haul communication systems can offer ultra high-speed data transfer rates but suffer from burst errors. The high-rate and high-performance staircase codes provide an efficient way for long-haul transmission. The staircase coding…

Information Theory · Computer Science 2018-05-28 Bowen Feng , Jian Jiao , Liu Zhou , Shaohua Wu , Bin Cao , Qinyu Zhang

In this paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon codes offering both complexity and performance advantages over previously known decoding algorithms. Our algorithm is a list decoding algorithm which…

Information Theory · Computer Science 2014-11-17 Mostafa El-Khamy , Robert J. McEliece

Coded modulation with probabilistic amplitude shaping (PAS) is considered for intensity modulation/direct detection channels with a transmitter peak-power constraint. PAS is used to map bits to a uniform PAM-6 distribution and outperforms…

Information Theory · Computer Science 2021-04-30 Tobias Prinz , Thomas Wiegart , Daniel Plabst , Stefano Calabrò , Georg Böcherer , Nebojsa Stojanovic , Talha Rahman

Raptor codes are rateless codes that achieve the capacity on the binary erasure channels. However the maximum degree of optimal output degree distribution is unbounded. This leads to a computational complexity problem both at encoders and…

Information Theory · Computer Science 2013-02-07 Kosuke Sakata , Kenta Kasai , Kohichi Sakaniwa

The sparse Mixture-of-Experts (MoE) architecture is increasingly favored for scaling Large Language Models (LLMs) efficiently, but it depends on heterogeneous compute and memory resources. These factors jointly affect system Cost, Accuracy,…

The sparse Mixture-of-Experts (MoE) architecture is increasingly favored for scaling Large Language Models (LLMs) efficiently, but it depends on heterogeneous compute and memory resources. These factors jointly affect system Cost, Accuracy,…

This paper presents several new construction techniques for low-density parity-check (LDPC) and systematic repeat-accumulate (RA) codes. Based on specific classes of combinatorial designs, the improved code design focuses on high-rate…

Information Theory · Computer Science 2018-07-03 Alexander Gruner , Michael Huber

This work addresses the problem of deriving fundamental trade-off bounds for a 1-relay and a 2-relay wireless network when multiple performance criteria are of interest. It proposes a simple MultiObjective (MO) performance evaluation…

Networking and Internet Architecture · Computer Science 2012-11-15 Qi Wang , Katia Jaffrès-Runser , Claire Goursaud , Jean-Marie Gorce
‹ Prev 1 4 5 6 7 8 10 Next ›