{"id":"https://openalex.org/W4388838006","doi":"https://doi.org/10.1109/tcomm.2023.3334812","title":"A Recursive Soft-Input Soft-Output Decoding Algorithm","display_name":"A Recursive Soft-Input Soft-Output Decoding Algorithm","publication_year":2023,"publication_date":"2023-11-20","ids":{"openalex":"https://openalex.org/W4388838006","doi":"https://doi.org/10.1109/tcomm.2023.3334812"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2023.3334812","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/tcomm.2023.3334812","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","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/A5022295421","display_name":"Liudmila Karakchieva","orcid":"https://orcid.org/0000-0002-0370-3444"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Liudmila Karakchieva","raw_affiliation_strings":["Department of Information Technology and Programming, ITMO University, Saint Petersburg, Russia"],"raw_orcid":"https://orcid.org/0000-0002-0370-3444","affiliations":[{"raw_affiliation_string":"Department of Information Technology and Programming, ITMO University, Saint Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016322127","display_name":"Peter Trifonov","orcid":"https://orcid.org/0000-0001-6960-0942"},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Peter Trifonov","raw_affiliation_strings":["Department of Information Technology and Programming, ITMO University, Saint Petersburg, Russia"],"raw_orcid":"https://orcid.org/0000-0001-6960-0942","affiliations":[{"raw_affiliation_string":"Department of Information Technology and Programming, ITMO University, Saint Petersburg, Russia","institution_ids":["https://openalex.org/I173089394"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022295421"],"corresponding_institution_ids":["https://openalex.org/I173089394"],"apc_list":null,"apc_paid":null,"fwci":0.1968,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53207541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"72","issue":"3","first_page":"1290","last_page":"1302"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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":0.9998999834060669,"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.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/algorithm","display_name":"Algorithm","score":0.7183372378349304},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7144399285316467},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6896222829818726},{"id":"https://openalex.org/keywords/bcjr-algorithm","display_name":"BCJR algorithm","score":0.5409286022186279},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5389910340309143},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.49657565355300903},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4933125078678131},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48989337682724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46547290682792664},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4328540861606598},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.431537389755249},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.41716712713241577},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0838766098022461}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7183372378349304},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7144399285316467},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6896222829818726},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.5409286022186279},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5389910340309143},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.49657565355300903},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4933125078678131},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48989337682724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46547290682792664},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4328540861606598},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.431537389755249},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.41716712713241577},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0838766098022461}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcomm.2023.3334812","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/tcomm.2023.3334812","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G316888921","display_name":null,"funder_award_id":"22-11-00208","funder_id":"https://openalex.org/F4320324099","funder_display_name":"Russian Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320324099","display_name":"Russian Science Foundation","ror":"https://ror.org/03y2gwe85"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1527274573","https://openalex.org/W1546341514","https://openalex.org/W2045407304","https://openalex.org/W2097668185","https://openalex.org/W2120033635","https://openalex.org/W2140328015","https://openalex.org/W2176476591","https://openalex.org/W3080618786","https://openalex.org/W3217369080","https://openalex.org/W4233121052","https://openalex.org/W4289655196","https://openalex.org/W6631612304","https://openalex.org/W6632719467"],"related_works":["https://openalex.org/W2109519980","https://openalex.org/W1980817751","https://openalex.org/W2383267581","https://openalex.org/W2010879611","https://openalex.org/W2100042218","https://openalex.org/W2377186915","https://openalex.org/W2247418595","https://openalex.org/W1866038923","https://openalex.org/W1976480044","https://openalex.org/W2129042426"],"abstract_inverted_index":{"A":[0],"reduced":[1],"complexity":[2,48,61],"symbolwise":[3],"maximum":[4],"a":[5],"posteriori":[6],"probability":[7],"(MAP)":[8],"decoding":[9],"algorithm":[10,18],"for":[11,63],"linear":[12],"block":[13],"codes":[14,65],"is":[15,19,66],"presented.":[16],"This":[17],"based":[20],"on":[21],"the":[22,30,43,56],"recursive":[23,53],"trellises":[24],"and":[25,34,55],"performs":[26],"two":[27],"passes":[28],"over":[29],"recursion":[31],"tree.":[32],"Probability-domain":[33],"Log-Max":[35],"implementations":[36],"are":[37],"considered.":[38],"Numeric":[39],"results":[40],"show":[41],"that":[42],"proposed":[44],"method":[45],"has":[46],"lower":[47],"compared":[49],"to":[50],"other":[51],"known":[52],"algorithms":[54],"classical":[57],"BCJR":[58],"algorithm.":[59],"The":[60],"analysis":[62],"random":[64],"provided.":[67]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-21T23:12:01.093139","created_date":"2025-10-10T00:00:00"}