Related papers: Enabling Sphere Decoding for SCMA
Carrier Sense Multiple Access (CSMA) MAC protocols are known to suffer from the hidden station (HS) problem. The complete mathematical analysis of CSMA networks with HSs is still an open problem, even for broadcast communication with a…
Ultra-reliable low-latency communications (URLLC) operate with short packets, where finite-blocklength effects make near-maximum-likelihood (near-ML) decoding desirable but often too costly. This paper proposes a two-stage near-ML decoding…
Low-density parity-check (LDPC) codes together with belief propagation (BP) decoding yield exceptional error correction capabilities in the large block length regime. Yet, there remains a gap between BP decoding and maximum likelihood…
Sparse code multiple access (SCMA) is a promising technique for the enabling of massive connectivity in future machine-type communication networks, but it suffers from a limited diversity order which is a bottleneck for significant…
Millimeter wave multiple-input multiple-output (MIMO) communication systems must operate over sparse wireless links and will require large antenna arrays to provide high throughput. To achieve sufficient array gains, these systems must…
Link adaptation is a crucial part of many modern communications systems, allowing the system to adapt the transmission and reception strategies to changes in channel conditions. One of the fundamental components of the link adaptation…
We derive a sphere-packing error exponent for coded transmission over discrete memoryless channels with a fixed decoding metric. By studying the error probability of the code over an auxiliary channel, we find a lower bound to the…
We introduce the spanning tree matching (STM) decoder for surface codes, which guarantees the error correction capability up to the code's designed distance by first employing an instance of the minimum spanning tree on a subset of ancilla…
In this paper, a multipath component aggregation (MCA) mechanism is introduced for spatial scattering modulation (SSM) to overcome the limitation in conventional SSM that the transmit antenna array steers the beam to a single multipath (MP)…
Speculative Decoding (SD) is a technique to accelerate the inference of Large Language Models (LLMs) by using a lower complexity draft model to propose candidate tokens verified by a larger target model. To further improve efficiency,…
This letter proposes a novel method for accelerating iterative detection for spatially coupled (SC) systems. An SC system is constructed by one-dimensional coupling of many subsystems, which are classified into training and propagation…
The detection and characterization of filamentary structures in the cosmic web allows cosmologists to constrain parameters that dictates the evolution of the Universe. While many filament estimators have been proposed, they generally lack…
Precoding for multiple-input, multiple-output (MIMO) antenna systems is considered with perfect channel knowledge available at both the transmitter and the receiver. For 2 transmit antennas and QAM constellations, an approximately optimal…
Reed-Solomon (RS) codes are widely used to correct errors in storage systems. Finding the error locator polynomial is one of the key steps in the error correction procedure of RS codes. Modular Approach (MA) is an effective algorithm for…
We study the problem of finding structured low-rank matrices using nuclear norm regularization where the structure is encoded by a linear map. In contrast to most known approaches for linearly structured rank minimization, we do not (a) use…
We propose several differential decoding schemes for asynchronous multi-user MIMO systems based on orthogonal space-time block codes (OSTBCs) where neither the transmitters nor the receiver has knowledge of the channel. First, we derive…
The new generation of telecommunication systems must provide acceptable data rates and spectral efficiency for new applications. Recently massive MIMO has been introduced as a key technique for the new generation of telecommunication…
This paper presents novel adaptive space-time reduced-rank interference suppression least squares algorithms based on joint iterative optimization of parameter vectors. The proposed space-time reduced-rank scheme consists of a joint…
Recently, a new class of binary codes for overloaded CDMA systems are proposed that not only has the ability of errorless communication but also suitable for detecting active users. These codes are called COWDA [1]. In [1], a Maximum…
We consider $N$-way data arrays and low-rank tensor factorizations where the time mode is coded as a sparse linear combination of temporal elements from an over-complete library. Our method, Shape Constrained Tensor Decomposition (SCTD) is…