{"id":"https://openalex.org/W2790162610","doi":"https://doi.org/10.1109/lcomm.2018.2806489","title":"Automatic Modulation Classification Using Moments and Likelihood Maximization","display_name":"Automatic Modulation Classification Using Moments and Likelihood Maximization","publication_year":2018,"publication_date":"2018-02-15","ids":{"openalex":"https://openalex.org/W2790162610","doi":"https://doi.org/10.1109/lcomm.2018.2806489","mag":"2790162610"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2018.2806489","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2018.2806489","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-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/A5032299852","display_name":"Mohannad Abu-Romoh","orcid":"https://orcid.org/0000-0003-3324-5867"},"institutions":[{"id":"https://openalex.org/I155093810","display_name":"University of Idaho","ror":"https://ror.org/03hbp5t65","country_code":"US","type":"education","lineage":["https://openalex.org/I155093810"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohannad Abu-Romoh","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Idaho, Moscow, ID, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Idaho, Moscow, ID, USA","institution_ids":["https://openalex.org/I155093810"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017634940","display_name":"Ahmed Aboutaleb","orcid":"https://orcid.org/0000-0003-0791-7762"},"institutions":[{"id":"https://openalex.org/I155093810","display_name":"University of Idaho","ror":"https://ror.org/03hbp5t65","country_code":"US","type":"education","lineage":["https://openalex.org/I155093810"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ahmed Aboutaleb","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Idaho, Moscow, ID, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Idaho, Moscow, ID, USA","institution_ids":["https://openalex.org/I155093810"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008189935","display_name":"Zouheir Rezki","orcid":"https://orcid.org/0000-0002-6491-3648"},"institutions":[{"id":"https://openalex.org/I155093810","display_name":"University of Idaho","ror":"https://ror.org/03hbp5t65","country_code":"US","type":"education","lineage":["https://openalex.org/I155093810"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zouheir Rezki","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Idaho, Moscow, ID, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Idaho, Moscow, ID, USA","institution_ids":["https://openalex.org/I155093810"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032299852"],"corresponding_institution_ids":["https://openalex.org/I155093810"],"apc_list":null,"apc_paid":null,"fwci":4.7236,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.95824972,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"22","issue":"5","first_page":"938","last_page":"941"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12131","display_name":"Wireless Signal Modulation Classification","score":0.9998000264167786,"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/T12131","display_name":"Wireless Signal Modulation Classification","score":0.9998000264167786,"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/T12946","display_name":"Fractal and DNA sequence analysis","score":0.9121999740600586,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10521","display_name":"RNA and protein synthesis mechanisms","score":0.9013000130653381,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.6897978186607361},{"id":"https://openalex.org/keywords/support-vector-machine","display_name":"Support vector machine","score":0.643517017364502},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6195685863494873},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.6161694526672363},{"id":"https://openalex.org/keywords/classifier","display_name":"Classifier (UML)","score":0.6136718988418579},{"id":"https://openalex.org/keywords/random-subspace-method","display_name":"Random subspace method","score":0.5343531370162964},{"id":"https://openalex.org/keywords/linear-classifier","display_name":"Linear classifier","score":0.5078149437904358},{"id":"https://openalex.org/keywords/feature-extraction","display_name":"Feature extraction","score":0.48555228114128113},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.47503259778022766},{"id":"https://openalex.org/keywords/expectation\u2013maximization-algorithm","display_name":"Expectation\u2013maximization algorithm","score":0.4708057641983032},{"id":"https://openalex.org/keywords/boosting","display_name":"Boosting (machine learning)","score":0.4586162567138672},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4200867712497711},{"id":"https://openalex.org/keywords/quadratic-classifier","display_name":"Quadratic classifier","score":0.41819238662719727},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3716502785682678},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.3556739091873169},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29227662086486816},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1299213469028473},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.08750969171524048}],"concepts":[{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.6897978186607361},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.643517017364502},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6195685863494873},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6161694526672363},{"id":"https://openalex.org/C95623464","wikidata":"https://www.wikidata.org/wiki/Q1096149","display_name":"Classifier (UML)","level":2,"score":0.6136718988418579},{"id":"https://openalex.org/C106135958","wikidata":"https://www.wikidata.org/wiki/Q7291993","display_name":"Random subspace method","level":3,"score":0.5343531370162964},{"id":"https://openalex.org/C139532973","wikidata":"https://www.wikidata.org/wiki/Q2679259","display_name":"Linear classifier","level":3,"score":0.5078149437904358},{"id":"https://openalex.org/C52622490","wikidata":"https://www.wikidata.org/wiki/Q1026626","display_name":"Feature extraction","level":2,"score":0.48555228114128113},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.47503259778022766},{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.4708057641983032},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.4586162567138672},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4200867712497711},{"id":"https://openalex.org/C52620605","wikidata":"https://www.wikidata.org/wiki/Q7268357","display_name":"Quadratic classifier","level":3,"score":0.41819238662719727},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3716502785682678},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.3556739091873169},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29227662086486816},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1299213469028473},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.08750969171524048}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcomm.2018.2806489","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2018.2806489","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4392770408","display_name":null,"funder_award_id":"NPRP 9-077-2-036","funder_id":"https://openalex.org/F4320332753","funder_display_name":"Qatar National Research Fund"}],"funders":[{"id":"https://openalex.org/F4320332753","display_name":"Qatar National Research Fund","ror":"https://ror.org/01svaqq28"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1484094384","https://openalex.org/W1508469562","https://openalex.org/W1973487321","https://openalex.org/W2041354698","https://openalex.org/W2048503135","https://openalex.org/W2048654658","https://openalex.org/W2080457280","https://openalex.org/W2132820343","https://openalex.org/W2147735901","https://openalex.org/W2147893740","https://openalex.org/W2170778725","https://openalex.org/W2420110223","https://openalex.org/W2548159479","https://openalex.org/W2560119283"],"related_works":["https://openalex.org/W2107265013","https://openalex.org/W2888937984","https://openalex.org/W2273564766","https://openalex.org/W2407804800","https://openalex.org/W2125266525","https://openalex.org/W2796033909","https://openalex.org/W1965671931","https://openalex.org/W2513386338","https://openalex.org/W2100597930","https://openalex.org/W2185384223"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"the":[2,7,23,26,41,49,65,79,98,105],"fact":[3],"that":[4,38,64],"moments":[5,55],"of":[6,25],"received":[8],"signal":[9],"are":[10],"easy":[11],"to":[12,20,78],"compute":[13],"and":[14,45,75,104],"can":[15],"provide":[16],"a":[17,31,58,69],"simple":[18],"way":[19],"automatically":[21],"classify":[22],"modulation":[24,36],"transmitted":[27],"signal,":[28],"we":[29],"propose":[30],"hybrid":[32],"method":[33,51,67],"for":[34],"automatic":[35],"classification":[37,73],"lies":[39],"in":[40],"intersection":[42],"between":[43,72],"likelihood-based":[44],"feature-based":[46],"classifiers.":[47],"Specifically,":[48],"proposed":[50,66],"relies":[52],"on":[53],"statistical":[54],"along":[56],"with":[57],"maximum":[59,80],"likelihood":[60,81],"engine.":[61],"We":[62],"show":[63],"offers":[68],"good":[70],"trade-off":[71],"accuracy":[74],"complexity":[76],"relative":[77],"classifier.":[82],"Furthermore,":[83],"our":[84],"classifier":[85,103],"outperforms":[86],"state-of-the-art":[87],"machine":[88,102],"learning":[89],"classifiers,":[90,97],"such":[91],"as":[92],"genetic":[93],"programming-based":[94],"K-nearest":[95],"neighbor":[96],"linear":[99],"support":[100],"vector":[101],"fold-based":[106],"Kolmogorov-Smirnov":[107],"algorithm.":[108]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}