Optimized Spreading Sequences and Multi-Stage Receiver for Lattice-Code Multiple-Access

It was shown that by operating over the integer linear combinations (ILCs) of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> users’ messages, lattice-code based multiple-access (LCMA) offers increased system load and improved error-rate performance over non-lattice based schemes. This paper advances the existing LCMA system in two aspects. 1) We formulate the spreading sequences optimization problem based on the achievable symmetric rate of LCMA. To solve this problem, we develop three new methods, namely target-switching steepest descent (TS-SD), particle swarm (PS) optimization, and Hadamard concatenation (HC). The TS-SD method always targets on the ILC with the lowest computation rate in the SD process. The PS method treats the spreading matrix as a particle and iteratively updates a swamp of particles’ positions and velocities, based on the relative distance to the best position that are currently known. To further reduce the complexity, we first obtain a solution in a lower dimension, and then apply Hadamard concatenation (HC) which yields a solution for the required dimension. The PS and HC methods are shown to approach the capacity of the MA channel. 2) We put forth a new multi-stage LCMA receiver. In each stage, the receiver attempts to compute as many ILCs as possible. Then, from these ILCs, generalized matrix inversion (GMI) is introduced to recover a subset of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> users’ messages. These recovered messages are cancelled from the original received signal, yielding an equivalent system with less users for the next stage. Such operation continues successively until all <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> users’ messages are recovered. System loads of up to 400% and near capacity performance are demonstrated for various MA models.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Wireless Communications
Published
2025-05-20
DOI
https://doi.org/10.1109/twc.2025.3569308
Citations
1
Primary Topic
Advanced Wireless Communication Techniques
Type
article
Field-Weighted Citation Impact
0.73

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimized Spreading Sequences and Multi-Stage Receiver for Lattice-Code Multiple-Access

Lawrence Ong, Tao Yang, Rongke Liu, Jinsong Wang et al.
1 citations
IEEE Transactions on Wireless Communications
Advanced Wireless Communication Techniques
0.73
article

Optimized Spreading Sequences and Multi-Stage Receiver for Lattice-Code Multiple-Access

Lawrence Ong, Tao Yang, Rongke Liu, Jinsong Wang, Yuyang Yin
article en
1 citations

Abstract

It was shown that by operating over the integer linear combinations (ILCs) of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> users’ messages, lattice-code based multiple-access (LCMA) offers increased system load and improved error-rate performance over non-lattice based schemes. This paper advances the existing LCMA system in two aspects. 1) We formulate the spreading sequences optimization problem based on the achievable symmetric rate of LCMA. To solve this problem, we develop three new methods, namely target-switching steepest descent (TS-SD), particle swarm (PS) optimization, and Hadamard concatenation (HC). The TS-SD method always targets on the ILC with the lowest computation rate in the SD process. The PS method treats the spreading matrix as a particle and iteratively updates a swamp of particles’ positions and velocities, based on the relative distance to the best position that are currently known. To further reduce the complexity, we first obtain a solution in a lower dimension, and then apply Hadamard concatenation (HC) which yields a solution for the required dimension. The PS and HC methods are shown to approach the capacity of the MA channel. 2) We put forth a new multi-stage LCMA receiver. In each stage, the receiver attempts to compute as many ILCs as possible. Then, from these ILCs, generalized matrix inversion (GMI) is introduced to recover a subset of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> users’ messages. These recovered messages are cancelled from the original received signal, yielding an equivalent system with less users for the next stage. Such operation continues successively until all <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</i> users’ messages are recovered. System loads of up to 400% and near capacity performance are demonstrated for various MA models.

IEEE Transactions on Wireless CommunicationsVol. 24(10)
University of Newcastle Australia (AU), Beihang University (CN)
National Natural Science Foundation of China, Australian Research Council
Openalex Percentile: Top 28%
Advanced Wireless Communication Techniques
0.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.