{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T12:31:48Z","timestamp":1718627508385},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,5,30]],"date-time":"2012-05-30T00:00:00Z","timestamp":1338336000000},"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":[[2012,12]]},"DOI":"10.1007\/s11265-012-0680-8","type":"journal-article","created":{"date-parts":[[2012,5,29]],"date-time":"2012-05-29T02:16:50Z","timestamp":1338257810000},"page":"293-304","source":"Crossref","is-referenced-by-count":1,"title":["A Reconfigurable TDMP Decoder for Raptor Codes"],"prefix":"10.1007","volume":"69","author":[{"given":"Hady","family":"Zeineddine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad M.","family":"Mansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,30]]},"reference":[{"key":"680_CR1","unstructured":"Design Compiler. http:\/\/www.synopsys.com ."},{"key":"680_CR2","unstructured":"Elias, P. (1955). Coding for two noisy channels. In Third London symposium on information theory (pp. 61\u201376)."},{"issue":"5","key":"680_CR3","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1109\/TIT.2006.872855","volume":"52","author":"O Etesami","year":"2006","unstructured":"Etesami, O., & Shokrollahi, A. (2006). Raptor codes on binary memoryless symmetric channels. IEEE Transactions on Information Theory, 52(5), 2033\u20132051.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"680_CR4","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/26.768759","volume":"47","author":"M Fossorier","year":"1999","unstructured":"Fossorier, M., Mihaljevic, M., & Imai, H. (1999). Reduced complexity iterative decoding of low-density parity-check codes based on belief propagation. IEEE Transactions on Communications, 47(5), 673\u2013680.","journal-title":"IEEE Transactions on Communications"},{"key":"680_CR5","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 Press."},{"issue":"6","key":"680_CR6","first-page":"985","volume":"27","author":"XH Kai Zhang","year":"2009","unstructured":"Kai\u00a0Zhang, X.\u00a0H., & Wang, Z. (2009). High-throughput layered decoder implementation for quasi-cyclic ldpc codes. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 27(6), 985\u2013994.","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"key":"680_CR7","doi-asserted-by":"crossref","unstructured":"Luby, M. (2002). LT-codes. In Proc. the 43rd annual IEEE symposium on the foundations of computer science (pp. 271\u2013280). Vancouver, BC, Canada.","DOI":"10.1109\/SFCS.2002.1181950"},{"issue":"11","key":"680_CR8","doi-asserted-by":"crossref","first-page":"4376","DOI":"10.1109\/TSP.2006.880240","volume":"54","author":"MM Mansour","year":"2006","unstructured":"Mansour, M.\u00a0M. (2006). A turbo-decoding message-passing algorithm for sparse parity-check matrix codes. IEEE Transactions on Signal Processing, 54(11), 4376\u20134392.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"6","key":"680_CR9","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1109\/TVLSI.2003.817545","volume":"11","author":"MM Mansour","year":"2003","unstructured":"Mansour, M.\u00a0M., & Shanbhag, N.\u00a0R. (2003). High-throughput LDPC decoders. IEEE Transactions on VLSI Systems, 11(6), 976\u2013996.","journal-title":"IEEE Transactions on VLSI Systems"},{"key":"680_CR10","doi-asserted-by":"crossref","unstructured":"Palanki, R., & Yedidia, J.\u00a0S. (2004). Rateless codes on noisy channels. In Proc. int. symposium on info (p.\u00a037). Theory, Chicago, Illinois USA.","DOI":"10.1109\/ISIT.2004.1365075"},{"issue":"6","key":"680_CR11","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","volume":"52","author":"A Shokrollahi","year":"2006","unstructured":"Shokrollahi, A. (2006). Raptor codes. IEEE Transactions on Information Theory, 52(6), 2551\u20132567.","journal-title":"IEEE Transactions on Information Theory"},{"key":"680_CR12","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TIT.1981.1056404","volume":"IT-27","author":"R.M Tanner","year":"1981","unstructured":"Tanner, R.\u00a0M. (1981). A recursive approach to low complexity codes. IEEE Transactions on Information Theory, IT-27, 533\u2013547.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"10","key":"680_CR13","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1109\/TVLSI.2009.2025169","volume":"18","author":"B Xiang","year":"2010","unstructured":"Xiang, B., Shen, R., Pan, A., Bao, D., & Zeng X. (2010). An area-efficient and low-power multirate decoder for quasi-cyclic low-density parity-check codes. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 18(10), 1447\u20131460.","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"issue":"6","key":"680_CR14","doi-asserted-by":"crossref","first-page":"2943","DOI":"10.1109\/TSP.2011.2114655","volume":"59","author":"H Zeineddine","year":"2011","unstructured":"Zeineddine, H., Mansour, M., & Puri, R. (2011). Construction and hardware-efficient decoding of raptor codes. IEEE Transactions on Signal Processing, 59(6), 2943\u20132960.","journal-title":"IEEE Transactions on Signal Processing"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-012-0680-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-012-0680-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-012-0680-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T01:56:08Z","timestamp":1561773368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-012-0680-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,30]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["680"],"URL":"https:\/\/doi.org\/10.1007\/s11265-012-0680-8","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,30]]}}}