Loading…

Reverse PAC Codes: Look-Ahead List Decoding

Convolutional precoding in polarization-adjusted convolutional (PAC) codes is a recently introduced variant of polar codes. It has demonstrated an effective reduction in the number of minimum weight codewords (a.k.a error coefficient) of polar codes. This reduction has the potential to significantly...

Full description

Saved in:

Bibliographic Details
Main Authors:	Gu, Xinyi, Rowshan, Mohammad, Yuan, Jinhong
Format:	Conference Proceeding
Language:	English
Subjects:	Codes Convolutional codes Decoding Error analysis error coefficient minimum weight codewords Numerical analysis ordered statistics decoding PAC codes Picture archiving and communication systems Polar codes pre-transformation Precoding sphere decoding
Online Access:	Request full text
Tags:	Add Tag No Tags, Be the first to tag this record!

cited_by
cites
container_end_page	2849
container_issue
container_start_page	2844
container_title
container_volume
creator	Gu, Xinyi Rowshan, Mohammad Yuan, Jinhong
description	Convolutional precoding in polarization-adjusted convolutional (PAC) codes is a recently introduced variant of polar codes. It has demonstrated an effective reduction in the number of minimum weight codewords (a.k.a error coefficient) of polar codes. This reduction has the potential to significantly improve the error correction performance. From a codeword formation perspective, this reduction has limitations. Capitalizing on the understanding of the decomposition of minimum-weight codewords, this paper studies reverse precoding that can effectively reduce minimum-weight codewords more than in PAC codes. We propose a look-ahead list decoding for the reverse PAC codes, which has the same order of complexity as list decoding in PAC codes. Through numerical analysis, we demonstrate a notable reduction in error coefficients compared to PAC codes and polar codes, resulting in a remarkable improvement in the block error rate, in particular at high code rates.
doi_str_mv	10.1109/ISIT57864.2024.10619652
format	conference_proceeding
fullrecord	<record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_10619652</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10619652</ieee_id><sourcerecordid>10619652</sourcerecordid><originalsourceid>FETCH-ieee_primary_106196523</originalsourceid><addsrcrecordid>eNqFzrsKwjAYQOEoCFbtGwhml9ZcmptbqYqFDqLdS7G_Gm-RRgTf3kVnpzN8y0FoQklMKTGzfJeXQmmZxIywJKZEUiMF66DQKKO5IFwzncguChgVKtKUqj4aeH8mhCtOWICmW3hB6wFv0gxnrgE_x4Vzlyg9Qd3gwvonXsDeNfZ-HKHeob56CL8dovFqWWbryAJA9WjtrW7f1W-C_-EPB0EzFg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Reverse PAC Codes: Look-Ahead List Decoding</title><source>IEEE Xplore All Conference Series</source><creator>Gu, Xinyi ; Rowshan, Mohammad ; Yuan, Jinhong</creator><creatorcontrib>Gu, Xinyi ; Rowshan, Mohammad ; Yuan, Jinhong</creatorcontrib><description>Convolutional precoding in polarization-adjusted convolutional (PAC) codes is a recently introduced variant of polar codes. It has demonstrated an effective reduction in the number of minimum weight codewords (a.k.a error coefficient) of polar codes. This reduction has the potential to significantly improve the error correction performance. From a codeword formation perspective, this reduction has limitations. Capitalizing on the understanding of the decomposition of minimum-weight codewords, this paper studies reverse precoding that can effectively reduce minimum-weight codewords more than in PAC codes. We propose a look-ahead list decoding for the reverse PAC codes, which has the same order of complexity as list decoding in PAC codes. Through numerical analysis, we demonstrate a notable reduction in error coefficients compared to PAC codes and polar codes, resulting in a remarkable improvement in the block error rate, in particular at high code rates.</description><identifier>EISSN: 2157-8117</identifier><identifier>EISBN: 9798350382846</identifier><identifier>DOI: 10.1109/ISIT57864.2024.10619652</identifier><language>eng</language><publisher>IEEE</publisher><subject>Codes ; Convolutional codes ; Decoding ; Error analysis ; error coefficient ; minimum weight codewords ; Numerical analysis ; ordered statistics decoding ; PAC codes ; Picture archiving and communication systems ; Polar codes ; pre-transformation ; Precoding ; sphere decoding</subject><ispartof>2024 IEEE International Symposium on Information Theory (ISIT), 2024, p.2844-2849</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10619652$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,778,782,787,788,27912,54542,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/10619652$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Gu, Xinyi</creatorcontrib><creatorcontrib>Rowshan, Mohammad</creatorcontrib><creatorcontrib>Yuan, Jinhong</creatorcontrib><title>Reverse PAC Codes: Look-Ahead List Decoding</title><title>2024 IEEE International Symposium on Information Theory (ISIT)</title><addtitle>ISIT</addtitle><description>Convolutional precoding in polarization-adjusted convolutional (PAC) codes is a recently introduced variant of polar codes. It has demonstrated an effective reduction in the number of minimum weight codewords (a.k.a error coefficient) of polar codes. This reduction has the potential to significantly improve the error correction performance. From a codeword formation perspective, this reduction has limitations. Capitalizing on the understanding of the decomposition of minimum-weight codewords, this paper studies reverse precoding that can effectively reduce minimum-weight codewords more than in PAC codes. We propose a look-ahead list decoding for the reverse PAC codes, which has the same order of complexity as list decoding in PAC codes. Through numerical analysis, we demonstrate a notable reduction in error coefficients compared to PAC codes and polar codes, resulting in a remarkable improvement in the block error rate, in particular at high code rates.</description><subject>Codes</subject><subject>Convolutional codes</subject><subject>Decoding</subject><subject>Error analysis</subject><subject>error coefficient</subject><subject>minimum weight codewords</subject><subject>Numerical analysis</subject><subject>ordered statistics decoding</subject><subject>PAC codes</subject><subject>Picture archiving and communication systems</subject><subject>Polar codes</subject><subject>pre-transformation</subject><subject>Precoding</subject><subject>sphere decoding</subject><issn>2157-8117</issn><isbn>9798350382846</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2024</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNqFzrsKwjAYQOEoCFbtGwhml9ZcmptbqYqFDqLdS7G_Gm-RRgTf3kVnpzN8y0FoQklMKTGzfJeXQmmZxIywJKZEUiMF66DQKKO5IFwzncguChgVKtKUqj4aeH8mhCtOWICmW3hB6wFv0gxnrgE_x4Vzlyg9Qd3gwvonXsDeNfZ-HKHeob56CL8dovFqWWbryAJA9WjtrW7f1W-C_-EPB0EzFg</recordid><startdate>20240707</startdate><enddate>20240707</enddate><creator>Gu, Xinyi</creator><creator>Rowshan, Mohammad</creator><creator>Yuan, Jinhong</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>20240707</creationdate><title>Reverse PAC Codes: Look-Ahead List Decoding</title><author>Gu, Xinyi ; Rowshan, Mohammad ; Yuan, Jinhong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-ieee_primary_106196523</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Codes</topic><topic>Convolutional codes</topic><topic>Decoding</topic><topic>Error analysis</topic><topic>error coefficient</topic><topic>minimum weight codewords</topic><topic>Numerical analysis</topic><topic>ordered statistics decoding</topic><topic>PAC codes</topic><topic>Picture archiving and communication systems</topic><topic>Polar codes</topic><topic>pre-transformation</topic><topic>Precoding</topic><topic>sphere decoding</topic><toplevel>online_resources</toplevel><creatorcontrib>Gu, Xinyi</creatorcontrib><creatorcontrib>Rowshan, Mohammad</creatorcontrib><creatorcontrib>Yuan, Jinhong</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gu, Xinyi</au><au>Rowshan, Mohammad</au><au>Yuan, Jinhong</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Reverse PAC Codes: Look-Ahead List Decoding</atitle><btitle>2024 IEEE International Symposium on Information Theory (ISIT)</btitle><stitle>ISIT</stitle><date>2024-07-07</date><risdate>2024</risdate><spage>2844</spage><epage>2849</epage><pages>2844-2849</pages><eissn>2157-8117</eissn><eisbn>9798350382846</eisbn><abstract>Convolutional precoding in polarization-adjusted convolutional (PAC) codes is a recently introduced variant of polar codes. It has demonstrated an effective reduction in the number of minimum weight codewords (a.k.a error coefficient) of polar codes. This reduction has the potential to significantly improve the error correction performance. From a codeword formation perspective, this reduction has limitations. Capitalizing on the understanding of the decomposition of minimum-weight codewords, this paper studies reverse precoding that can effectively reduce minimum-weight codewords more than in PAC codes. We propose a look-ahead list decoding for the reverse PAC codes, which has the same order of complexity as list decoding in PAC codes. Through numerical analysis, we demonstrate a notable reduction in error coefficients compared to PAC codes and polar codes, resulting in a remarkable improvement in the block error rate, in particular at high code rates.</abstract><pub>IEEE</pub><doi>10.1109/ISIT57864.2024.10619652</doi></addata></record>
fulltext	fulltext_linktorsrc
identifier	EISSN: 2157-8117
ispartof	2024 IEEE International Symposium on Information Theory (ISIT), 2024, p.2844-2849
issn	2157-8117
language	eng
recordid	cdi_ieee_primary_10619652
source	IEEE Xplore All Conference Series
subjects	Codes Convolutional codes Decoding Error analysis error coefficient minimum weight codewords Numerical analysis ordered statistics decoding PAC codes Picture archiving and communication systems Polar codes pre-transformation Precoding sphere decoding
title	Reverse PAC Codes: Look-Ahead List Decoding
url	http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T23%3A49%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Reverse%20PAC%20Codes:%20Look-Ahead%20List%20Decoding&rft.btitle=2024%20IEEE%20International%20Symposium%20on%20Information%20Theory%20(ISIT)&rft.au=Gu,%20Xinyi&rft.date=2024-07-07&rft.spage=2844&rft.epage=2849&rft.pages=2844-2849&rft.eissn=2157-8117&rft_id=info:doi/10.1109/ISIT57864.2024.10619652&rft.eisbn=9798350382846&rft_dat=%3Cieee_CHZPO%3E10619652%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-ieee_primary_106196523%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=10619652&rfr_iscdi=true