{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:05:08Z","timestamp":1742385908915},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,3]],"date-time":"2010-11-03T00:00:00Z","timestamp":1288742400000},"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":[[2011,7]]},"DOI":"10.1007\/s11265-010-0547-9","type":"journal-article","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T12:37:15Z","timestamp":1288701435000},"page":"149-159","source":"Crossref","is-referenced-by-count":20,"title":["Memory Access Optimized Implementation of Cyclic and Quasi-Cyclic LDPC Codes on a GPGPU"],"prefix":"10.1007","volume":"64","author":[{"given":"Hyunwoo","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junho","family":"Cho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wonyong","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,3]]},"reference":[{"key":"547_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low density parity check codes","author":"RG Gallager","year":"1963","unstructured":"Gallager, R. G. (1963). Low density parity check codes. Cambridge: MIT."},{"key":"547_CR2","unstructured":"The Digital Video Broadcasting Standard [Online]. Available: www.dvb.org"},{"key":"547_CR3","unstructured":"The IEEE 802.16 Working Group [Online]. Available: http:\/\/www.ieee802.org\/16\/"},{"key":"547_CR4","unstructured":"The IEEE 802.11n Working Group [Online]. Available: http:\/\/www.ieee802.org\/11\/"},{"key":"547_CR5","unstructured":"Falc\u00e3o, G., Silva, V., & Sousa L. (2009). How GPUs can outperform ASICSs for fast LDPC decoding. In Proc. of the 2third International Conference on Supercomputing, New York, USA, pp. 390\u2013399"},{"key":"547_CR6","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1007\/s11390-009-9266-8","volume":"24","author":"G Falc\u00e3o","year":"2009","unstructured":"Falc\u00e3o, G., Yamagiwa, S., Silva, V., & Sousa, L. (2009). Parallel LDPC decoding on GPUs using a stream-based computing approach. Journal of Computer Science and Technology, 24, 913\u2013924.","journal-title":"Journal of Computer Science and Technology"},{"key":"547_CR7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"IT-27","author":"RM Tanner","year":"1981","unstructured":"Tanner, R. M. (1981). A recursive approach to low complexity codes. IEEE Transactions on Information Theory, IT-27, 533\u2013547.","journal-title":"IEEE Transactions on Information Theory"},{"key":"547_CR8","doi-asserted-by":"crossref","first-page":"2711","DOI":"10.1109\/18.959255","volume":"47","author":"Y Kou","year":"2001","unstructured":"Kou, Y., Lin, S., & Fossorier, M. (2001). Low density parity check codes based on finite geometries: a rediscovery and more. IEEE Transactions on Information Theory, 47, 2711\u20132736.","journal-title":"IEEE Transactions on Information Theory"},{"key":"547_CR9","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"DJC MacKay","year":"1999","unstructured":"MacKay, D. J. C. (1999). Good error-correcting codes based on very sparse matrices. IEEE Transactions on Information Theory, 45, 399\u2013431.","journal-title":"IEEE Transactions on Information Theory"},{"key":"547_CR10","doi-asserted-by":"crossref","unstructured":"Chen, J., Dholakia, A., Eleftheriou, E., Fossorier, M., & Hu, X. Y. (2002). Near optimal reduced-complexity decoding algorithms for LDPC codes. In Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, p. 455","DOI":"10.1109\/ISIT.2002.1023727"},{"key":"547_CR11","unstructured":"The CUDA Programming Guide [Online]. Available: http:\/\/developer.NVIDIA.com\/object\/cuda.html"},{"key":"547_CR12","unstructured":"Bell, N., & Garland, M. (2008). Efficient Sparse Matrix-Vector Multiplication on CUDA. NVIDIA Technical Report NVR-2008-004, NVIDIA Corporation."},{"key":"547_CR13","unstructured":"Im, E. (2000). Optimizing the performance of sparse matrix-vector multiplication. Technical Report, UMI Order Number: CSD-00-1104., University of California at Berkeley."}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-010-0547-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-010-0547-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-010-0547-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T21:31:01Z","timestamp":1559770261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-010-0547-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["547"],"URL":"https:\/\/doi.org\/10.1007\/s11265-010-0547-9","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,3]]}}}