Efficient Concatenated Same Codebook Construction for the Random Access Gaussian MAC

In this paper, a low complexity scheme for unsourced random multiple access over the Gaussian channel is proposed. Following the literature by the word "unsourced" we mean the fact that the users use the same codebook codes. The proposed scheme is based on T-fold ALOHA with successive inte...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE Vehicular Technology Conference s. 1 - 5
Hlavní autori: Ustinova, Daria, Glebov, Anton, Rybin, Pavel, Frolov, Alexey
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.09.2019
Predmet:
Binary codes
Encoding
Iterative algorithms
Iterative decoding
Maximum likelihood decoding
ISSN:2577-2465
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In this paper, a low complexity scheme for unsourced random multiple access over the Gaussian channel is proposed. Following the literature by the word "unsourced" we mean the fact that the users use the same codebook codes. The proposed scheme is based on T-fold ALOHA with successive interference cancellation (SIC) procedure. In each slot, the same codebook concatenated code construction with outer non-binary (NB) low- density parity-check (LDPC) code and inner linear binary code is decoded with iterative joint decoding algorithm. Outer NB-LDPC code is decoded with low-complexity iterative q-ary sum-product algorithm (QSPA) and short inner binary code is decoded with maximum likelihood. Finally, the numerical results and comparison with theoretical bounds are represented.
AbstractList In this paper, a low complexity scheme for unsourced random multiple access over the Gaussian channel is proposed. Following the literature by the word "unsourced" we mean the fact that the users use the same codebook codes. The proposed scheme is based on T-fold ALOHA with successive interference cancellation (SIC) procedure. In each slot, the same codebook concatenated code construction with outer non-binary (NB) low- density parity-check (LDPC) code and inner linear binary code is decoded with iterative joint decoding algorithm. Outer NB-LDPC code is decoded with low-complexity iterative q-ary sum-product algorithm (QSPA) and short inner binary code is decoded with maximum likelihood. Finally, the numerical results and comparison with theoretical bounds are represented.
Author Ustinova, Daria
Rybin, Pavel
Glebov, Anton
Frolov, Alexey
Author_xml – sequence: 1
  givenname: Daria
  surname: Ustinova
  fullname: Ustinova, Daria
  organization: Skolkovo Institute of Science and Technology
– sequence: 2
  givenname: Anton
  surname: Glebov
  fullname: Glebov, Anton
  organization: Skolkovo Institute of Science and Technology
– sequence: 3
  givenname: Pavel
  surname: Rybin
  fullname: Rybin, Pavel
  organization: Skolkovo Institute of Science and Technology
– sequence: 4
  givenname: Alexey
  surname: Frolov
  fullname: Frolov, Alexey
  organization: Skolkovo Institute of Science and Technology
BookMark eNotkM1KAzEUhaMo2NY-gS7yAlPvzTSZzLIMrQoVQavbkp8bjLaJTKYL396KXRwOfAe-xRmzi5QTMXaLMEOE9u59063MbjcTgO1M6xal0mds2jYaG6ERhQB1zkZCNk0l5kpesXEpnwCAqMSIbZYhRBcpDbzLyZmB0jGev5o9HYknm_PX31SG_uCGmBMPuefDB_EXk3ze84VzVAq_N4dSokn8adFds8tgdoWmp56wt9Vy0z1U6-f7x26xrqKAeqjIYYvtPFgnGyGhISWDt9KjlxScBXDCQWuNstap2gpF1msi5RACaD2vJ-zm3xuJaPvdx73pf7anE-pfNH9UPg
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/VTCFall.2019.8891568
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781728112206
1728112206
EISSN 2577-2465
EndPage 5
ExternalDocumentID 8891568
Genre orig-research
GroupedDBID -~X
29I
6IE
6IH
AFFNX
AI.
ALMA_UNASSIGNED_HOLDINGS
CBEJK
RIE
RIO
RNS
VH1
ID FETCH-LOGICAL-i203t-ec19194fbc572507e65fdb5d1d5efcb00c2c09ba6bbc63b26ebd8ee6c10f08843
IEDL.DBID RIE
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000610542200506&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:43:54 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i203t-ec19194fbc572507e65fdb5d1d5efcb00c2c09ba6bbc63b26ebd8ee6c10f08843
PageCount 5
ParticipantIDs ieee_primary_8891568
PublicationCentury 2000
PublicationDate 2019-Sept.
PublicationDateYYYYMMDD 2019-09-01
PublicationDate_xml – month: 09
  year: 2019
  text: 2019-Sept.
PublicationDecade 2010
PublicationTitle IEEE Vehicular Technology Conference
PublicationTitleAbbrev VTCFall
PublicationYear 2019
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001162
Score 2.093073
Snippet In this paper, a low complexity scheme for unsourced random multiple access over the Gaussian channel is proposed. Following the literature by the word...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Binary codes
Encoding
Iterative algorithms
Iterative decoding
Maximum likelihood decoding
Title Efficient Concatenated Same Codebook Construction for the Random Access Gaussian MAC
URI https://ieeexplore.ieee.org/document/8891568
WOSCitedRecordID wos000610542200506&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NS8MwFH9sw4Ne_NjEb3LwaF2Ttkl6HGPTi2PolN1Gk7zCQDtxm3-_L9moCl6EFELCS0nSJC997_d7ANfGU5YLoyKXcRelqFRkvMGx4GXiBKXc6hBsQo1GejrNxw24qbEwiBicz_DWZ4Mt3y3s2v8q62qd03VDN6GplNxgtepdl3MpttA4Hufdl0l_WLx62wL3H0OQ-xVAJZwfw_3_vfkAOt9APDauj5hDaGB1BHs_OATbMBkEEggSZyTk_Zsqehx7Kt6QSlywhvqqmimWkZ7KSO9jj0XlFm-sF2ImsrtivfSISvbQ63fgeTiY9O-jbaiEaC7iZBWhpXtXnpbGZoqUGoUyK53JHHcZlpaWlhU2zk0hjbEyMUKicRpRWh6XtM-kyTG0qkWFJ8A8ZhuFdFphlhqTGMcLalenpbCkG-Sn0PbjM3vfsGHMtkNz9nfxOez6Kdh4ZV1Ai7qKl7BjP1fz5cdVmMIvYHCfKQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1dS8MwFL3MKagvfmzit3nw0bombdP0cQznxG0MrbK30SS3MHCduM3fb5KVquCL0EJJuC1J2uSm955zAK6lpSxnMvZ0RLUXYhx70gYcM5oHmpkjUcKJTcTDoRiPk1ENbiosDCK65DO8tZculq_namV_lbWESMx2Q2zAplXOKtFa1bxLKWclOI76Ses17XSzNxtdoPZ1cJa_JFTcCtLd-9-z96H5DcUjo2qROYAaFoew-4NFsAHpnaOBMObEGNkMp8KcmjxnMzQl2sVDbVXFFUuMp0qM50eeskLPZ6TtVBPJfbZaWEwlGbQ7TXjp3qWdnleKJXhT5gdLD5XZeSVhLlUUG7cmRh7lWkaa6ghzZT4uxZSfyIxLqXggGUepBSJX1M_NTBMGR1Av5gUeA7GobWRcixijUMpAapqZ-4owZ8p4B8kJNGz_TN7XfBiTsmtO_y6-gu1eOuhP-g_DxzPYscOxztE6h7ppNl7AlvpcThcfl244vwDX5qJy
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=IEEE+Vehicular+Technology+Conference&rft.atitle=Efficient+Concatenated+Same+Codebook+Construction+for+the+Random+Access+Gaussian+MAC&rft.au=Ustinova%2C+Daria&rft.au=Glebov%2C+Anton&rft.au=Rybin%2C+Pavel&rft.au=Frolov%2C+Alexey&rft.date=2019-09-01&rft.pub=IEEE&rft.eissn=2577-2465&rft.spage=1&rft.epage=5&rft_id=info:doi/10.1109%2FVTCFall.2019.8891568&rft.externalDocID=8891568