{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:38:13Z","timestamp":1740148693773,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T00:00:00Z","timestamp":1600732800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T00:00:00Z","timestamp":1600732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s11265-020-01597-0","type":"journal-article","created":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T21:51:03Z","timestamp":1600811463000},"page":"855-862","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["CVR: A Continuously Variable Rate LDPC Decoder Using Parity Check Extension for Minimum Latency"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9843-4664","authenticated-orcid":false,"given":"Sina","family":"Pourjabar","sequence":"first","affiliation":[]},{"given":"Gwan S.","family":"Choi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"issue":"1","key":"1597_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 Transactions on Information Theory, 8(1), 21\u201328.","journal-title":"IRE Transactions on Information Theory"},{"issue":"18","key":"1597_CR2","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1049\/el:19961141","volume":"32","author":"DJ MacKay","year":"1996","unstructured":"MacKay, D. J., & Neal, R. M. (1996). Near Shannon limit performance of low density parity check codes. Electronics Letters, 32(18), 1645\u20131646.","journal-title":"Electronics Letters"},{"issue":"5","key":"1597_CR3","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1109\/TCOMM.2012.042712.110189","volume":"60","author":"SV Maiya","year":"2012","unstructured":"Maiya, S. V., Costello, D. J., & Fuja, T. E. (2012). Low latency coding: Convolutional codes vs. LDPC codes. IEEE Transactions on Communications, 60(5), 1215\u20131225.","journal-title":"LDPC codes. IEEE Transactions on Communications"},{"key":"1597_CR4","doi-asserted-by":"crossref","unstructured":"Battaglioni, M., Tasdighi, A., Baldi, M., Tadayon, M. H., & Chiaraluce, F. (2018) Compact QC-LDPC block and SC-LDPC convolutional codes for low-latency communications. In 2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) (pp. 1-5). Bologna: IEEE.","DOI":"10.1109\/PIMRC.2018.8580758"},{"issue":"7","key":"1597_CR5","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1109\/TCSI.2012.2230506","volume":"60","author":"C-W Sham","year":"2013","unstructured":"Sham, C.-W., Chen, X., Lau, F. C. M., Zhao, Y., & Tam, W. M. (2013). A 2.0 Gb\/s throughput decoder for QC-LDPC convolutional codes. IEEE Transactions on Circuits and Systems I: Regular Papers, 60(7), 1857\u20131869.","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"issue":"1","key":"1597_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/TIT.1979.1055999","volume":"25","author":"J Cain","year":"1979","unstructured":"Cain, J., Clark, G., & Geist, J. (1979). Punctured convolutional codes of rate (n-1)\/n and simplified maximum likelihood decoding (Corresp.). IEEE Transactions on Information Theory, 25(1), 97\u2013100.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"1597_CR7","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/26.2763","volume":"36","author":"J Hagenauer","year":"1988","unstructured":"Hagenauer, J. (1988). Rate-compatible punctured convolutional codes (RCPC codes) and their applications. IEEE Transactions on Communications, 36(4), 389\u2013400.","journal-title":"IEEE Transactions on Communications"},{"issue":"3","key":"1597_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/TCOM.1984.1096047","volume":"32","author":"Y Yasuda","year":"1984","unstructured":"Yasuda, Y., Kashiki, K., & Hirata, Y. (1984). High-rate punctured convolutional codes for soft decision Viterbi decoding. IEEE Transactions on Communications, 32(3), 315\u2013319.","journal-title":"IEEE Transactions on Communications"},{"key":"1597_CR9","unstructured":"Li, J., & Narayanan, K. R. (2002). Rate-compatible Low Density Parity Check Codes for Capacity-approaching ARQ Schemes in Packet Data Communications. In Communications, Internet, and Information Technology (pp. 201-206)."},{"issue":"10","key":"1597_CR10","doi-asserted-by":"publisher","first-page":"2841","DOI":"10.1109\/TCOMM.2012.081012.110010","volume":"60","author":"T Van Nguyen","year":"2012","unstructured":"Van Nguyen, T., Nosratinia, A., & Divsalar, D. (2012). The design of rate-compatible protograph LDPC codes. IEEE Transactions on Communications, 60(10), 2841\u20132850.","journal-title":"IEEE Transactions on Communications"},{"issue":"7","key":"1597_CR11","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1109\/TCOM.1982.1095643","volume":"30","author":"S Lin","year":"1982","unstructured":"Lin, S., & Yu, P. (1982). A hybrid ARQ scheme with parity retransmission for error control of satellite channels. IEEE Transactions on Communications, 30(7), 1701\u20131719.","journal-title":"IEEE Transactions on Communications"},{"issue":"11","key":"1597_CR12","doi-asserted-by":"publisher","first-page":"1582","DOI":"10.1016\/j.aeue.2015.07.008","volume":"69","author":"J Liu","year":"2015","unstructured":"Liu, J., & de Lamare, R. C. (2015). Rate-compatible LDPC codes with short block lengths based on puncturing and extension techniques. AEU-International Journal of Electronics and Communications, 69(11), 1582\u20131589.","journal-title":"AEU-International Journal of Electronics and Communications"},{"key":"1597_CR13","unstructured":"Document 3GPP R1-1711982 3GPP TSG RAN WG1 Meeting AH NR2, 3GPP (2017). https:\/\/www.3gpp.org. Accessed Mar 2019."},{"key":"1597_CR14","unstructured":"Report ITU-R M.2410-0. (2017). Minimum requirements related to technical performance for IMT-2020 radio interface(s)."},{"key":"1597_CR15","unstructured":"Hu, X.-Y., Eleftheriou, E., Arnold, D.-M., & Dholakia, A. (2001). Efficient implementations of the sum-product algorithm for decoding LDPC codes. In GLOBECOM\u201901. IEEE Global Telecommunications Conference (Cat. No. 01CH37270) (Vol. 2, pp. 1036-1036E vol. 1032). San Antonio, TX: IEEE."},{"issue":"5","key":"1597_CR16","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/4234.1001666","volume":"6","author":"J Chen","year":"2002","unstructured":"Chen, J., & Fossorier, M. P. (2002). Density evolution for two improved BP-based decoding algorithms of LDPC codes. IEEE Communications Letters, 6(5), 208\u2013210.","journal-title":"IEEE Communications Letters"},{"issue":"3","key":"1597_CR17","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1109\/4.987093","volume":"37","author":"AJ Blanksby","year":"2002","unstructured":"Blanksby, A. J., & Howland, C. J. (2002). A 690-mW 1-Gb\/s 1024-b, rate-1\/2 low-density parity-check code decoder. IEEE Journal of Solid-State Circuits, 37(3), 404\u2013412.","journal-title":"IEEE Journal of Solid-State Circuits"},{"key":"1597_CR18","unstructured":"Yeo, E., Nikolic, B., & Anantharam, V. (2002). Architectures and implementations of low-density parity check decoding algorithms. In The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002 (Vol. 3, pp. III-III), Tulsa, OK: IEEE."},{"key":"1597_CR19","unstructured":"Zhang, T., & Parhi, K. K. (2002). A 54 mbps (3, 6)-regular FPGA LDPC decoder. In IEEE workshop on signal processing systems (pp. 127-132). San Diego, CA: IEEE."},{"key":"1597_CR20","unstructured":"Hocevar, D. E. (2004). A reduced complexity decoder architecture via layered decoding of LDPC codes. In IEEE Workshop on Signal Processing Systems, 2004. SIPS 2004 (pp. 107-112). Austin, TX: IEEE."},{"key":"1597_CR21","unstructured":"Liu, G. (2016). Gaussian noise generator IP Core specification. Available from: https:\/\/github.com\/liuguangxi\/gng. Accessed Mar 2019."},{"issue":"2","key":"1597_CR22","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.vlsi.2011.08.002","volume":"45","author":"VA Chandrasetty","year":"2012","unstructured":"Chandrasetty, V. A., & Aziz, S. M. (2012). An area efficient LDPC decoder using a reduced complexity min-sum algorithm. Integration, 45(2), 141\u2013148.","journal-title":"Integration"},{"key":"1597_CR23","doi-asserted-by":"crossref","unstructured":"Patel, D. J., & Engineer, P. (2017). Design and implementation of quasi cyclic low density parity check (QC-LDPC) code on FPGA. In 2017 International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET) (pp. 181-185). Chennai: IEEE.","DOI":"10.1109\/WiSPNET.2017.8299744"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-020-01597-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11265-020-01597-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-020-01597-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,22]],"date-time":"2021-09-22T00:30:44Z","timestamp":1632270644000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11265-020-01597-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,22]]},"references-count":23,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["1597"],"URL":"https:\/\/doi.org\/10.1007\/s11265-020-01597-0","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"type":"print","value":"1939-8018"},{"type":"electronic","value":"1939-8115"}],"subject":[],"published":{"date-parts":[[2020,9,22]]},"assertion":[{"value":"15 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}