Improved min-sum algorithm based on density evolution for low-density parity check codes
In this study, the authors present an improved min-sum (MS) algorithm based on density evolution (DE) called the DE MS algorithm for low-density parity check codes. First, they use DE theory to calculate the probability density function of the check-to-variable message of the belief propagation (BP)...
Saved in:
| Published in | IET communications Vol. 11; no. 10; pp. 1582 - 1586 |
|---|---|
| Main Authors | , , , , , , |
| Format | Journal Article |
| Language | English |
| Published |
The Institution of Engineering and Technology
13.07.2017
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1751-8628 1751-8636 |
| DOI | 10.1049/iet-com.2017.0014 |
Cover
| Abstract | In this study, the authors present an improved min-sum (MS) algorithm based on density evolution (DE) called the DE MS algorithm for low-density parity check codes. First, they use DE theory to calculate the probability density function of the check-to-variable message of the belief propagation (BP) algorithm and the MS/normalised MS (NMS) algorithm and furthermore to calculate the normalised factor α. Then, α is modified further by using the weighted average. Finally, in order to ensure the decoding performance and reduce the hardware complexity, the same α is used for different signal-to-noise ratios. The simulation results show that a gain of about 0.2 dB can be achieved in comparison with the classical NMS algorithm. In addition, this algorithm can obtain the same decoding performance compared with the Linear Minimum Mean Square Error (LMMSE) MS algorithm whose decoding performance is very close to that of the BP algorithm, and it also saves around 24.57% of logic elements and 34.33% of memory bits compared with the LMMSE MS algorithm at the same time. |
|---|---|
| AbstractList | In this study, the authors present an improved min‐sum (MS) algorithm based on density evolution (DE) called the DE MS algorithm for low‐density parity check codes. First, they use DE theory to calculate the probability density function of the check‐to‐variable message of the belief propagation (BP) algorithm and the MS/normalised MS (NMS) algorithm and furthermore to calculate the normalised factor α. Then, α is modified further by using the weighted average. Finally, in order to ensure the decoding performance and reduce the hardware complexity, the same α is used for different signal‐to‐noise ratios. The simulation results show that a gain of about 0.2 dB can be achieved in comparison with the classical NMS algorithm. In addition, this algorithm can obtain the same decoding performance compared with the Linear Minimum Mean Square Error (LMMSE) MS algorithm whose decoding performance is very close to that of the BP algorithm, and it also saves around 24.57% of logic elements and 34.33% of memory bits compared with the LMMSE MS algorithm at the same time. |
| Author | Li, Jun Cao, Haiyan Wang, Xiumin Cao, Weilin Li, Jinsong Qian, Fanglei Shan, Liang |
| Author_xml | – sequence: 1 givenname: Xiumin surname: Wang fullname: Wang, Xiumin email: wxm6341@163.com organization: 1College of Information Engineering, China Jiliang University, Hangzhou 310018, People's Republic of China – sequence: 2 givenname: Weilin surname: Cao fullname: Cao, Weilin organization: 1College of Information Engineering, China Jiliang University, Hangzhou 310018, People's Republic of China – sequence: 3 givenname: Jun surname: Li fullname: Li, Jun organization: 1College of Information Engineering, China Jiliang University, Hangzhou 310018, People's Republic of China – sequence: 4 givenname: Liang surname: Shan fullname: Shan, Liang organization: 1College of Information Engineering, China Jiliang University, Hangzhou 310018, People's Republic of China – sequence: 5 givenname: Haiyan surname: Cao fullname: Cao, Haiyan organization: 2College of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018, People's Republic of China – sequence: 6 givenname: Jinsong surname: Li fullname: Li, Jinsong organization: 3College of Optical and Electronic Technology, China Jiliang University, Hangzhou 310018, People's Republic of China – sequence: 7 givenname: Fanglei surname: Qian fullname: Qian, Fanglei organization: 1College of Information Engineering, China Jiliang University, Hangzhou 310018, People's Republic of China |
| BookMark | eNqFkLFOwzAQhi1UJNrCA7DlBVzsOE5iNqgoVCpioRKb5Tpn6pLElZ1S9e1xVGBgKNOdft93J38jNGhdCwhdUzKhJBM3FjqsXTNJCS0mhNDsDA1pwSkuc5YPfvu0vECjEDaEcJ5n2RC9zZutd59QJY1tcdg1iarfnbfduklWKsTctUkFbbDdIYFPV-86GxPjfFK7Pf552SrfF70G_ZFoV0G4ROdG1QGuvusYLWcPr9MnvHh5nE_vFlgzlglcAhdar0RZGZpmkGdcKC6M4ZyvtAaRFsZQlpcEmC6KmGWloKwihQLBGJRsjOhxr_YuBA9Gbr1tlD9ISmSvRkY1MqqRvRrZq4lM8YfRtlP9xzqvbH2SvD2Se1vD4f9Tcvq8TO9nsWUiwvgI92Mbt_NtFHPi2Bfyg4-J |
| CitedBy_id | crossref_primary_10_3390_e21050457 crossref_primary_10_1016_j_rineng_2024_101986 crossref_primary_10_1002_dac_4765 crossref_primary_10_1186_s13638_019_1491_4 crossref_primary_10_1007_s11036_019_01392_7 crossref_primary_10_1007_s12243_024_01054_0 |
| Cites_doi | 10.1109/4234.1001666 10.1109/18.748992 10.1109/EUROCON.2015.7313674 10.1587/transcom.E96.B.939 10.1109/26.990903 10.1080/00207217.2015.1087052 10.1587/transcom.E93.B.1256 10.1109/TCSII.2016.2530903 10.1109/18.910577 10.1093/ietcom/e90-b.3.440 10.1109/TIT.1962.1057683 10.1049/el:19970362 10.1016/j.aeue.2014.04.024 10.1109/LCOMM.2016.2517142 |
| ContentType | Journal Article |
| Copyright | The Institution of Engineering and Technology 2021 The Institution of Engineering and Technology |
| Copyright_xml | – notice: The Institution of Engineering and Technology – notice: 2021 The Institution of Engineering and Technology |
| DBID | AAYXX CITATION |
| DOI | 10.1049/iet-com.2017.0014 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1751-8636 |
| EndPage | 1586 |
| ExternalDocumentID | 10_1049_iet_com_2017_0014 CMU2BF00139 |
| Genre | article |
| GrantInformation_xml | – fundername: Jiangsu Postdoctoral Foundation grantid: 1302059B – fundername: Zhejiang Provincial Natural Science Foundation of China grantid: LY14F010019 – fundername: National Natural Science Foundation of China grantid: 51404223; 61379027; 61501158 – fundername: Zhejiang Provincial Natural Science Foundation of China funderid: LY14F010019 – fundername: Jiangsu Postdoctoral Foundation funderid: 1302059B – fundername: National Natural Science Foundation of China funderid: 61379027; 51404223; 61501158 |
| GroupedDBID | 0R 24P 29I 4IJ 5GY 6IK 8VB AAJGR ABPTK ACGFS ACIWK AENEX ALMA_UNASSIGNED_HOLDINGS BFFAM CS3 DU5 ESX HZ IFIPE IPLJI JAVBF LAI LOTEE LXI M43 MS NADUK NXXTH O9- OCL QWB RIE RNS RUI U5U UNMZH ZL0 ZZ .DC 0R~ 0ZK 1OC 2QL 4.4 6OB 8FE 8FG 96U AAHHS AAHJG ABJCF ABQXS ACCFJ ACCMX ACESK ACGFO ACXQS ADEYR AEEZP AEGXH AEQDE AFAZI AFKRA AIAGR AIWBW AJBDE ALUQN ARAPS AVUZU BENPR BGLVJ CCPQU EBS EJD F8P GOZPB GROUPED_DOAJ GRPMH HCIFZ HZ~ IAO ITC K1G L6V M7S MCNEO MS~ OK1 P62 PTHSS ROL S0W ~ZZ AAMMB AAYXX AEFGJ AFFHD AGXDD AIDQK AIDYY CITATION IDLOA PHGZM PHGZT PQGLB WIN |
| ID | FETCH-LOGICAL-c3349-8e59ccb98df124e6459a59ff555bcce927ff13680e3c775bc48913d07ae933e83 |
| IEDL.DBID | IDLOA |
| ISSN | 1751-8628 |
| IngestDate | Thu Apr 24 23:08:26 EDT 2025 Wed Oct 29 21:46:23 EDT 2025 Wed Jan 22 16:30:30 EST 2025 Tue Jan 05 21:45:56 EST 2021 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 10 |
| Keywords | low-density parity check codes LMMSE MS algorithm check-to-variable message DE theory parity check codes density evolution min-sum algorithm communication complexity decoding performance decoding signal-to-noise ratios probability density function |
| Language | English |
| License | http://onlinelibrary.wiley.com/termsAndConditions#vor |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3349-8e59ccb98df124e6459a59ff555bcce927ff13680e3c775bc48913d07ae933e83 |
| PageCount | 5 |
| ParticipantIDs | crossref_primary_10_1049_iet_com_2017_0014 crossref_citationtrail_10_1049_iet_com_2017_0014 iet_journals_10_1049_iet_com_2017_0014 wiley_primary_10_1049_iet_com_2017_0014_CMU2BF00139 |
| ProviderPackageCode | RUI |
| PublicationCentury | 2000 |
| PublicationDate | 2017-07-13 |
| PublicationDateYYYYMMDD | 2017-07-13 |
| PublicationDate_xml | – month: 07 year: 2017 text: 2017-07-13 day: 13 |
| PublicationDecade | 2010 |
| PublicationTitle | IET communications |
| PublicationYear | 2017 |
| Publisher | The Institution of Engineering and Technology |
| Publisher_xml | – name: The Institution of Engineering and Technology |
| References | Mackay, D.J.C.; Neal, R.M. (C2) 1997; 33 Wu, Z.; Su, K.; Guo, L. (C12) 2014; 68 Richardson, T.J.; Urbanke, R.L. (C13) 2001; 47 Zhu, X.; He, G. (C9) 2016; 63 Verma, S.; Sharma, S. (C6) 2016; 103 Mackay, D.J.C. (C3) 1999; 45 Gallager, R. (C1) 1962; 8 Meng, X.U.; Xincun, J.I.; Jianhui, W.U. (C7) 2010; E93-B Chen, J.; Fossorier, M.P.C. (C11) 2002; 50 Chen, J.; Fossorier, M.P.C. (C10) 2002; 6 Ohtsuki, T. (C5) 2007; E90-B Xu, M.; Ji, X.; Wu, J. (C14) 2013; E96-B Hemati, S.; Leduc-Primeau, F.; Gross, W.J. (C8) 2016; 20 1997; 33 1962; 8 2002; 50 2002; 6 1999; 45 2016; 20 2016; 63 2014; 68 2015 2013; E96‐B 2016; 103 2010; E93‐B 2001; 47 2007; E90‐B e_1_2_8_13_1 e_1_2_8_14_1 e_1_2_8_15_1 e_1_2_8_3_1 e_1_2_8_2_1 e_1_2_8_5_1 e_1_2_8_4_1 e_1_2_8_7_1 e_1_2_8_6_1 e_1_2_8_9_1 e_1_2_8_8_1 e_1_2_8_10_1 e_1_2_8_11_1 e_1_2_8_12_1 |
| References_xml | – volume: 68 start-page: 994 issue: 10 year: 2014 end-page: 999 ident: C12 article-title: A modified min sum decoding algorithm based on LMMSE for LDPC codes publication-title: Int. J. Electron. Commun. – volume: 6 start-page: 208 issue: 5 year: 2002 end-page: 210 ident: C10 article-title: Density evolution for two improved BP-based decoding algorithms of LDPC codes publication-title: IEEE Commun. Lett. – volume: E93-B start-page: 1256 issue: 5 year: 2010 end-page: 1259 ident: C7 article-title: A modified BP algorithm for LDPC decoding based on minimum mean square error criterion publication-title: IEICE Trans. Commun. – volume: E90-B start-page: 440 issue: 3 year: 2007 end-page: 453 ident: C5 article-title: LDPC codes in communications and broadcasting publication-title: IEICE Trans. Commun. – volume: 50 start-page: 406 issue: 3 year: 2002 end-page: 414 ident: C11 article-title: Near optimum universal belief propagation based decoding of low-density parity check codes publication-title: IEEE Trans. Commun. – volume: 33 start-page: 457 issue: 6 year: 1997 end-page: 458 ident: C2 article-title: Near Shannon limit performance of low density parity check codes publication-title: Electr. Lett. – volume: 47 start-page: 599 year: 2001 end-page: 618 ident: C13 article-title: The capacity of low-density parity-check codes under message-passing decoding publication-title: IEEE Trans. Inf. Theory – volume: 20 start-page: 422 issue: 3 year: 2016 end-page: 425 ident: C8 article-title: A relaxed min-sum LDPC decoder with simplified check nodes publication-title: IEEE Commun. Lett. – volume: 45 start-page: 399 issue: 2 year: 1999 end-page: 431 ident: C3 article-title: Good error-correcting codes based on very sparse matrices publication-title: IEEE Trans. Inf. Theory – volume: 103 start-page: 1112 issue: 7 year: 2016 end-page: 1126 ident: C6 article-title: FPGA implementation of low complexity LDPC iterative decoder publication-title: Int. J. Electron. – volume: E96-B start-page: 939 issue: 4 year: 2013 end-page: 947 ident: C14 article-title: A low-power LDPC decoder for multimedia wireless sensor networks publication-title: IEICE Trans. Commun. – volume: 8 start-page: 21 issue: 1 year: 1962 end-page: 28 ident: C1 article-title: Low-density parity-check codes publication-title: IRE Trans. Inf. Theory – volume: 63 start-page: 793 issue: 8 year: 2016 end-page: 797 ident: C9 article-title: An area time-efficient structure to find the approximate first two minima for min-sum-based LDPC decoders publication-title: IEEE Trans. Circuits Syst. II Express Briefs – volume: 68 start-page: 994 issue: 10 year: 2014 end-page: 999 article-title: A modified min sum decoding algorithm based on LMMSE for LDPC codes publication-title: Int. J. Electron. Commun. – volume: 33 start-page: 457 issue: 6 year: 1997 end-page: 458 article-title: Near Shannon limit performance of low density parity check codes publication-title: Electr. Lett. – volume: 50 start-page: 406 issue: 3 year: 2002 end-page: 414 article-title: Near optimum universal belief propagation based decoding of low‐density parity check codes publication-title: IEEE Trans. Commun. – volume: 45 start-page: 399 issue: 2 year: 1999 end-page: 431 article-title: Good error‐correcting codes based on very sparse matrices publication-title: IEEE Trans. Inf. Theory – volume: 6 start-page: 208 issue: 5 year: 2002 end-page: 210 article-title: Density evolution for two improved BP‐based decoding algorithms of LDPC codes publication-title: IEEE Commun. Lett. – volume: 47 start-page: 599 year: 2001 end-page: 618 article-title: The capacity of low‐density parity‐check codes under message‐passing decoding publication-title: IEEE Trans. Inf. Theory – volume: E93‐B start-page: 1256 issue: 5 year: 2010 end-page: 1259 article-title: A modified BP algorithm for LDPC decoding based on minimum mean square error criterion publication-title: IEICE Trans. Commun. – volume: E90‐B start-page: 440 issue: 3 year: 2007 end-page: 453 article-title: LDPC codes in communications and broadcasting publication-title: IEICE Trans. Commun. – volume: 20 start-page: 422 issue: 3 year: 2016 end-page: 425 article-title: A relaxed min‐sum LDPC decoder with simplified check nodes publication-title: IEEE Commun. Lett. – volume: 103 start-page: 1112 issue: 7 year: 2016 end-page: 1126 article-title: FPGA implementation of low complexity LDPC iterative decoder publication-title: Int. J. Electron. – volume: 63 start-page: 793 issue: 8 year: 2016 end-page: 797 article-title: An area time‐efficient structure to find the approximate first two minima for min‐sum‐based LDPC decoders publication-title: IEEE Trans. Circuits Syst. II Express Briefs – volume: 8 start-page: 21 issue: 1 year: 1962 end-page: 28 article-title: Low‐density parity‐check codes publication-title: IRE Trans. Inf. Theory – year: 2015 – volume: E96‐B start-page: 939 issue: 4 year: 2013 end-page: 947 article-title: A low‐power LDPC decoder for multimedia wireless sensor networks publication-title: IEICE Trans. Commun. – ident: e_1_2_8_11_1 doi: 10.1109/4234.1001666 – ident: e_1_2_8_4_1 doi: 10.1109/18.748992 – ident: e_1_2_8_5_1 doi: 10.1109/EUROCON.2015.7313674 – ident: e_1_2_8_15_1 doi: 10.1587/transcom.E96.B.939 – ident: e_1_2_8_12_1 doi: 10.1109/26.990903 – ident: e_1_2_8_7_1 doi: 10.1080/00207217.2015.1087052 – ident: e_1_2_8_8_1 doi: 10.1587/transcom.E93.B.1256 – ident: e_1_2_8_10_1 doi: 10.1109/TCSII.2016.2530903 – ident: e_1_2_8_14_1 doi: 10.1109/18.910577 – ident: e_1_2_8_6_1 doi: 10.1093/ietcom/e90-b.3.440 – ident: e_1_2_8_2_1 doi: 10.1109/TIT.1962.1057683 – ident: e_1_2_8_3_1 doi: 10.1049/el:19970362 – ident: e_1_2_8_13_1 doi: 10.1016/j.aeue.2014.04.024 – ident: e_1_2_8_9_1 doi: 10.1109/LCOMM.2016.2517142 |
| SSID | ssj0055644 |
| Score | 2.1632345 |
| Snippet | In this study, the authors present an improved min-sum (MS) algorithm based on density evolution (DE) called the DE MS algorithm for low-density parity check... In this study, the authors present an improved min‐sum (MS) algorithm based on density evolution (DE) called the DE MS algorithm for low‐density parity check... |
| SourceID | crossref wiley iet |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1582 |
| SubjectTerms | check‐to‐variable message communication complexity DE theory decoding decoding performance density evolution LMMSE MS algorithm low‐density parity check codes min‐sum algorithm parity check codes probability density function Research Article signal‐to‐noise ratios |
| SummonAdditionalLinks | – databaseName: Wiley Online Library Open Access dbid: 24P link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEA61XvQgPvFNDuJBWNzdJLvJUYtFhIoHCx6EJZuHFtutaFW8-RP8jf4SZ3a3xSJU8BSYPA7zyHxJJjOEHGhuhfWJDgxGtnNtokDlPgpsErI89jL0Mf4d7lwm511-cSNuGqQ1_gtT5YeYXLihZZT7NRq4zqsqJABqQYg9Nwow4AM8GGYhxGLW8xHgGVTzmF-Nt2MhkrKiK7jJKAD4LidPm-r41xJTzmkOuqcha-lz2stkqQaL9KSS7gppuGKVLP5IIbhGbqtbAWfpoFd8fXyCYlHdvxvCmf9-QNFHWTosqMU49dE7da-1qlEAq7Q_fIMp4z6sRwgNSNE8UPzq_rxOuu2z69Z5UFdMCAxjXAXSCWVMrqT14LcdJorRQnkvhMiNcSpOvY9YIkPHTJoCjeMrpQ1T7RRjTrIN0iyGhdskNJEy0rCq5QA4NOBIkXLYpNPI5HDGSeQWCcesykydThyrWvSz8lmbqwzYlwF3M-Quhs7xLXI0mfJY5dKYNfgQabVFPc8ayEoR_b1k1up049N2iXq3_zVrhywgHe92I7ZLmqOnF7cHoGSU75dK9w2SoNzg priority: 102 providerName: Wiley-Blackwell |
| Title | Improved min-sum algorithm based on density evolution for low-density parity check codes |
| URI | http://digital-library.theiet.org/content/journals/10.1049/iet-com.2017.0014 https://onlinelibrary.wiley.com/doi/abs/10.1049%2Fiet-com.2017.0014 |
| Volume | 11 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVBHI databaseName: IET Digital Library Open Access customDbUrl: eissn: 1751-8636 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0055644 issn: 1751-8628 databaseCode: IDLOA dateStart: 20130104 isFulltext: true titleUrlDefault: https://digital-library.theiet.org/content/collections providerName: Institution of Engineering and Technology – providerCode: PRVWIB databaseName: Wiley Online Library Open Access customDbUrl: eissn: 1751-8636 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0055644 issn: 1751-8628 databaseCode: 24P dateStart: 20130101 isFulltext: true titleUrlDefault: https://authorservices.wiley.com/open-science/open-access/browse-journals.html providerName: Wiley-Blackwell |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELagXWBAPEV5VB4QA5LVJLYTZ4RCVRBFDFTqFiV-lIo2RVBA_HvukrSAhIAplu3ccGf5vjvfg5CjVBhpXJgyjZHtItU-izPnMxN6PAuc8lyAucO9m7DbF1cDOfhMjzajIfbKYHOPG3rLbZl5gKHbcA-3Kh6XDUkA37ZgA8PID1BlWI4Qu1rXA7DOgxqpX55fo4lV3sxShkVzV9CYPgMkrxavnD8Q-aanlmH5O3ot1E9nnaxVuJGeloLeIEs23ySrX6oJbpFB6SCwhk5GOYMTRtPxcArG__2EorIydJpTgwHrs3dqX6szRwG10vH0jc1XsC0hfECY-oFixvvzNul3Lu7aXVY1TmCacxEzZWWsdRYr40B9W6wXk8rYOSllprWNg8g5n4fKs1xHEcwJfKw0XpTamHOr-A6p5dPc7hIaKuWnQNUIwB0pwEkZCbirI19nYOqEqkG8OZsSXVUVx-YW46R43RZxAqxLgLMJchYj6ESDnCx-eSxLavy2-Rjn5kL_bSMvxPM3yaTd6wdnnQL87v2X_D5ZwTF6dX1-QGqzpxd7CHBkljXJciBum9VZ-wDyJdwS |
| linkProvider | Institution of Engineering and Technology |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JSsRAEG1cDupBXHG3D-JBCCbpJd1Ht2FcRjw44EEISS8qjhnRUfHmJ_iNfolVSWZQBAVPDb0dqpd6VV39ipCNjFthvcwCg5HtPDNRoHMfBVaGLI-9Cn2Mf4dbp7LZ5kcX4mKI7Pf_wlT8EAOHG56M8r7GA44O6crg5EiSeeN6AUZ8gApDGkLMZj3KZSTRBIv5Wf8-FkKWKV1BT0YB4Hc1eNvU2z-m-KadhqH5O2YtlU5jikzWaJHuVMs7TYZcMUMmvnAIzpLLyi3gLL27KT7e3mFn0axz1QWj__qOopKytFtQi4HqvVfqnuu9RgGt0k73BYb02zAhIRSwjOaW4l_3xznSbhyc7zWDOmVCYBjjOlBOaGNyrawHxe2QKSYT2nshRG6M03HifcSkCh0zSQJ1HJ8pbZhkTjPmFJsnI0W3cAuESqWiDGa1HBBHBkBSJBxu6SQyORg5Ui2SsC-q1NR84pjWopOW79pcpyC-FKSbonQxdo4vkq3BkPuKTOO3zptYVx-px986snKJ_p4y3Wu1491GCXuX_jVqnYw1z1sn6cnh6fEyGcc-6OiN2AoZ6T08uVVAKL18rdyAn4d64Ew |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1JSwMxFA5aQfQgrljXHMSDMDjTJDPJ0a24lh4seBCGmSxabKfFVsWbP8Hf6C_xvZlpUQQFT4Fsh5fl-5K8fI-QnYQbYVyYeBo923miA0-lLvBM6LO05qTvavh3-KoRnrb4-Y24mSDHo78whT7E-MINV0a-X-MCt33jigMnR5HMth166PEBEIYyhBjNeooLQETUd-bN0X4sRJiHdAWcDDzg73L8tqn2f3TxDZ0mofg7Z81Bpz5P5kq2SA-K4V0gEzZbJLNfNASXyG1xLWAN7bazj7d3mFk06dz14NB_36UIUob2MmrQUX34Su1zOdcosFXa6b1Ak1EZBiSEBIZRP1D86z5YJq36yfXRqVeGTPA0Y1x50gqldaqkcQDcFpViEqGcE0KkWltVi5wLWCh9y3QUQR7HZ0rjR4lVjFnJVkgl62V2ldBQyiCBXg0HxpEAkQTTwi4dBTqFQ04oq8QfmSrWpZ44hrXoxPm7NlcxmC8G68ZoXfSd41WyN27SL8Q0fqu8i3nlkhr8VpHlQ_R3l_HRVat2WM9p79q_Wm2T6eZxPb48a1yskxmsgve8AdsgleHjk90EgjJMt_L59wlpkt_b |
| 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=Improved+min-sum+algorithm+based+on+density+evolution+for+low-density+parity+check+codes&rft.jtitle=IET+communications&rft.au=Wang%2C+Xiumin&rft.au=Cao%2C+Weilin&rft.au=Li%2C+Jun&rft.au=Shan%2C+Liang&rft.date=2017-07-13&rft.pub=The+Institution+of+Engineering+and+Technology&rft.issn=1751-8628&rft.eissn=1751-8636&rft.volume=11&rft.issue=10&rft.spage=1582&rft.epage=1586&rft_id=info:doi/10.1049%2Fiet-com.2017.0014&rft.externalDocID=10_1049_iet_com_2017_0014 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1751-8628&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1751-8628&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1751-8628&client=summon |