CRC-Aided Sparse Regression Codes for Unsourced Random Access
This letter considers a coding scheme for unsourced random access (URA) based on sparse regression codes (SPARCs). In particular, an efficient concatenated coding scheme is proposed, which concatenates SPARCs and cyclic redundancy check-based block Markov superposition transmission (CRC-BMST) codes....
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2023-08, Vol.27 (8), p.1944-1948 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1948 |
|---|---|
| container_issue | 8 |
| container_start_page | 1944 |
| container_title | IEEE communications letters |
| container_volume | 27 |
| creator | Cao, Haiwen Xing, Jiongyue Liang, Shansuo |
| description | This letter considers a coding scheme for unsourced random access (URA) based on sparse regression codes (SPARCs). In particular, an efficient concatenated coding scheme is proposed, which concatenates SPARCs and cyclic redundancy check-based block Markov superposition transmission (CRC-BMST) codes. A hybrid decoder consisting of a successive cancellation algorithm and a simplified approximated message passing (AMP) algorithm is presented for inner SPARCs, and an improved tree decoder is proposed for outer CRC-BMST codes by introducing a pruning technique. Simulation results show the proposed coding scheme outperforms the coded compressed sensing (CCS) scheme with lower computational complexity. |
| doi_str_mv | 10.1109/LCOMM.2023.3281495 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_LCOMM_2023_3281495</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10138601</ieee_id><sourcerecordid>2849107364</sourcerecordid><originalsourceid>FETCH-LOGICAL-c247t-92ffe7b94120c8b9f73a8f00253af5896656ef1543a0acedb7a29ee6c52cde833</originalsourceid><addsrcrecordid>eNpNkD9PwzAQxS0EEqXwBRBDJOaUsx3H9sBQRfyTUlUqdLZc54xS0bjY7cC3x6UdWN7d8Hv3To-QWwoTSkE_tM18NpswYHzCmaKVFmdkRIVQJctynndQupRSq0tyldIaABQTdEQem0VTTvsOu-J9a2PCYoGfEVPqw1A0ocNU-BCL5ZDCPrpMLezQhU0xdS5D1-TC26-EN6c5Jsvnp4_mtWznL2_NtC0dq-Su1Mx7lCtdUQZOrbSX3CoPwAS3Xihd16JGT0XFLdgcspKWacTaCeY6VJyPyf3x7jaG7z2mnVnnd4YcaZiqNAXJ6ypT7Ei5GFKK6M029hsbfwwFc6jJ_NVkDjWZU03ZdHc09Yj4z0C5qrP8AoqAYqU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2849107364</pqid></control><display><type>article</type><title>CRC-Aided Sparse Regression Codes for Unsourced Random Access</title><source>IEEE Electronic Library (IEL)</source><creator>Cao, Haiwen ; Xing, Jiongyue ; Liang, Shansuo</creator><creatorcontrib>Cao, Haiwen ; Xing, Jiongyue ; Liang, Shansuo</creatorcontrib><description>This letter considers a coding scheme for unsourced random access (URA) based on sparse regression codes (SPARCs). In particular, an efficient concatenated coding scheme is proposed, which concatenates SPARCs and cyclic redundancy check-based block Markov superposition transmission (CRC-BMST) codes. A hybrid decoder consisting of a successive cancellation algorithm and a simplified approximated message passing (AMP) algorithm is presented for inner SPARCs, and an improved tree decoder is proposed for outer CRC-BMST codes by introducing a pruning technique. Simulation results show the proposed coding scheme outperforms the coded compressed sensing (CCS) scheme with lower computational complexity.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2023.3281495</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; block Markov superposition transmission ; Codes ; Coding ; Compressed sensing ; CRC codes ; Cyclic redundancy check codes ; Decoding ; Encoding ; Markov processes ; Message passing ; Random access ; Receivers ; Redundancy ; sparse regression codes ; Unsourced random access</subject><ispartof>IEEE communications letters, 2023-08, Vol.27 (8), p.1944-1948</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c247t-92ffe7b94120c8b9f73a8f00253af5896656ef1543a0acedb7a29ee6c52cde833</cites><orcidid>0000-0003-1178-1204 ; 0000-0002-9238-7892 ; 0000-0002-4589-4138</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10138601$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/10138601$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Cao, Haiwen</creatorcontrib><creatorcontrib>Xing, Jiongyue</creatorcontrib><creatorcontrib>Liang, Shansuo</creatorcontrib><title>CRC-Aided Sparse Regression Codes for Unsourced Random Access</title><title>IEEE communications letters</title><addtitle>LCOMM</addtitle><description>This letter considers a coding scheme for unsourced random access (URA) based on sparse regression codes (SPARCs). In particular, an efficient concatenated coding scheme is proposed, which concatenates SPARCs and cyclic redundancy check-based block Markov superposition transmission (CRC-BMST) codes. A hybrid decoder consisting of a successive cancellation algorithm and a simplified approximated message passing (AMP) algorithm is presented for inner SPARCs, and an improved tree decoder is proposed for outer CRC-BMST codes by introducing a pruning technique. Simulation results show the proposed coding scheme outperforms the coded compressed sensing (CCS) scheme with lower computational complexity.</description><subject>Algorithms</subject><subject>block Markov superposition transmission</subject><subject>Codes</subject><subject>Coding</subject><subject>Compressed sensing</subject><subject>CRC codes</subject><subject>Cyclic redundancy check codes</subject><subject>Decoding</subject><subject>Encoding</subject><subject>Markov processes</subject><subject>Message passing</subject><subject>Random access</subject><subject>Receivers</subject><subject>Redundancy</subject><subject>sparse regression codes</subject><subject>Unsourced random access</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpNkD9PwzAQxS0EEqXwBRBDJOaUsx3H9sBQRfyTUlUqdLZc54xS0bjY7cC3x6UdWN7d8Hv3To-QWwoTSkE_tM18NpswYHzCmaKVFmdkRIVQJctynndQupRSq0tyldIaABQTdEQem0VTTvsOu-J9a2PCYoGfEVPqw1A0ocNU-BCL5ZDCPrpMLezQhU0xdS5D1-TC26-EN6c5Jsvnp4_mtWznL2_NtC0dq-Su1Mx7lCtdUQZOrbSX3CoPwAS3Xihd16JGT0XFLdgcspKWacTaCeY6VJyPyf3x7jaG7z2mnVnnd4YcaZiqNAXJ6ypT7Ei5GFKK6M029hsbfwwFc6jJ_NVkDjWZU03ZdHc09Yj4z0C5qrP8AoqAYqU</recordid><startdate>20230801</startdate><enddate>20230801</enddate><creator>Cao, Haiwen</creator><creator>Xing, Jiongyue</creator><creator>Liang, Shansuo</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0003-1178-1204</orcidid><orcidid>https://orcid.org/0000-0002-9238-7892</orcidid><orcidid>https://orcid.org/0000-0002-4589-4138</orcidid></search><sort><creationdate>20230801</creationdate><title>CRC-Aided Sparse Regression Codes for Unsourced Random Access</title><author>Cao, Haiwen ; Xing, Jiongyue ; Liang, Shansuo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c247t-92ffe7b94120c8b9f73a8f00253af5896656ef1543a0acedb7a29ee6c52cde833</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>block Markov superposition transmission</topic><topic>Codes</topic><topic>Coding</topic><topic>Compressed sensing</topic><topic>CRC codes</topic><topic>Cyclic redundancy check codes</topic><topic>Decoding</topic><topic>Encoding</topic><topic>Markov processes</topic><topic>Message passing</topic><topic>Random access</topic><topic>Receivers</topic><topic>Redundancy</topic><topic>sparse regression codes</topic><topic>Unsourced random access</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cao, Haiwen</creatorcontrib><creatorcontrib>Xing, Jiongyue</creatorcontrib><creatorcontrib>Liang, Shansuo</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cao, Haiwen</au><au>Xing, Jiongyue</au><au>Liang, Shansuo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>CRC-Aided Sparse Regression Codes for Unsourced Random Access</atitle><jtitle>IEEE communications letters</jtitle><stitle>LCOMM</stitle><date>2023-08-01</date><risdate>2023</risdate><volume>27</volume><issue>8</issue><spage>1944</spage><epage>1948</epage><pages>1944-1948</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>This letter considers a coding scheme for unsourced random access (URA) based on sparse regression codes (SPARCs). In particular, an efficient concatenated coding scheme is proposed, which concatenates SPARCs and cyclic redundancy check-based block Markov superposition transmission (CRC-BMST) codes. A hybrid decoder consisting of a successive cancellation algorithm and a simplified approximated message passing (AMP) algorithm is presented for inner SPARCs, and an improved tree decoder is proposed for outer CRC-BMST codes by introducing a pruning technique. Simulation results show the proposed coding scheme outperforms the coded compressed sensing (CCS) scheme with lower computational complexity.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2023.3281495</doi><tpages>5</tpages><orcidid>https://orcid.org/0000-0003-1178-1204</orcidid><orcidid>https://orcid.org/0000-0002-9238-7892</orcidid><orcidid>https://orcid.org/0000-0002-4589-4138</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2023-08, Vol.27 (8), p.1944-1948 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_LCOMM_2023_3281495 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms block Markov superposition transmission Codes Coding Compressed sensing CRC codes Cyclic redundancy check codes Decoding Encoding Markov processes Message passing Random access Receivers Redundancy sparse regression codes Unsourced random access |
| title | CRC-Aided Sparse Regression Codes for Unsourced Random Access |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T14%3A42%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=CRC-Aided%20Sparse%20Regression%20Codes%20for%20Unsourced%20Random%20Access&rft.jtitle=IEEE%20communications%20letters&rft.au=Cao,%20Haiwen&rft.date=2023-08-01&rft.volume=27&rft.issue=8&rft.spage=1944&rft.epage=1948&rft.pages=1944-1948&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2023.3281495&rft_dat=%3Cproquest_RIE%3E2849107364%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2849107364&rft_id=info:pmid/&rft_ieee_id=10138601&rfr_iscdi=true |