{"id":"https://openalex.org/W2137365207","doi":"https://doi.org/10.1109/tsp.2012.2192433","title":"Iterative Precoder Design and User Scheduling for Block-Diagonalized Systems","display_name":"Iterative Precoder Design and User Scheduling for Block-Diagonalized Systems","publication_year":2012,"publication_date":"2012-04-11","ids":{"openalex":"https://openalex.org/W2137365207","doi":"https://doi.org/10.1109/tsp.2012.2192433","mag":"2137365207"},"language":"en","primary_location":{"id":"doi:10.1109/tsp.2012.2192433","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2012.2192433","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Transactions on Signal Processing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-92966","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008843672","display_name":"Le\u2010Nam Tran","orcid":"https://orcid.org/0000-0002-9317-9980"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]},{"id":"https://openalex.org/I98381234","display_name":"University of Oulu","ror":"https://ror.org/03yj89h83","country_code":"FI","type":"education","lineage":["https://openalex.org/I98381234"]}],"countries":["FI","SE"],"is_corresponding":true,"raw_author_name":"Le-Nam Tran","raw_affiliation_strings":["Centre for Wireless Communications and Department of Communications Engineering, University of Oulu, Oulu, Finland","Signal Processing Laboratory, ACCESS Linnaeus Centre, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Centre for Wireless Communications and Department of Communications Engineering, University of Oulu, Oulu, Finland","institution_ids":["https://openalex.org/I98381234"]},{"raw_affiliation_string":"Signal Processing Laboratory, ACCESS Linnaeus Centre, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011373389","display_name":"Mats Bengtsson","orcid":"https://orcid.org/0000-0002-3599-5584"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mats Bengtsson","raw_affiliation_strings":["Signal Processing Laboratory, ACCESS Linnaeus Center, KTH Royal Institute of Technology, Stockholm, Sweden","Signal Processing Laboratory, ACCESS Linnaeus Centre, KTH Royal Institute of Technology, Stockholm, Sweden"],"affiliations":[{"raw_affiliation_string":"Signal Processing Laboratory, ACCESS Linnaeus Center, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Signal Processing Laboratory, ACCESS Linnaeus Centre, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080037825","display_name":"Bj\u00f6rn Ottersten","orcid":"https://orcid.org/0000-0003-2298-6774"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]},{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["LU","SE"],"is_corresponding":false,"raw_author_name":"Bj\u00f6rn Ottersten","raw_affiliation_strings":["Signal Processing Laboratory, ACCESS Linnaeus Center, KTH Royal Institute of Technology, Stockholm, Sweden","Signal Processing Laboratory, ACCESS Linnaeus Centre, KTH Royal Institute of Technology, Stockholm, Sweden","Interdisciplinary Center for Security, Reliability and Trust (SnT), University of Luxembourg, Kirchberg, Luxembourg"],"affiliations":[{"raw_affiliation_string":"Signal Processing Laboratory, ACCESS Linnaeus Center, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Signal Processing Laboratory, ACCESS Linnaeus Centre, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Interdisciplinary Center for Security, Reliability and Trust (SnT), University of Luxembourg, Kirchberg, Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008843672"],"corresponding_institution_ids":["https://openalex.org/I86987016","https://openalex.org/I98381234"],"apc_list":null,"apc_paid":null,"fwci":5.6466,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.96400614,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"60","issue":"7","first_page":"3726","last_page":"3739"},"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9994000196456909,"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.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/algorithm","display_name":"Algorithm","score":0.5689730048179626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5544483065605164},{"id":"https://openalex.org/keywords/precoding","display_name":"Precoding","score":0.5413979291915894},{"id":"https://openalex.org/keywords/mimo","display_name":"MIMO","score":0.5372689962387085},{"id":"https://openalex.org/keywords/telecommunications-link","display_name":"Telecommunications link","score":0.5311079621315002},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5130085349082947},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.48733338713645935},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47817927598953247},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4629797339439392},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4405103921890259},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3989517390727997},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.3055289387702942}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5689730048179626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5544483065605164},{"id":"https://openalex.org/C160562895","wikidata":"https://www.wikidata.org/wiki/Q7239557","display_name":"Precoding","level":4,"score":0.5413979291915894},{"id":"https://openalex.org/C207987634","wikidata":"https://www.wikidata.org/wiki/Q176862","display_name":"MIMO","level":3,"score":0.5372689962387085},{"id":"https://openalex.org/C138660444","wikidata":"https://www.wikidata.org/wiki/Q5607897","display_name":"Telecommunications link","level":2,"score":0.5311079621315002},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5130085349082947},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.48733338713645935},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47817927598953247},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4629797339439392},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4405103921890259},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3989517390727997},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.3055289387702942},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tsp.2012.2192433","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp.2012.2192433","pdf_url":null,"source":{"id":"https://openalex.org/S168680287","display_name":"IEEE Transactions on Signal Processing","issn_l":"1053-587X","issn":["1053-587X","1941-0476"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Transactions on Signal Processing","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:kth-92966","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-92966","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article in journal"},{"id":"pmh:oai:orbilu.uni.lu:10993/7581","is_oa":false,"landing_page_url":"https://orbilu.uni.lu/handle/10993/7581","pdf_url":null,"source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Signal Processing, 60 (7), 3726-3739 (2012-07)","raw_type":"peer reviewed"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:kth-92966","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-92966","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article in journal"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1667950888","https://openalex.org/W1826298598","https://openalex.org/W1981745143","https://openalex.org/W1988567845","https://openalex.org/W2023877378","https://openalex.org/W2030546921","https://openalex.org/W2083962008","https://openalex.org/W2092892296","https://openalex.org/W2098126478","https://openalex.org/W2100662485","https://openalex.org/W2103749601","https://openalex.org/W2105854862","https://openalex.org/W2115788850","https://openalex.org/W2116579348","https://openalex.org/W2117238059","https://openalex.org/W2118176331","https://openalex.org/W2119456443","https://openalex.org/W2125977229","https://openalex.org/W2127401968","https://openalex.org/W2130509920","https://openalex.org/W2130510547","https://openalex.org/W2136093293","https://openalex.org/W2143927285","https://openalex.org/W2151795416","https://openalex.org/W2151925996","https://openalex.org/W2154789273","https://openalex.org/W2161410889","https://openalex.org/W2164497732","https://openalex.org/W2164536085","https://openalex.org/W2164664877","https://openalex.org/W2164974876","https://openalex.org/W2169693117","https://openalex.org/W2170310805","https://openalex.org/W2504767107","https://openalex.org/W2798909945","https://openalex.org/W4297970789","https://openalex.org/W6638542730","https://openalex.org/W6677129254"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W3141240674","https://openalex.org/W4328011863","https://openalex.org/W2979334915"],"abstract_inverted_index":{"The":[0,179,236],"block":[1],"diagonalization":[2],"(BD)":[3],"scheme":[4],"is":[5,83,94,106,202,216,265],"a":[6,62,71,108,156,162,245],"low-complexity":[7,157],"suboptimal":[8],"precoding":[9],"technique":[10],"for":[11],"multiuser":[12,23,124],"multiple":[13],"input-multiple":[14],"output":[15],"(MIMO)":[16],"downlink":[17],"channels,":[18],"which":[19,137,166,201],"completely":[20],"precancels":[21],"the":[22,26,33,55,68,85,102,123,128,149,167,183,189,192,197,205,208,221,226,232,241,285,288,297,300,305],"interference.":[24],"Accordingly,":[25],"precoder":[27,151],"of":[28,36,73,75,80,87,104,110,131,169,182,191,196,231,266,287,299,304],"each":[29,176],"user":[30,158],"lies":[31],"in":[32,165,284,296],"null":[34],"space":[35],"other":[37],"users'":[38],"channel":[39,199,259,307],"matrices.":[40,308],"In":[41],"this":[42,153,271],"paper,":[43],"we":[44,66,273],"propose":[45,275],"an":[46,134],"iterative":[47,150],"algorithm":[48,160,186,223,243],"using":[49,161],"QR":[50],"decompositions":[51],"(QRDs)":[52],"to":[53,58,70,97,121,143,204,218],"compute":[54],"precoders.":[56],"Specifically,":[57],"avoid":[59],"dealing":[60],"with":[61],"large":[63],"concatenated":[64],"matrix,":[65],"apply":[67],"QRD":[69],"sequence":[72],"matrices":[74],"lower":[76],"dimensions.":[77],"One":[78],"problem":[79],"BD":[81],"schemes":[82],"that":[84,89,220,240],"number":[86,103],"users":[88,105,111,132,171,256,264],"can":[90,224],"be":[91,113,119,144],"simultaneously":[92],"supported":[93],"limited":[95],"due":[96],"zero":[98],"interference":[99],"constraints.":[100],"When":[101,255],"large,":[107],"set":[109,130],"must":[112],"selected,":[114],"and":[115,210,252,291],"selection":[116,159,177,180],"algorithms":[117],"should":[118],"designed":[120],"exploit":[122],"diversity":[125],"gain.":[126],"Finding":[127],"optimal":[129,227],"requires":[133],"exhaustive":[135],"search,":[136],"has":[138],"too":[139],"high":[140],"computational":[141,253],"complexity":[142],"practically":[145],"useful.":[146],"Based":[147],"on":[148,188],"design,":[152],"paper":[154],"proposes":[155],"greedy":[163],"method,":[164],"precoders":[168],"selected":[170],"are":[172],"recursively":[173],"updated":[174],"after":[175],"step.":[178],"metric":[181],"proposed":[184,222,242],"scheduling":[185,278],"relies":[187],"product":[190,298],"squared":[193,301],"row":[194,302],"norms":[195,303],"effective":[198,306],"matrices,":[200],"related":[203],"eigenvalues":[206],"by":[207],"Hadamard":[209],"Schur":[211],"inequalities.":[212],"An":[213],"asymptotic":[214],"analysis":[215],"provided":[217],"show":[219,239],"achieve":[225],"sum":[228,249],"rate":[229,250],"scaling":[230],"MIMO":[233],"broadcast":[234],"channel.":[235],"numerical":[237],"results":[238],"achieves":[244],"good":[246],"trade-off":[247],"between":[248],"performance":[251],"complexity.":[254],"suffer":[257],"different":[258],"conditions,":[260],"providing":[261],"fairness":[262,283,295],"among":[263],"critical":[267],"importance.":[268],"To":[269],"address":[270],"problem,":[272],"also":[274],"two":[276],"fair":[277],"(FS)":[279],"algorithms,":[280],"one":[281],"imposing":[282,294],"approximation":[286],"data":[289],"rate,":[290],"another":[292],"directly":[293]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}