{"id":"https://openalex.org/W2118759444","doi":"https://doi.org/10.1109/wcnc.2003.1200359","title":"Performance bounds on error probability of serially concatenated convolutional codes and CPM in fading channels","display_name":"Performance bounds on error probability of serially concatenated convolutional codes and CPM in fading channels","publication_year":2004,"publication_date":"2004-01-23","ids":{"openalex":"https://openalex.org/W2118759444","doi":"https://doi.org/10.1109/wcnc.2003.1200359","mag":"2118759444"},"language":"en","primary_location":{"id":"doi:10.1109/wcnc.2003.1200359","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2003.1200359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003.","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/A5078379352","display_name":"Ozgur Dural","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"O. Dural","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA","Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026924282","display_name":"J.G. Proakis","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.G. Proakis","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA","Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.23533851,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"273","last_page":"277"},"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9994999766349792,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9994000196456909,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.7901657819747925},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.7715033888816833},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.7321115732192993},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6804800033569336},{"id":"https://openalex.org/keywords/fading","display_name":"Fading","score":0.6724762320518494},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6484241485595703},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.5744425654411316},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.555702269077301},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5234985947608948},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5226283073425293},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.430059015750885},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35489583015441895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3036753535270691},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.19695648550987244},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09681788086891174},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07707303762435913}],"concepts":[{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.7901657819747925},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.7715033888816833},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.7321115732192993},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6804800033569336},{"id":"https://openalex.org/C81978471","wikidata":"https://www.wikidata.org/wiki/Q1196572","display_name":"Fading","level":3,"score":0.6724762320518494},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6484241485595703},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.5744425654411316},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.555702269077301},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5234985947608948},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5226283073425293},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.430059015750885},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35489583015441895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3036753535270691},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.19695648550987244},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09681788086891174},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07707303762435913},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wcnc.2003.1200359","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2003.1200359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003.","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/W1557819056","https://openalex.org/W1637171221","https://openalex.org/W2048382407","https://openalex.org/W2121762698","https://openalex.org/W2128765501","https://openalex.org/W2141661753","https://openalex.org/W2148862002","https://openalex.org/W2152300390","https://openalex.org/W2170691229","https://openalex.org/W2798333393","https://openalex.org/W4233460216","https://openalex.org/W4245808720","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W2015101254","https://openalex.org/W1603044377","https://openalex.org/W1944343091","https://openalex.org/W2168862745","https://openalex.org/W1580452828","https://openalex.org/W1532949632","https://openalex.org/W2130515157","https://openalex.org/W1996737726","https://openalex.org/W2160335134","https://openalex.org/W2347306183"],"abstract_inverted_index":{"Serial":[0],"concatenation":[1],"of":[2,34,52],"convolutional":[3],"codes":[4],"and":[5],"CPM":[6],"through":[7],"an":[8,25],"interleaver":[9],"has":[10],"a":[11],"similar":[12],"structure":[13],"as":[14],"serially":[15],"concatenated":[16],"turbo":[17],"codes.":[18],"Although":[19],"the":[20,30,50,56,73,96],"union":[21,97],"bound,":[22],"which":[23],"is":[24,37,55,86],"analytical":[26],"tool":[27],"to":[28,68,71,88],"estimate":[29,72],"bit":[31],"error":[32],"probability":[33],"such":[35],"systems,":[36],"tight":[38],"for":[39,46],"high":[40],"signal-to-noise":[41],"ratio":[42],"(SNR),":[43],"it":[44,85],"diverges":[45],"low":[47,76],"SNR":[48],"where":[49],"performance":[51,74],"our":[53,69],"system":[54,70],"most":[57],"appealing.":[58],"For":[59],"this":[60],"reason,":[61],"we":[62],"apply":[63],"improved":[64],"upper":[65],"bounding":[66],"techniques":[67],"at":[75],"SNR.":[77],"We":[78],"show":[79],"that":[80],"by":[81],"applying":[82],"these":[83],"techniques,":[84],"possible":[87],"obtain":[89],"1":[90],"dB":[91],"or":[92],"more":[93],"improvement":[94],"over":[95],"bound":[98],"in":[99],"fading":[100],"channels.":[101]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}