{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:29:08Z","timestamp":1780054148816,"version":"3.54.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T00:00:00Z","timestamp":1554422400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Circuits Syst Signal Process"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00034-019-01107-z","type":"journal-article","created":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T17:13:56Z","timestamp":1554484436000},"page":"5068-5080","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Second Minimum Approximation for Min-Sum Decoders Suitable for High-Rate LDPC Codes"],"prefix":"10.1007","volume":"38","author":[{"given":"J. M.","family":"Catal\u00e0-P\u00e9rez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. O.","family":"Lacruz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F.","family":"Garc\u00eda-Herrero","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9390-5022","authenticated-orcid":false,"given":"J.","family":"Valls","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Declercq","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,4,5]]},"reference":[{"issue":"12","key":"1107_CR1","doi-asserted-by":"publisher","first-page":"2342","DOI":"10.1109\/TVLSI.2011.2174166","volume":"20","author":"L Amaru","year":"2012","unstructured":"L. Amaru, M. Martina, G. Masera, High speed architectures for finding the first two maximum\/minimum values. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 20(12), 2342\u20132346 (2012). \n                    https:\/\/doi.org\/10.1109\/TVLSI.2011.2174166","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"1107_CR2","doi-asserted-by":"publisher","unstructured":"F. Angarita, V. Torres, A. Perez-Pascual, J. Valls, High-throughput FPGA-based emulator for structured LDPC codes. in 19th IEEE International Conference on Electronics, Circuits and Systems (ICECS) (2012), pp. 404\u2013407. \n                    https:\/\/doi.org\/10.1109\/ICECS.2012.6463664","DOI":"10.1109\/ICECS.2012.6463664"},{"issue":"7","key":"1107_CR3","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.1109\/TCSI.2014.2304660","volume":"61","author":"F Angarita","year":"2014","unstructured":"F. Angarita, J. Valls, V. Almenar, V. Torres, Reduced-complexity min-sum algorithm for decoding LDPC codes with low error-floor. IEEE Tran. Circuits Syst. I Regul. Pap. 61(7), 2150\u20132158 (2014). \n                    https:\/\/doi.org\/10.1109\/TCSI.2014.2304660","journal-title":"IEEE Tran. Circuits Syst. I Regul. Pap."},{"key":"1107_CR4","doi-asserted-by":"publisher","unstructured":"D. Bao, X. Chen, Y. Huang, C. Wu, Y. Chen, X.Y. Zeng, A single-routing layered LDPC decoder for 10Gbase-T Ethernet in 130nm CMOS, in 17th Asia and South Pacific Design Automation Conference (ASP-DAC) (2012), pp. 565\u2013566. \n                    https:\/\/doi.org\/10.1109\/ASPDAC.2012.6165020","DOI":"10.1109\/ASPDAC.2012.6165020"},{"key":"1107_CR5","doi-asserted-by":"publisher","unstructured":"A. Cevrero, Y. Leblebici, P. Ienne, A. Burg, A 5.35 mm\n                    \n                      \n                    \n                    $$^{2}$$\n                    \n                      \n                        \n                          \n                          2\n                        \n                      \n                    \n                   10GBASE-T Ethernet LDPC decoder chip in 90 nm CMOS, in IEEE Asian Solid State Circuits Conference (A-SSCC) (2010), pp. 1\u20134. \n                    https:\/\/doi.org\/10.1109\/ASSCC.2010.5716619","DOI":"10.1109\/ASSCC.2010.5716619"},{"issue":"8","key":"1107_CR6","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1109\/TCOMM.2005.852852","volume":"53","author":"J Chen","year":"2005","unstructured":"J. Chen, A. Dholakia, E. Eleftheriou, M. Fossorier, X.Y. Hu, Reduced-complexity decoding of LDPC codes. IEEE Trans. Commun. 53(8), 1288\u20131299 (2005). \n                    https:\/\/doi.org\/10.1109\/TCOMM.2005.852852","journal-title":"IEEE Trans. Commun."},{"issue":"9","key":"1107_CR7","doi-asserted-by":"publisher","first-page":"2738","DOI":"10.1109\/TCSI.2014.2312479","volume":"61","author":"CC Cheng","year":"2014","unstructured":"C.C. Cheng, J.D. Yang, H.C. Lee, C.H. Yang, Y.L. Ueng, A fully parallel LDPC decoder architecture using probabilistic min-sum algorithm for high-throughput applications. IEEE Tran. Circuits Syst. I Regul. Pap. 61(9), 2738\u20132746 (2014). \n                    https:\/\/doi.org\/10.1109\/TCSI.2014.2312479","journal-title":"IEEE Tran. Circuits Syst. I Regul. Pap."},{"key":"1107_CR8","doi-asserted-by":"publisher","unstructured":"A. Darabiha, A. Carusone, F. Kschischang, A bit-serial approximate min-sum LDPC decoder and FPGA implementation, in IEEE International Symposium on Circuits and Systems, 2006. ISCAS (2006), p. 4. \n                    https:\/\/doi.org\/10.1109\/ISCAS.2006.1692544","DOI":"10.1109\/ISCAS.2006.1692544"},{"issue":"6","key":"1107_CR9","doi-asserted-by":"publisher","first-page":"2947","DOI":"10.1109\/TIT.2015.2508455","volume":"62","author":"Q Diao","year":"2016","unstructured":"Q. Diao, J. Li, S. Lin, I.F. Blake, New classes of partial geometries and their associated LDPC codes. IEEE Trans. Inf. Theory 62(6), 2947\u20132965 (2016). \n                    https:\/\/doi.org\/10.1109\/TIT.2015.2508455","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1107_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R Gallager","year":"1962","unstructured":"R. Gallager, Low-density parity-check codes. IEEE Trans. Inf. Theory 8(1), 21\u201328 (1962). \n                    https:\/\/doi.org\/10.1109\/TIT.1962.1057683","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1107_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1109\/TVLSI.2017.2766925","volume":"26","author":"R Ghanaatian","year":"2018","unstructured":"R. Ghanaatian, A. Balatsoukas-Stimming, T.C. Mller, M. Meidlinger, G. Matz, A. Teman, A. Burg, A 588-gb\/s LDPC decoder based on finite-alphabet message passing. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 26(2), 329\u2013340 (2018). \n                    https:\/\/doi.org\/10.1109\/TVLSI.2017.2766925","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"issue":"2","key":"1107_CR12","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"F Kschischang","year":"2001","unstructured":"F. Kschischang, B. Frey, H.A. Loeliger, Factor graphs and the sum-product algorithm. IEEE Trans. Inf. Theory 47(2), 498\u2013519 (2001). \n                    https:\/\/doi.org\/10.1109\/18.910572","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1107_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1109\/TCSI.2014.2354753","volume":"62","author":"JO Lacruz","year":"2015","unstructured":"J.O. Lacruz, F. Garca-Herrero, J. Valls, D. Declercq, One minimum only trellis decoder for non-binary low-density parity-check codes. IEEE Tran. Circuits Syst. I Regul. Pap. 62(1), 177\u2013184 (2015). \n                    https:\/\/doi.org\/10.1109\/TCSI.2014.2354753","journal-title":"IEEE Tran. Circuits Syst. I Regul. Pap."},{"issue":"1","key":"1107_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TCSII.2014.2362663","volume":"62","author":"Y Lee","year":"2015","unstructured":"Y. Lee, B. Kim, J. Jung, I.C. Park, Low-complexity tree architecture for finding the first two minima. IEEE Trans. Circuits Syst. II Express Briefs 62(1), 61\u201364 (2015). \n                    https:\/\/doi.org\/10.1109\/TCSII.2014.2362663","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"issue":"5","key":"1107_CR15","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TCSI.2010.2046957","volume":"57","author":"T Mohsenin","year":"2010","unstructured":"T. Mohsenin, D. Truong, B. Baas, A Low-complexity message-passing algorithm for reduced routing congestion in LDPC decoders. IEEE Tran. Circuits Syst. I Regul. Pap. 57(5), 1048\u20131061 (2010). \n                    https:\/\/doi.org\/10.1109\/TCSI.2010.2046957","journal-title":"IEEE Tran. Circuits Syst. I Regul. Pap."},{"issue":"8","key":"1107_CR16","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/TCSII.2015.2433451","volume":"62","author":"I Tsatsaragkos","year":"2015","unstructured":"I. Tsatsaragkos, V. Paliouras, Approximate algorithms for identifying minima on min-sum LDPC decoders and their hardware implementation. IEEE Trans. Circuits Syst. II Express Briefs 62(8), 766\u2013770 (2015). \n                    https:\/\/doi.org\/10.1109\/TCSII.2015.2433451","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"issue":"20","key":"1107_CR17","doi-asserted-by":"publisher","first-page":"5368","DOI":"10.1109\/TSP.2017.2725221","volume":"65","author":"YL Ueng","year":"2017","unstructured":"Y.L. Ueng, C.Y. Wang, M.R. Li, An efficient combined bit-flipping and stochastic LDPC decoder using improved probability tracers. IEEE Trans. Signal Process. 65(20), 5368\u20135380 (2017). \n                    https:\/\/doi.org\/10.1109\/TSP.2017.2725221","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1107_CR18","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TCSI.2009.2018915","volume":"57","author":"C Zhang","year":"2010","unstructured":"C. Zhang, Z. Wang, J. Sha, L. Li, J. Lin, Flexible LDPC decoder design for multigigabit-per-second applications. IEEE Tran. Circuits Syst. I Regul. Pap. 57(1), 116\u2013124 (2010). \n                    https:\/\/doi.org\/10.1109\/TCSI.2009.2018915","journal-title":"IEEE Tran. Circuits Syst. I Regul. Pap."},{"issue":"6","key":"1107_CR19","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1109\/TCOMM.2009.06.070313","volume":"57","author":"B Zhou","year":"2009","unstructured":"B. Zhou, J. Kang, S. Song, S. Lin, K. Abdel-Ghaffar, M. Xu, Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions. IEEE Trans. Commun. 57(6), 1652\u20131662 (2009). \n                    https:\/\/doi.org\/10.1109\/TCOMM.2009.06.070313","journal-title":"IEEE Trans. Commun."}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-019-01107-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00034-019-01107-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-019-01107-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T23:09:57Z","timestamp":1585955397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00034-019-01107-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,5]]},"references-count":19,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["1107"],"URL":"https:\/\/doi.org\/10.1007\/s00034-019-01107-z","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"value":"0278-081X","type":"print"},{"value":"1531-5878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,5]]},"assertion":[{"value":"13 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}