MIMO Unsourced Random Access in Frequency Selective Channels: Exploiting Delay-Angular SparsityVisa övriga samt affilieringar
2024 (Engelska)Ingår i: 2024 International Conference on Future Communications and Networks, FCN 2024 - Proceedings, Institute of Electrical and Electronics Engineers (IEEE) , 2024Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]
Unsourced random access (URA) has garnered substantial interest for its applicability in massive machine-type communication (mMTC) scenarios. This paper introduces a novel multiple-antenna URA system that incorporates orthogonal frequency division multiplexing (OFDM) in multiple-input multiple-output (MIMO) systems, specifically designed for frequency-selective fading channels by exploiting the delay-angular domain sparsity. Each user's data is partitioned into two segments, one conveyed through selected pilots and the other through the payload. Crucially, we deploy the vector approximate message passing (VAMP) algorithm to first reconstruct users' wireless channels within the delay-angular domain. An iterative detector is then employed to decode the payload. Simulation results clearly demonstrate the proposed scheme's enhanced performance, significantly outperforming existing systems in managing frequency-selective fading channels.
Ort, förlag, år, upplaga, sidor
Institute of Electrical and Electronics Engineers (IEEE) , 2024.
Nyckelord [en]
multiple-input multiple-output (MIMO), orthogonal frequency division multiplexing (OFDM), Unsourced random access (URA), vector approximate message passing (VAMP)
Nationell ämneskategori
Signalbehandling Telekommunikation Kommunikationssystem
Identifikatorer
URN: urn:nbn:se:kth:diva-364406DOI: 10.1109/FCN64323.2024.10984846Scopus ID: 2-s2.0-105007286156OAI: oai:DiVA.org:kth-364406DiVA, id: diva2:1968220
Konferens
2024 International Conference on Future Communications and Networks, FCN 2024, Valletta, Malta, November 18-22, 2024
Anmärkning
Part of ISBN 9798331512880
QC 20250615
2025-06-122025-06-122025-06-15Bibliografiskt granskad