{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:06:37Z","timestamp":1649203597971},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,6,8]],"date-time":"2012-06-08T00:00:00Z","timestamp":1339113600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2012,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Supporting a great diversity of multi-rate <jats:bold>H<\/jats:bold>-matrices for multiple communication protocols requires a large amount of non-volatile memory, which may consume a large silicon area or logic elements and constrain the implementation of an overall decoder. Therefore, schemes for memory reduction are necessary to make the parity-check storage more compact. This study proposes a specific set of quasi-cyclic low-density parity-check (LDPC) (QC-LDPC) codes which can transfer a traditional two-dimensional (2-D) parity-check matrix (<jats:bold>H<\/jats:bold>-matrix) into a one-dimensional (1-D) memory space. Compared to the existing schemes, the proposed codes and memory reduction scheme do achieve significant reduction rates. Within a fixed memory space, many more <jats:bold>H<\/jats:bold>-matrices for diverse communication protocols can be saved via the proposed QC-LDPC codes, which are well constructed from modified Welch-Costas sequences. Furthermore, relatively good error performances, which outperform computer-generated random LDPC codes and Sridhara-Fuja-Tanner codes, are also shown in our simulation results. Consequently, we conclude that the proposed QC-LDPC codes can enlarge the capacity for saving much more low-BER (bit error rate) <jats:bold>H<\/jats:bold>-matrices within a fixed memory space.<\/jats:p>","DOI":"10.1186\/1687-1499-2012-191","type":"journal-article","created":{"date-parts":[[2012,6,13]],"date-time":"2012-06-13T11:42:33Z","timestamp":1339587753000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-volatile memory reduction based on 1-D memory space mapping of a specific set of QC-LDPC codes"],"prefix":"10.1186","volume":"2012","author":[{"given":"Chung-Ping","family":"Young","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Chu","family":"Chia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao-Chin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Ming","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,8]]},"reference":[{"key":"360_CR1","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1049\/el:19961141","volume":"32","author":"D MacKay","year":"1996","unstructured":"MacKay D, Neal R: Near Shannon limit performance of low-density parity-check codes. Electron Lett 1996, 32: 1645-1646. 10.1049\/el:19961141","journal-title":"Electron Lett"},{"key":"360_CR2","first-page":"891","volume-title":"Proceedings of the Design Automation Conference","author":"E Amador","year":"2009","unstructured":"Amador E, Pacalet R, Rezard V: Optimum LDPC decoder: a memory architecture problem. In Proceedings of the Design Automation Conference. San Francisco, CA, USA; 2009:891-896."},{"key":"360_CR3","first-page":"547","volume":"3","author":"Y Tian","year":"2009","unstructured":"Tian Y, Zhang X, Lai Z: A LDPC decoder with all single port memories. Proceedings of the Intelligent Computing and Intelligent Systems, Shanghai, China 2009, 3: 547-550.","journal-title":"Proceedings of the Intelligent Computing and Intelligent Systems, Shanghai, China"},{"key":"360_CR4","first-page":"100","volume-title":"Proceedings of the Design Automation and Test in Europe 2005","author":"F Kienle","year":"2005","unstructured":"Kienle F, Brack T, When N: A synthesizable IP Core for DVB-S2 LDPC code decoding. In Proceedings of the Design Automation and Test in Europe 2005. Volume 3. Munich, Germany; 2005:100-105."},{"issue":"4","key":"360_CR5","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1109\/TCE.2009.5373744","volume":"55","author":"S Lee","year":"2008","unstructured":"Lee S, Park J, Chung K: Memory efficient multi-rate regular LDPC decoder for CMMB. IEEE Trans Consum Electron 2008, 55(4):1866-1874.","journal-title":"IEEE Trans Consum Electron"},{"issue":"9","key":"360_CR6","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1109\/TCOMM.2002.802537","volume":"50","author":"A Prabhakar","year":"2002","unstructured":"Prabhakar A, Narayanan K: Pseudorandom construction of low density parity check codes using linear congruential sequences. IEEE Trans Commun 2002, 50(9):1389-1396. 10.1109\/TCOMM.2002.802537","journal-title":"IEEE Trans Commun"},{"issue":"12","key":"360_CR7","doi-asserted-by":"publisher","first-page":"2966","DOI":"10.1109\/TIT.2004.838370","volume":"50","author":"R Tanner","year":"2004","unstructured":"Tanner R, Sridhara D, Sridharan A, Fuja T, Costello D: LDPC block and convolutional codes based on circulant matrices. IEEE Trans Inf Theory 2004, 50(12):2966-2984. 10.1109\/TIT.2004.838370","journal-title":"IEEE Trans Inf Theory"},{"key":"360_CR8","doi-asserted-by":"publisher","first-page":"1788","DOI":"10.1109\/TIT.2004.831841","volume":"50","author":"M Fossorier","year":"2004","unstructured":"Fossorier M: Quasi-cyclic low density parity check codes from circulant permutation matrices. IEEE Trans Inf Theory 2004, 50: 1788-1794. 10.1109\/TIT.2004.831841","journal-title":"IEEE Trans Inf Theory"},{"key":"360_CR9","doi-asserted-by":"publisher","first-page":"2608","DOI":"10.1109\/26.310621","volume":"42","author":"Z Kostic","year":"1994","unstructured":"Kostic Z, Titlebaum E: The design and performance analysis for several new classes of codes for optical synchronous CDMA and for arbitrary-medium time-hopping synchronous CDMA communication systems. IEEE Trans Commun 1994, 42: 2608-2617. 10.1109\/26.310621","journal-title":"IEEE Trans Commun"},{"issue":"7","key":"360_CR10","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TCOMM.2004.831353","volume":"52","author":"L Chen","year":"2004","unstructured":"Chen L, Xu J, Djurdjevic I, Lin S: Near-Shannon-limit quasi-cyclic low-density parity-check codes. IEEE Trans Commun 2004, 52(7):1038-1042. 10.1109\/TCOMM.2004.831353","journal-title":"IEEE Trans Commun"},{"issue":"12","key":"360_CR11","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.1109\/JLT.2008.2009548","volume":"27","author":"J Huang","year":"2009","unstructured":"Huang J, Yang C, Huang C: On analyzing quasi-cyclic LDPC codes over modified Welch-Costas-coded optical CDMA system. IEEE J Lightw Technol 2009, 27(12):2150-2158.","journal-title":"IEEE J Lightw Technol"},{"key":"360_CR12","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1109\/LPT.2007.893579","volume":"19","author":"C Yang","year":"2007","unstructured":"Yang C: Optical CDMA passive optical network using prime code with interference elimination. IEEE Photon Technol Lett 2007, 19: 516-518.","journal-title":"IEEE Photon Technol Lett"},{"key":"360_CR13","doi-asserted-by":"crossref","unstructured":"Huang J, Huang C, Yang C: Construction of one-coincidence sequence quasi-cycle LDPC codes of large Girth. IEEE Trans Inf Theory LDPC Decoder implementation; 2012, 58(3):1825-1836. Accessed 9 April 2012 [http:\/\/cwe.ccsds.org]","DOI":"10.1109\/TIT.2011.2173246"},{"key":"360_CR14","unstructured":"High throughput low power decoder architectures for low density parity check codes[http:\/\/repository.tamu.edu]"},{"key":"360_CR15","doi-asserted-by":"crossref","unstructured":"Sandberg S: Improved design of unequal error protection LDPC codes. EURASIP J Wirel Commun Netw 2010: doi:10.1155\/2010\/423989","DOI":"10.1155\/2010\/423989"},{"issue":"9","key":"360_CR16","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1109\/TCOMM.2006.877980","volume":"54","author":"F Verdier","year":"2006","unstructured":"Verdier F, Declercq D: A low-cost parallel scalable FPGA architecture for regular and I regular LDPC decoding. IEEE Trans Commun 2006, 54(9):1215-1223.","journal-title":"IEEE Trans Commun"},{"key":"360_CR17","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/MSP.2004.1267048","volume":"21","author":"J Moura","year":"2004","unstructured":"Moura J, Lu J, Zhang H: Structured low density parity check decoding. IEEE Signal Process Mag 2004, 21: 42-55. 10.1109\/MSP.2004.1267048","journal-title":"IEEE Signal Process Mag"},{"key":"360_CR18","volume-title":"Proceedings of the IMA Workshop Codes, Systems and Graphical Models","author":"D MacKay","year":"1999","unstructured":"MacKay D, Davey M: Evaluation of Gallager codes for short block length and high rate applications. In Proceedings of the IMA Workshop Codes, Systems and Graphical Models. Minneapolis, MN; 1999."},{"issue":"9","key":"360_CR19","doi-asserted-by":"publisher","first-page":"2898","DOI":"10.1109\/TCSI.2008.922024","volume":"55","author":"Y Dai","year":"2008","unstructured":"Dai Y, Chen N, Yan Z: Memory efficient decoder architecture for quasi-cyclic LDPC codes. IEEE Trans Circ Syst 2008, 55(9):2898-2911.","journal-title":"IEEE Trans Circ Syst"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2012-191.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1687-1499-2012-191\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2012-191.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T19:13:09Z","timestamp":1630523589000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/1687-1499-2012-191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,8]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["360"],"URL":"https:\/\/doi.org\/10.1186\/1687-1499-2012-191","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,8]]},"assertion":[{"value":"8 February 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2012","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2012","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"191"}}