{"id":"https://openalex.org/W3046133421","doi":"https://doi.org/10.1109/icc40277.2020.9148772","title":"Joint Hybrid Precoding and Power Allocation via Rank-Constrained D.C. Programming","display_name":"Joint Hybrid Precoding and Power Allocation via Rank-Constrained D.C. Programming","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3046133421","doi":"https://doi.org/10.1109/icc40277.2020.9148772","mag":"3046133421"},"language":"en","primary_location":{"id":"doi:10.1109/icc40277.2020.9148772","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc40277.2020.9148772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","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/A5064501316","display_name":"Guanchong Niu","orcid":"https://orcid.org/0000-0002-0571-2571"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guanchong Niu","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen Guangdong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen Guangdong, China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037704808","display_name":"Qi Cao","orcid":"https://orcid.org/0000-0002-5272-3644"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qi Cao","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen Guangdong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen Guangdong, China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040559125","display_name":"Man-On Pun","orcid":"https://orcid.org/0000-0003-3316-5381"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Man-On Pun","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen Guangdong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen Guangdong, China","institution_ids":["https://openalex.org/I4210116924"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210116924"],"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":"13","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems 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/T10148","display_name":"Advanced MIMO Systems 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/T10936","display_name":"Millimeter-Wave Propagation and Modeling","score":0.9991000294685364,"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/T11392","display_name":"Energy Harvesting in Wireless Networks","score":0.9991000294685364,"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/precoding","display_name":"Precoding","score":0.7919216156005859},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7057315111160278},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6339360475540161},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.5221357941627502},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5047074556350708},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.49860429763793945},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4643322229385376},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4636344611644745},{"id":"https://openalex.org/keywords/fractional-programming","display_name":"Fractional programming","score":0.4621925950050354},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.44114699959754944},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42430388927459717},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.41083893179893494},{"id":"https://openalex.org/keywords/mimo","display_name":"MIMO","score":0.3838930130004883},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3589804768562317},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.274042010307312},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.11375370621681213},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07058551907539368},{"id":"https://openalex.org/keywords/beamforming","display_name":"Beamforming","score":0.05863022804260254},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.05835321545600891}],"concepts":[{"id":"https://openalex.org/C160562895","wikidata":"https://www.wikidata.org/wiki/Q7239557","display_name":"Precoding","level":4,"score":0.7919216156005859},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7057315111160278},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6339360475540161},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.5221357941627502},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5047074556350708},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.49860429763793945},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4643322229385376},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4636344611644745},{"id":"https://openalex.org/C169069869","wikidata":"https://www.wikidata.org/wiki/Q5477546","display_name":"Fractional programming","level":4,"score":0.4621925950050354},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.44114699959754944},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42430388927459717},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.41083893179893494},{"id":"https://openalex.org/C207987634","wikidata":"https://www.wikidata.org/wiki/Q176862","display_name":"MIMO","level":3,"score":0.3838930130004883},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3589804768562317},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.274042010307312},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.11375370621681213},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07058551907539368},{"id":"https://openalex.org/C54197355","wikidata":"https://www.wikidata.org/wiki/Q5782992","display_name":"Beamforming","level":2,"score":0.05863022804260254},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.05835321545600891},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc40277.2020.9148772","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc40277.2020.9148772","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","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":11,"referenced_works":["https://openalex.org/W1956027752","https://openalex.org/W2001715686","https://openalex.org/W2025138368","https://openalex.org/W2053521124","https://openalex.org/W2111953900","https://openalex.org/W2120435222","https://openalex.org/W2145163533","https://openalex.org/W2272804037","https://openalex.org/W2614731226","https://openalex.org/W2790183137","https://openalex.org/W3099908750"],"related_works":["https://openalex.org/W4281688526","https://openalex.org/W4295789378","https://openalex.org/W2400034325","https://openalex.org/W4292651679","https://openalex.org/W4299515259","https://openalex.org/W2499557797","https://openalex.org/W2985979428","https://openalex.org/W2510140549","https://openalex.org/W2187449906","https://openalex.org/W2962818859"],"abstract_inverted_index":{"Hybrid":[0],"analog":[1],"and":[2,26],"digital":[3],"precoding":[4,25],"have":[5],"recently":[6],"been":[7],"proposed":[8,75,109,122],"for":[9],"massive":[10],"multiple-input":[11],"multiple-output":[12],"(MIMO)":[13],"systems.":[14],"However,":[15],"it":[16],"is":[17,33,42,69,77,112],"challenging":[18],"to":[19],"jointly":[20],"optimize":[21],"the":[22,30,39,45,57,61,74,82,93,103,108,118,121],"design":[23],"of":[24,48,60,79,86,95,99,107,120],"power":[27],"allocation":[28],"as":[29],"optimization":[31],"problem":[32,41],"highly":[34],"non-convex.":[35],"In":[36],"this":[37],"work,":[38],"non-convex":[40],"cast":[43],"into":[44,91],"D.C.":[46,66],"(difference":[47],"two":[49],"convex":[50],"functions)":[51],"programming":[52,67],"framework.":[53],"To":[54],"cope":[55],"with":[56],"high":[58],"dimensionality":[59],"problem,":[62],"an":[63],"iterative":[64,110,123],"rank-constrained":[65],"technique":[68],"developed.":[70],"As":[71],"a":[72],"result,":[73],"algorithm":[76,111],"capable":[78],"directly":[80],"maximizing":[81],"weighted":[83],"sum-rate":[84],"(WSR)":[85],"all":[87],"users":[88],"while":[89],"taking":[90],"account":[92],"quality":[94],"service":[96],"(QoS)":[97],"requirement":[98],"each":[100],"user.":[101],"Furthermore,":[102],"monotonic":[104],"convergence":[105],"behavior":[106],"proved.":[113],"Finally,":[114],"simulation":[115],"results":[116],"confirm":[117],"effectiveness":[119],"algorithm.":[124]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}