Loading…
Spatially coupled turbo-coded continuous phase modulation: asymptotic analysis and optimization
For serially or parallel concatenated communication systems, spatial coupling techniques enable to improve the threshold of these systems under iterative decoding using belief propagation (BP). For the case of low-density parity-check (LDPC) codes, it has been shown that, under some asymptotic assum...
Saved in:
Published in: | EURASIP journal on wireless communications and networking 2020-08, Vol.2020 (1), p.1-20, Article 159 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | cdi_FETCH-LOGICAL-c414t-9f915de82e72b44ee29db59c867c2a43a98c0f1697e651c3cbb88414c5c99d843 |
container_end_page | 20 |
container_issue | 1 |
container_start_page | 1 |
container_title | EURASIP journal on wireless communications and networking |
container_volume | 2020 |
creator | Benaddi, Tarik Poulliat, Charly |
description | For serially or parallel concatenated communication systems, spatial coupling techniques enable to improve the threshold of these systems under iterative decoding using belief propagation (BP). For the case of low-density parity-check (LDPC) codes, it has been shown that, under some asymptotic assumptions, spatially coupled ensembles have BP thresholds that approach the bitwise maximum a posteriori (MAP) threshold of the related uncoupled ensemble. This phenomenon is often referred to as
threshold saturation
, and it has sometimes very important consequences. For example, in the case of regular LDPC code ensembles, spatial coupling enables to achieve asymptotically the capacity for any class of binary memoryless symmetric channels. Since then, this threshold saturation has been conjectured or proved for several other types of concatenations. In this work, we consider a serially concatenated scheme which is the serial concatenation of a simple outer convolutional code and a continuous phase modulator (CPM) separated by an interleaver. Then, we propose a method to do the spatial coupling of several replicas of this serially concatenated scheme, aiming to improve the asymptotic convergence threshold. First, exploiting the specific structure of the proposed system, an original procedure is proposed in order to terminate the spatially coupled turbo-coded CPM scheme. In particular, the proposed procedure aims to ensure the continuity of the transmitted signal among spatially coupled replicas, enabling to keep one of the core characteristics and advantages of coded CPM schemes. Then, based on an asymptotic analysis, we show that the proposed scheme has very competitive thresholds when compared to carefully designed spatially coupled LDPC codes. Furthermore, it is shown how we can accelerate the convergence rate of the designed systems by optimizing the connection distributions in the coupling matrices. Finally, by investigating on different continuous phase modulation schemes, we corroborate the conjecture stating that spatially coupled turbo-coded CPM schemes saturate to a lower bound very close to the threshold given by the extrinsic information transfer (EXIT) area theorem. |
doi_str_mv | 10.1186/s13638-020-01773-7 |
format | article |
fullrecord | <record><control><sourceid>proquest_doaj_</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_ef0341443b3e4212b2944530dea46223</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><doaj_id>oai_doaj_org_article_ef0341443b3e4212b2944530dea46223</doaj_id><sourcerecordid>2432270988</sourcerecordid><originalsourceid>FETCH-LOGICAL-c414t-9f915de82e72b44ee29db59c867c2a43a98c0f1697e651c3cbb88414c5c99d843</originalsourceid><addsrcrecordid>eNp9kc9LwzAYhoMoOKf_gKeCJw_V_GqTeBtD3WDgQT2HNEm3jrapSSvMv95sFX9cPOXj43lewvcCcIngDUI8vw2I5ISnEMMUIsZIyo7ABOWcpYgKcfxrPgVnIWwhJIQKPAHyuVN9pep6l2g3dLU1ST_4wqXamThr1_ZVO7ghJN1GBZs0zgx1NFx7l6iwa7re9ZVOVKvqXahCHEziur5qqo8DdQ5OSlUHe_H1TsHrw_3LfJGunh6X89kq1RTRPhWlQJmxHFuGC0qtxcIUmdA8ZxorSpTgGpYoF8zmGdJEFwXn0dSZFsJwSqZgOeYap7ay81Wj_E46VcnDwvm1VD7-tLbSlpBElZKCWIoRLrCgNCPQWEVzjEnMuh6zNqr-E7WYreR-BwmEKGP4HUX2amQ7794GG3q5dYOP1wgSU4Ixg4LzSOGR0t6F4G35HYug3BcoxwJlLFAeCpQsSmSUQoTbtfU_0f9Yn49mnac</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2432270988</pqid></control><display><type>article</type><title>Spatially coupled turbo-coded continuous phase modulation: asymptotic analysis and optimization</title><source>Publicly Available Content Database</source><source>Springer Nature - SpringerLink Journals - Fully Open Access </source><creator>Benaddi, Tarik ; Poulliat, Charly</creator><creatorcontrib>Benaddi, Tarik ; Poulliat, Charly</creatorcontrib><description>For serially or parallel concatenated communication systems, spatial coupling techniques enable to improve the threshold of these systems under iterative decoding using belief propagation (BP). For the case of low-density parity-check (LDPC) codes, it has been shown that, under some asymptotic assumptions, spatially coupled ensembles have BP thresholds that approach the bitwise maximum a posteriori (MAP) threshold of the related uncoupled ensemble. This phenomenon is often referred to as
threshold saturation
, and it has sometimes very important consequences. For example, in the case of regular LDPC code ensembles, spatial coupling enables to achieve asymptotically the capacity for any class of binary memoryless symmetric channels. Since then, this threshold saturation has been conjectured or proved for several other types of concatenations. In this work, we consider a serially concatenated scheme which is the serial concatenation of a simple outer convolutional code and a continuous phase modulator (CPM) separated by an interleaver. Then, we propose a method to do the spatial coupling of several replicas of this serially concatenated scheme, aiming to improve the asymptotic convergence threshold. First, exploiting the specific structure of the proposed system, an original procedure is proposed in order to terminate the spatially coupled turbo-coded CPM scheme. In particular, the proposed procedure aims to ensure the continuity of the transmitted signal among spatially coupled replicas, enabling to keep one of the core characteristics and advantages of coded CPM schemes. Then, based on an asymptotic analysis, we show that the proposed scheme has very competitive thresholds when compared to carefully designed spatially coupled LDPC codes. Furthermore, it is shown how we can accelerate the convergence rate of the designed systems by optimizing the connection distributions in the coupling matrices. Finally, by investigating on different continuous phase modulation schemes, we corroborate the conjecture stating that spatially coupled turbo-coded CPM schemes saturate to a lower bound very close to the threshold given by the extrinsic information transfer (EXIT) area theorem.</description><identifier>ISSN: 1687-1499</identifier><identifier>ISSN: 1687-1472</identifier><identifier>EISSN: 1687-1499</identifier><identifier>DOI: 10.1186/s13638-020-01773-7</identifier><language>eng</language><publisher>Cham: Springer International Publishing</publisher><subject>Asymptotic properties ; Code design ; Codes ; Communications Engineering ; Communications systems ; Computer Science ; Continuous phase modulation ; Convergence ; Coupling ; Decoding ; Engineering ; Error correcting codes ; EXIT analysis ; Information Systems Applications (incl.Internet) ; Information transfer ; Low density parity check codes ; Lower bounds ; Networking and Internet Architecture ; Networks ; Optimization ; Phase modulation ; Saturation ; Signal,Image and Speech Processing ; Spatially coupling ; Thresholds ; Turbo decoding</subject><ispartof>EURASIP journal on wireless communications and networking, 2020-08, Vol.2020 (1), p.1-20, Article 159</ispartof><rights>The Author(s) 2020</rights><rights>The Author(s) 2020. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>Attribution - NonCommercial - NoDerivatives</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c414t-9f915de82e72b44ee29db59c867c2a43a98c0f1697e651c3cbb88414c5c99d843</cites><orcidid>0000-0003-4112-6876 ; 0000-0001-6407-8841</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2432270988/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2432270988?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>230,314,776,780,881,25733,27903,27904,36991,44569,74872</link.rule.ids><backlink>$$Uhttps://hal.science/hal-03001572$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Benaddi, Tarik</creatorcontrib><creatorcontrib>Poulliat, Charly</creatorcontrib><title>Spatially coupled turbo-coded continuous phase modulation: asymptotic analysis and optimization</title><title>EURASIP journal on wireless communications and networking</title><addtitle>J Wireless Com Network</addtitle><description>For serially or parallel concatenated communication systems, spatial coupling techniques enable to improve the threshold of these systems under iterative decoding using belief propagation (BP). For the case of low-density parity-check (LDPC) codes, it has been shown that, under some asymptotic assumptions, spatially coupled ensembles have BP thresholds that approach the bitwise maximum a posteriori (MAP) threshold of the related uncoupled ensemble. This phenomenon is often referred to as
threshold saturation
, and it has sometimes very important consequences. For example, in the case of regular LDPC code ensembles, spatial coupling enables to achieve asymptotically the capacity for any class of binary memoryless symmetric channels. Since then, this threshold saturation has been conjectured or proved for several other types of concatenations. In this work, we consider a serially concatenated scheme which is the serial concatenation of a simple outer convolutional code and a continuous phase modulator (CPM) separated by an interleaver. Then, we propose a method to do the spatial coupling of several replicas of this serially concatenated scheme, aiming to improve the asymptotic convergence threshold. First, exploiting the specific structure of the proposed system, an original procedure is proposed in order to terminate the spatially coupled turbo-coded CPM scheme. In particular, the proposed procedure aims to ensure the continuity of the transmitted signal among spatially coupled replicas, enabling to keep one of the core characteristics and advantages of coded CPM schemes. Then, based on an asymptotic analysis, we show that the proposed scheme has very competitive thresholds when compared to carefully designed spatially coupled LDPC codes. Furthermore, it is shown how we can accelerate the convergence rate of the designed systems by optimizing the connection distributions in the coupling matrices. Finally, by investigating on different continuous phase modulation schemes, we corroborate the conjecture stating that spatially coupled turbo-coded CPM schemes saturate to a lower bound very close to the threshold given by the extrinsic information transfer (EXIT) area theorem.</description><subject>Asymptotic properties</subject><subject>Code design</subject><subject>Codes</subject><subject>Communications Engineering</subject><subject>Communications systems</subject><subject>Computer Science</subject><subject>Continuous phase modulation</subject><subject>Convergence</subject><subject>Coupling</subject><subject>Decoding</subject><subject>Engineering</subject><subject>Error correcting codes</subject><subject>EXIT analysis</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>Information transfer</subject><subject>Low density parity check codes</subject><subject>Lower bounds</subject><subject>Networking and Internet Architecture</subject><subject>Networks</subject><subject>Optimization</subject><subject>Phase modulation</subject><subject>Saturation</subject><subject>Signal,Image and Speech Processing</subject><subject>Spatially coupling</subject><subject>Thresholds</subject><subject>Turbo decoding</subject><issn>1687-1499</issn><issn>1687-1472</issn><issn>1687-1499</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><sourceid>DOA</sourceid><recordid>eNp9kc9LwzAYhoMoOKf_gKeCJw_V_GqTeBtD3WDgQT2HNEm3jrapSSvMv95sFX9cPOXj43lewvcCcIngDUI8vw2I5ISnEMMUIsZIyo7ABOWcpYgKcfxrPgVnIWwhJIQKPAHyuVN9pep6l2g3dLU1ST_4wqXamThr1_ZVO7ghJN1GBZs0zgx1NFx7l6iwa7re9ZVOVKvqXahCHEziur5qqo8DdQ5OSlUHe_H1TsHrw_3LfJGunh6X89kq1RTRPhWlQJmxHFuGC0qtxcIUmdA8ZxorSpTgGpYoF8zmGdJEFwXn0dSZFsJwSqZgOeYap7ay81Wj_E46VcnDwvm1VD7-tLbSlpBElZKCWIoRLrCgNCPQWEVzjEnMuh6zNqr-E7WYreR-BwmEKGP4HUX2amQ7794GG3q5dYOP1wgSU4Ixg4LzSOGR0t6F4G35HYug3BcoxwJlLFAeCpQsSmSUQoTbtfU_0f9Yn49mnac</recordid><startdate>20200810</startdate><enddate>20200810</enddate><creator>Benaddi, Tarik</creator><creator>Poulliat, Charly</creator><general>Springer International Publishing</general><general>Springer Nature B.V</general><general>SpringerOpen</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7SP</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><scope>1XC</scope><scope>VOOES</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0003-4112-6876</orcidid><orcidid>https://orcid.org/0000-0001-6407-8841</orcidid></search><sort><creationdate>20200810</creationdate><title>Spatially coupled turbo-coded continuous phase modulation: asymptotic analysis and optimization</title><author>Benaddi, Tarik ; Poulliat, Charly</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c414t-9f915de82e72b44ee29db59c867c2a43a98c0f1697e651c3cbb88414c5c99d843</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Asymptotic properties</topic><topic>Code design</topic><topic>Codes</topic><topic>Communications Engineering</topic><topic>Communications systems</topic><topic>Computer Science</topic><topic>Continuous phase modulation</topic><topic>Convergence</topic><topic>Coupling</topic><topic>Decoding</topic><topic>Engineering</topic><topic>Error correcting codes</topic><topic>EXIT analysis</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>Information transfer</topic><topic>Low density parity check codes</topic><topic>Lower bounds</topic><topic>Networking and Internet Architecture</topic><topic>Networks</topic><topic>Optimization</topic><topic>Phase modulation</topic><topic>Saturation</topic><topic>Signal,Image and Speech Processing</topic><topic>Spatially coupling</topic><topic>Thresholds</topic><topic>Turbo decoding</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Benaddi, Tarik</creatorcontrib><creatorcontrib>Poulliat, Charly</creatorcontrib><collection>SpringerOpen</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>EURASIP journal on wireless communications and networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Benaddi, Tarik</au><au>Poulliat, Charly</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Spatially coupled turbo-coded continuous phase modulation: asymptotic analysis and optimization</atitle><jtitle>EURASIP journal on wireless communications and networking</jtitle><stitle>J Wireless Com Network</stitle><date>2020-08-10</date><risdate>2020</risdate><volume>2020</volume><issue>1</issue><spage>1</spage><epage>20</epage><pages>1-20</pages><artnum>159</artnum><issn>1687-1499</issn><issn>1687-1472</issn><eissn>1687-1499</eissn><abstract>For serially or parallel concatenated communication systems, spatial coupling techniques enable to improve the threshold of these systems under iterative decoding using belief propagation (BP). For the case of low-density parity-check (LDPC) codes, it has been shown that, under some asymptotic assumptions, spatially coupled ensembles have BP thresholds that approach the bitwise maximum a posteriori (MAP) threshold of the related uncoupled ensemble. This phenomenon is often referred to as
threshold saturation
, and it has sometimes very important consequences. For example, in the case of regular LDPC code ensembles, spatial coupling enables to achieve asymptotically the capacity for any class of binary memoryless symmetric channels. Since then, this threshold saturation has been conjectured or proved for several other types of concatenations. In this work, we consider a serially concatenated scheme which is the serial concatenation of a simple outer convolutional code and a continuous phase modulator (CPM) separated by an interleaver. Then, we propose a method to do the spatial coupling of several replicas of this serially concatenated scheme, aiming to improve the asymptotic convergence threshold. First, exploiting the specific structure of the proposed system, an original procedure is proposed in order to terminate the spatially coupled turbo-coded CPM scheme. In particular, the proposed procedure aims to ensure the continuity of the transmitted signal among spatially coupled replicas, enabling to keep one of the core characteristics and advantages of coded CPM schemes. Then, based on an asymptotic analysis, we show that the proposed scheme has very competitive thresholds when compared to carefully designed spatially coupled LDPC codes. Furthermore, it is shown how we can accelerate the convergence rate of the designed systems by optimizing the connection distributions in the coupling matrices. Finally, by investigating on different continuous phase modulation schemes, we corroborate the conjecture stating that spatially coupled turbo-coded CPM schemes saturate to a lower bound very close to the threshold given by the extrinsic information transfer (EXIT) area theorem.</abstract><cop>Cham</cop><pub>Springer International Publishing</pub><doi>10.1186/s13638-020-01773-7</doi><tpages>20</tpages><orcidid>https://orcid.org/0000-0003-4112-6876</orcidid><orcidid>https://orcid.org/0000-0001-6407-8841</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1687-1499 |
ispartof | EURASIP journal on wireless communications and networking, 2020-08, Vol.2020 (1), p.1-20, Article 159 |
issn | 1687-1499 1687-1472 1687-1499 |
language | eng |
recordid | cdi_doaj_primary_oai_doaj_org_article_ef0341443b3e4212b2944530dea46223 |
source | Publicly Available Content Database; Springer Nature - SpringerLink Journals - Fully Open Access |
subjects | Asymptotic properties Code design Codes Communications Engineering Communications systems Computer Science Continuous phase modulation Convergence Coupling Decoding Engineering Error correcting codes EXIT analysis Information Systems Applications (incl.Internet) Information transfer Low density parity check codes Lower bounds Networking and Internet Architecture Networks Optimization Phase modulation Saturation Signal,Image and Speech Processing Spatially coupling Thresholds Turbo decoding |
title | Spatially coupled turbo-coded continuous phase modulation: asymptotic analysis and optimization |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T19%3A03%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Spatially%20coupled%20turbo-coded%20continuous%20phase%20modulation:%20asymptotic%20analysis%20and%20optimization&rft.jtitle=EURASIP%20journal%20on%20wireless%20communications%20and%20networking&rft.au=Benaddi,%20Tarik&rft.date=2020-08-10&rft.volume=2020&rft.issue=1&rft.spage=1&rft.epage=20&rft.pages=1-20&rft.artnum=159&rft.issn=1687-1499&rft.eissn=1687-1499&rft_id=info:doi/10.1186/s13638-020-01773-7&rft_dat=%3Cproquest_doaj_%3E2432270988%3C/proquest_doaj_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c414t-9f915de82e72b44ee29db59c867c2a43a98c0f1697e651c3cbb88414c5c99d843%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2432270988&rft_id=info:pmid/&rfr_iscdi=true |