⚡ electrical engineering

Dual-Mapping Sparse Vector Transmission for Short Packet URLLC

This paper proposes a dual-mapping sparse vector coding (DM-SVC) scheme for short-packet URLLC that enhances transmission performance by utilizing block and single-element sparse mappings to concentrate power and control code length, coupled with a two-stage decoding algorithm that achieves superior block error rate and spectral efficiency compared to existing methods.

Original authors: Yanfeng Zhang, Xu Zhu, Jinkai Zheng, Weiwei Yang, Xianhua Yu, Haiyong Zeng, Yujie Liu, Yong Liang Guan

Published 2026-01-23

📖 4 min read☕ Coffee break read

CC BY 4.0

Original authors: Yanfeng Zhang, Xu Zhu, Jinkai Zheng, Weiwei Yang, Xianhua Yu, Haiyong Zeng, Yujie Liu, Yong Liang Guan

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to send a very short, urgent message (like "Stop!" or "Go!") across a noisy radio channel. In the world of next-generation communication (called URLLC), speed and reliability are everything. If the message is too long, it takes too much time to send and check for errors. But if it's too short, standard methods often fail to get the message through clearly.

This paper introduces a new way to send these short messages called Dual-Mapping Sparse Vector Transmission (DM-SVC). Think of it as a smarter, more organized way to pack and send your data.

Here is how it works, using simple analogies:

1. The Problem: The "Messy Room" vs. The "Organized Box"

Traditional methods for sending short messages are a bit like throwing a bunch of items into a large, empty warehouse and hoping the receiver can find them. They spread the information out randomly. While this works okay, it wastes space and makes it hard to find the important parts quickly.

2. The Solution: The "Dual-Mapping" Strategy

The authors propose a new system that uses two different ways to organize the data before sending it. Imagine you have a large grid of mailboxes (the "sparse vector").

Method A: The "Block" Strategy (The Heavy Hitters)
Instead of putting just one letter in a random mailbox, this method puts a whole stack of letters into a specific group of mailboxes.
- The Analogy: Think of this as sending a heavy, concentrated package. Because the energy (power) is focused on a small group of mailboxes, it's very loud and easy to hear. This helps the receiver quickly spot where the important groups are, even in a noisy room.
- The Benefit: It improves the accuracy of finding the message.
Method B: The "Single" Strategy (The Light Touch)
This method puts single letters into individual mailboxes scattered around the rest of the grid.
- The Analogy: This is like sending a few extra notes to fill in the details.
- The Benefit: It ensures the message doesn't get too long or complicated just because you have more information to send. It keeps the system efficient.

The "Dual" Part: The system mixes these two methods together. It sends some data as concentrated "blocks" and some as "single items." This combination allows them to pack more information into the same space (higher efficiency) without losing reliability.

3. The Receiver: The "Two-Stage Detective"

When the message arrives, the receiver has to figure out which mailboxes contain the letters. The paper proposes a special two-stage detective algorithm to do this:

Stage 1: Find the Blocks First.
The detective looks for the loud, concentrated "blocks" first. Because the system put extra power into these blocks, they stand out clearly against the background noise. The detective identifies these groups immediately.
- Why this helps: Once the big blocks are found and "removed" from the picture, the noise they caused is gone.
Stage 2: Find the Singles.
Now that the big blocks are accounted for, the detective looks for the quieter, single letters. Because the interference from the blocks is gone, it's much easier to find these smaller details.
- The Result: This step-by-step approach is much more accurate than trying to find everything at once.

4. The Results: Faster and More Reliable

The authors ran many computer simulations to test this new system against existing methods. They found that:

Better Accuracy: The new system makes fewer mistakes (lower error rate) than the old methods.
Better Efficiency: It can send more information using the same amount of radio frequency space (higher spectral efficiency).
Power Balance: They found that giving about 64% of the power to the "blocks" and the rest to the "singles" works best.

Summary

In short, this paper suggests a new way to send short, urgent messages by organizing them into concentrated groups and individual items. By using a two-step listening process (finding the loud groups first, then the quiet items), the system becomes much better at hearing the message clearly, even when the connection is noisy or the message is very short. This makes it ideal for future technologies like self-driving cars and remote robots that need instant, reliable communication.

Technical Summary: Dual-Mapping Sparse Vector Transmission for Short Packet URLLC

Problem Statement
Ultra-Reliable Low Latency Communication (URLLC) is critical for latency-sensitive applications such as autonomous driving and IoT. However, traditional long-packet transmission paradigms struggle in these scenarios due to high signaling overhead and the inability of existing channel codes (like LDPC and Polar codes) to maintain reliability with short block lengths. While Sparse Vector Coding (SVC) has emerged as a promising alternative by mapping information bits to the non-zero indexes of sparse vectors, existing SVC variants primarily rely on single-element sparse mapping patterns. These schemes often face a trade-off: they either require significant Time-Frequency (TF) resources to ensure reliability or fail to fully exploit the structural properties of sparse vectors to improve spectral efficiency (SE). Furthermore, existing decoding algorithms, such as Approximate Message Passing (AMP) and Multipath Matching Pursuit (MMP), often overlook the specific block-structured prior information inherent in certain sparse vector distributions, limiting their decoding accuracy.

Methodology
The paper proposes a Dual-Mapping Sparse Vector Coding (DM-SVC) scheme designed to enhance short-packet transmission performance in URLLC. The methodology consists of three main components:

Dual Sparse Mapping Pattern:
Unlike conventional SVC which maps bits solely to single non-zero elements, DM-SVC utilizes two distinct mapping patterns:
- Block Sparse Mapping: A portion of information bits ( $b_{I,1}$ ) is mapped to the indexes of $K_b$ non-zero blocks, each of length $L$ . This concentrates transmit power into a small number of blocks.
- Single-Element Sparse Mapping: The remaining information bits ( $b_{I,2}$ ) are mapped to $K_s$ individual non-zero element indexes.
- Merging and Modulation: These two sparse vectors are merged with a power allocation ratio $\alpha$ . The non-zero elements (both block and single) are then modulated using QAM symbols ( $b_S$ bits). Guard positions are inserted between blocks to prevent index overlap.
Random Spreading and Transmission:
The resulting sparse vector is spread using a codebook matrix composed of pseudo-random codewords (Bernoulli distributed $\pm 1$ ). The spread sequence is transformed to the time domain via IDFT, a cyclic prefix is added, and the signal is transmitted over the TF domain.
Two-Stage Decoding Algorithm:
To recover the information, the receiver employs a sequential two-stage decoding process that leverages the block-structured prior information:
- Stage I (Block Identification): The algorithm sequentially identifies the indexes of the $K_b$ non-zero blocks. It utilizes a cyclic shift property of the measurement matrix to calculate block correlation values, identifying the block index and the specific cyclic shift that maximizes the correlation with the residual signal. This stage estimates the non-zero values within the identified blocks and performs interference cancellation.
- Stage II (Element Identification): After removing the interference from the identified blocks, the algorithm uses the existing Multipath Matching Pursuit (MMP) algorithm to identify the $K_s$ single-element non-zero indexes and estimate their values.

Key Contributions

Introduction of Dual Mapping: This work is the first to introduce two sparse mapping patterns (block and single-element) within an SVC framework. This approach aims to improve Spectral Efficiency (SE) by reducing the number of TF resources required for transmission compared to schemes using only single-element mapping, while ensuring code length does not increase dramatically with information bits.
Block-Aware Two-Stage Decoding: The paper proposes a novel decoding algorithm that exploits the block-structured sparsity of the signal. By sequentially identifying non-zero blocks before single elements, the algorithm achieves higher identification accuracy compared to standard AMP or MMP algorithms that treat sparsity as unstructured.
Performance Analysis: Theoretical analysis and simulations demonstrate that the DM-SVC scheme requires fewer subcarriers to achieve the same reliability as traditional schemes, leading to higher SE.

Simulation Results
Extensive simulations were conducted to evaluate the Block Error Rate (BLER) and Spectral Efficiency of the proposed scheme against existing methods (SVC, ESVC, SSC, GSPARC, and BOSS):

Spectral Efficiency: The DM-SVC scheme demonstrated a significant SE improvement over the Sparse Superimposed Codes (SSC) scheme. Specifically, improvements of over 12% and 14% were observed for QPSK and 16-QAM modulations, respectively. Under specific parameters ( $K_b=1, L=5, K_s=1$ ), a two-fold SE improvement was achieved for 16-QAM.
Reliability (BLER): At a target BLER of $10^{-5}$ , the DM-SVC scheme achieved an SNR gain of approximately 0.5 dB compared to the GSPARC scheme. It consistently outperformed SVC, ESVC, SSC, GSPARC, and BOSS schemes across various SNR levels.
Decoding Performance: The proposed two-stage decoding algorithm outperformed existing AMP, MMP, and OMP algorithms. The performance gain is attributed to the accurate identification of non-zero block indexes in the first stage, which reduces interference for the subsequent single-element detection.
Power Allocation: The optimal power allocation ratio ( $\alpha$ ) for the block sparse component was found to be approximately 0.64, indicating that allocating more power to block identification is crucial for overall decoding performance.

Significance and Claims
The paper claims that the proposed DM-SVC scheme effectively addresses the limitations of existing short-packet transmission methods by utilizing multiple sparse mapping patterns to enhance both Spectral Efficiency and reliability. By integrating block-structured prior information into the decoding process, the scheme achieves superior Block Error Rate performance compared to state-of-the-art sparse coding techniques. The authors position this work as a critical step toward designing more efficient transmission methods for URLLC scenarios, offering a flexible framework where parameters like block length ( $L$ ) and the number of single elements ( $K_s$ ) can be adjusted to meet specific reliability and throughput requirements.

1. The Problem: The "Messy Room" vs. The "Organized Box"

2. The Solution: The "Dual-Mapping" Strategy

3. The Receiver: The "Two-Stage Detective"

4. The Results: Faster and More Reliable

Summary

More like this