Collision resolution for random access

buir.contributor.authorKazemi, Muhammad
buir.contributor.authorDuman, Tolga M.
buir.contributor.orcidDuman, Tolga M.|0000-0002-5187-8660
dc.contributor.authorKazemi, Muhammad
dc.contributor.authorDuman, Tolga M.
dc.date.accessioned2022-02-05T11:29:06Z
dc.date.available2022-02-05T11:29:06Z
dc.date.issued2021-10-28
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description( Early Access )en_US
dc.description.abstractAs a building block toward a simple and scalable solution for massive random access, we introduce collision-resolution algorithms using successive interference cancellation (SIC) based on the received signals, with no need for any coordination or codebook differentiation. We first consider two-user multiple access with the ZigZag algorithm. We prove that the original ZigZag and a modified version of it, called double-zipper ZigZag, attain the same performance as the optimal coordinated time-sharing in the high signal to noise ratio (SNR) regime, even in the presence of channel state information (CSI) errors. We then extend the results to the case of arbitrary number of users employing delay-domain processing. Specifically, we introduce delay-domain zero forcing and its regularized version, which are able to cancel and suppress the interference among users, respectively. By obtaining a post-processing system model and characterizing the accumulated noise during the decoupling process, we also derive bounds on the achievable sum-rates of the proposed algorithm for both cases of perfect and imperfect CSI. Simulation results show that the newly proposed approach have comparable performance with coordinated time-sharing at high SNRs.en_US
dc.description.provenanceSubmitted by Evrim Ergin (eergin@bilkent.edu.tr) on 2022-02-05T11:29:06Z No. of bitstreams: 1 Collision_resolution_for_random_access.pdf: 5481532 bytes, checksum: d9b544225bedd9061c973be7cc2436f4 (MD5)en
dc.description.provenanceMade available in DSpace on 2022-02-05T11:29:06Z (GMT). No. of bitstreams: 1 Collision_resolution_for_random_access.pdf: 5481532 bytes, checksum: d9b544225bedd9061c973be7cc2436f4 (MD5) Previous issue date: 2021-10-28en
dc.identifier.doi10.1109/TWC.2021.3122016en_US
dc.identifier.eissn1558-2248
dc.identifier.issn1536-1276
dc.identifier.urihttp://hdl.handle.net/11693/77092
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttps://doi.org/10.1109/TWC.2021.3122016en_US
dc.source.titleIEEE Transactions on Wireless Communicationsen_US
dc.subjectZigZag algorithmen_US
dc.subjectCollision resolutionen_US
dc.subjectInterference cancellationen_US
dc.subjectDelay domain processingen_US
dc.subjectMassive random accessen_US
dc.titleCollision resolution for random accessen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Collision_resolution_for_random_access.pdf
Size:
5.23 MB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description: