Loading…
Faster than Nyquist signaling with limited computational resources
This paper focuses on performance analysis of Faster than Nyquist (FTN) signaling schemes that employ low-density parity-check (LDPC) codes, trellis-based detector and turbo equalization decoding principle. We propose an optimization procedure for shaping pulse design, that takes into account number...
Saved in:
Published in: | Physical communication 2021-08, Vol.47, p.101403, Article 101403 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c236t-676b5d0158217f36be2b42d2850ae7e48e7c80eb0c0183e1087144aa88b703633 |
---|---|
cites | cdi_FETCH-LOGICAL-c236t-676b5d0158217f36be2b42d2850ae7e48e7c80eb0c0183e1087144aa88b703633 |
container_end_page | |
container_issue | |
container_start_page | 101403 |
container_title | Physical communication |
container_volume | 47 |
creator | Brkic, Srdan Ivanis, Predrag Radosevic, Andreja |
description | This paper focuses on performance analysis of Faster than Nyquist (FTN) signaling schemes that employ low-density parity-check (LDPC) codes, trellis-based detector and turbo equalization decoding principle. We propose an optimization procedure for shaping pulse design, that takes into account number of trellis states used for equalization. By using proposed numerical procedure, we identify information rate limits, achievable by FTN signaling technique, with identically and uniformly distributed (i.u.d.) inputs, from a discrete constellation. Furthermore, based on EXIT chart analysis, we provide a numerical upper bound on achievable information rate (AIR) of FTN communication systems with i.u.d. inputs, finite number of turbo decoding iterations or code complexity limitations. Additionally, we derive a tighter upper bound on AIR and demonstrate its usefulness by showing that it is possible to design irregular repeat accumulate LDPC codes that operate within 0.2 dB of the proposed bound for a wide range of code rates. |
doi_str_mv | 10.1016/j.phycom.2021.101403 |
format | article |
fullrecord | <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1016_j_phycom_2021_101403</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1874490721001403</els_id><sourcerecordid>S1874490721001403</sourcerecordid><originalsourceid>FETCH-LOGICAL-c236t-676b5d0158217f36be2b42d2850ae7e48e7c80eb0c0183e1087144aa88b703633</originalsourceid><addsrcrecordid>eNp9kM9OAjEQxhujiQR5Aw99gcXpH9pyMVEiYkL0ouem2x2gBHax7Wp4e3ddz85lJjP5vm_yI-SWwZQBU3f76Wl39s1xyoGzfiVBXJARM1oVgrP55e8sCzkHfU0mKe2hLw1cyhF5XLqUMdK8czV9PX-2IWWawrZ2h1Bv6XfIO3oIx5Cxol3Iqc0uh6a70oipaaPHdEOuNu6QcPLXx-Rj-fS-WBXrt-eXxcO68FyoXCitylkFbGY40xuhSuSl5BU3M3CoURrU3gCW4IEZgQyMZlI6Z0ypQSghxkQOvj42KUXc2FMMRxfPloHtUdi9HVDYHoUdUHSy-0GG3W9fAaNNPmDtsQoRfbZVE_43-AFiA2j6</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Faster than Nyquist signaling with limited computational resources</title><source>ScienceDirect Freedom Collection</source><creator>Brkic, Srdan ; Ivanis, Predrag ; Radosevic, Andreja</creator><creatorcontrib>Brkic, Srdan ; Ivanis, Predrag ; Radosevic, Andreja</creatorcontrib><description>This paper focuses on performance analysis of Faster than Nyquist (FTN) signaling schemes that employ low-density parity-check (LDPC) codes, trellis-based detector and turbo equalization decoding principle. We propose an optimization procedure for shaping pulse design, that takes into account number of trellis states used for equalization. By using proposed numerical procedure, we identify information rate limits, achievable by FTN signaling technique, with identically and uniformly distributed (i.u.d.) inputs, from a discrete constellation. Furthermore, based on EXIT chart analysis, we provide a numerical upper bound on achievable information rate (AIR) of FTN communication systems with i.u.d. inputs, finite number of turbo decoding iterations or code complexity limitations. Additionally, we derive a tighter upper bound on AIR and demonstrate its usefulness by showing that it is possible to design irregular repeat accumulate LDPC codes that operate within 0.2 dB of the proposed bound for a wide range of code rates.</description><identifier>ISSN: 1874-4907</identifier><identifier>EISSN: 1876-3219</identifier><identifier>DOI: 10.1016/j.phycom.2021.101403</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>EXIT charts ; Faster than Nyquist signaling ; Low-density parity-check codes ; Turbo equalization</subject><ispartof>Physical communication, 2021-08, Vol.47, p.101403, Article 101403</ispartof><rights>2021 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c236t-676b5d0158217f36be2b42d2850ae7e48e7c80eb0c0183e1087144aa88b703633</citedby><cites>FETCH-LOGICAL-c236t-676b5d0158217f36be2b42d2850ae7e48e7c80eb0c0183e1087144aa88b703633</cites><orcidid>0000-0002-9815-0650</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Brkic, Srdan</creatorcontrib><creatorcontrib>Ivanis, Predrag</creatorcontrib><creatorcontrib>Radosevic, Andreja</creatorcontrib><title>Faster than Nyquist signaling with limited computational resources</title><title>Physical communication</title><description>This paper focuses on performance analysis of Faster than Nyquist (FTN) signaling schemes that employ low-density parity-check (LDPC) codes, trellis-based detector and turbo equalization decoding principle. We propose an optimization procedure for shaping pulse design, that takes into account number of trellis states used for equalization. By using proposed numerical procedure, we identify information rate limits, achievable by FTN signaling technique, with identically and uniformly distributed (i.u.d.) inputs, from a discrete constellation. Furthermore, based on EXIT chart analysis, we provide a numerical upper bound on achievable information rate (AIR) of FTN communication systems with i.u.d. inputs, finite number of turbo decoding iterations or code complexity limitations. Additionally, we derive a tighter upper bound on AIR and demonstrate its usefulness by showing that it is possible to design irregular repeat accumulate LDPC codes that operate within 0.2 dB of the proposed bound for a wide range of code rates.</description><subject>EXIT charts</subject><subject>Faster than Nyquist signaling</subject><subject>Low-density parity-check codes</subject><subject>Turbo equalization</subject><issn>1874-4907</issn><issn>1876-3219</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp9kM9OAjEQxhujiQR5Aw99gcXpH9pyMVEiYkL0ouem2x2gBHax7Wp4e3ddz85lJjP5vm_yI-SWwZQBU3f76Wl39s1xyoGzfiVBXJARM1oVgrP55e8sCzkHfU0mKe2hLw1cyhF5XLqUMdK8czV9PX-2IWWawrZ2h1Bv6XfIO3oIx5Cxol3Iqc0uh6a70oipaaPHdEOuNu6QcPLXx-Rj-fS-WBXrt-eXxcO68FyoXCitylkFbGY40xuhSuSl5BU3M3CoURrU3gCW4IEZgQyMZlI6Z0ypQSghxkQOvj42KUXc2FMMRxfPloHtUdi9HVDYHoUdUHSy-0GG3W9fAaNNPmDtsQoRfbZVE_43-AFiA2j6</recordid><startdate>202108</startdate><enddate>202108</enddate><creator>Brkic, Srdan</creator><creator>Ivanis, Predrag</creator><creator>Radosevic, Andreja</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-9815-0650</orcidid></search><sort><creationdate>202108</creationdate><title>Faster than Nyquist signaling with limited computational resources</title><author>Brkic, Srdan ; Ivanis, Predrag ; Radosevic, Andreja</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c236t-676b5d0158217f36be2b42d2850ae7e48e7c80eb0c0183e1087144aa88b703633</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>EXIT charts</topic><topic>Faster than Nyquist signaling</topic><topic>Low-density parity-check codes</topic><topic>Turbo equalization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Brkic, Srdan</creatorcontrib><creatorcontrib>Ivanis, Predrag</creatorcontrib><creatorcontrib>Radosevic, Andreja</creatorcontrib><collection>CrossRef</collection><jtitle>Physical communication</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Brkic, Srdan</au><au>Ivanis, Predrag</au><au>Radosevic, Andreja</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Faster than Nyquist signaling with limited computational resources</atitle><jtitle>Physical communication</jtitle><date>2021-08</date><risdate>2021</risdate><volume>47</volume><spage>101403</spage><pages>101403-</pages><artnum>101403</artnum><issn>1874-4907</issn><eissn>1876-3219</eissn><abstract>This paper focuses on performance analysis of Faster than Nyquist (FTN) signaling schemes that employ low-density parity-check (LDPC) codes, trellis-based detector and turbo equalization decoding principle. We propose an optimization procedure for shaping pulse design, that takes into account number of trellis states used for equalization. By using proposed numerical procedure, we identify information rate limits, achievable by FTN signaling technique, with identically and uniformly distributed (i.u.d.) inputs, from a discrete constellation. Furthermore, based on EXIT chart analysis, we provide a numerical upper bound on achievable information rate (AIR) of FTN communication systems with i.u.d. inputs, finite number of turbo decoding iterations or code complexity limitations. Additionally, we derive a tighter upper bound on AIR and demonstrate its usefulness by showing that it is possible to design irregular repeat accumulate LDPC codes that operate within 0.2 dB of the proposed bound for a wide range of code rates.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.phycom.2021.101403</doi><orcidid>https://orcid.org/0000-0002-9815-0650</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1874-4907 |
ispartof | Physical communication, 2021-08, Vol.47, p.101403, Article 101403 |
issn | 1874-4907 1876-3219 |
language | eng |
recordid | cdi_crossref_primary_10_1016_j_phycom_2021_101403 |
source | ScienceDirect Freedom Collection |
subjects | EXIT charts Faster than Nyquist signaling Low-density parity-check codes Turbo equalization |
title | Faster than Nyquist signaling with limited computational resources |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T15%3A34%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Faster%20than%20Nyquist%20signaling%20with%20limited%20computational%20resources&rft.jtitle=Physical%20communication&rft.au=Brkic,%20Srdan&rft.date=2021-08&rft.volume=47&rft.spage=101403&rft.pages=101403-&rft.artnum=101403&rft.issn=1874-4907&rft.eissn=1876-3219&rft_id=info:doi/10.1016/j.phycom.2021.101403&rft_dat=%3Celsevier_cross%3ES1874490721001403%3C/elsevier_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c236t-676b5d0158217f36be2b42d2850ae7e48e7c80eb0c0183e1087144aa88b703633%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |