{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:11:58Z","timestamp":1704931918485},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2019,6,1]]},"DOI":"10.1587\/transcom.2018ebp3111","type":"journal-article","created":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T22:23:50Z","timestamp":1543789430000},"page":"1128-1139","source":"Crossref","is-referenced-by-count":0,"title":["Design of High-Rate Polar-LDGM Codes for Relay Satellite Communications"],"prefix":"10.23919","volume":"E102.B","author":[{"given":"Bin","family":"DUO","sequence":"first","affiliation":[{"name":"College of Information Science & Technology, Chengdu University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junsong","family":"LUO","sequence":"additional","affiliation":[{"name":"College of Information Science & Technology, Chengdu University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"FANG","sequence":"additional","affiliation":[{"name":"College of Information Science & Technology, Chengdu University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"JIA","sequence":"additional","affiliation":[{"name":"College of Information Science & Technology, Chengdu University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoling","family":"ZHONG","sequence":"additional","affiliation":[{"name":"College of Information Science & Technology, Chengdu University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiyan","family":"JIN","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","unstructured":"[1] G.D. Forney, Concatenated Code, MIT Press, Cambridge, Massachusetts, 1966."},{"key":"2","unstructured":"[2] ETSI, \u201cDigital Video Broadcasting (DVB); Framing structure, channel coding and modulation for 11\/12GHz satellite services,\u201d EN 300 421, V1.1.2, Aug. 1997."},{"key":"3","unstructured":"[3] 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 1: DVB-S2,\u201d EN 302 307-1, V1.4.1, Nov. 2014."},{"key":"4","unstructured":"[4] 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, Feb. 2015."},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] R. Gallager, \u201cLow-density parity-check codes,\u201d IEEE Trans. Inf. Theory, vol.8, no.1, pp.21-28, 1962. 10.1109\/tit.1962.1057683","DOI":"10.1109\/TIT.1962.1057683"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] T.C. Chen, E.H. Lu, C.J. Li, and K.T. Huang, \u201cAn efficient weighted bit-flipping algorithm for decoding LDPC codes based on log-likelihood ratio of bit error probability,\u201d IEICE Trans. Commun., vol.E100-B, no.12, pp.2095-2103, Dec. 2017. 10.1587\/transcom.2016ebp3376","DOI":"10.1587\/transcom.2016EBP3376"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] S.H. Tanno, T. Nishimura, T. Ohgane, and Y. Ogawa, \u201cSerial and parallel LLR updates using damped LLR for LDPC coded massive MIMO detection with belief propagation,\u201d IEICE Trans. Commun., vol.E100-B, no.8, pp.1277-1284, Aug. 2017. 10.1587\/transcom.2016fgp0012","DOI":"10.1587\/transcom.2016FGP0012"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] J. Garcia-Frias and W. Zhong, \u201cApproaching Shannon performance by iterative decoding of linear codes with low-density generator matrix,\u201d IEEE Commun. Lett., vol.7, no.6, pp.266-268, 2003. 10.1109\/lcomm.2003.813816","DOI":"10.1109\/LCOMM.2003.813816"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] 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, 1999. 10.1109\/18.748992","DOI":"10.1109\/18.748992"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] E. Arikan, \u201cChannel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,\u201d IEEE Trans. Inf. Theory, vol.55, no.7, pp.3051-3073, 2009. 10.1109\/tit.2009.2021379","DOI":"10.1109\/TIT.2009.2021379"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] A. Eslami and H. Pishro-Nik, \u201cOn finite-length performance of polar codes: Stopping sets, error floor, and concatenated design,\u201d IEEE Trans. Commun., vol.61, no.3, pp.919-929, 2013. 10.1109\/tcomm.2013.012313.110692","DOI":"10.1109\/TCOMM.2013.012313.110692"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] M. Mondelli, S.H. Hassani, and R.L. Urbanke, \u201cUnified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors,\u201d IEEE Trans. Inf. Theory, vol.62, no.12, pp.6698-6712, 2016. 10.1109\/tit.2016.2616117","DOI":"10.1109\/TIT.2016.2616117"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] E. Arikan, \u201cA performance comparison of polar codes and reed-muller codes,\u201d IEEE Commun. Lett., vol.12, no.6, pp.447-449, 2008. 10.1109\/lcomm.2008.080017","DOI":"10.1109\/LCOMM.2008.080017"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] N. Hussami, S.B. Korada, and R. Urbanke, \u201cPerformance of polar codes for channel and source coding,\u201d Proc. 2009 IEEE International Symposium on Information Theory (ISIT), pp.1488-1492, 2009. 10.1109\/isit.2009.5205860","DOI":"10.1109\/ISIT.2009.5205860"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] E. Arikan, \u201cOn the origin of polar coding,\u201d IEEE J. Sel. Areas Commun., vol.34, no.2, pp.209-223, 2016. 10.1109\/jsac.2015.2504300","DOI":"10.1109\/JSAC.2015.2504300"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] U.U. Fayyaz and J.R. Barry, \u201cLow-complexity soft-output decoding of polar codes,\u201d IEEE J. Sel. Areas Commun., vol.32, no.5, pp.958-966, 2014. 10.1109\/jsac.2014.140515","DOI":"10.1109\/JSAC.2014.140515"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] I. Tal and A. Vardy, \u201cList decoding of polar codes,\u201d IEEE Trans. Inf. Theory, vol.61, no.5, pp.2213-2226, 2015. 10.1109\/TIT.2015.2410251","DOI":"10.1109\/TIT.2015.2410251"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W.J. Gross, \u201cFast list decoders for polar codes,\u201d IEEE J. Sel. Areas Commun., vol.34, no.2, pp.318-328, 2016. 10.1109\/jsac.2015.2504299","DOI":"10.1109\/JSAC.2015.2504299"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[19] D. Kim and I.C. Park, \u201cA fast successive cancellation list decoder for polar codes with an early stopping criterion,\u201d IEEE Trans. Signal Process., vol.66, no.18, pp.4971-4979, 2018. 10.1109\/tsp.2018.2864580","DOI":"10.1109\/TSP.2018.2864580"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] S.M. Abbas, Y.Z. Fan, J. Chen, and C.Y. Tsui, \u201cHigh-throughput and energy-efficient belief propagation polar code decoder,\u201d IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol.25, no.3, pp.1098-1111, 2017. 10.1109\/tvlsi.2016.2620998","DOI":"10.1109\/TVLSI.2016.2620998"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[21] E.C. Van Der Meulen, \u201cThree-terminal communication channels,\u201d Adv. Appl. Probab., vol.3, no.1, pp.120-154, 1971. 10.2307\/1426331","DOI":"10.2307\/1426331"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] M. Andersson, V. Rathi, R. Thobaben, J. Kliewer, and M. Skoglund, \u201cNested polar codes for wiretap and relay channels,\u201d IEEE Commun. Lett., vol.14, no.8, pp.752-754, 2010. 10.1109\/lcomm.2010.08.100875","DOI":"10.1109\/LCOMM.2010.08.100875"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] R. Blasco-Serrano, R. Thobaben, M. Andersson, V. Rathi, and M. Skoglund, \u201cPolar codes for cooperative relaying,\u201d IEEE Trans. Commun., vol.60, no.11, pp.3263-3273, 2012. 10.1109\/tcomm.2012.081412.110266","DOI":"10.1109\/TCOMM.2012.081412.110266"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] A. Bravo-Santos, \u201cPolar codes for Gaussian degraded relay channels,\u201d IEEE Commun. Lett., vol.17, no.2, pp.365-368, 2013. 10.1109\/lcomm.2013.011113.122188","DOI":"10.1109\/LCOMM.2013.011113.122188"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] B. Duo, X.L. Zhong, and Y. Guo, \u201cPractical polar code construction for degraded multiple-relay networks,\u201d China Commun., vol.14, no.4, pp.127-139, 2017. 10.1109\/cc.2017.7927571","DOI":"10.1109\/CC.2017.7927571"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] F. Yang, K. Niu, C. Dong, and B. Tian, \u201cPolar codes for soft decode-and-forward in half-duplex relay channels,\u201d China Commun., vol.14, no.8, pp.22-32, 2017. 10.1109\/cc.2017.8014344","DOI":"10.1109\/CC.2017.8014344"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] A. Chakrabarti, A. De Baynast, A. Sabharwal, and B. Aazhang, \u201cLow density parity check codes for the relay channel,\u201d IEEE J. Sel. Areas Commun., vol.25, no.2, pp.280-290, 2007. 10.1109\/jsac.2007.070205","DOI":"10.1109\/JSAC.2007.070205"},{"key":"28","unstructured":"[28] S.B. Korada, \u201cPolar codes for channel and source coding,\u201d Ph.D Dissertation, EPFL, Lausanne, 2009."},{"key":"29","doi-asserted-by":"crossref","unstructured":"[29] C. Di, D. Proietti, I.E. Telatar, T.J. Richardson, and R.L. Urbanke, \u201cFinite-length analysis of low-density parity-check codes on the binary erasure channel,\u201d IEEE Trans. Inf. Theory, vol.48, no.6, pp.1570-1579, 2002. 10.1109\/tit.2002.1003839","DOI":"10.1109\/TIT.2002.1003839"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[30] M. Gonz\u00e1lez-L\u00f3pez, F.J. V\u00e1zquez-Ara\u00fajo, L. Castedo, and J. Garcia-Frias, \u201cLayered LDGM codes: A capacity-approaching structure for arbitrary rates,\u201d Proc. 4th IEEE International Symposium on Wireless Communication Systems (ISWCS), pp.16-20, 2007. 10.1109\/iswcs.2007.4392293","DOI":"10.1109\/ISWCS.2007.4392293"},{"key":"31","doi-asserted-by":"publisher","unstructured":"[31] X.Y. Hu, E. Eleftheriou, and D.M. Arnold, \u201cRegular and irregular progressive edge-growth tanner graphs,\u201d IEEE Trans. Inf. Theory, vol.51, no.1, pp.386-398, 2005. 10.1109\/tit.2004.839541","DOI":"10.1109\/TIT.2004.839541"},{"key":"32","unstructured":"[33] ITU-T, \u201cEnd-to-end error performance parameters and objectives for international, constant bit-rate digital paths and connections,\u201d Recommendation G.826, Dec. 2002."}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E102.B\/6\/E102.B_2018EBP3111\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T14:57:39Z","timestamp":1704898659000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E102.B\/6\/E102.B_2018EBP3111\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,1]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2018ebp3111","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,1]]}}}