{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T05:48:34Z","timestamp":1776491314081,"version":"3.51.2"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,8,24]],"date-time":"2014-08-24T00:00:00Z","timestamp":1408838400000},"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":["Wireless Pers Commun"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s11277-014-2026-2","type":"journal-article","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T10:57:02Z","timestamp":1408791422000},"page":"561-570","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Modified Optimally Quantized Offset Min-Sum Decoding Algorithm for Low-Complexity LDPC Decoder"],"prefix":"10.1007","volume":"80","author":[{"given":"Michaelraj Kingston","family":"Roberts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh","family":"Jayabalan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,24]]},"reference":[{"issue":"1","key":"2026_CR1","doi-asserted-by":"crossref","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 Transactions on Information Theory, 8(1), 21\u201328.","journal-title":"IRE Transactions on Information Theory"},{"issue":"2","key":"2026_CR2","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/18.910576","volume":"47","author":"MG Luby","year":"2001","unstructured":"Luby, M. G., Mitzenmacher, M., Shokrollahi, M. A., & Spielman, D. A. (2001). Improved low-density parity-check codes using irregular graphs. IEEE Transactions on Information Theory, 47(2), 585\u2013598.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026_CR3","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.910577","volume":"47","author":"TJ Richardson","year":"2001","unstructured":"Richardson, T. J., & Urbanke, R. (2001). The capacity of low-density parity check codes under message passing decoding. IEEE Transactions on Information Theory, 47(2), 599\u2013618.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026_CR4","doi-asserted-by":"crossref","unstructured":"Anastasopoulos, A. (2001). A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution. In IEEE global telecommunication conference, 2001 GLOBECOM \u201901, (pp. 1021\u20131025) IEEE.","DOI":"10.1109\/GLOCOM.2001.965572"},{"issue":"5","key":"2026_CR5","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/26.768759","volume":"47","author":"M Fossorier","year":"1999","unstructured":"Fossorier, M., Mihalijevic, M., & Imai, H. (1999). Reduced complexity iterative decoding of low-density parity-check codes based on belief propagation. IEEE Transactions on Communications, 47(5), 673\u2013680.","journal-title":"IEEE Transactions on Communications"},{"issue":"10","key":"2026_CR6","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1109\/TCOMM.2012.072412.110464","volume":"60","author":"Y Fang","year":"2012","unstructured":"Fang, Y., Chen, P., Wang, L., & Lau, F. (2012). Design of protograph LDPC codes for partial response channels. IEEE Transactions on Communications, 60(10), 2809\u20132819.","journal-title":"IEEE Transactions on Communications"},{"issue":"4","key":"2026_CR7","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/LCOMM.2003.810000","volume":"7","author":"N Varnica","year":"2003","unstructured":"Varnica, N., & Kavcic, A. (2003). Optimized low-density parity-check codes for partial response channels. IEEE Communication Letters, 7(4), 168\u2013170.","journal-title":"IEEE Communication Letters"},{"issue":"3","key":"2026_CR8","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1109\/26.990903","volume":"50","author":"J Chen","year":"2002","unstructured":"Chen, J., & Fossorier, M. P. C. (2002). Near-optimum universal belief propagation based decoding of low density parity check codes. IEEE Transactions on Communications, 50(3), 406\u2013414.","journal-title":"IEEE Transactions on Communications"},{"issue":"8","key":"2026_CR9","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1109\/TCOMM.2005.852852","volume":"53","author":"J Chen","year":"2005","unstructured":"Chen, J., Dholakia, A., Eleftheriou, E., Fossorier, M. P. C., & Hu, X. Y. (2005). Reduced complexity decoding of LDPC codes. IEEE Transactions on Communications, 53(8), 1288\u20131299.","journal-title":"IEEE Transactions on Communications"},{"issue":"3","key":"2026_CR10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1109\/LCOMM.2006.1603377","volume":"10","author":"J Zhang","year":"2006","unstructured":"Zhang, J., Fossorier, M., & Gu, D. (2006). Two-dimensional correction for min-sum decoding of irregular LDPC codes. IEEE Transactions on Communication Letters, 10(3), 180\u2013182.","journal-title":"IEEE Transactions on Communication Letters"},{"issue":"6","key":"2026_CR11","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1109\/LCOMM.2006.1638623","volume":"10","author":"Jiang Ming","year":"2006","unstructured":"Ming, Jiang, Chunming, Zhao, Li, Zhang, & Enyang, Xu. (2006). Adaptive Offset min-sum algorithm for low-density parity check codes. IEEE Communication Letters, 10(6), 483\u2013485.","journal-title":"IEEE Communication Letters"},{"key":"2026_CR12","doi-asserted-by":"crossref","unstructured":"Zarubica, R., Hinton, R., Wilson, S. G., & Hall, E. K. (2008). Efficient quantization schemes for LDPC decoders. In IEEE conference on military communications, 2008 MIL COM\u201908, (pp. 1\u20135) IEEE.","DOI":"10.1109\/MILCOM.2008.4753231"},{"key":"2026_CR13","doi-asserted-by":"crossref","unstructured":"Howard, S.L., Schmidt, G., Bossert, M., & Costa, E. (2005). A degree-matched check node approximation for LDPC decoding. In IEEE international symposium on information theory, 2005 (pp. 1131\u20131135) IEEE.","DOI":"10.1109\/ISIT.2005.1523516"},{"issue":"6","key":"2026_CR14","first-page":"1098","volume":"152","author":"G Masera","year":"2005","unstructured":"Masera, G., Quaglio, F., & Vacca, F. (2005). Finite precision implementation of LDPC decoders. IEE Transations on Communications, 152(6), 1098\u20131102.","journal-title":"IEE Transations on Communications"},{"key":"2026_CR15","unstructured":"IEEE P802.11 wireless LANs TGn Sync Proposal: TGnSync Proposal Technical Specification, IEEE 11\u201304-0889-06-000n, May 2005."}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-014-2026-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-014-2026-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-014-2026-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:16:16Z","timestamp":1559394976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-014-2026-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,24]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["2026"],"URL":"https:\/\/doi.org\/10.1007\/s11277-014-2026-2","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,24]]}}}