{"id":"https://openalex.org/W2292002362","doi":"https://doi.org/10.1109/glocom.2014.7417667","title":"Low-Complexity Decoding of Repeat-Accumulate Codes over Quasi-Static Fading Channels","display_name":"Low-Complexity Decoding of Repeat-Accumulate Codes over Quasi-Static Fading Channels","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2292002362","doi":"https://doi.org/10.1109/glocom.2014.7417667","mag":"2292002362"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2014.7417667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2014.7417667","pdf_url":null,"source":{"id":"https://openalex.org/S4363607712","display_name":"2015 IEEE Global Communications Conference (GLOBECOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Global Communications Conference (GLOBECOM)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5008684838","display_name":"Haifeng Yuan","orcid":"https://orcid.org/0000-0002-8086-4217"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Haifeng Yuan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, National University of Singapore, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083124337","display_name":"Pooi\u2010Yuen Kam","orcid":"https://orcid.org/0000-0001-5543-5034"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Pooi Yuen Kam","raw_affiliation_strings":["Department of Electrical and Computer Engineering, National University of Singapore, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"53","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9997000098228455,"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.9980999827384949,"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/decoding-methods","display_name":"Decoding methods","score":0.856738805770874},{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.7289109230041504},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.7156611680984497},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7146657705307007},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.70822674036026},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6716943383216858},{"id":"https://openalex.org/keywords/fading","display_name":"Fading","score":0.6447405815124512},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.6232286095619202},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6193773150444031},{"id":"https://openalex.org/keywords/soft-decision-decoder","display_name":"Soft-decision decoder","score":0.5372030735015869},{"id":"https://openalex.org/keywords/iterative-viterbi-decoding","display_name":"Iterative Viterbi decoding","score":0.5285571813583374},{"id":"https://openalex.org/keywords/trellis","display_name":"Trellis (graph)","score":0.5222780704498291},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5006301403045654},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48871493339538574},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3559027910232544},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.18334317207336426},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1324172019958496}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.856738805770874},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.7289109230041504},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.7156611680984497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7146657705307007},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.70822674036026},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6716943383216858},{"id":"https://openalex.org/C81978471","wikidata":"https://www.wikidata.org/wiki/Q1196572","display_name":"Fading","level":3,"score":0.6447405815124512},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.6232286095619202},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6193773150444031},{"id":"https://openalex.org/C185588885","wikidata":"https://www.wikidata.org/wiki/Q7553811","display_name":"Soft-decision decoder","level":3,"score":0.5372030735015869},{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.5285571813583374},{"id":"https://openalex.org/C2781235587","wikidata":"https://www.wikidata.org/wiki/Q7838009","display_name":"Trellis (graph)","level":3,"score":0.5222780704498291},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5006301403045654},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48871493339538574},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3559027910232544},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.18334317207336426},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1324172019958496}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2014.7417667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2014.7417667","pdf_url":null,"source":{"id":"https://openalex.org/S4363607712","display_name":"2015 IEEE Global Communications Conference (GLOBECOM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Global Communications Conference (GLOBECOM)","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":30,"referenced_works":["https://openalex.org/W147465018","https://openalex.org/W213300876","https://openalex.org/W1561953724","https://openalex.org/W1562979145","https://openalex.org/W2026234398","https://openalex.org/W2045407304","https://openalex.org/W2056414370","https://openalex.org/W2063941287","https://openalex.org/W2099180514","https://openalex.org/W2102726031","https://openalex.org/W2104653913","https://openalex.org/W2119411189","https://openalex.org/W2120773424","https://openalex.org/W2128765501","https://openalex.org/W2129202348","https://openalex.org/W2135764410","https://openalex.org/W2137028798","https://openalex.org/W2137358528","https://openalex.org/W2140446444","https://openalex.org/W2145018027","https://openalex.org/W2148643041","https://openalex.org/W2149959899","https://openalex.org/W2157050350","https://openalex.org/W2159152700","https://openalex.org/W2167368385","https://openalex.org/W2987657883","https://openalex.org/W4300188436","https://openalex.org/W6605892194","https://openalex.org/W6678102121","https://openalex.org/W6678839936"],"related_works":["https://openalex.org/W2374292458","https://openalex.org/W2133857928","https://openalex.org/W2375912048","https://openalex.org/W2921374214","https://openalex.org/W2156108776","https://openalex.org/W2146383045","https://openalex.org/W2101868111","https://openalex.org/W2007227294","https://openalex.org/W3008468562","https://openalex.org/W1843778016"],"abstract_inverted_index":{"We":[0],"consider":[1],"iterative":[2,116],"decoding":[3,29,75,84,97],"of":[4,31,40,115],"repeat-":[5],"accumulate":[6],"(RA)":[7],"codes":[8],"over":[9],"frequency-flat,":[10],"quasi-":[11],"static":[12],"fading":[13],"channels.":[14],"A":[15],"soft-input,":[16],"soft-output":[17,33],"decoder":[18,46,88,123],"is":[19,63],"proposed":[20,87,122],"for":[21],"the":[22,28,32,37,41,53,59,68,74,82,86,106,112,121],"inner":[23],"convolutional":[24],"decoding,":[25,120],"which":[26],"fuses":[27],"approach":[30,39],"Viterbi":[34],"algorithm":[35,50],"and":[36,70,119,128],"estimation":[38,118],"maximum-likelihood":[42],"sequence":[43],"detector.":[44],"The":[45],"deploys":[47],"trellis":[48],"search":[49],"based":[51],"on":[52],"generalized":[54],"likelihood":[55],"ratio":[56],"test,":[57],"whereby":[58],"channel":[60,101,117],"state":[61],"information":[62],"acquired":[64],"implicitly":[65],"using":[66],"both":[67],"pilot":[69],"data":[71],"signals":[72],"during":[73],"process.":[76],"Through":[77],"simulations,":[78],"we":[79],"show":[80],"that":[81],"RA":[83,96],"with":[85,98,111],"has":[89,124],"much":[90,125],"better":[91],"error":[92,140],"performance":[93],"than":[94],"standard":[95],"pilot-symbol-":[99],"assisted":[100],"estimation,":[102],"while":[103],"having":[104],"approximately":[105],"same":[107],"computational":[108,132],"complexity.":[109],"Compared":[110],"conventional":[113],"scheme":[114],"simpler":[126],"structure":[127],"requires":[129],"significantly":[130],"less":[131],"power,":[133],"although":[134],"it":[135],"incurs":[136],"some":[137],"loss":[138],"in":[139],"performance.":[141]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}