{"id":"https://openalex.org/W3217369080","doi":"https://doi.org/10.1109/itw48936.2021.9611446","title":"A recursive SISO decoding algorithm","display_name":"A recursive SISO decoding algorithm","publication_year":2021,"publication_date":"2021-10-17","ids":{"openalex":"https://openalex.org/W3217369080","doi":"https://doi.org/10.1109/itw48936.2021.9611446","mag":"3217369080"},"language":"en","primary_location":{"id":"doi:10.1109/itw48936.2021.9611446","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw48936.2021.9611446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Information Theory Workshop (ITW)","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/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":["ITMO University, Russia"],"affiliations":[{"raw_affiliation_string":"ITMO University, 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":["ITMO University, Russia"],"affiliations":[{"raw_affiliation_string":"ITMO University, 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.5014,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.64917269,"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998999834060669,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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/T11130","display_name":"Coding theory and cryptography","score":0.9997000098228455,"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/recursion","display_name":"Recursion (computer science)","score":0.839140772819519},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.732811450958252},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7204821109771729},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6213140487670898},{"id":"https://openalex.org/keywords/bcjr-algorithm","display_name":"BCJR algorithm","score":0.5339516401290894},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5319868326187134},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5212469696998596},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5075956583023071},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4553939700126648},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4397837817668915},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4390184283256531},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41710129380226135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3101803660392761},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07070562243461609}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.839140772819519},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.732811450958252},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7204821109771729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6213140487670898},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.5339516401290894},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5319868326187134},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5212469696998596},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5075956583023071},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4553939700126648},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4397837817668915},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4390184283256531},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41710129380226135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3101803660392761},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07070562243461609}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw48936.2021.9611446","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw48936.2021.9611446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Information Theory Workshop (ITW)","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":10,"referenced_works":["https://openalex.org/W1527274573","https://openalex.org/W1546341514","https://openalex.org/W2045407304","https://openalex.org/W2097668185","https://openalex.org/W2111481360","https://openalex.org/W2120033635","https://openalex.org/W2176476591","https://openalex.org/W3080618786","https://openalex.org/W6631612304","https://openalex.org/W6632719467"],"related_works":["https://openalex.org/W1980817751","https://openalex.org/W2383267581","https://openalex.org/W2010879611","https://openalex.org/W2377186915","https://openalex.org/W2247418595","https://openalex.org/W1976480044","https://openalex.org/W1866038923","https://openalex.org/W2081909507","https://openalex.org/W2129042426","https://openalex.org/W2996270337"],"abstract_inverted_index":{"A":[0],"novel":[1],"SISO":[2],"decoding":[3],"algorithm":[4,12],"for":[5],"linear":[6],"block":[7],"codes":[8],"is":[9,13],"presented.":[10],"This":[11],"based":[14],"on":[15],"the":[16,24,46,52],"recursive":[17,49],"trellises":[18],"and":[19,29,51],"performs":[20],"two":[21],"passes":[22],"over":[23],"recursion":[25],"tree.":[26],"Probabilitydomain":[27],"implementation":[28],"its":[30],"LogMax":[31],"approximation":[32],"are":[33],"considered.":[34],"Numeric":[35],"results":[36],"show":[37],"that":[38],"proposed":[39],"method":[40],"has":[41],"lower":[42],"complexity":[43],"compared":[44],"to":[45],"other":[47],"known":[48],"algorithms":[50],"classical":[53],"BCJR":[54],"algorithm.":[55]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}