{"id":"https://openalex.org/W2963609335","doi":"https://doi.org/10.1109/icassp.2011.5946358","title":"Fourier domain decoding algorithm of non-binary LDPC codes for parallel implementation","display_name":"Fourier domain decoding algorithm of non-binary LDPC codes for parallel implementation","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2963609335","doi":"https://doi.org/10.1109/icassp.2011.5946358","mag":"2963609335"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2011.5946358","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2011.5946358","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","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/A5109351206","display_name":"Kenta Kasai","orcid":null},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kenta Kasai","raw_affiliation_strings":["Tokyo Institute of Technology, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tokyo Institute of Technology, Japan","institution_ids":["https://openalex.org/I114531698"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110189199","display_name":"K. Sakaniwa","orcid":null},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Koichi Sakaniwa","raw_affiliation_strings":["Tokyo Institute of Technology, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tokyo Institute of Technology, Japan","institution_ids":["https://openalex.org/I114531698"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114531698"],"apc_list":null,"apc_paid":null,"fwci":0.858,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73272255,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"3128","last_page":"3131"},"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.9984999895095825,"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.9945999979972839,"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/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.7060424089431763},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6425126791000366},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6338913440704346},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6239941716194153},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.544725239276886},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5437747836112976},{"id":"https://openalex.org/keywords/prime-factor-fft-algorithm","display_name":"Prime-factor FFT algorithm","score":0.5374038815498352},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4625259041786194},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.4210788905620575},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.41415590047836304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38412219285964966},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.36667144298553467},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.28681686520576477},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.15899816155433655},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1293734908103943},{"id":"https://openalex.org/keywords/fractional-fourier-transform","display_name":"Fractional Fourier transform","score":0.06772938370704651}],"concepts":[{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7060424089431763},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6425126791000366},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6338913440704346},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6239941716194153},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.544725239276886},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5437747836112976},{"id":"https://openalex.org/C77928272","wikidata":"https://www.wikidata.org/wiki/Q7243214","display_name":"Prime-factor FFT algorithm","level":5,"score":0.5374038815498352},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4625259041786194},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4210788905620575},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.41415590047836304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38412219285964966},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36667144298553467},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.28681686520576477},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.15899816155433655},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1293734908103943},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.06772938370704651},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2011.5946358","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2011.5946358","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","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":23,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W1606480398","https://openalex.org/W2015684392","https://openalex.org/W2085021014","https://openalex.org/W2101375967","https://openalex.org/W2102986410","https://openalex.org/W2109866575","https://openalex.org/W2110422517","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2137813581","https://openalex.org/W2139584447","https://openalex.org/W2140570026","https://openalex.org/W2143687662","https://openalex.org/W2144533880","https://openalex.org/W2151072989","https://openalex.org/W2153008566","https://openalex.org/W2157702143","https://openalex.org/W2166319738","https://openalex.org/W2169732368","https://openalex.org/W2173776306","https://openalex.org/W4300188436","https://openalex.org/W6678839936"],"related_works":["https://openalex.org/W2031343199","https://openalex.org/W2356814585","https://openalex.org/W2977460836","https://openalex.org/W2012363129","https://openalex.org/W3046688035","https://openalex.org/W1984254719","https://openalex.org/W2144412928","https://openalex.org/W2042527476","https://openalex.org/W1975692575","https://openalex.org/W2978884468"],"abstract_inverted_index":{"For":[0],"decoding":[1,66],"non-binary":[2],"low-density":[3],"parity-check":[4],"(LDPC)":[5],"codes,":[6],"logarithm-domain":[7],"sum-product":[8],"(Log-SP)":[9],"algorithms":[10,42],"were":[11],"proposed":[12],"for":[13,65,69,127],"reducing":[14],"quantization":[15],"effects":[16],"of":[17,62,96],"SP":[18],"algorithm":[19,86],"in":[20,29,39,87,118,133],"conjunction":[21],"with":[22],"FFT.":[23],"Since":[24],"FFT":[25],"is":[26,47,67],"not":[27],"applicable":[28],"the":[30,33,40,63,88,94,128,134],"logarithm":[31],"domain,":[32],"computations":[34,106],"required":[35],"at":[36],"check":[37,49,70,100],"nodes":[38,50,98,101],"Log-SP":[41,85],"are":[43,102,107],"computationally":[44],"intensive.":[45],"What":[46],"worse,":[48],"usually":[51],"have":[52],"higher":[53],"degree":[54],"than":[55],"variable":[56,97,111],"nodes.":[57],"As":[58],"a":[59,76,84,123],"result,":[60],"most":[61],"time":[64],"used":[68],"node":[71],"computations,":[72],"which":[73,113],"leads":[74],"to":[75],"bottleneck":[77],"effect.":[78],"In":[79],"this":[80,92],"paper,":[81],"we":[82,121],"propose":[83],"Fourier":[89,135],"domain.":[90,136],"With":[91],"algorithm,":[93],"role":[95],"and":[99,131],"switched.":[103],"The":[104],"intensive":[105],"spread":[108],"over":[109],"lower-degree":[110],"nodes,":[112],"can":[114],"be":[115],"efficiently":[116],"calculated":[117],"parallel.":[119],"Furthermore,":[120],"develop":[122],"fast":[124],"calculation":[125],"method":[126],"estimated":[129],"bits":[130],"syndromes":[132]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}