{"id":"https://openalex.org/W2106920422","doi":"https://doi.org/10.1109/tcomm.2010.06.0800482","title":"An efficient algorithm for optimal discrete bit-loading in multicarrier systems","display_name":"An efficient algorithm for optimal discrete bit-loading in multicarrier systems","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2106920422","doi":"https://doi.org/10.1109/tcomm.2010.06.0800482","mag":"2106920422"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2010.06.0800482","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2010.06.0800482","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications","raw_type":"journal-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/A5055476089","display_name":"Asad Mahmood","orcid":"https://orcid.org/0000-0001-8978-3336"},"institutions":[{"id":"https://openalex.org/I201181511","display_name":"\u00c9cole Nationale Sup\u00e9rieure de Techniques Avanc\u00e9es","ror":"https://ror.org/0309cs235","country_code":"FR","type":"education","lineage":["https://openalex.org/I201181511","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4405258625","display_name":"\u00c9cole Nationale Sup\u00e9rieure de Techniques Avanc\u00e9es Paris","ror":"https://ror.org/0106ccb15","country_code":"FR","type":"education","lineage":["https://openalex.org/I201181511","https://openalex.org/I4210145102","https://openalex.org/I4405258625"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Asad Mahmood","raw_affiliation_strings":["ENSTA, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ENSTA, Paris, France","institution_ids":["https://openalex.org/I201181511","https://openalex.org/I4405258625"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113613594","display_name":"J.-C. Belfiore","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Belfiore","raw_affiliation_strings":["ENST, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ENST, Paris, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5885,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.73385959,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"58","issue":"6","first_page":"1627","last_page":"1630"},"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.9998999834060669,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9998000264167786,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7037435173988342},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6162229180335999},{"id":"https://openalex.org/keywords/bit","display_name":"Bit (key)","score":0.6020117998123169},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5833306312561035},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.525050163269043},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3602006435394287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24537432193756104}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7037435173988342},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6162229180335999},{"id":"https://openalex.org/C117011727","wikidata":"https://www.wikidata.org/wiki/Q1278488","display_name":"Bit (key)","level":2,"score":0.6020117998123169},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5833306312561035},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.525050163269043},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3602006435394287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24537432193756104},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcomm.2010.06.0800482","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2010.06.0800482","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W22664669","https://openalex.org/W1508899218","https://openalex.org/W1970376525","https://openalex.org/W1989008275","https://openalex.org/W2032094184","https://openalex.org/W2097187865","https://openalex.org/W2099259212","https://openalex.org/W2099660711","https://openalex.org/W2103664294","https://openalex.org/W2121379024","https://openalex.org/W2130019790","https://openalex.org/W2142901448","https://openalex.org/W2144461446","https://openalex.org/W2150297068","https://openalex.org/W2154536867","https://openalex.org/W2161765632","https://openalex.org/W2946046356","https://openalex.org/W3145128584","https://openalex.org/W4285719527"],"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/W1531601525","https://openalex.org/W2189341500","https://openalex.org/W2389640906","https://openalex.org/W4312077400","https://openalex.org/W2979334915"],"abstract_inverted_index":{"An":[0,22],"efficient":[1],"algorithm":[2,62],"for":[3],"bit-loading":[4,51],"in":[5,26,66],"multicarrier":[6],"systems":[7],"is":[8,38],"proposed":[9,49],"based":[10],"upon":[11],"an":[12],"allocation":[13],"rhythm/order":[14],"underlying":[15],"the":[16,29,41,56],"classical":[17,42],"optimal":[18,50],"greedy":[19],"bit-allocation":[20],"procedure.":[21],"accurate":[23],"complexity":[24,58],"comparison":[25],"terms":[27],"of":[28,32,60],"exact":[30],"number":[31],"execution":[33],"cycles":[34],"over":[35],"a":[36],"processor":[37],"made":[39],"with":[40,46,63],"Greedy":[43],"solution":[44],"along":[45],"another":[47],"recently":[48],"algorithm.":[52],"Simulation":[53],"results":[54],"verify":[55],"significant":[57],"advantage":[59],"our":[61],"no":[64],"loss":[65],"performance.":[67]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}