{"id":"https://openalex.org/W2123851055","doi":"https://doi.org/10.1109/icassp.2004.1327075","title":"An LDPC decoding schedule for memory access reduction","display_name":"An LDPC decoding schedule for memory access reduction","publication_year":2004,"publication_date":"2004-09-28","ids":{"openalex":"https://openalex.org/W2123851055","doi":"https://doi.org/10.1109/icassp.2004.1327075","mag":"2123851055"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2004.1327075","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2004.1327075","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Acoustics, Speech, and Signal Processing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081338858","display_name":"Kiran Gunnam","orcid":"https://orcid.org/0000-0001-7219-7234"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Gunnam","raw_affiliation_strings":["Department of Electrical Engineering, Texas A and M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112468803","display_name":"Gwan Choi","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gwan Choi","raw_affiliation_strings":["Department of Electrical Engineering, Texas A and M University, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106134979","display_name":"Mark Yeary","orcid":null},"institutions":[{"id":"https://openalex.org/I8692664","display_name":"University of Oklahoma","ror":"https://ror.org/02aqsxs83","country_code":"US","type":"education","lineage":["https://openalex.org/I8692664"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Yeary","raw_affiliation_strings":["ECE Department, University of Oklahama, Norman, OK, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE Department, University of Oklahama, Norman, OK, USA","institution_ids":["https://openalex.org/I8692664"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":null,"first_page":"V","last_page":"173"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.794257640838623},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.716437578201294},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6395661234855652},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5208868980407715},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.49496954679489136},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.43442919850349426},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.42648744583129883},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3932443857192993},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30386918783187866},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18111777305603027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15262874960899353}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.794257640838623},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.716437578201294},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6395661234855652},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5208868980407715},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.49496954679489136},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.43442919850349426},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.42648744583129883},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3932443857192993},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30386918783187866},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18111777305603027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15262874960899353}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2004.1327075","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2004.1327075","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Acoustics, Speech, and Signal Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1598436058","https://openalex.org/W1956090263","https://openalex.org/W2097783206","https://openalex.org/W2107301532","https://openalex.org/W2126225729","https://openalex.org/W2128765501","https://openalex.org/W2144652834","https://openalex.org/W4229913234","https://openalex.org/W4240234834","https://openalex.org/W4300188436","https://openalex.org/W6674896211"],"related_works":["https://openalex.org/W2537963609","https://openalex.org/W2092857423","https://openalex.org/W2361792238","https://openalex.org/W2182725540","https://openalex.org/W3126598192","https://openalex.org/W2122913048","https://openalex.org/W2954849755","https://openalex.org/W2066141615","https://openalex.org/W2796395817","https://openalex.org/W2090897912"],"abstract_inverted_index":{"Recent":[0],"research":[1],"efforts":[2],"based":[3],"on":[4],"a":[5,57],"joint":[6],"code-decoder":[7],"design":[8],"methodology":[9],"have":[10],"shown":[11],"that":[12,85],"it":[13],"is":[14,52,56,82,90,111],"possible":[15],"to":[16,43,47,108,122,130,134],"construct":[17],"structured":[18],"LDPC":[19],"(low":[20],"density":[21],"parity":[22,65],"check)":[23],"codes":[24],"without":[25],"any":[26],"performance":[27],"degradation.":[28],"An":[29],"interesting":[30],"new":[31],"data":[32],"independence":[33],"property":[34,55],"between":[35],"the":[36,60,64,78,94,106,116,120,148],"two":[37],"classes":[38],"of":[39,59,63,80,88,100,105,119,144],"messages":[40,81,136],"viz.":[41],"check":[42,66,107,121,129,135],"bit":[44,46,109,123,131,133],"and":[45,132,146],"check,":[48],"involved":[49],"in":[50,76,113],"decoding,":[51],"observed.":[53],"This":[54,139],"result":[58],"specific":[61],"structuring":[62],"matrix.":[67],"By":[68],"exploiting":[69],"this":[70],"property,":[71],"we":[72],"propose":[73],"an":[74],"architecture":[75],"which":[77],"computation":[79],"synchronized":[83],"such":[84],"each":[86],"class":[87,99],"message":[89],"consumed":[91],"immediately":[92],"by":[93,152],"computational":[95],"unit":[96],"for":[97,128],"another":[98],"message.":[101],"The":[102,125],"internal":[103],"memory":[104,142,150],"units":[110],"increased":[112],"tune":[114],"with":[115],"storage":[117],"requirement":[118],"messages.":[124],"separate":[126],"memories":[127],"are":[137],"eliminated.":[138],"approach":[140],"has":[141],"savings":[143],"75%":[145],"reduces":[147],"overall":[149],"accesses":[151],"66%.":[153]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}