Low-Complexity Memory AMP Detector for High-Mobility MIMO-OTFS SCMA Systems

March 15, 2023 Β· Declared Dead Β· πŸ› 2023 IEEE International Conference on Communications Workshops (ICC Workshops)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Yao Ge, Lei Liu, Shunqi Huang, David GonzΓ‘lez G., Yong Liang Guan, Zhi Ding arXiv ID 2303.08531 Category eess.SP: Signal Processing Cross-listed cs.IT Citations 33 Venue 2023 IEEE International Conference on Communications Workshops (ICC Workshops) Last Checked 6 months ago
Abstract
Efficient signal detectors are rather important yet challenging to achieve satisfactory performance for large-scale communication systems. This paper considers a non-orthogonal sparse code multiple access (SCMA) configuration for multiple-input multiple-output (MIMO) systems with recently proposed orthogonal time frequency space (OTFS) modulation. We develop a novel low-complexity yet effective customized Memory approximate message passing (AMP) algorithm for channel equalization and multi-user detection. Specifically, the proposed Memory AMP detector enjoys the sparsity of the channel matrix and only applies matrix-vector multiplications in each iteration for low-complexity. To alleviate the performance degradation caused by positive reinforcement problem in the iterative process, all the preceding messages are utilized to guarantee the orthogonality principle in Memory AMP detector. Simulation results are finally provided to illustrate the superiority of our Memory AMP detector over the existing solutions.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Signal Processing

Died the same way β€” πŸ‘» Ghosted