{"id":"https://openalex.org/W2039470879","doi":"https://doi.org/10.1109/isita.2010.5649530","title":"Subcarrier allocation and partner selection algorithms for cooperative multicarrier systems","display_name":"Subcarrier allocation and partner selection algorithms for cooperative multicarrier systems","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2039470879","doi":"https://doi.org/10.1109/isita.2010.5649530","mag":"2039470879"},"language":"en","primary_location":{"id":"doi:10.1109/isita.2010.5649530","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isita.2010.5649530","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Symposium On Information Theory & Its Applications","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/A5059884841","display_name":"Kuang-Yu Sung","orcid":null},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Kuang-Yu Sung","raw_affiliation_strings":["Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan","Institute of Communications Engineering, National Tsing Hua University Hsinchu 30013, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"Institute of Communications Engineering, National Tsing Hua University Hsinchu 30013, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009791512","display_name":"Y.-W. Peter Hong","orcid":"https://orcid.org/0000-0001-7043-8276"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Y.-W. Peter Hong","raw_affiliation_strings":["Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan","Institute of Communications Engineering, National Tsing Hua University Hsinchu 30013, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"Institute of Communications Engineering, National Tsing Hua University Hsinchu 30013, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047823549","display_name":"Chi-chao Chao","orcid":"https://orcid.org/0000-0002-5259-2488"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chi-chao Chao","raw_affiliation_strings":["Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan","Institute of Communications Engineering, National Tsing Hua University Hsinchu 30013, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I25846049"]},{"raw_affiliation_string":"Institute of Communications Engineering, National Tsing Hua University Hsinchu 30013, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I25846049"],"apc_list":null,"apc_paid":null,"fwci":0.2934,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.44915085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"963","last_page":"968"},"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9937999844551086,"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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9869999885559082,"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/subcarrier","display_name":"Subcarrier","score":0.9587087631225586},{"id":"https://openalex.org/keywords/relay","display_name":"Relay","score":0.7779319882392883},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7214061617851257},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6549443006515503},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.585027277469635},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.47911930084228516},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4765123426914215},{"id":"https://openalex.org/keywords/orthogonal-frequency-division-multiplexing","display_name":"Orthogonal frequency-division multiplexing","score":0.4724811911582947},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4536844491958618},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.43402808904647827},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.34311234951019287},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3036075830459595},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.27464598417282104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1478518545627594},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05749785900115967}],"concepts":[{"id":"https://openalex.org/C198329298","wikidata":"https://www.wikidata.org/wiki/Q586358","display_name":"Subcarrier","level":4,"score":0.9587087631225586},{"id":"https://openalex.org/C2778156585","wikidata":"https://www.wikidata.org/wiki/Q174053","display_name":"Relay","level":3,"score":0.7779319882392883},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7214061617851257},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6549443006515503},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.585027277469635},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.47911930084228516},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4765123426914215},{"id":"https://openalex.org/C40409654","wikidata":"https://www.wikidata.org/wiki/Q375889","display_name":"Orthogonal frequency-division multiplexing","level":3,"score":0.4724811911582947},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4536844491958618},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.43402808904647827},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.34311234951019287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3036075830459595},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.27464598417282104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1478518545627594},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05749785900115967},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isita.2010.5649530","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isita.2010.5649530","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Symposium On Information Theory & Its Applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W200973355","https://openalex.org/W2064765581","https://openalex.org/W2116602961","https://openalex.org/W2129729589","https://openalex.org/W2138526546","https://openalex.org/W2142688862","https://openalex.org/W2143701515","https://openalex.org/W2145437642","https://openalex.org/W2148963518","https://openalex.org/W2152121970","https://openalex.org/W2153278451","https://openalex.org/W2296319761","https://openalex.org/W4250589301","https://openalex.org/W6677787474"],"related_works":["https://openalex.org/W2172159377","https://openalex.org/W2055131418","https://openalex.org/W1501039677","https://openalex.org/W2166250390","https://openalex.org/W2306672848","https://openalex.org/W2019909929","https://openalex.org/W1964989099","https://openalex.org/W2547202878","https://openalex.org/W2126075151","https://openalex.org/W3000091417"],"abstract_inverted_index":{"Subcarrier":[0],"allocation,":[1,3],"power":[2,138,154,191],"and":[4,45,69,85,100,134,157],"partner":[5,70,173],"selection":[6,71,174],"algorithms":[7,224],"are":[8,73],"examined":[9],"for":[10,78,124,140],"amplify-and-forward":[11],"cooperative":[12,22,63,197],"multicarrier":[13],"systems.":[14],"Consider":[15],"a":[16,25,92,111,158,204],"network":[17],"that":[18],"consists":[19],"of":[20,39,55,83,221],"multiple":[21],"pairs":[23],"employing":[24],"two-phase":[26],"cooperation":[27,166],"scheme":[28],"where":[29,115],"the":[30,53,62,136,153,181,185,189,196,222],"users":[31,84],"first":[32],"transmit":[33],"their":[34,40,48,56],"own":[35,49],"messages":[36,50,54],"on":[37,152,180],"each":[38,116],"subcarriers":[41,127,194],"in":[42,58,128,195],"Phase":[43,59,129],"I":[44],"either":[46],"retransmit":[47,121],"or":[51,122],"relay":[52,123],"partners":[57],"II,":[60],"i.e.,":[61],"phase.":[64],"In":[65,87],"general,":[66],"subcarrier":[67,117,144,186],"allocation":[68,139,145,155,187,192],"problems":[72],"known":[74],"to":[75,96,105,120,163,202],"be":[76,149,200,203,211],"intractable":[77],"systems":[79],"with":[80],"large":[81],"number":[82],"subcarriers.":[86],"this":[88,141],"work,":[89],"we":[90,109],"propose":[91],"mathematically":[93],"tractable":[94],"approach":[95],"address":[97],"these":[98],"issues":[99],"show":[101],"its":[102],"effectiveness":[103],"compared":[104],"existing":[106],"algorithms.":[107],"Specifically,":[108],"consider":[110],"relaxed":[112],"problem":[113,207],"formulation,":[114],"is":[118,161,167,176,225],"able":[119],"all":[125],"other":[126],"II":[130],"over":[131],"orthogonal":[132],"channels,":[133],"derive":[135],"optimal":[137,190],"scenario.":[142],"Efficient":[143],"policies":[146],"can":[147,199,210],"then":[148,177],"derived":[150],"based":[151,179],"result":[156],"sufficient":[159,182],"condition":[160],"obtained":[162],"determine":[164],"when":[165],"helpful":[168],"among":[169,193],"two":[170],"users.":[171],"A":[172],"algorithm":[175],"devised":[178],"condition.":[183],"Given":[184],"scheme,":[188],"phase":[198],"shown":[201],"convex":[205,216],"optimization":[206,217],"and,":[208],"thus,":[209],"solved":[212],"efficiently":[213],"using":[214],"standard":[215],"tools.":[218],"The":[219],"efficacy":[220],"proposed":[223],"demonstrated":[226],"through":[227],"numerical":[228],"simulations.":[229]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}