{"id":"https://openalex.org/W2790194416","doi":"https://doi.org/10.1109/camsap.2017.8313142","title":"Weighted sum rate maximization for non-regenerative multi-way relay channels with multi-user decoding","display_name":"Weighted sum rate maximization for non-regenerative multi-way relay channels with multi-user decoding","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2790194416","doi":"https://doi.org/10.1109/camsap.2017.8313142","mag":"2790194416"},"language":"en","primary_location":{"id":"doi:10.1109/camsap.2017.8313142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/camsap.2017.8313142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)","raw_type":"proceedings-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/A5058121440","display_name":"Bho Matthiesen","orcid":"https://orcid.org/0000-0002-4582-3938"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Bho Matthiesen","raw_affiliation_strings":["Institute of Communication Technology, Technische Universit\u00e4t, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Communication Technology, Technische Universit\u00e4t, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029956964","display_name":"Eduard A. Jorswieck","orcid":"https://orcid.org/0000-0001-7893-8435"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Eduard A. Jorswieck","raw_affiliation_strings":["Institute of Communication Technology, Technische Universit\u00e4t, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Communication Technology, Technische Universit\u00e4t, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058121440"],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":0.6216,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74367583,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"12","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9995999932289124,"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.9980000257492065,"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/decoding-methods","display_name":"Decoding methods","score":0.8419964909553528},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7288317680358887},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.7222719192504883},{"id":"https://openalex.org/keywords/relay","display_name":"Relay","score":0.6358861923217773},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5803255438804626},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5645781755447388},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5617496967315674},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5488225221633911},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.526349663734436},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.5105222463607788},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37384033203125},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.3567696213722229},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19885379076004028},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09741118550300598},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.09143126010894775},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.08629098534584045}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8419964909553528},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7288317680358887},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.7222719192504883},{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.6358861923217773},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5803255438804626},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5645781755447388},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5617496967315674},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5488225221633911},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.526349663734436},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.5105222463607788},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37384033203125},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.3567696213722229},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19885379076004028},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09741118550300598},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09143126010894775},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.08629098534584045},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/camsap.2017.8313142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/camsap.2017.8313142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)","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":14,"referenced_works":["https://openalex.org/W1494099594","https://openalex.org/W2025183929","https://openalex.org/W2058162451","https://openalex.org/W2066409766","https://openalex.org/W2098473710","https://openalex.org/W2163278024","https://openalex.org/W2177315802","https://openalex.org/W2233951218","https://openalex.org/W2338807306","https://openalex.org/W2783067144","https://openalex.org/W3103561054","https://openalex.org/W4229995946","https://openalex.org/W4249840661","https://openalex.org/W4300840296"],"related_works":["https://openalex.org/W2539674285","https://openalex.org/W1998322187","https://openalex.org/W1038122923","https://openalex.org/W2952514781","https://openalex.org/W3019210376","https://openalex.org/W2391145594","https://openalex.org/W2326572623","https://openalex.org/W1559320887","https://openalex.org/W2137838797","https://openalex.org/W2360483549"],"abstract_inverted_index":{"This":[0,96],"paper":[1],"studies":[2],"the":[3,6,19,23,33,57,67,84,98,105,110],"maximization":[4],"of":[5,32,50,59,145],"weighted":[7],"sum":[8],"rate":[9],"in":[10,56,143],"multi-way":[11],"relay":[12],"channels":[13],"with":[14,73,113],"simultaneous":[15],"non-unique":[16],"decoding":[17,115,124,136,142],"at":[18,129],"receivers.":[20],"We":[21,61,108,132],"state":[22],"resource":[24],"allocation":[25,119],"problem":[26,31,68,86],"as":[27],"a":[28,43,70],"global":[29,106],"optimization":[30,45,52,85],"transmit":[34],"powers":[35,66],"and":[36,39,77,91,102,116,125,147],"achievable":[37,111],"rates,":[38],"transform":[40],"it":[41],"into":[42,87],"monotonic":[44,51,94],"problem.":[46],"The":[47],"computational":[48,99],"complexity":[49,76,100],"problems":[53],"is":[54,69],"exponential":[55],"number":[58],"variables.":[60],"observe":[62,133],"that":[63,134],"for":[64,149],"fixed":[65],"linear":[71,90],"program":[72],"much":[74,138],"lower":[75],"exploit":[78],"this":[79],"structural":[80],"property":[81],"by":[82],"decomposing":[83],"an":[88,92],"inner":[89],"outer":[93],"program.":[95],"reduces":[97],"significantly":[101],"allows":[103],"computing":[104],"solution.":[107],"compare":[109],"throughput":[112,146],"multi-user":[114,135],"optimal":[117],"power":[118],"numerically":[120],"to":[121,126,151],"state-of-the-art":[122],"single-user":[123,141],"simply":[127],"transmitting":[128],"maximum":[130],"power.":[131],"performs":[137],"better":[139],"than":[140],"terms":[144],"fairness":[148],"medium":[150],"high":[152],"SNRs.":[153]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}