Alapfogalmak
The proposed integrated decoding algorithm leverages matrix information geometry to simultaneously detect and stitch codewords in each sub-slot, enabling timely recovery of original messages in massive uncoupled unsourced random access for 6G wireless networks.
Kivonat
The paper presents an efficient integrated decoding algorithm for massive uncoupled unsourced random access (UURA) in 6G wireless networks. The key highlights are:
-
A UURA framework is established that enables immediate decoding, where each sub-message within a sub-slot is detected and stitched simultaneously upon arrival at the receiver, eliminating the need to wait for the complete message before decoding begins.
-
An integrated decoding algorithm is designed by leveraging matrix information geometry (MIG) theory. MIG is used to efficiently measure the geometric similarities between codeword covariance matrices, facilitating the simultaneous detection and stitching of codewords in each sub-slot.
-
The computational complexity and convergence rate of the proposed MIG-aided integrated decoding-based UURA scheme are analyzed, validating its feasibility and effectiveness.
-
Extensive simulations are presented to demonstrate the performance advantages of the proposed scheme over existing UURA and coupled URA schemes in terms of processing latency and computational complexity.
Statisztikák
The paper provides the following key figures and metrics:
The received signal model in the l-th sub-slot is given by Yl = CΓ1/2
l
e
Hl + Wl, where C is the codebook matrix, Γl is the codeword activity matrix, e
Hl has i.i.d. entries following CN(0, 1), and Wl is the additive white Gaussian noise.
The codeword covariance matrix is Rl
j = γj,lI, where γj,l represents the activity of the j-th codeword in the l-th sub-slot.
The computational complexity of the proposed UURA-ID scheme is O(n2
0ML + Titer(L −1)(n2
0 + K2
a)), where n0 is the codeword length, L is the number of sub-slots, Titer is the maximum number of iterations, and Ka is the number of active user equipments.
Idézetek
"The proposed integrated decoding algorithm leverages matrix information geometry to simultaneously detect and stitching codewords in each sub-slot, enabling timely recovery of original messages in massive uncoupled unsourced random access for 6G wireless networks."
"The computational complexity of the proposed UURA-ID scheme is superior to the existing CURA and UURA-SD schemes, as it does not depend on the number of potential user equipments."