Joint source channel VL coding/decoding for deep space communication networks based on a space trellis
This paper presents joint source channel variable length （VL） coding/decoding based on a space trellis. Through constructing a joint decoding plane trellis, better decoding performance can be achieved than by using the bit-level decoding algorithm. However, the plane trellis is complicated, which re...
Gespeichert in:
| Veröffentlicht in: | Science China. Information sciences 2011-09, Vol.54 (9), p.1883-1894 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1894 |
|---|---|
| container_issue | 9 |
| container_start_page | 1883 |
| container_title | Science China. Information sciences |
| container_volume | 54 |
| creator | Wu, WeiRen Tu, Juan Tu, GuoFang Gao, ShaoShuai Zhang, Can |
| description | This paper presents joint source channel variable length （VL） coding/decoding based on a space trellis. Through constructing a joint decoding plane trellis, better decoding performance can be achieved than by using the bit-level decoding algorithm. However, the plane trellis is complicated, which results in high decoding complexity for decoding VL turbo codes. To solve this problem, we construct a space trellis and design a low-complexity joint decoding algorithm with a variable length symbol-a posteriori probability （VLS- APP） algorithm in resource constrained deep space communication networks. Simulation results show that the proposed approach reduces the decoding complexity by 10% compared with the plane trellis, and the gain of Eb/No is about 0.2 dB at SER = 10-4. Furthermore, it provides substantial error protection for variable-length encoded image data. |
| doi_str_mv | 10.1007/s11432-011-4362-0 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_963855946</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>38755376</cqvip_id><sourcerecordid>963855946</sourcerecordid><originalsourceid>FETCH-LOGICAL-c374t-7c546f1a3699caca3b12e24c36ed27af6ec7766adb6a26a19f102c8354b8f2003</originalsourceid><addsrcrecordid>eNp9kEtLxDAUhYMoOIzzA9xFXLiq0zyaNEsZfDLgRsVdSNN0pmObdJIW8d-b0kHBhdnkEL5z78kB4Byl1yhN-TIgRAlOUoQSSlgUR2CGciYSJJA4jppxmnBC3k_BIoRdGg8hKeb5DFRPrrY9DG7w2kC9VdaaBr6toXZlbTfL0kwCVs7D0pgOhk6NpGvbwdZa9bWz0Jr-0_mPAAsVTAnjizpwvTdNU4czcFKpJpjF4Z6D17vbl9VDsn6-f1zdrBNNOO0TrjPKKqQIE0IrrUiBsMFUE2ZKzFXFjOacMVUWTGGmkKhQinVOMlrkFY6_moOraW7n3X4woZdtHXSMoKxxQ5CCkTzLBGWRvPxD7mIHNoaTWKA8E0TEUucATZT2LgRvKtn5ulX-S6JUjt3LqXsZu5dj93LMgCdPiKzdGP87-T_TxWHR1tnNPvp-NpGcZxnhjHwDIaGRzA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918593914</pqid></control><display><type>article</type><title>Joint source channel VL coding/decoding for deep space communication networks based on a space trellis</title><source>Springer Nature - Complete Springer Journals</source><source>ProQuest Central UK/Ireland</source><source>Alma/SFX Local Collection</source><source>ProQuest Central</source><creator>Wu, WeiRen ; Tu, Juan ; Tu, GuoFang ; Gao, ShaoShuai ; Zhang, Can</creator><creatorcontrib>Wu, WeiRen ; Tu, Juan ; Tu, GuoFang ; Gao, ShaoShuai ; Zhang, Can</creatorcontrib><description>This paper presents joint source channel variable length （VL） coding/decoding based on a space trellis. Through constructing a joint decoding plane trellis, better decoding performance can be achieved than by using the bit-level decoding algorithm. However, the plane trellis is complicated, which results in high decoding complexity for decoding VL turbo codes. To solve this problem, we construct a space trellis and design a low-complexity joint decoding algorithm with a variable length symbol-a posteriori probability （VLS- APP） algorithm in resource constrained deep space communication networks. Simulation results show that the proposed approach reduces the decoding complexity by 10% compared with the plane trellis, and the gain of Eb/No is about 0.2 dB at SER = 10-4. Furthermore, it provides substantial error protection for variable-length encoded image data.</description><identifier>ISSN: 1674-733X</identifier><identifier>EISSN: 1869-1919</identifier><identifier>DOI: 10.1007/s11432-011-4362-0</identifier><language>eng</language><publisher>Heidelberg: SP Science China Press</publisher><subject>Algorithms ; Channels ; Coding ; Communication networks ; Complexity ; Computer Science ; Construction ; Decoding ; Deep space ; Information Systems and Communication Service ; Planes ; Research Papers ; Space communication ; Turbo codes ; 信源 ; 可变长度编码 ; 格子 ; 深空通信 ; 空间 ; 编码/解码 ; 网络基础 ; 通道</subject><ispartof>Science China. Information sciences, 2011-09, Vol.54 (9), p.1883-1894</ispartof><rights>Science China Press and Springer-Verlag Berlin Heidelberg 2011</rights><rights>Science China Press and Springer-Verlag Berlin Heidelberg 2011.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c374t-7c546f1a3699caca3b12e24c36ed27af6ec7766adb6a26a19f102c8354b8f2003</citedby><cites>FETCH-LOGICAL-c374t-7c546f1a3699caca3b12e24c36ed27af6ec7766adb6a26a19f102c8354b8f2003</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/84009A/84009A.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11432-011-4362-0$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918593914?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,777,781,21369,27905,27906,33725,33726,41469,42538,43786,51300,64364,64366,64368,72218</link.rule.ids></links><search><creatorcontrib>Wu, WeiRen</creatorcontrib><creatorcontrib>Tu, Juan</creatorcontrib><creatorcontrib>Tu, GuoFang</creatorcontrib><creatorcontrib>Gao, ShaoShuai</creatorcontrib><creatorcontrib>Zhang, Can</creatorcontrib><title>Joint source channel VL coding/decoding for deep space communication networks based on a space trellis</title><title>Science China. Information sciences</title><addtitle>Sci. China Inf. Sci</addtitle><addtitle>SCIENCE CHINA Information Sciences</addtitle><description>This paper presents joint source channel variable length （VL） coding/decoding based on a space trellis. Through constructing a joint decoding plane trellis, better decoding performance can be achieved than by using the bit-level decoding algorithm. However, the plane trellis is complicated, which results in high decoding complexity for decoding VL turbo codes. To solve this problem, we construct a space trellis and design a low-complexity joint decoding algorithm with a variable length symbol-a posteriori probability （VLS- APP） algorithm in resource constrained deep space communication networks. Simulation results show that the proposed approach reduces the decoding complexity by 10% compared with the plane trellis, and the gain of Eb/No is about 0.2 dB at SER = 10-4. Furthermore, it provides substantial error protection for variable-length encoded image data.</description><subject>Algorithms</subject><subject>Channels</subject><subject>Coding</subject><subject>Communication networks</subject><subject>Complexity</subject><subject>Computer Science</subject><subject>Construction</subject><subject>Decoding</subject><subject>Deep space</subject><subject>Information Systems and Communication Service</subject><subject>Planes</subject><subject>Research Papers</subject><subject>Space communication</subject><subject>Turbo codes</subject><subject>信源</subject><subject>可变长度编码</subject><subject>格子</subject><subject>深空通信</subject><subject>空间</subject><subject>编码/解码</subject><subject>网络基础</subject><subject>通道</subject><issn>1674-733X</issn><issn>1869-1919</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kEtLxDAUhYMoOIzzA9xFXLiq0zyaNEsZfDLgRsVdSNN0pmObdJIW8d-b0kHBhdnkEL5z78kB4Byl1yhN-TIgRAlOUoQSSlgUR2CGciYSJJA4jppxmnBC3k_BIoRdGg8hKeb5DFRPrrY9DG7w2kC9VdaaBr6toXZlbTfL0kwCVs7D0pgOhk6NpGvbwdZa9bWz0Jr-0_mPAAsVTAnjizpwvTdNU4czcFKpJpjF4Z6D17vbl9VDsn6-f1zdrBNNOO0TrjPKKqQIE0IrrUiBsMFUE2ZKzFXFjOacMVUWTGGmkKhQinVOMlrkFY6_moOraW7n3X4woZdtHXSMoKxxQ5CCkTzLBGWRvPxD7mIHNoaTWKA8E0TEUucATZT2LgRvKtn5ulX-S6JUjt3LqXsZu5dj93LMgCdPiKzdGP87-T_TxWHR1tnNPvp-NpGcZxnhjHwDIaGRzA</recordid><startdate>20110901</startdate><enddate>20110901</enddate><creator>Wu, WeiRen</creator><creator>Tu, Juan</creator><creator>Tu, GuoFang</creator><creator>Gao, ShaoShuai</creator><creator>Zhang, Can</creator><general>SP Science China Press</general><general>Springer Nature B.V</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</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>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20110901</creationdate><title>Joint source channel VL coding/decoding for deep space communication networks based on a space trellis</title><author>Wu, WeiRen ; Tu, Juan ; Tu, GuoFang ; Gao, ShaoShuai ; Zhang, Can</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c374t-7c546f1a3699caca3b12e24c36ed27af6ec7766adb6a26a19f102c8354b8f2003</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithms</topic><topic>Channels</topic><topic>Coding</topic><topic>Communication networks</topic><topic>Complexity</topic><topic>Computer Science</topic><topic>Construction</topic><topic>Decoding</topic><topic>Deep space</topic><topic>Information Systems and Communication Service</topic><topic>Planes</topic><topic>Research Papers</topic><topic>Space communication</topic><topic>Turbo codes</topic><topic>信源</topic><topic>可变长度编码</topic><topic>格子</topic><topic>深空通信</topic><topic>空间</topic><topic>编码/解码</topic><topic>网络基础</topic><topic>通道</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wu, WeiRen</creatorcontrib><creatorcontrib>Tu, Juan</creatorcontrib><creatorcontrib>Tu, GuoFang</creatorcontrib><creatorcontrib>Gao, ShaoShuai</creatorcontrib><creatorcontrib>Zhang, Can</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</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 Korea</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 & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research 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><jtitle>Science China. Information sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wu, WeiRen</au><au>Tu, Juan</au><au>Tu, GuoFang</au><au>Gao, ShaoShuai</au><au>Zhang, Can</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Joint source channel VL coding/decoding for deep space communication networks based on a space trellis</atitle><jtitle>Science China. Information sciences</jtitle><stitle>Sci. China Inf. Sci</stitle><addtitle>SCIENCE CHINA Information Sciences</addtitle><date>2011-09-01</date><risdate>2011</risdate><volume>54</volume><issue>9</issue><spage>1883</spage><epage>1894</epage><pages>1883-1894</pages><issn>1674-733X</issn><eissn>1869-1919</eissn><abstract>This paper presents joint source channel variable length （VL） coding/decoding based on a space trellis. Through constructing a joint decoding plane trellis, better decoding performance can be achieved than by using the bit-level decoding algorithm. However, the plane trellis is complicated, which results in high decoding complexity for decoding VL turbo codes. To solve this problem, we construct a space trellis and design a low-complexity joint decoding algorithm with a variable length symbol-a posteriori probability （VLS- APP） algorithm in resource constrained deep space communication networks. Simulation results show that the proposed approach reduces the decoding complexity by 10% compared with the plane trellis, and the gain of Eb/No is about 0.2 dB at SER = 10-4. Furthermore, it provides substantial error protection for variable-length encoded image data.</abstract><cop>Heidelberg</cop><pub>SP Science China Press</pub><doi>10.1007/s11432-011-4362-0</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1674-733X |
| ispartof | Science China. Information sciences, 2011-09, Vol.54 (9), p.1883-1894 |
| issn | 1674-733X 1869-1919 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_963855946 |
| source | Springer Nature - Complete Springer Journals; ProQuest Central UK/Ireland; Alma/SFX Local Collection; ProQuest Central |
| subjects | Algorithms Channels Coding Communication networks Complexity Computer Science Construction Decoding Deep space Information Systems and Communication Service Planes Research Papers Space communication Turbo codes 信源 可变长度编码 格子 深空通信 空间 编码/解码 网络基础 通道 |
| title | Joint source channel VL coding/decoding for deep space communication networks based on a space trellis |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T16%3A25%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Joint%20source%20channel%20VL%20coding/decoding%20for%20deep%20space%20communication%20networks%20based%20on%20a%20space%20trellis&rft.jtitle=Science%20China.%20Information%20sciences&rft.au=Wu,%20WeiRen&rft.date=2011-09-01&rft.volume=54&rft.issue=9&rft.spage=1883&rft.epage=1894&rft.pages=1883-1894&rft.issn=1674-733X&rft.eissn=1869-1919&rft_id=info:doi/10.1007/s11432-011-4362-0&rft_dat=%3Cproquest_cross%3E963855946%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918593914&rft_id=info:pmid/&rft_cqvip_id=38755376&rfr_iscdi=true |