.png){kind=icon}
.png){kind=icon}
Return
ReedMuller Sequence-Enabled Low-Complexity Index Redefinition-Based Sparse Vector Coding
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2026.3674355.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sparse vector coding (SVC) has attracted considerable attention for ultra-reliable and low-latency communications due to its excellent block error rate performance. However, conventional SVC schemes suffer from high lookup-table and storage complexity when the number of information bits increases. In this letter, a low-complexity index redefinition-based SVC scheme aided by Reed-Muller (RM) sequences is proposed. By mapping the transmitted binary information bits to the generation parameters of RM sequences, the index tables storing the information about non-zero elements in the sparse vector are no longer required. Moreover, exploiting the algebraic structure of RM sequences eliminates the need for the entire measurement matrix in the multi-path matching pursuit algorithm, significantly reducing the storage overhead. Simulation results show that the proposed scheme achieves nearly identical block error rate performance to existing index redefinition-based SVC schemes, and even slightly outperforms when the information payload approaches the maximum supported by the RM-IRSVC structure.
Keywords:
Vectors
Static VAr compensators
Indexes
Symbols
Quadrature amplitude modulation
Encoding
Sparse matrices
Payloads
Maximum likelihood decoding
Simulation
Index redefinition
compressed sensing
multi-path matching
sparse vector coding
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
No organization information available