{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:50:52Z","timestamp":1759146652690},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,11,27]],"date-time":"2013-11-27T00:00:00Z","timestamp":1385510400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s11265-013-0864-x","type":"journal-article","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T21:53:18Z","timestamp":1385416398000},"page":"211-222","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Check Node Processing Architectures for Non-binary LDPC Decoding Using Power Representation"],"prefix":"10.1007","volume":"76","author":[{"given":"Fang","family":"Cai","sequence":"first","affiliation":[]},{"given":"Xinmiao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,27]]},"reference":[{"key":"864_CR1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/4234.681360","volume":"2","author":"M Davey","year":"1998","unstructured":"Davey, M., & MacKay, D.J. (1998). Low density parity check codes over GF(q). IEEE Communications Letters, 2, 165\u2013167.","journal-title":"IEEE Communications Letters"},{"key":"864_CR2","doi-asserted-by":"crossref","unstructured":"Wymeersch, H., Steendam, H., Moeneclaey, M. (2004). Log-domain decoding of LDPC codes over GF ( q ) $GF(q)$ . In Proceedings IEEE international conference on communications (pp. 772\u2013776). Paris.","DOI":"10.1109\/ICC.2004.1312606"},{"key":"864_CR3","unstructured":"Barnault, L., & Declercq, D. (2003). Fast decoding algorithm for LDPC over GF ( 2 q ) $GF(2^{q})$ . In proceedings information theory workshop. Paris."},{"issue":"12","key":"864_CR4","doi-asserted-by":"crossref","first-page":"2609","DOI":"10.1109\/TCSI.2009.2016621","volume":"56","author":"C Spagnol","year":"2009","unstructured":"Spagnol, C., Popovici, E., Marnane, W. (2009). Hardware implementation of GF ( 2 m ) $GF(2^{m})$ LDPC decoders. IEEE Transactions on Circuits and Systems I, 56(12), 2609\u20132620.","journal-title":"IEEE Transactions on Circuits and Systems I"},{"issue":"4","key":"864_CR5","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1109\/TCOMM.2007.894088","volume":"55","author":"D Declercq","year":"2007","unstructured":"Declercq, D., & Fossorier, M. (2007). Decoding algorithms for nonbinary LDPC codes over GF(q). IEEE Transactions on Communications, 55(4), 633\u2013643.","journal-title":"IEEE Transactions on Communications"},{"key":"864_CR6","doi-asserted-by":"crossref","unstructured":"Savin, V. (2008). Min-Max decoding for non binary LDPC codes. In Proceedings IEEE international symposia on information theory (pp. 960\u2013964). Toronto.","DOI":"10.1109\/ISIT.2008.4595129"},{"issue":"2","key":"864_CR7","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1109\/TCSI.2010.2071830","volume":"58","author":"X Zhang","year":"2011","unstructured":"Zhang, X., & Cai, F. (2011). Efficient partial-parallel decoder architecture for quasi-cyclic non-binary LDPC codes. IEEE Transactions on Circuits and Systems I, 58(2), 402\u2013414.","journal-title":"IEEE Transactions on Circuits and Systems I"},{"issue":"7","key":"864_CR8","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1109\/TVLSI.2010.2047956","volume":"17","author":"X Zhang","year":"2011","unstructured":"Zhang, X., & Cai, F. (2011). Reduced-complexity decoder architecture for non-binary LDPC codes. IEEE Transactions on VLSI Systems, 17(7), 1229\u20131238.","journal-title":"IEEE Transactions on VLSI Systems"},{"key":"864_CR9","unstructured":"Cai, F., & Zhang, X. (in press). Relaxed min-max decoder architectures for nonbinary low-density parity-check codes. IEEE Transactions on VLSI Systems."},{"issue":"5","key":"864_CR10","first-page":"1071","volume":"57","author":"J Lin","year":"2010","unstructured":"Lin, J., Sha, J., Wang, Z., Li, L. (2010). Efficient decoder design for nonbinary quasicyclic LDPC codes. IEEE Transactions on VLSI Systems I, 57(5), 1071\u20131082.","journal-title":"IEEE Transactions on VLSI Systems I"},{"issue":"1","key":"864_CR11","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1109\/TCSI.2011.2161416","volume":"59","author":"X Chen","year":"2012","unstructured":"Chen, X., Lin, S., Akella, V. (2012). Efficient con urable decoder architecture for non-binary quasi-cyclic LDPC codes. IEEE Transactions on Circuits and Systems I, 59(1), 188\u2013197.","journal-title":"IEEE Transactions on Circuits and Systems I"},{"issue":"11","key":"864_CR12","doi-asserted-by":"crossref","first-page":"2784","DOI":"10.1109\/TCSI.2012.2190668","volume":"59","author":"X Chen","year":"2012","unstructured":"Chen, X., & Wang, C. (2012). High-throughput efficient non-binary LDPC decoder based on the simplified min-sum algorithm. IEEE Transactions on Circuits and Systems I, 59(11), 2784\u20132794.","journal-title":"IEEE Transactions on Circuits and Systems I"},{"issue":"1","key":"864_CR13","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TCOMM.2012.101712.110709","volume":"61","author":"C Wang","year":"2013","unstructured":"Wang, C., Chen, X., Li, Z., Yang, S. (2013). A simplified min-sum decoding algorithm for non-binary LDPC codes. IEEE Transactions on Communication, 61(1), 24\u201332.","journal-title":"IEEE Transactions on Communication"},{"key":"864_CR14","doi-asserted-by":"crossref","unstructured":"Cai, F., & Zhang, X. (2012). Efficient check node processing architectures for non-binary LDPC decoding using power representation. In Proceedings IEEE workshop on signal processing systems (pp. 137\u2013142). Quebec.","DOI":"10.1109\/SiPS.2012.12"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-013-0864-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-013-0864-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-013-0864-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,3]],"date-time":"2019-08-03T22:16:11Z","timestamp":1564870571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-013-0864-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,27]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["864"],"URL":"https:\/\/doi.org\/10.1007\/s11265-013-0864-x","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,27]]}}}