极化码的多比特译码算法研究
针对极化码的连续消除列表(successive cancellation list,SCL)译码算法的高时延问题,提出了基于对数似然比的多比特SCL(multi-bit SCL,MSCL)译码算法,可以在一个判决时刻同时译出多个码字比特,在不损失译码性能的前提下,将译码时延由3N-2个时钟降为4N/M-2个时钟,相比于现有的多比特SCL译码算法,MSCL译码算法具有更低的路径度量值计算复杂度。为了降低循环冗余校验(cyclical redundancy check,CRC)辅助的SCL(CRC aided SCL,CA-SCL)译码算法的译码时延以及存储空间,提出了分段CRC辅助的MSCL(s...
Saved in:
Published in | 电信科学 Vol. 34; no. 11; pp. 77 - 86 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | Chinese |
Published |
中国通信学会
01.11.2018
人民邮电出版社有限公司 杭州电子科技大学通信工程学院,浙江杭州,310018 |
Subjects | |
Online Access | Get full text |
ISSN | 1000-0801 |
DOI | 10.11959/j.issn.1000-0801.2018261 |
Cover
Abstract | 针对极化码的连续消除列表(successive cancellation list,SCL)译码算法的高时延问题,提出了基于对数似然比的多比特SCL(multi-bit SCL,MSCL)译码算法,可以在一个判决时刻同时译出多个码字比特,在不损失译码性能的前提下,将译码时延由3N-2个时钟降为4N/M-2个时钟,相比于现有的多比特SCL译码算法,MSCL译码算法具有更低的路径度量值计算复杂度。为了降低循环冗余校验(cyclical redundancy check,CRC)辅助的SCL(CRC aided SCL,CA-SCL)译码算法的译码时延以及存储空间,提出了分段CRC辅助的MSCL(segmented CRC-aided MSCL,SCA-MSCL)译码算法,并提出了分段信息码字长度修正算法,来保证在信息位索引集A不变的前提下,实现每一分段结尾处对应的信息位索引能够被M整除。SCA-MSCL算法可以借助多个CRC判决来尽可能早地输出译码码字,从而减少译码器的存储空间以及译码时延。 |
---|---|
AbstractList | 针对极化码的连续消除列表(successive cancellation list,SCL)译码算法的高时延问题,提出了基于对数似然比的多比特SCL(multi-bit SCL,MSCL)译码算法,可以在一个判决时刻同时译出多个码字比特,在不损失译码性能的前提下,将译码时延由3N-2个时钟降为4N/M-2个时钟,相比于现有的多比特SCL译码算法,MSCL译码算法具有更低的路径度量值计算复杂度。为了降低循环冗余校验(cyclical redundancy check,CRC)辅助的SCL(CRC aided SCL,CA-SCL)译码算法的译码时延以及存储空间,提出了分段CRC辅助的MSCL(segmented CRC-aided MSCL,SCA-MSCL)译码算法,并提出了分段信息码字长度修正算法,来保证在信息位索引集A不变的前提下,实现每一分段结尾处对应的信息位索引能够被M整除。SCA-MSCL算法可以借助多个CRC判决来尽可能早地输出译码码字,从而减少译码器的存储空间以及译码时延。 TP393; 针对极化码的连续消除列表(successive cancellation list,SCL)译码算法的高时延问题,提出了基于对数似然比的多比特SCL (multi-bit SCL,MSCL)译码算法,可以在一个判决时刻同时译出多个码字比特,在不损失译码性能的前提下,将译码时延由3N-2个时钟降为4N/M-2个时钟,相比于现有的多比特SCL译码算法,MSCL译码算法具有更低的路径度量值计算复杂度.为了降低循环冗余校验(cyclical redundancy check,CRC)辅助的SCL (CRC aided SCL,CA-SCL)译码算法的译码时延以及存储空间,提出了分段CRC辅助的MSCL (segmented CRC-aided MSCL,SCA-MSCL)译码算法,并提出了分段信息码字长度修正算法,来保证在信息位索引集A不变的前提下,实现每一分段结尾处对应的信息位索引能够被M整除.SCA-MSCL算法可以借助多个CRC判决来尽可能早地输出译码码字,从而减少译码器的存储空间以及译码时延. |
Author | 沈周青 尚俊娜 |
AuthorAffiliation | 杭州电子科技大学通信工程学院,浙江杭州,310018 |
AuthorAffiliation_xml | – name: 杭州电子科技大学通信工程学院,浙江杭州,310018 |
Author_FL | SHEN Zhouqing SHANG Junna |
Author_FL_xml | – sequence: 1 fullname: SHEN Zhouqing – sequence: 2 fullname: SHANG Junna |
Author_xml | – sequence: 1 fullname: 沈周青 organization: 杭州电子科技大学通信工程学院,浙江杭州310018 – sequence: 2 fullname: 尚俊娜 organization: 杭州电子科技大学通信工程学院,浙江杭州310018 |
BookMark | eNo9jz9LA0EUxLeIYIz5BFYWYnXne7u3e_dKCf6DgE36Y_f2ThJlAy5i2oCNYCNEhRSSwsbGFILgB8qdH8M7IlbDDMMMvy3WcmOXM7aLECKSpINROPTehQgAASSAIQdMuMIWa_9nm6zr_dDUNpJEAtpsv3ydrh6eq8W0mt-t3ublclbdf_8sH5vk46X8fKoWs-r9a5ttFPrK590_7bDB8dGgdxr0z0_Oeof9IJNAAZJWqJUpkOcmiRXpKJcCuQHUcZIVVlhVkNGRSMCQspKkUVZb4pIrEUeiw_bWs7faFdpdpKPxzbWrD1M7uZw0RFjDUN3bWfcy7X3qvLepaigFxhLELy2ZWhs |
ClassificationCodes | TP393 |
ContentType | Journal Article |
Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
DBID | NSCOK 2B. 4A8 92I 93N PSX TCJ |
DOI | 10.11959/j.issn.1000-0801.2018261 |
DatabaseName | National Center for Philosophy and Social Sciences Documentation (NCPSSD) Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
DocumentTitle_FL | Research on multi-bit decoding algorithms for polar codes |
EndPage | 86 |
ExternalDocumentID | dxkx201811009 6100031750 |
GrantInformation_xml | – fundername: 国家自然科学基金资助项目 funderid: (11603041) |
GroupedDBID | -0Y ALMA_UNASSIGNED_HOLDINGS CCEZO CUBFJ GROUPED_DOAJ NSCOK U1G U5S 2B. 4A8 92I 93N PSX TCJ |
ID | FETCH-LOGICAL-c509-19a61a6bf12eb8769a4e5312b01a78cfd3d6f9ba4380b96d595b6dad925263743 |
ISSN | 1000-0801 |
IngestDate | Thu May 29 04:00:34 EDT 2025 Tue Jan 21 20:57:53 EST 2025 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Issue | 11 |
Keywords | 多比特编码 存储空间 极化码 MSCL 译码时延 分段CRC |
Language | Chinese |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c509-19a61a6bf12eb8769a4e5312b01a78cfd3d6f9ba4380b96d595b6dad925263743 |
OpenAccessLink | http://dx.doi.org/10.11959/j.issn.1000-0801.2018261 |
PageCount | 10 |
ParticipantIDs | wanfang_journals_dxkx201811009 cass_nssd_6100031750 |
PublicationCentury | 2000 |
PublicationDate | 2018-11-01 |
PublicationDateYYYYMMDD | 2018-11-01 |
PublicationDate_xml | – month: 11 year: 2018 text: 2018-11-01 day: 01 |
PublicationDecade | 2010 |
PublicationTitle | 电信科学 |
PublicationTitle_FL | Telecommunications Science |
PublicationYear | 2018 |
Publisher | 中国通信学会 人民邮电出版社有限公司 杭州电子科技大学通信工程学院,浙江杭州,310018 |
Publisher_xml | – name: 人民邮电出版社有限公司 – name: 中国通信学会 – name: 杭州电子科技大学通信工程学院,浙江杭州,310018 |
SSID | ssib000459930 ssib051374496 ssib023646091 ssib036437025 ssj0002912124 ssib001102832 ssib058759007 |
Score | 1.7680534 |
Snippet | 针对极化码的连续消除列表(successive cancellation list,SCL)译码算法的高时延问题,提出了基于对数似然比的多比特SCL(multi-bit SCL,MSCL)译码算法,可以在一个判决时刻同... TP393; 针对极化码的连续消除列表(successive cancellation list,SCL)译码算法的高时延问题,提出了基于对数似然比的多比特SCL (multi-bit SCL,MSCL)译码算法,可以在一个判... |
SourceID | wanfang cass |
SourceType | Aggregation Database |
StartPage | 77 |
Title | 极化码的多比特译码算法研究 |
URI | https://www.ncpssd.cn/Literature/articleinfo?id=6100031750&type=journalArticle https://d.wanfangdata.com.cn/periodical/dxkx201811009 |
Volume | 34 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals issn: 1000-0801 databaseCode: DOA dateStart: 20090101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.doaj.org/ omitProxy: true ssIdentifier: ssj0002912124 providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources issn: 1000-0801 databaseCode: M~E dateStart: 20120101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://road.issn.org omitProxy: true ssIdentifier: ssib058759007 providerName: ISSN International Centre |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NaxNBFB_aCuJFlCrWj9CCD0-pO5ud2XnHSbKhCPUUobewX1EQIpgUSg9CwYvgRagKPUgPXrzYgyD4BzXxz_C9ySTZQMWPyzI7b_bNe_N29_3m8wlxv8hjnatI1nNyDvUo7sd17JdZvcyIEBR5LkveO7z7WO88iR7tqb2V1a3KqqX9UbadH164r-R_rEp5ZFfeJfsPlp0zpQxKk33pSham61_ZGBINmBAYhESBaQFqSGKwgcuJAS2YiEk24jQVth3AiEkGoYmQGJcjl56yCWDMhZsNQOVJ06csPaWrcNbVEkGTitG1A3bKIXY8qd422PnIn2MZgjFMIbqlBAK2AcNFEQXNwMnq2BnruBjAVnV0Qhq_TW_2Prl2aHN1zCDmNlkI5sTAoCKYZsYm8C1DmTNRWSBTqd9Kz9BO28GAaS4VRgQb0lvqdFN8ywkJ2LlApLDF0xxLfsBtuDdeE-8o_Kir_yBk5bfvI9F4AKEvdk2o0PkmrmB7XgGvLqQunlz44_kqyeLg-QFT-VQ_XBWXwlhrDtKx-yqpInLE6sSoA4xzxMrhAXSwOA6pwfO0lYllJRtxFC1OXFTUfcXAjwgwmAlRErhxazNmEl8WWzN9Hv5OGwI4OXX-3E64QT8dPK2Atu41cdX3tjbt9NO5LlYOn62LB-NPR-dvP0xOjyYnr88_n4zPjidvfvw8e8c5Xz-Ov72fnB5Pvny_IbqdpNvaqft4IfVccVAPTLVMddaXYZmRk8c0KsnDhFkg09jk_aJR6D5mKcdYyFAXClWmi7TAUIWamqFxU6wNXgzKW2IzNHlIOF2V1PuIiixPGyn1SzhsaJyaVJkNsc7q9QbDYdHTrD3D8GBD1Ly6Pf-XGPaWjHj7TwXuiCuLr-iuWBu93C_vEeodZTU3WlRz1v8F5Dh28Q |
linkProvider | ISSN International Centre |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E6%9E%81%E5%8C%96%E7%A0%81%E7%9A%84%E5%A4%9A%E6%AF%94%E7%89%B9%E8%AF%91%E7%A0%81%E7%AE%97%E6%B3%95%E7%A0%94%E7%A9%B6&rft.jtitle=%E7%94%B5%E4%BF%A1%E7%A7%91%E5%AD%A6&rft.au=%E6%B2%88%E5%91%A8%E9%9D%92&rft.au=%E5%B0%9A%E4%BF%8A%E5%A8%9C&rft.date=2018-11-01&rft.pub=%E6%9D%AD%E5%B7%9E%E7%94%B5%E5%AD%90%E7%A7%91%E6%8A%80%E5%A4%A7%E5%AD%A6%E9%80%9A%E4%BF%A1%E5%B7%A5%E7%A8%8B%E5%AD%A6%E9%99%A2%2C%E6%B5%99%E6%B1%9F%E6%9D%AD%E5%B7%9E%2C310018&rft.issn=1000-0801&rft.volume=34&rft.issue=11&rft.spage=77&rft.epage=86&rft_id=info:doi/10.11959%2Fj.issn.1000-0801.2018261&rft.externalDocID=dxkx201811009 |
thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fdxkx%2Fdxkx.jpg |