Publication:
Scaling Laws for Gaussian Random Many-Access Channels

Simple item page
dc.affiliation.dptoUC3M. Departamento de Teoría de la Señal y Comunicacioneses
dc.affiliation.grupoinvUC3M. Grupo de Investigación: Tratamiento de la Señal y Aprendizaje (GTSA)es
dc.contributor.authorRavikumaran Nair, Jithin
dc.contributor.authorKoch, Tobias Mirco
dc.contributor.funderEuropean Commissionen
dc.contributor.funderMinisterio de Ciencia e Innovación (España)es
dc.date.accessioned2022-03-30T11:39:12Z
dc.date.available2022-03-30T11:39:12Z
dc.date.issued2022-04
dc.descriptionAn earlier version of this paper was presented in part at the 2019 IEEE International Symposium on Information Theory [DOI: 10.1109/ISIT.2019.8849751], in part at the 2020 International Zurich Seminar on Information and Communication [DOI: 10.3929/ethz-b-000403243], and in part at the 2020 IEEE International Symposium on Information Theory [DOI: 10.1109/ISIT44484.2020.9174091].en
dc.description.abstractThis paper considers a Gaussian multiple-access channel with random user activity where the total number of users ℓn and the average number of active users kn may grow with the blocklength n . For this channel, it studies the maximum number of bits that can be transmitted reliably per unit-energy as a function of ℓn and kn . When all users are active with probability one, i.e., ℓn=kn , it is demonstrated that, if kn is of an order strictly below n/logn , then each user can achieve the single-user capacity per unit-energy (loge)/N0 (where N0/2 is the noise power) by using an orthogonal-access scheme. In contrast, if kn is of an order strictly above n/logn , then the users cannot achieve any positive rate per unit-energy. Consequently, there is a sharp transition between orders of growth where interference-free communication is feasible and orders of growth where reliable communication at a positive rate per unit-energy is infeasible. It is further demonstrated that orthogonal-access schemes in combination with orthogonal codebooks, which achieve the capacity per unit-energy when the number of users is bounded, can be strictly suboptimal. When the user activity is random, i.e., when ℓn and kn are different, it is demonstrated that, if knlogℓn is sublinear in n , then each user can achieve the single-user capacity per unit-energy (loge)/N0 . Conversely, if knlogℓn is superlinear in n , then the users cannot achieve any positive rate per unit-energy. Consequently, there is again a sharp transition between orders of growth where interference-free communication is feasible and orders of growth where reliable communication at a positive rate is infeasible that depends on the asymptotic behaviors of both ℓn and kn . It is further demonstrated that orthogonal-ac...en
dc.description.sponsorshipThe work of Jithin Ravi was supported by the European Research Council (ERC) under the European Union's Horizon 2020 Research and Innovation Program under Grant 714161. The work of Tobias Koch was supported in part by the European Research Council (ERC) under the European Union's Horizon 2020 Research and Innovation Program under Grant 714161; and in part by the Spanish Ministerio de Ciencia e Innovación under Grant RYC-2014-16332, Grant TEC2016-78434-C3-3-R (AEI/FEDER, EU), and Grant PID2020-116683GB-C21 / AEI / 10.13039/501100011033.en
dc.format.extent31es
dc.identifier.bibliographicCitationIEEE Transactions on Information Theory, 68(4), April 2022, Pp. 2429-2459en
dc.identifier.doihttps://doi.org/10.1109/TIT.2021.3139430
dc.identifier.issn0018-9448
dc.identifier.issn1557-9654 (online)
dc.identifier.publicationfirstpage2429es
dc.identifier.publicationissue4es
dc.identifier.publicationlastpage2459es
dc.identifier.publicationtitleIEEE TRANSACTIONS ON INFORMATION THEORYen
dc.identifier.publicationvolume68es
dc.identifier.urihttps://hdl.handle.net/10016/34495
dc.identifier.uxxiAR/0000029745
dc.language.isoengen
dc.publisherIEEEes
dc.relation.ispartofhttps://doi.org/10.1109/ISIT.2019.8849751
dc.relation.ispartofhttps://doi.org/10.3929/ethz-b-000403243
dc.relation.ispartofhttps://doi.org/10.1109/ISIT44484.2020.9174091
dc.relation.projectIDinfo:eu-repo/grantAgreement/EC/H2020/714161/LOLITAen
dc.relation.projectIDGobierno de España. RYC-2014-16332es
dc.relation.projectIDGobierno de España. TEC2016-78434-C3-3-Res
dc.relation.projectIDGobierno de España. PID2020-116683GB-C21es
dc.rights© 2021 IEEE.en
dc.rights.accessRightsopen accessen
dc.subject.ecienciaElectrónicaes
dc.subject.ecienciaTelecomunicacioneses
dc.subject.otherCapacity per unit-energyen
dc.subject.otherMany-access channelen
dc.subject.otherMultiple accessen
dc.subject.otherRandom accessen
dc.titleScaling Laws for Gaussian Random Many-Access Channelsen
dc.typeresearch article*
dc.type.hasVersionAM*
dspace.entity.typePublication
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
scaling_TIT_2022_ps.pdf
Size:
830.92 KB
Format:
Adobe Portable Document Format
Download
Collections
DTSC - GTSA - Artículos de Revistas
OpenAIRE: Open Access Infrastructure for Research in Europe