{"id":"https://openalex.org/W2036698740","doi":"https://doi.org/10.1109/glocom.2011.6134177","title":"Polynomial-Complexity Optimal Resource Allocation Framework for Uplink SC-FDMA Systems","display_name":"Polynomial-Complexity Optimal Resource Allocation Framework for Uplink SC-FDMA Systems","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2036698740","doi":"https://doi.org/10.1109/glocom.2011.6134177","mag":"2036698740"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2011.6134177","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6134177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","raw_type":"proceedings-article"},"type":"preprint","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/A5077863085","display_name":"Ayaz Ahmad","orcid":"https://orcid.org/0000-0002-2253-6004"},"institutions":[{"id":"https://openalex.org/I102475099","display_name":"Sup\u00e9lec","ror":"https://ror.org/00n7gwn90","country_code":"FR","type":"education","lineage":["https://openalex.org/I102475099"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"A. Ahmad","raw_affiliation_strings":["Department of Telecommunications, SUPELEC, Gif-sur-Yvette, France","Dept. of Telecommun., SUPELEC, Gif-sur-Yvette, France"],"affiliations":[{"raw_affiliation_string":"Department of Telecommunications, SUPELEC, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I102475099"]},{"raw_affiliation_string":"Dept. of Telecommun., SUPELEC, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I102475099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112859564","display_name":"Mohamad Assaad","orcid":null},"institutions":[{"id":"https://openalex.org/I102475099","display_name":"Sup\u00e9lec","ror":"https://ror.org/00n7gwn90","country_code":"FR","type":"education","lineage":["https://openalex.org/I102475099"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M. Assaad","raw_affiliation_strings":["Department of Telecommunications, SUPELEC, Gif-sur-Yvette, France","Dept. of Telecommun., SUPELEC, Gif-sur-Yvette, France"],"affiliations":[{"raw_affiliation_string":"Department of Telecommunications, SUPELEC, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I102475099"]},{"raw_affiliation_string":"Dept. of Telecommun., SUPELEC, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I102475099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077863085"],"corresponding_institution_ids":["https://openalex.org/I102475099"],"apc_list":null,"apc_paid":null,"fwci":4.2566833,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.9519013,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","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/T11409","display_name":"Advanced Wireless Network Optimization","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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9993000030517578,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9990000128746033,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7342374920845032},{"id":"https://openalex.org/keywords/telecommunications-link","display_name":"Telecommunications link","score":0.6800639033317566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6791038513183594},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.6532487273216248},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6400777697563171},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5204477906227112},{"id":"https://openalex.org/keywords/frequency-division-multiple-access","display_name":"Frequency-division multiple access","score":0.5152342915534973},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4739037752151489},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4631352722644806},{"id":"https://openalex.org/keywords/orthogonal-frequency-division-multiple-access","display_name":"Orthogonal frequency-division multiple access","score":0.4413285255432129},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43019527196884155},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4195796847343445},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35904496908187866},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.3586706519126892},{"id":"https://openalex.org/keywords/orthogonal-frequency-division-multiplexing","display_name":"Orthogonal frequency-division multiplexing","score":0.23843052983283997},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23053434491157532},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0670134425163269},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.05896884202957153}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7342374920845032},{"id":"https://openalex.org/C138660444","wikidata":"https://www.wikidata.org/wiki/Q5607897","display_name":"Telecommunications link","level":2,"score":0.6800639033317566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6791038513183594},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.6532487273216248},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6400777697563171},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5204477906227112},{"id":"https://openalex.org/C2776208322","wikidata":"https://www.wikidata.org/wiki/Q844071","display_name":"Frequency-division multiple access","level":4,"score":0.5152342915534973},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4739037752151489},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4631352722644806},{"id":"https://openalex.org/C2775907427","wikidata":"https://www.wikidata.org/wiki/Q2697649","display_name":"Orthogonal frequency-division multiple access","level":4,"score":0.4413285255432129},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43019527196884155},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4195796847343445},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35904496908187866},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.3586706519126892},{"id":"https://openalex.org/C40409654","wikidata":"https://www.wikidata.org/wiki/Q375889","display_name":"Orthogonal frequency-division multiplexing","level":3,"score":0.23843052983283997},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23053434491157532},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0670134425163269},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.05896884202957153},{"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/glocom.2011.6134177","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6134177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","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":16,"referenced_works":["https://openalex.org/W587390710","https://openalex.org/W1747102809","https://openalex.org/W1972168423","https://openalex.org/W2106749358","https://openalex.org/W2116456097","https://openalex.org/W2117650401","https://openalex.org/W2118019594","https://openalex.org/W2126341321","https://openalex.org/W2140685518","https://openalex.org/W2141977729","https://openalex.org/W2151522817","https://openalex.org/W2163198537","https://openalex.org/W2296319761","https://openalex.org/W2497916910","https://openalex.org/W4250589301","https://openalex.org/W6680523794"],"related_works":["https://openalex.org/W2025189274","https://openalex.org/W2092365485","https://openalex.org/W1585503616","https://openalex.org/W1543564974","https://openalex.org/W2004574319","https://openalex.org/W2060870071","https://openalex.org/W2224554958","https://openalex.org/W1591771139","https://openalex.org/W2043538149","https://openalex.org/W2301502114"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,145],"study":[4],"a":[5,36,48,88,111,123,131,147],"weighted-sum":[6],"rate":[7],"maximization":[8,133],"problem":[9,62,109,115,121,128],"in":[10,23,29,50,174],"SC-FDMA":[11,51],"which":[12,129,159],"is":[13,94,130,163],"adopted":[14],"as":[15,55,110],"the":[16,21,24,32,43,59,66,97,106,119,137,140,160,167,171,175,185,189],"multiple":[17,44],"access":[18],"scheme":[19],"for":[20,76],"uplink":[22],"3GPP-LTE":[25],"standard.":[26],"Unlike":[27],"OFDMA,":[28,77],"addition":[30],"to":[31,38,47,177],"restriction":[33],"of":[34,139],"allocating":[35],"sub-channel":[37],"one":[39],"user":[40,49],"at":[41],"most,":[42],"sub-channels":[45],"allocated":[46],"should":[52],"be":[53],"consecutive":[54],"well.":[56],"This":[57],"renders":[58],"resource":[60,107,148],"allocation":[61,108,149],"prohibitively":[63],"difficult":[64],"and":[65,116],"standard":[67],"optimization":[68,91],"tools":[69],"(e.g.,":[70],"Lagrange":[71],"dual":[72,127,143],"approach":[73],"widely":[74],"used":[75],"etc.)":[78],"can":[79],"not":[80],"help":[81],"towards":[82],"its":[83,179],"optimal":[84],"solution.":[85],"We":[86,103,155,165],"propose":[87,146],"novel":[89],"polynomial-complexity":[90],"framework":[92],"that":[93,151,184],"inspired":[95],"from":[96],"recently":[98],"developed":[99],"canonical":[100,126],"duality":[101],"theory.":[102],"first":[104],"formulate":[105],"binary-integer":[112],"programming":[113],"(BIP)":[114],"then":[117],"transform":[118],"BIP":[120],"into":[122],"continuous":[124,141],"space":[125,142],"concave":[132],"problem.":[134],"Based":[135],"on":[136],"solution":[138],"problem,":[144],"algorithm":[150,162,169,187],"has":[152],"polynomial":[153],"complexity.":[154],"provide":[156],"conditions":[157],"under":[158],"proposed":[161,168,186],"optimal.":[164],"compare":[166],"with":[170],"existing":[172],"algorithms":[173],"literature":[176],"assess":[178],"performance.":[180],"Simulation":[181],"results":[182],"show":[183],"improves":[188],"system":[190],"performance":[191],"significantly.":[192]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}
