{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:09:49Z","timestamp":1777334989285,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s11036-019-01392-7","type":"journal-article","created":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T20:04:15Z","timestamp":1569960255000},"page":"1848-1852","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An Improved Low Complex Offset Min-Sum Based Decoding Algorithm for LDPC Codes"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1484-703X","authenticated-orcid":false,"given":"Michaelraj Kingston","family":"Roberts","sequence":"first","affiliation":[]},{"given":"S. Sudha","family":"Mohanram","sequence":"additional","affiliation":[]},{"given":"N.","family":"Shanmugasundaram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,1]]},"reference":[{"issue":"1","key":"1392_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R Gallager","year":"1962","unstructured":"Gallager R (1962) Low-density parity-check codes. IRE Trans Inform Theor 8(1):21\u201328","journal-title":"IRE Trans Inform Theor"},{"issue":"6","key":"1392_CR2","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1631\/FITEE.1400269","volume":"16","author":"MK Roberts","year":"2015","unstructured":"Roberts MK, Jayabalan R (2015) An improved low-complexity sum-product decoding algorithm for low-density parity-check codes. Front Inform Technol Electron Eng 16(6):511\u2013518","journal-title":"Front Inform Technol Electron Eng"},{"issue":"12","key":"1392_CR3","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1109\/LCOMM.2015.2492965","volume":"19","author":"S Papaharalabos","year":"2015","unstructured":"Papaharalabos S, Lazarakis F (2015) Approximated box-plus decoding of LDPC codes. IEEE Commun Lett 19(12):2074\u20132077","journal-title":"IEEE Commun Lett"},{"issue":"5","key":"1392_CR4","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/4234.1001666","volume":"6","author":"J Chen","year":"2002","unstructured":"Chen J, Fossorier MPC (2002) Density evolution for two improved BP-based decoding algorithms of LDPC codes. IEEE Commun Lett 6(5):208\u2013210","journal-title":"IEEE Commun Lett"},{"key":"1392_CR5","doi-asserted-by":"crossref","unstructured":"F. Vatta, A. Soranzo, and F. Babich, \u201cLow-complexity bound on irregular LDPC belief-propagation decoding thresholds using a Gaussian approximation,\u201d Electron Lett, vol. 54, no. 17, pp. 1038\u20131040, Aug. 2018","DOI":"10.1049\/el.2018.0478"},{"issue":"5","key":"1392_CR6","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/26.768759","volume":"47","author":"MPC Fossorier","year":"1999","unstructured":"Fossorier MPC, Mihaljevic M, Imai H (1999) Reduced complexity iterative decoding of low-density parity check codes based on belief propagation. IEEE Trans Commun 47(5):673\u2013680","journal-title":"IEEE Trans Commun"},{"issue":"1","key":"1392_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.optcom.2019.02.071","volume":"442","author":"DT Nguyen","year":"2019","unstructured":"Nguyen DT, Park Y (2019) Performance analysis of interleaved LDPC for optical satellite communications. Optic Commun 442(1):13\u201318","journal-title":"Optic Commun"},{"issue":"8","key":"1392_CR8","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/s11265-018-1398-z","volume":"91","author":"JH Lee","year":"2019","unstructured":"Lee JH, Sunwoo MH (2019) Low-complexity high-throughput bit-wise LDPC decoder. J Signal Process Syst 91(8):855\u2013862","journal-title":"J Signal Process Syst"},{"issue":"10","key":"1392_CR9","first-page":"4044","volume":"64","author":"S Jayasooriya","year":"2016","unstructured":"Jayasooriya S, Shirvanimoghaddam M, Ong L, Lechner G, Johnson SJ (2016) A new density evolution approximation for LDPC and multi-edge type LDPC codes. IEEE Trans Commun 64(10):4044\u20134056","journal-title":"IEEE Trans Commun"},{"issue":"10","key":"1392_CR10","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.1049\/iet-com.2017.0014","volume":"11","author":"X Wang","year":"2017","unstructured":"Wang X, Cao W, Li J, Shan L, Cao H, Li J, Qianet F (2017) Improved min-sum algorithm based on density evolution for low-density parity check codes. IET Commun 11(10):1582\u20131586","journal-title":"IET Commun"},{"issue":"8","key":"1392_CR11","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1109\/TCOMM.2005.852852","volume":"53","author":"J Chen","year":"2005","unstructured":"Chen J, Dholakia A, Eleftheriou E, Fossorier MPC, Hu X-Y (2005) Reduced- complexity decoding of LDPC codes. IEEE Trans Commun 53(8):1288\u20131299","journal-title":"IEEE Trans Commun"},{"issue":"1","key":"1392_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.envsoft.2019.03.022","volume":"118","author":"F Khorashadi Zadeh","year":"2019","unstructured":"Khorashadi Zadeh F, Nossent J, Woldegiorgis BT, Bauwens W, van Griensven A (2019) Impact of measurement error and limited data frequency on parameter estimation and uncertainty quantification. Environ Model Softw 118(1):35\u201347","journal-title":"Environ Model Softw"},{"issue":"10","key":"1392_CR13","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1016\/j.aeue.2014.04.024","volume":"68","author":"Z Wu","year":"2014","unstructured":"Wu Z, Su K, Guo L (2014) A modified min sum decoding algorithm based on LMMSE for LDPC codes. AEU Int J Electron Commun 68(10):994\u2013999","journal-title":"AEU Int J Electron Commun"},{"issue":"9","key":"1392_CR14","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1016\/j.sigpro.2013.03.006","volume":"93","author":"V Savaux","year":"2013","unstructured":"Savaux V, Lou\u00ebt Y, Djoko-Kouam M, Skrzypczak A (2013) Artificial channel aided LMMSE estimation for time\u2013frequency selective channels in OFDM context. Signal Process 93(9):2369\u20132380","journal-title":"Signal Process"},{"key":"1392_CR15","doi-asserted-by":"crossref","unstructured":"A. Boudjellal, K. Abed-Meraim, A. Belouchrani, and Ph. Ravier, \u201cImproved order-statistics-based noise power estimator,\u201d Signal Process, vol. 164, no.1, pp. 202\u2013205, Nov. 2019","DOI":"10.1016\/j.sigpro.2019.06.002"},{"issue":"2","key":"1392_CR16","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1002\/sat.1173","volume":"35","author":"W Xue","year":"2017","unstructured":"Xue W, Ban T, Wang J (2017) A modified normalized min-sum algorithm for LDPC decoding using order statistics. Int J Satell Commun Netw 35(2):163\u2013175","journal-title":"Int J Satell Commun Netw"},{"key":"1392_CR17","doi-asserted-by":"crossref","unstructured":"M. K. Roberts and R. Jayabalan, \u201cA modified optimally quantized offset min-sum decoding algorithm for low-complexity LDPC decoder,\u201d Wirel Pers Commun, vol. 80, no. 2, pp. 561\u2013570, Jan. 2015","DOI":"10.1007\/s11277-014-2026-2"},{"issue":"4","key":"1392_CR18","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/TBC.2017.2686011","volume":"63","author":"S Myung","year":"2017","unstructured":"Myung S, Park S-I, Kim K-J, Lee J-Y, Kwon S, Kim J (2017) Offset and normalized min-sum algorithms for ATSC 3.0 LDPC decoder. IEEE Trans Broadcast 63(4):734\u2013739","journal-title":"IEEE Trans Broadcast"},{"issue":"6","key":"1392_CR19","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1109\/LCOMM.2006.1638623","volume":"10","author":"M Jiang","year":"2006","unstructured":"Jiang M, Zhao C, Li Z, Enyang X (2006) Adaptive offset min-sum algorithm for low-density parity check codes. IEEE Commun Lett 10(6):483\u2013485","journal-title":"IEEE Commun Lett"},{"issue":"13","key":"1392_CR20","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1049\/el:20040551","volume":"40","author":"N Kim","year":"2004","unstructured":"Kim N, Park H (2004) Modified UMP-BP decoding algorithm based on mean square error. Electron Lett 40(13):816\u2013817","journal-title":"Electron Lett"},{"key":"1392_CR21","doi-asserted-by":"crossref","unstructured":"Zheng H, Zhou H, He J (2009) Design of BP-based decoding for short LDPC codes using MMSE criterion. 2009 5th international conference on wireless communications, networking and Mobile computing: 1\u20134","DOI":"10.1109\/WICOM.2009.5303564"},{"issue":"1","key":"1392_CR22","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jfranklin.2007.06.002","volume":"345","author":"A Abedi","year":"2008","unstructured":"Abedi A, Khandani AK (2008) A new method for performance evaluation of bit decoding algorithms using statistics of the log likelihood ratio. J Franklin Instit 345(1):60\u201374","journal-title":"J Franklin Instit"},{"issue":"7","key":"1392_CR23","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1109\/LCOMM.2010.07.100508","volume":"14","author":"X Wu","year":"2010","unstructured":"Wu X, Song Y, Jiang M, Zhao C (2010) Adaptive-normalized\/offset min-sum algorithm. IEEE Commun Lett 14(7):667\u2013669","journal-title":"IEEE Commun Lett"},{"issue":"1","key":"1392_CR24","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.phycom.2017.10.003","volume":"25","author":"T-L Kung","year":"2017","unstructured":"Kung T-L (2017) A MMSE-based joint timing synchronization and channel estimation scheme for two-way amplify-and-forward relay networks. Phys Commun 25(1):173\u2013183","journal-title":"Phys Commun"},{"issue":"5","key":"1392_CR25","doi-asserted-by":"publisher","first-page":"457","DOI":"10.3390\/e21050457","volume":"21","author":"X Wang","year":"2019","unstructured":"Wang X, Chang H, Li J, Cao W, Shan L (2019) Analysis of TDMP algorithm of LDPC codes based on density evolution and Gaussian approximation. Entropy 21(5):457","journal-title":"Entropy"},{"key":"1392_CR26","doi-asserted-by":"crossref","unstructured":"F. Vatta, A. Soranzo, and F. Babich, \u201cMore accurate analysis of sum-product decoding of LDPC codes using a Gaussian approximation,\u201d IEEE Commun Lett, vol. 23, no.2, pp. 230\u2013233, Feb. 2019","DOI":"10.1109\/LCOMM.2018.2886261"},{"issue":"1","key":"1392_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/LCOMM.2017.2766223","volume":"22","author":"H Wei","year":"2018","unstructured":"Wei H, Banihashemi AH (2018) An iterative check polytope projection algorithm for ADMM-based LP decoding of LDPC codes. IEEE Commun Lett 22(1):29\u201332","journal-title":"IEEE Commun Lett"},{"issue":"2","key":"1392_CR28","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1016\/j.jmaa.2015.12.024","volume":"436","author":"J Segura","year":"2016","unstructured":"Segura J (2016) Sharp bounds for cumulative distribution functions. J Math Anal Appl 436(2):748\u2013763","journal-title":"J Math Anal Appl"},{"key":"1392_CR29","doi-asserted-by":"crossref","unstructured":"Yushu Zhang, Kewu Peng, Zhangmei Chen and Jian Song, \"Progressive matrix growth algorithm for constructing rate-compatible length-scalable raptor-like quasi-cyclic LDPC codes ,\" IEEE Trans Broadcast, vol.64, no.4, pp.816\u2013829, Dec. 2018","DOI":"10.1109\/TBC.2017.2781137"},{"key":"1392_CR30","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.measurement.2018.08.051","volume":"131","author":"MK Roberts","year":"2019","unstructured":"Roberts MK (2019) Simulation and implementation design of multi-mode decoder for Wi-MAX and WLAN applications. Measurement 131:28\u201334","journal-title":"Measurement"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01392-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-019-01392-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01392-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T23:50:40Z","timestamp":1601423440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-019-01392-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,1]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["1392"],"URL":"https:\/\/doi.org\/10.1007\/s11036-019-01392-7","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,1]]},"assertion":[{"value":"1 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}