{"id":"https://openalex.org/W2237024159","doi":"https://doi.org/10.1631/fitee.1400269","title":"An improved low-complexity sum-product decoding algorithm for low-density parity-check codes","display_name":"An improved low-complexity sum-product decoding algorithm for low-density parity-check codes","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W2237024159","doi":"https://doi.org/10.1631/fitee.1400269","mag":"2237024159"},"language":"en","primary_location":{"id":"doi:10.1631/fitee.1400269","is_oa":false,"landing_page_url":"https://doi.org/10.1631/fitee.1400269","pdf_url":null,"source":{"id":"https://openalex.org/S4210189857","display_name":"Frontiers of Information Technology & Electronic Engineering","issn_l":"2095-9184","issn":["2095-9184","2095-9230"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers of Information Technology & Electronic Engineering","raw_type":"journal-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/A5046904999","display_name":"Michaelraj Kingston Roberts","orcid":"https://orcid.org/0000-0002-1484-703X"},"institutions":[{"id":"https://openalex.org/I4210109528","display_name":"PSG INSTITUTE OF TECHNOLOGY AND APPLIED RESEARCH","ror":"https://ror.org/01sa9ng67","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210109528"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Michaelraj Kingston Roberts","raw_affiliation_strings":["Department of Electronics and Communication Engineering, PSG College of Technology, Coimbatore, 641004, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics and Communication Engineering, PSG College of Technology, Coimbatore, 641004, India","institution_ids":["https://openalex.org/I4210109528"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113865316","display_name":"Ramesh Jayabalan","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109528","display_name":"PSG INSTITUTE OF TECHNOLOGY AND APPLIED RESEARCH","ror":"https://ror.org/01sa9ng67","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210109528"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ramesh Jayabalan","raw_affiliation_strings":["Department of Electronics and Communication Engineering, PSG College of Technology, Coimbatore, 641004, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics and Communication Engineering, PSG College of Technology, Coimbatore, 641004, India","institution_ids":["https://openalex.org/I4210109528"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.052,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.81398347,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"16","issue":"6","first_page":"511","last_page":"518"},"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.9987999796867371,"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.9918000102043152,"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/decoding-methods","display_name":"Decoding methods","score":0.7621543407440186},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6935003399848938},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.6399118900299072},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.6204129457473755},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5965949296951294},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5617908239364624},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.528713047504425},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.500119686126709},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4711410403251648},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4486812651157379},{"id":"https://openalex.org/keywords/cyclotomic-fast-fourier-transform","display_name":"Cyclotomic fast Fourier transform","score":0.43366360664367676},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.42969951033592224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4130687713623047},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.20636719465255737},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.19050201773643494},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.09719386696815491},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.0749596655368805},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07010811567306519}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7621543407440186},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6935003399848938},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.6399118900299072},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.6204129457473755},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5965949296951294},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5617908239364624},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.528713047504425},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.500119686126709},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4711410403251648},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4486812651157379},{"id":"https://openalex.org/C43060483","wikidata":"https://www.wikidata.org/wiki/Q17006372","display_name":"Cyclotomic fast Fourier transform","level":5,"score":0.43366360664367676},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.42969951033592224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4130687713623047},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.20636719465255737},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.19050201773643494},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.09719386696815491},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.0749596655368805},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07010811567306519},{"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/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C76563020","wikidata":"https://www.wikidata.org/wiki/Q4817582","display_name":"Fractional Fourier transform","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1631/fitee.1400269","is_oa":false,"landing_page_url":"https://doi.org/10.1631/fitee.1400269","pdf_url":null,"source":{"id":"https://openalex.org/S4210189857","display_name":"Frontiers of Information Technology & Electronic Engineering","issn_l":"2095-9184","issn":["2095-9184","2095-9230"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers of Information Technology & Electronic Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1975692575","https://openalex.org/W2021290382","https://openalex.org/W2036812077","https://openalex.org/W2040461907","https://openalex.org/W2104310451","https://openalex.org/W2111191676","https://openalex.org/W2123530431","https://openalex.org/W2126259959","https://openalex.org/W2128765501","https://openalex.org/W2133980064","https://openalex.org/W2135031801","https://openalex.org/W2140000789","https://openalex.org/W2140695554","https://openalex.org/W2154887764","https://openalex.org/W2156938362","https://openalex.org/W2169732368","https://openalex.org/W4253521662","https://openalex.org/W4300768403"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2102627024","https://openalex.org/W2182594114","https://openalex.org/W2085052822","https://openalex.org/W2357077655"],"abstract_inverted_index":{"In":[0,16],"this":[1],"paper,":[2],"an":[3,50,67],"improved":[4],"low-complexity":[5],"sum-product":[6,83],"decoding":[7,44,88,106],"algorithm":[8,65,84,89],"is":[9,24,46],"presented":[10],"for":[11,104],"low-density":[12],"parity-check":[13],"(LDPC)":[14],"codes.":[15],"the":[17,36,43,55,63,82,86,97,105],"proposed":[18,64,87],"algorithm,":[19],"reduction":[20,93],"in":[21,35,42,54],"computational":[22],"complexity":[23],"achieved":[25,47],"by":[26,48],"utilizing":[27,49],"fast":[28],"Fourier":[29],"transform":[30],"(FFT)":[31],"with":[32,81],"time":[33],"shift":[34],"check":[37],"node":[38,57],"process.":[39,58,107],"The":[40],"improvement":[41,71],"performance":[45],"optimized":[51],"integer":[52],"constant":[53],"variable":[56],"Simulation":[59],"results":[60],"show":[61],"that":[62],"achieves":[66],"overall":[68],"coding":[69],"gain":[70],"ranging":[72],"from":[73],"0.04":[74],"to":[75],"0.46":[76],"dB.":[77],"Moreover,":[78],"when":[79],"compared":[80],"(SPA),":[85],"can":[90],"achieve":[91],"a":[92],"of":[94,96,100],"42%\u201367%":[95],"total":[98],"number":[99],"arithmetic":[101],"operations":[102],"required":[103]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}