{"id":"https://openalex.org/W2152956478","doi":"https://doi.org/10.1109/glocom.2003.1258596","title":"Decoder architecture for array-code-based LDPC codes","display_name":"Decoder architecture for array-code-based LDPC codes","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2152956478","doi":"https://doi.org/10.1109/glocom.2003.1258596","mag":"2152956478"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2003.1258596","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2003.1258596","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","raw_type":"proceedings-article"},"type":"article","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/A5020089633","display_name":"S. \u00d6l\u00e7er","orcid":null},"institutions":[{"id":"https://openalex.org/I4210126328","display_name":"IBM Research - Zurich","ror":"https://ror.org/02js37d36","country_code":"CH","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210126328"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"S. Olcer","raw_affiliation_strings":["Zurich Research Laboratory, IBM Research GmbH, Ruschlikon, Switzerland"],"affiliations":[{"raw_affiliation_string":"Zurich Research Laboratory, IBM Research GmbH, Ruschlikon, Switzerland","institution_ids":["https://openalex.org/I4210126328"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020089633"],"corresponding_institution_ids":["https://openalex.org/I4210126328"],"apc_list":null,"apc_paid":null,"fwci":5.7336,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.96321721,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2046","last_page":"2050"},"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.9997000098228455,"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.9976000189781189,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.9080182313919067},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.765384316444397},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.687332034111023},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5999112129211426},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.5732223391532898},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5519284605979919},{"id":"https://openalex.org/keywords/soft-decision-decoder","display_name":"Soft-decision decoder","score":0.5293897986412048},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4893803000450134},{"id":"https://openalex.org/keywords/architecture","display_name":"Architecture","score":0.441537082195282},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38297876715660095},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2468675971031189}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9080182313919067},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.765384316444397},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.687332034111023},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5999112129211426},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.5732223391532898},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5519284605979919},{"id":"https://openalex.org/C185588885","wikidata":"https://www.wikidata.org/wiki/Q7553811","display_name":"Soft-decision decoder","level":3,"score":0.5293897986412048},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4893803000450134},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.441537082195282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38297876715660095},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2468675971031189},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2003.1258596","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2003.1258596","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","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":8,"referenced_works":["https://openalex.org/W1825164805","https://openalex.org/W1944715054","https://openalex.org/W1956090263","https://openalex.org/W2128765501","https://openalex.org/W2135764410","https://openalex.org/W2147392818","https://openalex.org/W2147762969","https://openalex.org/W6638596791"],"related_works":["https://openalex.org/W2537963609","https://openalex.org/W2092857423","https://openalex.org/W1650655882","https://openalex.org/W2126543779","https://openalex.org/W2361792238","https://openalex.org/W2169811229","https://openalex.org/W1482743218","https://openalex.org/W2154078079","https://openalex.org/W2116533133","https://openalex.org/W2167124952"],"abstract_inverted_index":{"We":[0],"describe":[1],"a":[2],"decoder":[3,82],"architecture":[4],"intended":[5],"for":[6],"decoding":[7,72],"array-code-based":[8],"low-density":[9],"parity-check":[10,64],"(LDPC)":[11],"codes":[12],"using":[13],"the":[14,21,27,32,59,63,81],"sum-product":[15],"algorithm":[16],"(SPA).":[17],"The":[18],"advantages":[19,54],"of":[20,31,39,46,62,66],"proposed":[22,78],"architecture,":[23],"as":[24],"compared":[25],"to":[26,48,79],"fully":[28],"parallel":[29],"implementation":[30,83],"SPA,":[33],"are:":[34],"reduced":[35],"memory":[36],"size,":[37],"avoidance":[38],"complex":[40],"signal":[41],"interconnect":[42],"patterns,":[43],"and":[44],"ease":[45],"programmability":[47],"accommodate":[49],"various":[50],"code":[51],"parameters.":[52],"These":[53],"are":[55,77],"derived":[56],"from":[57],"exploiting":[58],"well-defined":[60],"structure":[61],"matrix":[65],"array-code":[67],"based":[68],"LDPC":[69],"codes.":[70],"Sum-product":[71],"with":[73],"modified":[74],"message-passing":[75],"schedules":[76],"simplify":[80],"further.":[84]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}