{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T04:18:58Z","timestamp":1727065138467},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2022,11,1]]},"DOI":"10.1587\/transcom.2022ebp3032","type":"journal-article","created":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T22:10:03Z","timestamp":1651097403000},"page":"1408-1413","source":"Crossref","is-referenced-by-count":0,"title":["Block-Based Scheduling Algorithm for Layered Decoding of Block LDPC Codes"],"prefix":"10.23919","volume":"E105.B","author":[{"given":"Sangjoon","family":"PARK","sequence":"first","affiliation":[{"name":"Department of Electronic Engineering, Kyonggi University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] D.J.C. MacKay, \u201cGood error-correcting codes based on very sparse matrices,\u201d IEEE Trans. Inf. Theory, vol.45, no.2, pp.399-431, March 1999. 10.1109\/18.748992","DOI":"10.1109\/18.748992"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] S. Chung, G.D. Forney, Jr., T.J. Richardson, and R. Urbanke, \u201cOn the design of low-density parity-check codes within 0.0045dB of the Shannon limit,\u201d IEEE Commun. Lett., vol.5, no.2, pp.58-60, Feb. 2001. 10.1109\/4234.905935","DOI":"10.1109\/4234.905935"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] N. Ohkubo, N. Miki, Y. Kishiyama, K. Higuchi, and M. Sawahashi, \u201cPerformance comparison between turbo code and rate-compatible LDPC code for evolved UTRA downlink OFDM radio access,\u201d Proc. IEEE Military Communications Conference (MILCOM), Washington, DC, USA, pp.1-7, Oct. 2006. 10.1109\/milcom.2006.302034","DOI":"10.1109\/MILCOM.2006.302034"},{"key":"4","unstructured":"[4] A.E.S. Hassan, M. Dessouky, A.A. Elazm, and M. Shokair, \u201cEvaluation of complexity versus performance for turbo code and LDPC under different code rates,\u201d Proc. International Conference on Advances in Satellite and Space Communications (SPACOMM), Chamonix\/Mont Blanc, France, pp.93-98, May 2012."},{"key":"5","unstructured":"[5] IEEE, \u201cIEEE standard for local and metropolitan area networks; Part 16: Air interface for fixed and mobile broadband wireless access systems,\u201d Feb. 2006."},{"key":"6","unstructured":"[6] ETSI, \u201cDigital Video Broadcasting (DVB); Second generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broadband satellite applications; Part 2: DVB-S2 Extensions (DVB-S2X),\u201d EN 302 307-2 V1.1.1, Oct. 2014."},{"key":"7","unstructured":"[7] 3GPP, \u201cNR; Multiplexing and channel coding,\u201d TS38.212-V16.2.0, July 2020."},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] S. Park, S. Lee, S. Hwang, and S. Choi, \u201cA group shuffled BP decoding for punctured low-density parity-check codes,\u201d IEICE Electron. Express, vol.7, no.19, pp.1429-1434, Oct. 2010. 10.1587\/elex.7.1429","DOI":"10.1587\/elex.7.1429"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] Y.-M. Chang, A.I.V. Casado, M.-C.F. Chang, and R.D. Wesel, \u201cLower-complexity layered brief-propagation decoding of LDPC codes,\u201d IEEE Intl. Conf. on Communications, Beijing, China, pp.1155-1160, May 2008. 10.1109\/icc.2008.225","DOI":"10.1109\/ICC.2008.225"},{"key":"10","unstructured":"[10] D.E. Hocevar, \u201cA reduced complexity decoder architecture via layered decoding of LDPC codes,\u201d Proc. IEEE Workshop on Signal Processing Systems (SIPS), Austin, TX, USA, pp.107-112, Oct. 2004. 10.1109\/sips.2004.1363033"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] M. Jang, B. Shin, W. Park, J. No, and D. Shin, \u201cConvergence speed analysis of layered decoding of block-type LDPC codes,\u201d IEICE Trans. Commun., vol.E92-B, no.7, pp.2484-2487, Sept. 2009. 10.1587\/transcom.e92.b.2484","DOI":"10.1587\/transcom.E92.B.2484"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] S. Kim, G.E. Sobelman, and H. Lee, \u201cA reduced-complexity architecture for LDPC layered decoding schemes,\u201d IEEE Trans. Very Lagre Scale Integr. (VLSI) Syst., vol.19, no.6, pp.1099-1103, June 2011. 10.1109\/tvlsi.2010.2043965","DOI":"10.1109\/TVLSI.2010.2043965"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] M. Kim, D. Kim, and Y.H. Lee, \u201cSerial scheduling algorithm of LDPC decoding for multimedia transmission,\u201d Proc. IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB), Seoul, Korea, pp.1-4, June 2012. 10.1109\/bmsb.2012.6264324","DOI":"10.1109\/BMSB.2012.6264324"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Y. Sun and J.R. Cavallaro, \u201cVLSI architecture for layered decoding of QC-LDPC codes with high circulant weight,\u201d IEEE Trans. Very Lagre Scale Integr. (VLSI) Syst., vol.21, no.10, pp.1960-1964, Oct. 2013. 10.1109\/tvlsi.2012.2220388","DOI":"10.1109\/TVLSI.2012.2220388"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] X. Jiao, J. Mu, and H. Wei, \u201cReduced complexity node-wise scheduling of ADMM decoding for LDPC codes,\u201d IEEE Commun. Lett., vol.21, no.3, pp.472-475, March 2017. 10.1109\/lcomm.2016.2643629","DOI":"10.1109\/LCOMM.2016.2643629"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] B. Wang, Y. Zhu, and J. Kang, \u201cTwo effective scheduling schemes for layered belief propagation of 5G LDPC codes,\u201d IEEE Commun. Lett., vol.24, no.8, pp.1683-1686, Aug. 2020. 10.1109\/lcomm.2020.2991473","DOI":"10.1109\/LCOMM.2020.2991473"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] A. Anastasopoulos, \u201cA comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution,\u201d Proc. IEEE Global Communications Conference (GLOBECOM), San Antonio, TX, USA, pp.1021-1025, Nov. 2001. 10.1109\/glocom.2001.965572","DOI":"10.1109\/GLOCOM.2001.965572"}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E105.B\/11\/E105.B_2022EBP3032\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T03:31:07Z","timestamp":1727062267000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E105.B\/11\/E105.B_2022EBP3032\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":17,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2022ebp3032","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"type":"print","value":"0916-8516"},{"type":"electronic","value":"1745-1345"}],"subject":[],"published":{"date-parts":[[2022,11,1]]},"article-number":"2022EBP3032"}}