利用完备差集构造QC-LDPC码
针对准循环低密度奇偶校验(QC-LDPC)码中循环置换矩阵的移位次数的确定问题,提出了一种利用组合设计中完备差集(PDF)构造QC-LDPC码的新颖方法.当循环置换矩阵的维度大于一定值时,该方法所构造的规则QC-LDPC码围长至少为6,具有灵活选择码长和码率的优点,且所需的存储空间更少,降低了硬件实现的复杂度.仿真结果表明:在误码率为10-5时,所构造的码率为3/4的PDF-QC-LDPC(3136,2352)与基于最大公约数(GCD)构造的GCD-QC-LDPC(3136,2352)码和基于循环差集(CDF)构造的CDF-QC-LDPC(3136,2352)码相比,其净编码增益(NCG)分别...
Saved in:
Published in | 电讯技术 Vol. 56; no. 5; pp. 471 - 475 |
---|---|
Main Author | |
Format | Journal Article |
Language | Chinese |
Published |
重庆邮电大学 光通信与网络重点实验室,重庆,400065
2016
|
Subjects | |
Online Access | Get full text |
ISSN | 1001-893X |
DOI | 10.3969/j.issn.1001-893x.2016.05.001 |
Cover
Abstract | 针对准循环低密度奇偶校验(QC-LDPC)码中循环置换矩阵的移位次数的确定问题,提出了一种利用组合设计中完备差集(PDF)构造QC-LDPC码的新颖方法.当循环置换矩阵的维度大于一定值时,该方法所构造的规则QC-LDPC码围长至少为6,具有灵活选择码长和码率的优点,且所需的存储空间更少,降低了硬件实现的复杂度.仿真结果表明:在误码率为10-5时,所构造的码率为3/4的PDF-QC-LDPC(3136,2352)与基于最大公约数(GCD)构造的GCD-QC-LDPC(3136,2352)码和基于循环差集(CDF)构造的CDF-QC-LDPC(3136,2352)码相比,其净编码增益(NCG)分别有0.41dB和0.32dB的提升;且在码率为4/5时,所构造的PDF-QC-LDPC(4880,3584)码比GCD-QC-LDPC(4880,3584)码和CDF-QC-LDPC(4880,3584)码的NCG分别改善了0.21dB和0.13dB. |
---|---|
AbstractList | TN911.22; 针对准循环低密度奇偶校验( QC-LDPC)码中循环置换矩阵的移位次数的确定问题,提出了一种利用组合设计中完备差集( PDF)构造QC-LDPC码的新颖方法。当循环置换矩阵的维度大于一定值时,该方法所构造的规则QC-LDPC码围长至少为6,具有灵活选择码长和码率的优点,且所需的存储空间更少,降低了硬件实现的复杂度。仿真结果表明:在误码率为10-5时,所构造的码率为3/4的PDF-QC-LDPC(3136,2352)与基于最大公约数(GCD)构造的GCD-QC-LDPC(3136,2352)码和基于循环差集(CDF)构造的CDF-QC-LDPC(3136,2352)码相比,其净编码增益(NCG)分别有0.41 dB和0.32 dB的提升;且在码率为4/5时,所构造的PDF-QC-LDPC (4880,3584)码比GCD-QC-LDPC(4880,3584)码和CDF-QC-LDPC(4880,3584)码的NCG分别改善了0.21 dB和0.13 dB。 针对准循环低密度奇偶校验(QC-LDPC)码中循环置换矩阵的移位次数的确定问题,提出了一种利用组合设计中完备差集(PDF)构造QC-LDPC码的新颖方法.当循环置换矩阵的维度大于一定值时,该方法所构造的规则QC-LDPC码围长至少为6,具有灵活选择码长和码率的优点,且所需的存储空间更少,降低了硬件实现的复杂度.仿真结果表明:在误码率为10-5时,所构造的码率为3/4的PDF-QC-LDPC(3136,2352)与基于最大公约数(GCD)构造的GCD-QC-LDPC(3136,2352)码和基于循环差集(CDF)构造的CDF-QC-LDPC(3136,2352)码相比,其净编码增益(NCG)分别有0.41dB和0.32dB的提升;且在码率为4/5时,所构造的PDF-QC-LDPC(4880,3584)码比GCD-QC-LDPC(4880,3584)码和CDF-QC-LDPC(4880,3584)码的NCG分别改善了0.21dB和0.13dB. |
Abstract_FL | For the problem of determining shift times of the circulant permutation matirx( CPM) in quasi-cy-clic low-density parity-check(QC-LDPC) codes,a novel construction method based on the perfect differ-ence family( PDF) among combinatorial mathematics is proposed. When the dimension of the CPM exceeds a certain particular value,the girth of the Tanner graph of QC-LDPC codes constructed by this method is at least six,and the proposed algorithm has high flexibility with respect to the design of code-length and code-rate. In addition,it has less requirement about storage space,so the complexity of the hardware implementa-tion is reduced. The simulation results show that the net coding gain(NCG) of the PDF-QC-LDPC(3136, 2352) code with the code-rate of 3/4 is respectively improved 1. 15 dB and 0. 58 dB than those of the GCD-QC-LDPC(3136,2352) code based on the greatest common divisor(GCD) and the CDF-QC-LDPC(3136, 2352) code based on the cyclic difference family(CDF) at the bit error rate(BER) of 10-5. In addition,the NCG of the proposed PDF-QC-LDPC(4880,3584) code is improved 0. 21 dB and 0. 13 dB than those of the GCD-QC-LDPC(4880,3584) code and the CDF-QC-LDPC(4880,3584) code with the same conditions correspondingly with the code-rate of 4/5 and the BER of 10-5 . |
Author | 袁建国 李媛媛 梁梦琪 尚晓娟 王永 |
AuthorAffiliation | 重庆邮电大学光通信与网络重点实验室,重庆400065 |
AuthorAffiliation_xml | – name: 重庆邮电大学 光通信与网络重点实验室,重庆,400065 |
Author_FL | LIANG Mengqi SHANG Xiaojuan YUAN Jianguo WANG Yong LI Yuanyuan |
Author_FL_xml | – sequence: 1 fullname: YUAN Jianguo – sequence: 2 fullname: LI Yuanyuan – sequence: 3 fullname: LIANG Mengqi – sequence: 4 fullname: SHANG Xiaojuan – sequence: 5 fullname: WANG Yong |
Author_xml | – sequence: 1 fullname: 袁建国 李媛媛 梁梦琪 尚晓娟 王永 |
BookMark | eNo1jz1Lw0Acxm-oYK39EsXBJec_uZdcRomvEFChg1u4XO5qgl40QaybBVEHRzdBOjjo0tVPFEu_hSfV6YGHH7-HZw11bGU1Qhs-YBLxaKvERdNY7AP4nojIGAfgcwwMu6KDuv_96SrqN02RQUA45VT4XTRonz7nLx_t7Ll9f2y_ZovXh--3-8Xd9CT2kp3jeD6drKMVI88b3f_LHhru7Q7jAy852j-MtxNPcafXhOSGMhapkAJnRhHJOINAcK2UcGvcUB2AzkDRPFciU1FgiAqlyZgOiSQ9tLnU3khrpB2lZXVdWzeY5oW047L5_QTMXXHoYImqs8qOrgoHX9bFhaxvU84FFwChID-g91mn |
ClassificationCodes | TN911.22 |
ContentType | Journal Article |
Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
DBID | 2RA 92L CQIGP W92 ~WA 2B. 4A8 92I 93N PSX TCJ |
DOI | 10.3969/j.issn.1001-893x.2016.05.001 |
DatabaseName | 维普期刊资源整合服务平台 中文科技期刊数据库-CALIS站点 维普中文期刊数据库 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 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 | Constructing QC-LDPC Codes by Using Perfect Difference Families |
EndPage | 475 |
ExternalDocumentID | dianxjs201605001 668680078 |
GrantInformation_xml | – fundername: 国家自然科学基金资助项目; 重庆市基础与前沿研究计划项目(cstc2015jcyjA0554) Foundation Item:The National Natural Science Foundation of China; Chongqing Research Program of Basic Research and Frontier Technology funderid: (61472464); (61472464); (cstc2015jcyjA0554) |
GroupedDBID | 2RA 92L ALMA_UNASSIGNED_HOLDINGS CDYEO CQIGP W92 ~WA 2B. 4A8 92I 93N PSX TCJ |
ID | FETCH-LOGICAL-c601-e33df4559c74065fc3a5650286ecc84646f4e20eb0c4ddc8bc92f3c7afb5e73a3 |
ISSN | 1001-893X |
IngestDate | Thu May 29 03:55:22 EDT 2025 Wed Feb 14 10:20:04 EST 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 5 |
Keywords | quasi-cyclic low-density parity-check code 准循环低密度校验码 净编码增益 完备差集 循环置换矩阵 circulant permutation matirx net coding gain perfect difference family |
Language | Chinese |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c601-e33df4559c74065fc3a5650286ecc84646f4e20eb0c4ddc8bc92f3c7afb5e73a3 |
Notes | 51-1267/TN |
PageCount | 5 |
ParticipantIDs | wanfang_journals_dianxjs201605001 chongqing_primary_668680078 |
PublicationCentury | 2000 |
PublicationDate | 2016 |
PublicationDateYYYYMMDD | 2016-01-01 |
PublicationDate_xml | – year: 2016 text: 2016 |
PublicationDecade | 2010 |
PublicationTitle | 电讯技术 |
PublicationTitleAlternate | Telecommunication Engineering |
PublicationYear | 2016 |
Publisher | 重庆邮电大学 光通信与网络重点实验室,重庆,400065 |
Publisher_xml | – name: 重庆邮电大学 光通信与网络重点实验室,重庆,400065 |
SSID | ssib023646481 ssib001102885 ssib036437028 ssib051374628 ssib000459929 ssib009282364 ssib006568479 ssib018830122 |
Score | 2.0203686 |
Snippet | ... TN911.22; 针对准循环低密度奇偶校验( QC-LDPC)码中循环置换矩阵的移位次数的确定问题,提出了一种利用组合设计中完备差集(... |
SourceID | wanfang chongqing |
SourceType | Aggregation Database Publisher |
StartPage | 471 |
SubjectTerms | 净编码增益 准循环低密度校验码 完备差集 循环置换矩阵 |
Title | 利用完备差集构造QC-LDPC码 |
URI | http://lib.cqvip.com/qk/91166X/201605/668680078.html https://d.wanfangdata.com.cn/periodical/dianxjs201605001 |
Volume | 56 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NaxQxFA-1BfEiioq1KlWak2ydmWTycczMzlKkFcUWelt2vlp62KptofSkIOrBozdBevCgl179i9bS_8L33mS7YylShWV4m0ney3tvMvklk5cwtmBEUUkdS2hpuuxIUw2AwnmrQZHLuKwrW2Ps8MpTtbQmn6zH61OX1lqrlvZ288Xi4Ny4kv_xKqSBXzFK9h88e8oUEoAG_8IVPAzXC_mYZzE3hjvLM82t5M5gisu4SYkAnKiRSDQmZpbbhBvFM8Ut5JGYYgLugudpZ7n7LEUuLuDN4SZjxOpZJzHPDHJxPSxvHJZERimkjL1GWSJgQEITnjgkQGjSnWSBMl1uMqqgw5tjop3FcyHCKaoDVNRNsgD_gFtH7EAvQVwMt732NEYTX0mPHOmquelSUUdmgJSIDHOqIdnMkc1cFwQ_IgvDz3pboUTI2uMuJMKQJhoU5DYkIkGTTIRplJFY7xdLXgBtvYMylBel51QuSiUBt1angcvSAPett3uVZrt033riVhchmyNnPNqQzbkxZzsyYZWljgwFLI4F7ONSREU7zfoZoD-3Csc3yv7WDmYK4gCjGmcircN4ms247sryizaOt21cHCLMbG1iBCAfUMvkvoWBuZiMq0NjBH6SHf_He6oV0C3wa3AwGdfGodAYA00rD7ytLrMFr-fjv2mJW55sbg83XgGQo7i6YT0YbrQg4Oo1dtWP3eZd0xCvs6mDzRvs4ejjj-PP30dHn0bfPox-Hp18ef_r67uTN4e-UR0fvr3JVnvZarrU8QePdAoFdaiEKGsJQ-1CA9yN60IMYNgD-ih43wFel6qWVRRUeVDIsixMXtioFoUe1HlcaTEQt9j0cHtY3WbzRahhPF8DPyFlqSNTxibPTSlDGZpS57Ns7lS9_stmf5m-UkYZxO6z7IFXuO_fOjv9sz6-c4E8c-wK0s3M4V02vft6r7oHWHo3v--fjN_X74xm |
linkProvider | EBSCOhost |
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=%E5%88%A9%E7%94%A8%E5%AE%8C%E5%A4%87%E5%B7%AE%E9%9B%86%E6%9E%84%E9%80%A0QC-LDPC%E7%A0%81&rft.jtitle=%E7%94%B5%E8%AE%AF%E6%8A%80%E6%9C%AF&rft.au=%E8%A2%81%E5%BB%BA%E5%9B%BD&rft.au=%E6%9D%8E%E5%AA%9B%E5%AA%9B&rft.au=%E6%A2%81%E6%A2%A6%E7%90%AA&rft.au=%E5%B0%9A%E6%99%93%E5%A8%9F&rft.date=2016&rft.pub=%E9%87%8D%E5%BA%86%E9%82%AE%E7%94%B5%E5%A4%A7%E5%AD%A6+%E5%85%89%E9%80%9A%E4%BF%A1%E4%B8%8E%E7%BD%91%E7%BB%9C%E9%87%8D%E7%82%B9%E5%AE%9E%E9%AA%8C%E5%AE%A4%2C%E9%87%8D%E5%BA%86%2C400065&rft.issn=1001-893X&rft.volume=56&rft.issue=5&rft.spage=471&rft.epage=475&rft_id=info:doi/10.3969%2Fj.issn.1001-893x.2016.05.001&rft.externalDocID=dianxjs201605001 |
thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F91166X%2F91166X.jpg http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fdianxjs%2Fdianxjs.jpg |