{"id":"https://openalex.org/W1993747621","doi":"https://doi.org/10.1109/sips.2011.6088976","title":"Reduced complexity Chase-Pyndiah decoding algorithm for turbo product codes","display_name":"Reduced complexity Chase-Pyndiah decoding algorithm for turbo product codes","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W1993747621","doi":"https://doi.org/10.1109/sips.2011.6088976","mag":"1993747621"},"language":"en","primary_location":{"id":"doi:10.1109/sips.2011.6088976","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips.2011.6088976","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","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/A5082132679","display_name":"Junhee Cho","orcid":"https://orcid.org/0000-0001-7427-7457"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Junhee Cho","raw_affiliation_strings":["Department of Electrical Engineering, Seoul National University, Seoul, South Korea","Department of Electrical Engineering, Seoul National University, 599 Gwanangno, Gwanak-gu, Seoul, 151-744, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Department of Electrical Engineering, Seoul National University, 599 Gwanangno, Gwanak-gu, Seoul, 151-744, Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113491293","display_name":"Wonyong Sung","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Wonyong Sung","raw_affiliation_strings":["Department of Electrical Engineering, Seoul National University, Seoul, South Korea","Department of Electrical Engineering, Seoul National University, 599 Gwanangno, Gwanak-gu, Seoul, 151-744, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Department of Electrical Engineering, Seoul National University, 599 Gwanangno, Gwanak-gu, Seoul, 151-744, Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082132679"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":0.4276,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.70956537,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9995999932289124,"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.9994999766349792,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7280622720718384},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7138736248016357},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6448973417282104},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5875093340873718},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5623215436935425},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.49253591895103455},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.4816547930240631},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4594520032405853},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44983750581741333},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.44743484258651733},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.43270143866539},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.4277424216270447},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3268689811229706},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2519380748271942}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7280622720718384},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7138736248016357},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6448973417282104},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5875093340873718},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5623215436935425},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.49253591895103455},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.4816547930240631},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4594520032405853},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44983750581741333},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.44743484258651733},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.43270143866539},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4277424216270447},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3268689811229706},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2519380748271942},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sips.2011.6088976","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sips.2011.6088976","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Workshop on Signal Processing Systems (SiPS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1562979145","https://openalex.org/W1990176214","https://openalex.org/W2003324421","https://openalex.org/W2023355697","https://openalex.org/W2045407304","https://openalex.org/W2045833460","https://openalex.org/W2055884992","https://openalex.org/W2101780271","https://openalex.org/W2102251435","https://openalex.org/W2124799219","https://openalex.org/W2143781601","https://openalex.org/W2164090540","https://openalex.org/W2167657277"],"related_works":["https://openalex.org/W2382797376","https://openalex.org/W2104799730","https://openalex.org/W2989606067","https://openalex.org/W2110220059","https://openalex.org/W1986569921","https://openalex.org/W2078915705","https://openalex.org/W2161191727","https://openalex.org/W2150832817","https://openalex.org/W2079180764","https://openalex.org/W2358176388"],"abstract_inverted_index":{"Turbo":[0],"product":[1],"codes":[2],"(TPC)":[3],"are":[4,32,38],"very":[5],"suitable":[6],"for":[7,106],"applications":[8],"requiring":[9],"a":[10,14,27,119],"large":[11],"code":[12],"length,":[13],"high":[15],"code-rate,":[16],"and":[17,34,99],"good":[18],"error":[19,73],"performance.":[20],"In":[21],"the":[22,35,50,53,61,94,101,115],"Chase":[23],"decoding":[24,55],"algorithm,":[25],"normally":[26],"few":[28],"least":[29,64],"reliable":[30,65],"positions":[31,66,82,105],"selected":[33],"test":[36,97],"sequences":[37,98],"generated":[39],"from":[40],"these":[41,88],"positions.":[42],"This":[43],"paper":[44],"proposes":[45],"two":[46],"methods":[47],"to":[48],"lower":[49,100],"complexity":[51],"of":[52,63,96,103],"Chase-Pyndiah":[54],"algorithm.":[56],"The":[57,75],"first":[58],"scheme":[59],"reduces":[60],"number":[62,95,102],"by":[67],"excluding":[68],"those":[69],"having":[70],"relatively":[71],"low":[72],"probabilities.":[74],"other":[76],"one":[77],"minimizes":[78],"computations":[79],"on":[80],"unnecessary":[81],"in":[83],"an":[84,108],"algebraic":[85],"decoder.":[86],"With":[87],"methods,":[89],"we":[90],"can":[91],"significantly":[92],"reduce":[93],"utilized":[104],"constructing":[107],"extended":[109,124],"candidate":[110],"codeword":[111],"set.":[112],"We":[113],"show":[114],"simulation":[116],"results":[117],"with":[118],"squared":[120],"(64,":[121],"57,":[122],"4)":[123],"Hamming":[125],"code-based":[126],"TPC.":[127]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}