Forced-convergence decoding for LDPC-coded modulation
Low-density parity-check （LDPC）-coded modulation has attracted much attention for its outstand- ing performance in a bandwidth-limited channel. However, it involves relatively high decoding complexity. Owing to different convergence behaviors of variable nodes, the nodes detected early can be delete...
Saved in:
| Published in | Science China. Information sciences Vol. 56; no. 1; pp. 143 - 153 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
Heidelberg
SP Science China Press
2013
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1674-733X 1869-1919 |
| DOI | 10.1007/s11432-012-4710-8 |
Cover
| Abstract | Low-density parity-check （LDPC）-coded modulation has attracted much attention for its outstand- ing performance in a bandwidth-limited channel. However, it involves relatively high decoding complexity. Owing to different convergence behaviors of variable nodes, the nodes detected early can be deleted from the Tanner graph, which reduces the size of the parity-check matrix iteration by iteration and thus the decoding complexity. In this paper, we propose a new decoding algorithm for LDPC-coded modulation with reduced complexity. In addition, by deleting the converged bits from the modulation constellation and updating the hit metrics of the demapper with the reduced constellation, more accurate estimation of the bits can be achieved. Simulation results show that, compared with conventional decoding schemes, the proposed method not only greatly reduces the overall decoding complexity for LDPC-coded modulation but also significantly improves decoding performance. |
|---|---|
| AbstractList | Low-density parity-check (LDPC)-coded modulation has attracted much attention for its outstanding performance in a bandwidth-limited channel. However, it involves relatively high decoding complexity. Owing to different convergence behaviors of variable nodes, the nodes detected early can be deleted from the Tanner graph, which reduces the size of the parity-check matrix iteration by iteration and thus the decoding complexity. In this paper, we propose a new decoding algorithm for LDPC-coded modulation with reduced complexity. In addition, by deleting the converged bits from the modulation constellation and updating the bit metrics of the demapper with the reduced constellation, more accurate estimation of the bits can be achieved. Simulation results show that, compared with conventional decoding schemes, the proposed method not only greatly reduces the overall decoding complexity for LDPC-coded modulation but also significantly improves decoding performance. Low-density parity-check （LDPC）-coded modulation has attracted much attention for its outstand- ing performance in a bandwidth-limited channel. However, it involves relatively high decoding complexity. Owing to different convergence behaviors of variable nodes, the nodes detected early can be deleted from the Tanner graph, which reduces the size of the parity-check matrix iteration by iteration and thus the decoding complexity. In this paper, we propose a new decoding algorithm for LDPC-coded modulation with reduced complexity. In addition, by deleting the converged bits from the modulation constellation and updating the hit metrics of the demapper with the reduced constellation, more accurate estimation of the bits can be achieved. Simulation results show that, compared with conventional decoding schemes, the proposed method not only greatly reduces the overall decoding complexity for LDPC-coded modulation but also significantly improves decoding performance. |
| Author | DAI LiYun YANG HongWen FAN JianXiao RAO WenYuan |
| AuthorAffiliation | School of Software and Communication Engineering, Jiangxi University of Finance and Economics, Nanchang 330013, China School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China |
| Author_xml | – sequence: 1 givenname: LiYun surname: Dai fullname: Dai, LiYun email: dailiy2005@gmail.com organization: School of Software and Communication Engineering, Jiangxi University of Finance and Economics, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications – sequence: 2 givenname: HongWen surname: Yang fullname: Yang, HongWen organization: School of Information and Communication Engineering, Beijing University of Posts and Telecommunications – sequence: 3 givenname: JianXiao surname: Fan fullname: Fan, JianXiao organization: School of Information and Communication Engineering, Beijing University of Posts and Telecommunications – sequence: 4 givenname: WenYuan surname: Rao fullname: Rao, WenYuan organization: School of Software and Communication Engineering, Jiangxi University of Finance and Economics |
| BookMark | eNp9kE1LAzEYhINUsNb-AG8VL16i-dxsjlKtCgU9KHgLaZJdt2yTNtkK_ntTtyh4aAJJIDPvDM8pGPjgHQDnGF1jhMRNwphRAhEmkAmMYHkEhrgsJMQSy0F-F4JBQen7CRintER5UYqIKIeAz0I0zkIT_KeLtfPGTawzwTa-nlQhTuZ3L9P8a52drILdtrprgj8Dx5Vukxvv7xF4m92_Th_h_PnhaXo7h4YK3kFWVUYKRJiuqpLhheSWEmqI4RYtHJe4RIwJjXQ-KmSlLhwnC8olM4axAtMRuOrnrmPYbF3q1KpJxrWt9i5sk8KMyLKgZd4jcPlPugzb6HM7RXJQwQkqRFbhXmViSCm6Sq1js9LxS2GkdixVz1JllmrHUu0mi38e03Q_GLqom_agk_TOlFN87eJfp0Omi33cR_D1Jvt-O2YmnAhO6TdbwJKm |
| CitedBy_id | crossref_primary_10_3390_info11070355 |
| Cites_doi | 10.1587/transfun.E92.A.2411 10.1109/4234.1001666 10.1109/TIT.1981.1056404 10.1109/26.990903 10.1109/TCOMM.2004.826370 10.1109/18.669123 10.1093/ietcom/e91-b.4.1145 10.1109/26.768759 10.1109/TCOMM.2002.800828 10.1109/TIT.2009.2013001 10.1109/TCOMM.2005.852852 10.1049/el:20082236 10.1007/s11432-010-0077-x 10.1049/el:19961141 10.1109/LCOMM.200501010 10.1109/TIT.1962.1057683 10.1049/el:19960666 10.1109/TCOMM.2004.841982 10.1007/s11277-008-9654-3 10.1109/TIT.2003.815777 10.1109/TCOMM.2002.802566 10.1109/IC4.2009.4909263 10.1109/ICC.2008.225 10.1109/ICCOMTA.2009.5349137 10.1109/TCOMM.2002.801524 10.1109/ISITA.2008.4895536 |
| ContentType | Journal Article |
| Copyright | Science China Press and Springer-Verlag Berlin Heidelberg 2012 Science China Press and Springer-Verlag Berlin Heidelberg 2012. |
| Copyright_xml | – notice: Science China Press and Springer-Verlag Berlin Heidelberg 2012 – notice: Science China Press and Springer-Verlag Berlin Heidelberg 2012. |
| DBID | 2RA 92L CQIGP W92 ~WA AAYXX CITATION 8FE 8FG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI 7SC 8FD L7M L~C L~D |
| DOI | 10.1007/s11432-012-4710-8 |
| DatabaseName | 维普_期刊 中文科技期刊数据库-CALIS站点 维普中文期刊数据库 中文科技期刊数据库-工程技术 中文科技期刊数据库- 镜像站点 CrossRef ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology collection ProQuest One Community College ProQuest Central ProQuest Central Student SciTech Premium Collection (ProQuest) ProQuest Computer Science Collection Computer Science Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition Computer and Information Systems Abstracts Technology Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Advanced Technologies & Aerospace Collection Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection ProQuest One Academic Eastern Edition SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central Advanced Technologies & Aerospace Database ProQuest One Applied & Life Sciences ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts Advanced Technologies & Aerospace Collection |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| DocumentTitleAlternate | Forced-convergence decoding for LDPC-coded modulation |
| EISSN | 1869-1919 |
| EndPage | 153 |
| ExternalDocumentID | 10_1007_s11432_012_4710_8 44652753 |
| GroupedDBID | -59 -5G -BR -EM -Y2 -~C .VR 06D 0VY 1N0 2B. 2C. 2J2 2JN 2JY 2KG 2KM 2LR 2RA 2VQ 2~H 30V 4.4 406 40D 40E 5VR 5VS 8TC 8UJ 92E 92I 92L 92Q 93N 95- 95. 96X AAAVM AABHQ AAFGU AAHNG AAIAL AAJKR AANZL AARHV AARTL AATNV AATVU AAUYE AAWCG AAYFA AAYIU AAYQN AAYTO ABBBX ABDZT ABECU ABFGW ABFTV ABHQN ABJNI ABJOX ABKAS ABKCH ABKTR ABMQK ABNWP ABQBU ABSXP ABTEG ABTHY ABTKH ABTMW ABWNU ABXPI ACAOD ACBMV ACBRV ACBXY ACBYP ACGFO ACGFS ACHSB ACHXU ACIGE ACIPQ ACKNC ACMDZ ACMLO ACOKC ACOMO ACREN ACSNA ACTTH ACVWB ACWMK ACZOJ ADHIR ADINQ ADKNI ADKPE ADMDM ADOXG ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEBTG AEFTE AEGAL AEGNC AEJHL AEJRE AEOHA AEPYU AESKC AESTI AETLH AEVLU AEVTX AEXYK AFKRA AFLOW AFNRJ AFQWF AFUIB AFWTZ AFYQB AFZKB AGAYW AGDGC AGGBP AGJBK AGMZJ AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIIXL AILAN AIMYW AITGF AJBLW AJDOV AJRNO AJZVZ AKQUC ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AOCGG ARAPS ARMRJ ASPBG AVWKF AXYYD AZFZN B-. BDATZ BENPR BGLVJ BGNMA CAG CCEZO CCPQU CHBEP COF CQIGP CSCUP CUBFJ CW9 DDRTE DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG FA0 FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 HCIFZ HG6 HMJXF HRMNR HVGLF HZ~ IJ- IKXTQ IWAJR IXD I~X I~Z J-C JBSCW JZLTJ K7- KOV LLZTM M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9J P9O PF0 PT4 QOS R89 RIG ROL RSV S16 S3B SAP SCL SCO SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN TCJ TGP TR2 TSG TUC U2A UG4 UNUBA UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 W92 WK8 YLTOR Z7R Z7S Z7X Z7Z Z83 Z88 ZMTXR ~A9 ~WA -SI -S~ 0R~ AACDK AAJBT AASML AAXDM AAYZH ABAKF ABQSL ACDTI AEFQL AEMSY AGQEE AGRTI AIGIU BSONS CAJEI CJPJV H13 Q-- U1G U5S AAPKM AAYXX ABBRH ABDBE ABRTQ AFDZB AFOHR AGQPQ AHPBZ ATHPR AYFIA CITATION PHGZM PHGZT PQGLB PUEGO 8FE 8FG AZQEC DWQXO GNUQQ JQ2 P62 PKEHL PQEST PQQKQ PQUKI 7SC 8FD L7M L~C L~D |
| ID | FETCH-LOGICAL-c375t-4ffc97024aff841b95d323c2c5d0be59180447a0a47af0d9a6e52b3594cc44613 |
| IEDL.DBID | U2A |
| ISSN | 1674-733X |
| IngestDate | Thu Sep 04 16:42:45 EDT 2025 Fri Jul 25 23:34:27 EDT 2025 Wed Oct 01 03:06:52 EDT 2025 Thu Apr 24 22:55:19 EDT 2025 Fri Feb 21 02:33:12 EST 2025 Wed Feb 14 10:43:47 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | low-density parity-check code coded modulation forced-convergence belief propagation decoding |
| Language | English |
| License | http://www.springer.com/tdm |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c375t-4ffc97024aff841b95d323c2c5d0be59180447a0a47af0d9a6e52b3594cc44613 |
| Notes | Low-density parity-check （LDPC）-coded modulation has attracted much attention for its outstand- ing performance in a bandwidth-limited channel. However, it involves relatively high decoding complexity. Owing to different convergence behaviors of variable nodes, the nodes detected early can be deleted from the Tanner graph, which reduces the size of the parity-check matrix iteration by iteration and thus the decoding complexity. In this paper, we propose a new decoding algorithm for LDPC-coded modulation with reduced complexity. In addition, by deleting the converged bits from the modulation constellation and updating the hit metrics of the demapper with the reduced constellation, more accurate estimation of the bits can be achieved. Simulation results show that, compared with conventional decoding schemes, the proposed method not only greatly reduces the overall decoding complexity for LDPC-coded modulation but also significantly improves decoding performance. 11-5847/TP forced-convergence, low-density parity-check code, coded modulation, belief propagation decoding ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| PQID | 2918652067 |
| PQPubID | 2043626 |
| PageCount | 11 |
| ParticipantIDs | proquest_miscellaneous_1429863838 proquest_journals_2918652067 crossref_primary_10_1007_s11432_012_4710_8 crossref_citationtrail_10_1007_s11432_012_4710_8 springer_journals_10_1007_s11432_012_4710_8 chongqing_primary_44652753 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2013 20130100 2013-1-00 20130101 |
| PublicationDateYYYYMMDD | 2013-01-01 |
| PublicationDate_xml | – year: 2013 text: 2013 |
| PublicationDecade | 2010 |
| PublicationPlace | Heidelberg |
| PublicationPlace_xml | – name: Heidelberg |
| PublicationTitle | Science China. Information sciences |
| PublicationTitleAbbrev | Sci. China Inf. Sci |
| PublicationTitleAlternate | SCIENCE CHINA Information Sciences |
| PublicationYear | 2013 |
| Publisher | SP Science China Press Springer Nature B.V |
| Publisher_xml | – name: SP Science China Press – name: Springer Nature B.V |
| References | Dai, Yang, Chen (CR33) 2011; 5 MacKay, Neal (CR2) 1996; 32 CR18 CR16 CR15 CR14 Hou, Siegel, Milstein (CR7) 2003; 49 CR32 Tanner (CR19) 1981; 27 Li, Chindapol, Ritcey (CR4) 2002; 50 Lin, Xiao, Li (CR29) 2010; 52 Wang, Xiao, Brown (CR28) 2002; 50 Lin, Ku (CR13) 2008; 44 Caire, Taricco, Biglieri (CR3) 1998; 44 Chen, Dholakia, Eleftheriou (CR10) 2005; 53 Fossorier, Mihaljevic, Imai (CR21) 1999; 47 Fagervik, Jeans (CR27) 1996; 32 Li, Ryan (CR6) 2005; 9 Hou, Yi, Lee (CR8) 2004; 1 Zhang, Fossorier (CR24) 2005; 53 Zou, Liu, Feng (CR30) 2010; 53 Chen, Fossorier (CR23) 2002; 6 CR9 Tran, Nguyen, Le-Ngoc (CR31) 2009; 55 CR25 Shin, Yang, Heo (CR12) 2008; 91-B Chen, Fossorier (CR22) 2002; 50 Jiang, Nie (CR11) 2010; 38 CR20 Huang, Zhang (CR26) 2011; 8 Gallager (CR1) 1962; 8 Brink, Kramer, Ashikhmin (CR5) 2004; 52 Hironori, Kohsuke (CR17) 2009; E92-A S. Brink (4710_CR5) 2004; 52 D. J. C. MacKay (4710_CR2) 1996; 32 4710_CR18 D. Shin (4710_CR12) 2008; 91-B 4710_CR16 4710_CR15 J. H. Chen (4710_CR22) 2002; 50 J. Hou (4710_CR8) 2004; 1 Y. Li (4710_CR6) 2005; 9 J. Huang (4710_CR26) 2011; 8 4710_CR32 M. P. C. Fossorier (4710_CR21) 1999; 47 N. H. Tran (4710_CR31) 2009; 55 4710_CR14 J. T. Zhang (4710_CR24) 2005; 53 J. Hou (4710_CR7) 2003; 49 R. G. Gallager (4710_CR1) 1962; 8 L. Y. Dai (4710_CR33) 2011; 5 G. Caire (4710_CR3) 1998; 44 X. D. Li (4710_CR4) 2002; 50 R. M. Tanner (4710_CR19) 1981; 27 J. H. Chen (4710_CR23) 2002; 6 X. L. Zou (4710_CR30) 2010; 53 M. M. Wang (4710_CR28) 2002; 50 K. Fagervik (4710_CR27) 1996; 32 D. S. Lin (4710_CR29) 2010; 52 4710_CR9 U. Hironori (4710_CR17) 2009; E92-A J. Chen (4710_CR10) 2005; 53 4710_CR20 C. Y. Lin (4710_CR13) 2008; 44 4710_CR25 X. B. Jiang (4710_CR11) 2010; 38 |
| References_xml | – volume: E92-A start-page: 2411 year: 2009 end-page: 2417 ident: CR17 article-title: Complexity-reducing algorithm for serial scheduled min-sum decoding of LDPC codes publication-title: IEICE Trans Commun doi: 10.1587/transfun.E92.A.2411 – ident: CR18 – volume: 6 start-page: 208 year: 2002 end-page: 210 ident: CR23 article-title: Density evolution for two improved BP-based decoding algorithms of LDPC codes publication-title: IEEE Commun Lett doi: 10.1109/4234.1001666 – volume: 27 start-page: 533 year: 1981 end-page: 547 ident: CR19 article-title: A recursive approach to low complexity codes publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.1981.1056404 – ident: CR14 – volume: 50 start-page: 406 year: 2002 end-page: 414 ident: CR22 article-title: Near optimum universal belief propagation based decoding of low-density parity-check codes publication-title: IEEE Trans Commun doi: 10.1109/26.990903 – volume: 52 start-page: 670 year: 2004 end-page: 678 ident: CR5 article-title: Design of low-density parity-check codes for modulation and detection publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2004.826370 – ident: CR16 – volume: 44 start-page: 927 year: 1998 end-page: 946 ident: CR3 article-title: Bit-interleaved coded modulation publication-title: IEEE Trans Inf Theory doi: 10.1109/18.669123 – volume: 91-B start-page: 1145 year: 2008 end-page: 1148 ident: CR12 article-title: A stopping criterion for low-density parity-check codes publication-title: IEICE Trans Commun doi: 10.1093/ietcom/e91-b.4.1145 – volume: 47 start-page: 673 year: 1999 end-page: 680 ident: CR21 article-title: Reduced complexity iterative decoding of low-density parity check codes based on belief propagation publication-title: IEEE Trans Commun doi: 10.1109/26.768759 – volume: 5 start-page: 66 year: 2011 end-page: 69 ident: CR33 article-title: Estimation error rate based on the radius of decision region (in Chinese) publication-title: J Beijing Univ Posts Telecommun – volume: 50 start-page: 1058 year: 2002 end-page: 1061 ident: CR28 article-title: Soft decision metric generation for QAM with channel estimation error publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2002.800828 – volume: 1 start-page: 141 year: 2004 end-page: 148 ident: CR8 article-title: Multilevel LDPC codes design for multimedia communication CDMA system publication-title: EURASIP J Wirel Commun Netw – volume: 55 start-page: 1592 year: 2009 end-page: 1602 ident: CR31 article-title: Performance analysis and design criteria of BICM-ID with signal space diversity for keyhole Nakagami-m fading channels publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.2009.2013001 – volume: 53 start-page: 1288 year: 2005 end-page: 1299 ident: CR10 article-title: Reduced complexity iterative decoding of LDPC codes publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2005.852852 – ident: CR25 – volume: 44 start-page: 1368 year: 2008 end-page: 1370 ident: CR13 article-title: Early detection of successful decoding for dual-diagonal block-based LDPC codes publication-title: IEEE Electron Lett doi: 10.1049/el:20082236 – volume: 53 start-page: 833 year: 2010 end-page: 841 ident: CR30 article-title: Performance of iteratively decoded bit-interleaved coded modulation with chaos based interleaving strategies publication-title: Sci China Inf Sci doi: 10.1007/s11432-010-0077-x – volume: 32 start-page: 1645 year: 1996 end-page: 1646 ident: CR2 article-title: Near Shannon limit performance of low density parity check codes publication-title: Electron Lett doi: 10.1049/el:19961141 – volume: 8 start-page: 47 year: 2011 end-page: 53 ident: CR26 article-title: Relative-residual-based dynamic schedule for belief propagation decoding of LDPC codes publication-title: China Commun – ident: CR15 – volume: 9 start-page: 1 year: 2005 end-page: 3 ident: CR6 article-title: Bit-reliability mapping in LDPC-coded modulation systems publication-title: IEEE Commun Lett doi: 10.1109/LCOMM.200501010 – ident: CR9 – ident: CR32 – volume: 8 start-page: 21 year: 1962 end-page: 28 ident: CR1 article-title: Low-density parity-check code publication-title: IRE Trans Inf Theory doi: 10.1109/TIT.1962.1057683 – volume: 32 start-page: 985 year: 1996 end-page: 987 ident: CR27 article-title: Low complexity bit by bit soft output demodulator publication-title: IEEE Electron Lett doi: 10.1049/el:19960666 – volume: 53 start-page: 209 year: 2005 end-page: 213 ident: CR24 article-title: Shuffled iterative decoding publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2004.841982 – volume: 52 start-page: 383 year: 2010 end-page: 392 ident: CR29 article-title: Low complexity soft decision technique for gray mapping modulation publication-title: Wirel Pers Commun doi: 10.1007/s11277-008-9654-3 – volume: 49 start-page: 2141 year: 2003 end-page: 2155 ident: CR7 article-title: Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.2003.815777 – volume: 38 start-page: 1612 year: 2010 end-page: 1615 ident: CR11 article-title: Low computational complexity algorithms of LDPC decoder for CMMB publication-title: Chin J Electron – ident: CR20 – volume: 50 start-page: 1250 year: 2002 end-page: 1257 ident: CR4 article-title: Bit-interleaved coded modulation with iterative decoding and 8PSK signaling publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2002.802566 – ident: 4710_CR9 doi: 10.1109/IC4.2009.4909263 – volume: 27 start-page: 533 year: 1981 ident: 4710_CR19 publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.1981.1056404 – volume: 53 start-page: 1288 year: 2005 ident: 4710_CR10 publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2005.852852 – volume: 47 start-page: 673 year: 1999 ident: 4710_CR21 publication-title: IEEE Trans Commun doi: 10.1109/26.768759 – volume: 53 start-page: 833 year: 2010 ident: 4710_CR30 publication-title: Sci China Inf Sci doi: 10.1007/s11432-010-0077-x – volume: 8 start-page: 21 year: 1962 ident: 4710_CR1 publication-title: IRE Trans Inf Theory doi: 10.1109/TIT.1962.1057683 – volume: 44 start-page: 927 year: 1998 ident: 4710_CR3 publication-title: IEEE Trans Inf Theory doi: 10.1109/18.669123 – volume: 32 start-page: 985 year: 1996 ident: 4710_CR27 publication-title: IEEE Electron Lett doi: 10.1049/el:19960666 – ident: 4710_CR15 – ident: 4710_CR32 – volume: 49 start-page: 2141 year: 2003 ident: 4710_CR7 publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.2003.815777 – ident: 4710_CR25 doi: 10.1109/ICC.2008.225 – volume: E92-A start-page: 2411 year: 2009 ident: 4710_CR17 publication-title: IEICE Trans Commun doi: 10.1587/transfun.E92.A.2411 – volume: 1 start-page: 141 year: 2004 ident: 4710_CR8 publication-title: EURASIP J Wirel Commun Netw – ident: 4710_CR18 doi: 10.1109/ICCOMTA.2009.5349137 – volume: 52 start-page: 670 year: 2004 ident: 4710_CR5 publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2004.826370 – volume: 55 start-page: 1592 year: 2009 ident: 4710_CR31 publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.2009.2013001 – volume: 6 start-page: 208 year: 2002 ident: 4710_CR23 publication-title: IEEE Commun Lett doi: 10.1109/4234.1001666 – volume: 38 start-page: 1612 year: 2010 ident: 4710_CR11 publication-title: Chin J Electron – volume: 44 start-page: 1368 year: 2008 ident: 4710_CR13 publication-title: IEEE Electron Lett doi: 10.1049/el:20082236 – volume: 32 start-page: 1645 year: 1996 ident: 4710_CR2 publication-title: Electron Lett doi: 10.1049/el:19961141 – ident: 4710_CR14 – volume: 50 start-page: 1058 year: 2002 ident: 4710_CR28 publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2002.800828 – volume: 50 start-page: 406 year: 2002 ident: 4710_CR22 publication-title: IEEE Trans Commun doi: 10.1109/26.990903 – volume: 50 start-page: 1250 year: 2002 ident: 4710_CR4 publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2002.801524 – volume: 9 start-page: 1 year: 2005 ident: 4710_CR6 publication-title: IEEE Commun Lett doi: 10.1109/LCOMM.200501010 – volume: 8 start-page: 47 year: 2011 ident: 4710_CR26 publication-title: China Commun – volume: 5 start-page: 66 year: 2011 ident: 4710_CR33 publication-title: J Beijing Univ Posts Telecommun – ident: 4710_CR16 doi: 10.1109/ISITA.2008.4895536 – volume: 91-B start-page: 1145 year: 2008 ident: 4710_CR12 publication-title: IEICE Trans Commun doi: 10.1093/ietcom/e91-b.4.1145 – volume: 53 start-page: 209 year: 2005 ident: 4710_CR24 publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2004.841982 – ident: 4710_CR20 – volume: 52 start-page: 383 year: 2010 ident: 4710_CR29 publication-title: Wirel Pers Commun doi: 10.1007/s11277-008-9654-3 |
| SSID | ssj0000330278 |
| Score | 1.9398873 |
| Snippet | Low-density parity-check （LDPC）-coded modulation has attracted much attention for its outstand- ing performance in a bandwidth-limited channel. However, it... Low-density parity-check (LDPC)-coded modulation has attracted much attention for its outstanding performance in a bandwidth-limited channel. However, it... |
| SourceID | proquest crossref springer chongqing |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 143 |
| SubjectTerms | Algorithms Channels China Complexity Computer Science Computer simulation Constellations Convergence Decoding Error correcting codes Information Systems and Communication Service LDPC Modulation Nodes Parity Research Paper Tanner图 低密度奇偶校验 复杂度 收敛 编码调制 解码算法 译码 |
| SummonAdditionalLinks | – databaseName: ProQuest Central dbid: BENPR link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LT9wwEB7R5UIPFY9WXQooSJxAFokfcXxAiFJWCMEKIZD2Znn9aA9twmP5_8yEZJdWKpcoUhInmtjz8Mx8H8BerrVWRN-unDcMtZ9jlY8F876QRZJRJ0ONwlfj8vxOXkzUZAnGfS8MlVX2OrFV1KHxtEd-yE1RlYrAxo_vHxixRlF2tafQcB21QjhqIcY-wDInZKwBLH8_G1_fzHddckF5urY_rqRCRCEmfaqz7adD74EqFTh9dc4qAlz41dQ_H9CM_G24Ft7oPwnU1i6NVuFT51BmJ68zYA2WYr0OH9_ADG6AGjWPPgbWVpi3zZYxCxh2ktnK0GnNLn9cnzJqbg_ZnyZ0hF6f4W50dnt6zjq6BOaFVjMmU_JGo811KVWymBoVBBeeexXyaVQov1xK7XKHh5QH48qo-FQoI73HoLAQX2BQN3X8CpmWlfBOaS10kNFrE5NUpnR4XhVJ6CFszuVi719hMSxBr3GMfoaQ94KyvgMaJ76L33YBkUxytihnS3K21RD254_0w71z81YvfdstuCe7mB5D2J1fxqVC-Q9Xx-b5CaMcbirUNwKHOOj_2mKI_75w8_0XfoMV3nJk0L7MFgxmj89xGz2V2XSnm34vSGfg4w priority: 102 providerName: ProQuest |
| Title | Forced-convergence decoding for LDPC-coded modulation |
| URI | http://lib.cqvip.com/qk/84009A/201301/44652753.html https://link.springer.com/article/10.1007/s11432-012-4710-8 https://www.proquest.com/docview/2918652067 https://www.proquest.com/docview/1429863838 |
| Volume | 56 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 1869-1919 dateEnd: 20241028 omitProxy: true ssIdentifier: ssj0000330278 issn: 1674-733X databaseCode: BENPR dateStart: 20010201 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1869-1919 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000330278 issn: 1674-733X databaseCode: AGYKE dateStart: 20010101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1869-1919 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0000330278 issn: 1674-733X databaseCode: U2A dateStart: 20100101 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dT9swED-t8DIeYGMgCqwKEk-bLCX-qO3HwvqhDVCFVqk8Wa5jwwMkQMv_zzkkLZtg0l6SSHHOyvnj7nx3vwM4TqWUIpZvF9ZpgrufJcr5jDiX8SxwL4OOicLnF93RhP-cimmdxz1vot0bl2S1U6-S3VC0xzACGkmmRLVgXUQ0L5zEE9pbHqykLLriqhS4bow1ZGzaeDPfohIxFW7K4voBe_xTNq0Uzr98pJXoGXyCzVpnTHovg_wZPvhiG7aaegxJvTy3YeMVuOAXEIPy0fmcVHHlVYqlT3I0NqOwSlBVTc5-jE9JTGnPk7syr8t47cBk0P99OiJ1kQTimBQLwkNwWqKktSEons20yBlljjqRpzMvdKZSzqVNLV5Cmmvb9YLOmNDcOTQFM7YLa0VZ-D1IJFfMWSElkzn3TmofuNBdi88qC0y2YX_JKnP_AoZhIuAaRZunDWnDO-NqePFY5eLWrICRI-sNst5E1hvVhm_LTxpy_2h82AyIqZfZ3FD8PeweJW4bjpavcYFEr4ctfPk0R9uGaoW7DEMS35uBXJF4t8P9_2p9AB9pVSgjHs4cwtri8cl_RXVlMetASw2GHVjvDa9-9fF-0r8YX3aqSfsMk0XhJw |
| linkProvider | Springer Nature |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEB6V9gAcEE-RUsBIcAGtsPfh9R4qBG2jlKZRhVopt2WzDziA3TapEH-O38aMayeARG-9WJZsz0qz43nsPD6Al7nWWhF8u3LeMNR-jlU-Fsz7QhZJRp0MNQofTsrRifw4VdM1-NX3wlBZZa8TW0UdGk9n5G-5KapS0bDxd6dnjFCjKLvaQ2i4DlohbLcjxrrGjoP48weGcPPt_V3c71ecD_eOd0asQxlgXmi1YDIlbzSaKpdSJYuZUUFw4blXIZ9FhcvmUmqXO7ykPBhXRsVnQhnpPcZShUC6N2BDCmkw-Nv4sDc5-rQ85ckF5QXbfrySCh-FmPap1bZ_D70VqozgxKWcVTTg4WtTfzlDs_W3oVx5v_8kbFs7OLwLdzoHNnt_KXH3YC3W9-H2H2MNH4AaNuc-BtZWtLfNnTELGOaSmczQSc7Gu0c7jJrpQ_a9CR2A2EM4uRbGPYL1uqnjY8i0rIR3Smuhg4xem5ikMqXD-6pIQg9gc8kXe3o5hsPSqDeO0dYA8p5R1neDzQlf45tdjWQmPlvksyU-22oAr5ef9OSueHmr577tfvC5XYnjAF4sH-OvSfkWV8fmYo5RFTcV6jeBJN70u7Yi8d8FN69e8DncHB0fju14f3LwBG7xFp-DzoS2YH1xfhGfope0mD3rRDGDz9ct_b8BXlQdRg |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9NAEB7RIqFyAJoWkVKokXoCrWrvI-s9VglRaUuVQyPlttrsoxzALk36_5lx7AQQrcTFsuT1rHb2MTM7M98AHOdaa0Xl25XzhuHp51jpY8G8L2SRZNTJUKLw16vB2VSez9SsrXO66KLdO5fkKqeBUJqq5cltSCebxDcU8xRSwIl8zsoteCoJJwEX9JSfri9ZckFuuSYdbkBxh0LMOs_mv6gQvsK3urr5ib3_Kac2yudf_tJGDI1fwYtWf8xOVxO-C09i1YOXXW2GrN2qPXj-G9DgHqhxfedjYE2MeZNuGbOAhicJrgzV1uxyNBkySm8P2Y86tCW99mE6_nw9PGNtwQTmhVZLJlPyRqPUdSmVspgbFQQXnnsV8nlUpihzKbXLHT5SHowbRMXnQhnpPZqFhXgN21VdxTeQaVkK75TWQgcZvTYxSWUGDt_LIgndh4M1q-ztChjDEvgaR_unD3nHO-tbqHGqePHdbkCSifUWWW-J9bbsw8f1Lx25RxofdhNi2y23sByHh92j9O3Dh_Vn3CzkAXFVrO8XaOdwU-KJI5DEp24iNyQe7PDgv1ofwbPJaGwvv1xdvIUd3tTPoDubQ9he3t3Hd6jFLOfvm5X6CyM25Ds |
| 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=Forced-convergence+decoding+for+LDPC-coded+modulation&rft.jtitle=%E4%B8%AD%E5%9B%BD%E7%A7%91%E5%AD%A6%EF%BC%9A%E4%BF%A1%E6%81%AF%E7%A7%91%E5%AD%A6%EF%BC%88%E8%8B%B1%E6%96%87%E7%89%88%EF%BC%89&rft.au=DAI+LiYun+YANG+HongWen+FAN+JianXiao+RAO+WenYuan&rft.date=2013&rft.issn=1674-733X&rft.eissn=1869-1919&rft.issue=1&rft.spage=143&rft.epage=153&rft_id=info:doi/10.1007%2Fs11432-012-4710-8&rft.externalDocID=44652753 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F84009A%2F84009A.jpg |