{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T10:46:04Z","timestamp":1730285164224,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1109\/ncc.2014.6811240","type":"proceedings-article","created":{"date-parts":[[2014,5,16]],"date-time":"2014-05-16T17:51:49Z","timestamp":1400262709000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["Optimal communication scheduling for iterative decoding of irregular codes"],"prefix":"10.1109","author":[{"given":"Hrishikesh","family":"Sharma","sequence":"first","affiliation":[]},{"given":"S.","family":"Sivasubramanian","sequence":"additional","affiliation":[]},{"given":"S.","family":"Patkar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"19","DOI":"10.1109\/JSAC.2009.090816"},{"doi-asserted-by":"publisher","key":"22","DOI":"10.1007\/s004930170002"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1109\/LCOMM.2012.101712.121953"},{"doi-asserted-by":"publisher","key":"23","DOI":"10.1016\/S0020-0190(02)00446-5"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1109\/SOFTCOM.2006.329769"},{"doi-asserted-by":"publisher","key":"24","DOI":"10.1145\/125826.126029"},{"key":"15","article-title":"High throughput memory-efficient vlsi designs for structured ldpc decoding","author":"sharma","year":"2011","journal-title":"International Conference on Pervasive and Embedded Computing and Communication Systems"},{"key":"16","article-title":"A highly parallel design for irregular ldpc decoding on gpgpus","author":"chiu","year":"2012","journal-title":"Asia-Pacific Signal Information Processing Association Annual Summit and Conference"},{"year":"2014","author":"sharma","journal-title":"A Design Methodology for Folded Pipelined Architectures in VLSI Applications using Projective Space Lattices","key":"13"},{"key":"14","volume":"2013","author":"choudhary","year":"0","journal-title":"Optimal Folding of Data Flow Graphs based on Projective Geometry"},{"key":"11","article-title":"Design of irregular graphs for erasure decoding","author":"rosenthal","year":"2008","journal-title":"International Symposium on the Mathematical Theory of Networks and Systems"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.5772\/139"},{"year":"2009","author":"korte","journal-title":"Theory and Algorithms","key":"21"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1109\/18.910576"},{"year":"2012","author":"sharma","journal-title":"Exploration of Projective Geometry-based New Communication Methods for Many-core VLSI Systems","key":"20"},{"key":"2","article-title":"Iterative decoding of low-density parity check codes","author":"guruswami","year":"2006","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/ISIT.2006.261904"},{"year":"2004","author":"guilloud","journal-title":"Generic architecture for LDPC codes decoding","key":"10"},{"key":"7","first-page":"1","article-title":"Convergence analysis of serial message-passing schedules for ldpc decoding","author":"sharon","year":"2006","journal-title":"Proc 5th Int Symp Turbo Codes and Related Topics"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/ASAP.2006.23"},{"year":"2005","journal-title":"EN 302 307 Second generation framing structure channel coding and modulation systems for Broadcasting Interactive Services News Gathering and other broadband satellite applications ETSI","key":"5"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1109\/ICC.2007.750"},{"key":"9","first-page":"1453","article-title":"Iterative decoding algorithm in the turbo, ldpc, polar codes","author":"li","year":"2010","journal-title":"IEEE international conference on communication technology"},{"key":"8","first-page":"355","article-title":"Non iterative decoding of low density parity check codes using artificial neural networks","author":"blackmer","year":"2011","journal-title":"International Conference on Wireless Networks"}],"event":{"name":"2014 Twentieth National Conference on Communications (NCC)","start":{"date-parts":[[2014,2,28]]},"location":"Kanpur, India","end":{"date-parts":[[2014,3,2]]}},"container-title":["2014 Twentieth National Conference on Communications (NCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6802611\/6811235\/06811240.pdf?arnumber=6811240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T11:54:57Z","timestamp":1490270097000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6811240\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/ncc.2014.6811240","relation":{},"subject":[],"published":{"date-parts":[[2014,2]]}}}