Coded Faster-than-Nyquist Signaling for Short Packet Communications
Ultra-reliable low-latency communication (URLLC) requires short packets of data transmission. It is known that when the packet length becomes short, the achievable rate is subject to a penalty when compared to the channel capacity. In this paper, we propose to use faster-than-Nyquist (FTN) signaling...
Gespeichert in:
| 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 | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Cerci, Emre Cicek, Adem Cavus, Enver Bedeer, Ebrahim Yanikomeroglu, Halim |
| description | Ultra-reliable low-latency communication (URLLC) requires short packets of
data transmission. It is known that when the packet length becomes short, the
achievable rate is subject to a penalty when compared to the channel capacity.
In this paper, we propose to use faster-than-Nyquist (FTN) signaling to
compensate for the achievable rate loss of short packet communications. We
investigate the performance of a combination of a low complexity detector of
FTN signaling used with nonbinary low-density parity-check (NB-LDPC) codes that
is suitable for low-latency and short block length requirements of URLLC
systems. Our investigation shows that such combination of low-complexity FTN
signaling detection and NB-LDPC codes outperforms the use of close-to-optimal
FTN signaling detectors with LDPC codes in terms of error rate performance and
also has a considerably lower computational complexity. |
| doi_str_mv | 10.48550/arxiv.2106.10574 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2106_10574</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2106_10574</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-d76885151dd05acfe9a9486907e64e47853dce37e7040b6da49e3c00dab8bda43</originalsourceid><addsrcrecordid>eNotz71OwzAYhWEvDKhwAUz4Bhxs_JsRWRSQKkBq9-iL_aW1aBxwXETvHihMR-9ypIeQK8Eb5bTmN1C-0mdzK7hpBNdWnRPvp4iRLmGuWFjdQWbPx49Dmitdp22GfcpbOkyFrndTqfQVwhtW6qdxPOQUoKYpzxfkbID9jJf_uyCb5f3GP7LVy8OTv1sxMFaxaI1zWmgRI9cQBmyhVc603KJRqKzTMgaUFi1XvDcRVIsycB6hd_1PyQW5_rs9Kbr3kkYox-5X05008hv8dEUY</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Coded Faster-than-Nyquist Signaling for Short Packet Communications</title><source>arXiv.org</source><creator>Cerci, Emre ; Cicek, Adem ; Cavus, Enver ; Bedeer, Ebrahim ; Yanikomeroglu, Halim</creator><creatorcontrib>Cerci, Emre ; Cicek, Adem ; Cavus, Enver ; Bedeer, Ebrahim ; Yanikomeroglu, Halim</creatorcontrib><description>Ultra-reliable low-latency communication (URLLC) requires short packets of
data transmission. It is known that when the packet length becomes short, the
achievable rate is subject to a penalty when compared to the channel capacity.
In this paper, we propose to use faster-than-Nyquist (FTN) signaling to
compensate for the achievable rate loss of short packet communications. We
investigate the performance of a combination of a low complexity detector of
FTN signaling used with nonbinary low-density parity-check (NB-LDPC) codes that
is suitable for low-latency and short block length requirements of URLLC
systems. Our investigation shows that such combination of low-complexity FTN
signaling detection and NB-LDPC codes outperforms the use of close-to-optimal
FTN signaling detectors with LDPC codes in terms of error rate performance and
also has a considerably lower computational complexity.</description><identifier>DOI: 10.48550/arxiv.2106.10574</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2021-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2106.10574$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2106.10574$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Cerci, Emre</creatorcontrib><creatorcontrib>Cicek, Adem</creatorcontrib><creatorcontrib>Cavus, Enver</creatorcontrib><creatorcontrib>Bedeer, Ebrahim</creatorcontrib><creatorcontrib>Yanikomeroglu, Halim</creatorcontrib><title>Coded Faster-than-Nyquist Signaling for Short Packet Communications</title><description>Ultra-reliable low-latency communication (URLLC) requires short packets of
data transmission. It is known that when the packet length becomes short, the
achievable rate is subject to a penalty when compared to the channel capacity.
In this paper, we propose to use faster-than-Nyquist (FTN) signaling to
compensate for the achievable rate loss of short packet communications. We
investigate the performance of a combination of a low complexity detector of
FTN signaling used with nonbinary low-density parity-check (NB-LDPC) codes that
is suitable for low-latency and short block length requirements of URLLC
systems. Our investigation shows that such combination of low-complexity FTN
signaling detection and NB-LDPC codes outperforms the use of close-to-optimal
FTN signaling detectors with LDPC codes in terms of error rate performance and
also has a considerably lower computational complexity.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAYhWEvDKhwAUz4Bhxs_JsRWRSQKkBq9-iL_aW1aBxwXETvHihMR-9ypIeQK8Eb5bTmN1C-0mdzK7hpBNdWnRPvp4iRLmGuWFjdQWbPx49Dmitdp22GfcpbOkyFrndTqfQVwhtW6qdxPOQUoKYpzxfkbID9jJf_uyCb5f3GP7LVy8OTv1sxMFaxaI1zWmgRI9cQBmyhVc603KJRqKzTMgaUFi1XvDcRVIsycB6hd_1PyQW5_rs9Kbr3kkYox-5X05008hv8dEUY</recordid><startdate>20210619</startdate><enddate>20210619</enddate><creator>Cerci, Emre</creator><creator>Cicek, Adem</creator><creator>Cavus, Enver</creator><creator>Bedeer, Ebrahim</creator><creator>Yanikomeroglu, Halim</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20210619</creationdate><title>Coded Faster-than-Nyquist Signaling for Short Packet Communications</title><author>Cerci, Emre ; Cicek, Adem ; Cavus, Enver ; Bedeer, Ebrahim ; Yanikomeroglu, Halim</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-d76885151dd05acfe9a9486907e64e47853dce37e7040b6da49e3c00dab8bda43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Cerci, Emre</creatorcontrib><creatorcontrib>Cicek, Adem</creatorcontrib><creatorcontrib>Cavus, Enver</creatorcontrib><creatorcontrib>Bedeer, Ebrahim</creatorcontrib><creatorcontrib>Yanikomeroglu, Halim</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cerci, Emre</au><au>Cicek, Adem</au><au>Cavus, Enver</au><au>Bedeer, Ebrahim</au><au>Yanikomeroglu, Halim</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Coded Faster-than-Nyquist Signaling for Short Packet Communications</atitle><date>2021-06-19</date><risdate>2021</risdate><abstract>Ultra-reliable low-latency communication (URLLC) requires short packets of
data transmission. It is known that when the packet length becomes short, the
achievable rate is subject to a penalty when compared to the channel capacity.
In this paper, we propose to use faster-than-Nyquist (FTN) signaling to
compensate for the achievable rate loss of short packet communications. We
investigate the performance of a combination of a low complexity detector of
FTN signaling used with nonbinary low-density parity-check (NB-LDPC) codes that
is suitable for low-latency and short block length requirements of URLLC
systems. Our investigation shows that such combination of low-complexity FTN
signaling detection and NB-LDPC codes outperforms the use of close-to-optimal
FTN signaling detectors with LDPC codes in terms of error rate performance and
also has a considerably lower computational complexity.</abstract><doi>10.48550/arxiv.2106.10574</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2106.10574 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2106_10574 |
| source | arXiv.org |
| subjects | Computer Science - Information Theory Mathematics - Information Theory |
| title | Coded Faster-than-Nyquist Signaling for Short Packet Communications |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T09%3A26%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Coded%20Faster-than-Nyquist%20Signaling%20for%20Short%20Packet%20Communications&rft.au=Cerci,%20Emre&rft.date=2021-06-19&rft_id=info:doi/10.48550/arxiv.2106.10574&rft_dat=%3Carxiv_GOX%3E2106_10574%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |