{"id":"https://openalex.org/W2142456283","doi":"https://doi.org/10.1109/isit.2004.1365529","title":"Reduced-complexity iterative decoding using a variable-size trellis structure","display_name":"Reduced-complexity iterative decoding using a variable-size trellis structure","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2142456283","doi":"https://doi.org/10.1109/isit.2004.1365529","mag":"2142456283"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365529","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365529","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5042538342","display_name":"D. Bokolamulla","orcid":null},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"D.N. Bokolamulla","raw_affiliation_strings":["Department of Computer Engineering, Chalmers University of Technology, Gothenburg, Sweden","Dept of Computer Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Dept of Computer Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056309960","display_name":"Tor Aulin","orcid":"https://orcid.org/0009-0002-9523-2711"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"T. Aulin","raw_affiliation_strings":["Department of Computer Engineering, Chalmers University of Technology, Gothenburg, Sweden","Dept of Computer Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Dept of Computer Engineering, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042538342"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":0.3388,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.66322652,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"492","last_page":"492"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":1.0,"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":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9980000257492065,"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/exit-chart","display_name":"EXIT chart","score":0.7837074995040894},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7814458012580872},{"id":"https://openalex.org/keywords/trellis","display_name":"Trellis (graph)","score":0.7313566207885742},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6724272966384888},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6689453125},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6427193880081177},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6041086316108704},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6002597808837891},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4696611166000366},{"id":"https://openalex.org/keywords/bit-error-rate","display_name":"Bit error rate","score":0.449735552072525},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3702518939971924},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.15440252423286438}],"concepts":[{"id":"https://openalex.org/C171401667","wikidata":"https://www.wikidata.org/wiki/Q5324684","display_name":"EXIT chart","level":5,"score":0.7837074995040894},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7814458012580872},{"id":"https://openalex.org/C2781235587","wikidata":"https://www.wikidata.org/wiki/Q7838009","display_name":"Trellis (graph)","level":3,"score":0.7313566207885742},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6724272966384888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6689453125},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6427193880081177},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6041086316108704},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6002597808837891},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4696611166000366},{"id":"https://openalex.org/C56296756","wikidata":"https://www.wikidata.org/wiki/Q840922","display_name":"Bit error rate","level":3,"score":0.449735552072525},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3702518939971924},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.15440252423286438},{"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2004.1365529","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365529","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.lib.chalmers.se:12567","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/12567-reduced-complexity-iterative-decoding-using-a-variable-size-trellis-structure","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Conference.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:12567","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/12567","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2107878407","https://openalex.org/W2159059820","https://openalex.org/W2897795513","https://openalex.org/W6755279021"],"related_works":["https://openalex.org/W2614896695","https://openalex.org/W2031125189","https://openalex.org/W2137420069","https://openalex.org/W4285195826","https://openalex.org/W1968190056","https://openalex.org/W2364605271","https://openalex.org/W3115308715","https://openalex.org/W2247533527","https://openalex.org/W2794886828","https://openalex.org/W4251897046"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,19,61],"new":[3],"reduced-complexity":[4],"iterative":[5],"decoding":[6],"algorithm.":[7],"The":[8],"main":[9],"concept":[10],"is":[11],"to":[12,25,35],"approximate":[13],"the":[14,27,36,40,47,57],"aposteriori":[15],"probabilities":[16],"(APP)":[17],"by":[18,50],"set":[20,31],"of":[21,29],"few":[22],"sequences,":[23],"and":[24,46,66],"reduce":[26],"size":[28],"this":[30],"with":[32],"iterations.":[33],"According":[34],"numerical":[37],"results":[38],"on":[39],"bit":[41],"error":[42],"rate":[43],"(BER)":[44],"performance":[45,65],"convergence":[48],"behavior":[49],"extrinsic":[51],"information":[52],"transfer":[53],"(EXIT)":[54],"chart":[55],"analysis,":[56],"algorithm":[58],"could":[59],"obtain":[60],"good":[62],"balance":[63],"between":[64],"complexity.":[67]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}