A Computationally Efficient Discrete Bit-Loading Algorithm for OFDM Systems Subject to Spectral-Compatibility Limits
This paper considers bit-loading algorithms to maximize throughput under total power and spectral mask constraints in interference-free OFDM systems. The contribution is twofold. First, we propose a simple criterion to switch between two well-known algorithms from the literature: the conventional Gr...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on communications Jg. 63; H. 6; S. 2261 - 2272 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
IEEE
01.06.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers |
| Schlagworte: | |
| ISSN: | 0090-6778, 1558-0857 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | This paper considers bit-loading algorithms to maximize throughput under total power and spectral mask constraints in interference-free OFDM systems. The contribution is twofold. First, we propose a simple criterion to switch between two well-known algorithms from the literature: the conventional Greedy and Greedy-based bit-removing (with maximum allowable bit loading initialization) algorithms. Second, we present a new low-complexity loading algorithm that exploits the bit vector obtained by rounding the water-filling algorithm solution to the associated continuous-input rate maximization problem as an efficient initial bit vector of the Greedy algorithm. We theoretically prove that this bit vector has two interesting properties. The first one states that it is an efficient bit vector, i.e., there is no movement of a bit from one subcarrier to another that reduces the total used power. The second one states that the optimized throughput, starting from this initial bit vector, is achieved by adding or removing bits on each subcarrier at most once. Simulation results show the efficiency of the proposed algorithm, i.e., the achievable throughput is maximized with significant reduction of computation cost as compared to many algorithms in the literature. |
|---|---|
| AbstractList | This paper considers bit-loading algorithms to maximize throughput under total power and spectral mask constraints in interference-free OFDM systems. The contribution is twofold. First, we propose a simple criterion to switch between two well-known algorithms from the literature: the conventional Greedy and Greedy-based bit-removing (with maximum allowable bit loading initialization) algorithms. Second, we present a new low-complexity loading algorithm that exploits the bit vector obtained by rounding the water-filling algorithm solution to the associated continuous-input rate maximization problem as an efficient initial bit vector of the Greedy algorithm. We theoretically prove that this bit vector has two interesting properties. The first one states that it is an efficient bit vector, i.e., there is no movement of a bit from one subcarrier to another that reduces the total used power. The second one states that the optimized throughput, starting from this initial bit vector, is achieved by adding or removing bits on each subcarrier at most once. Simulation results show the efficiency of the proposed algorithm, i.e., the achievable throughput is maximized with significant reduction of computation cost as compared to many algorithms in the literature. This paper considers bit-loading algorithms to maximize throughput under total power and spectral mask constraints in interference-free OFDM systems. The contribution is twofold. First, we propose a simple criterion to switch between two wellknown algorithms from the literature: the conventional Greedy and Greedy-based bit-removing (with maximum allowable bit loading initialization) algorithms. Second, we present a new lowcomplexity loading algorithm that exploits the bit vector obtained by rounding the water-filling algorithm solution to the associated continuous-input rate maximization problem as an efficient initial bit vector of the Greedy algorithm.We theoretically prove that this bit vector has two interesting properties. The first one states that it is an efficient bit vector, i.e., there is no movement of a bit from one subcarrier to another that reduces the total used power. The second one states that the optimized throughput, starting from this initial bit vector, is achieved by adding or removing bits on each subcarrier at most once. Simulation results show the efficiency of the proposed algorithm, i.e., the achievable throughput is maximized with significant reduction of computation cost as compared to many algorithms in the literature. |
| Author | Thanh Nhan Vo Amis, Karine Chonavel, Thierry Siohan, Pierre |
| Author_xml | – sequence: 1 surname: Thanh Nhan Vo fullname: Thanh Nhan Vo email: thanh.vo@telecom-bretagne.eu organization: Lab.-STICC, Telecom Bretagne, Brest, France – sequence: 2 givenname: Karine surname: Amis fullname: Amis, Karine email: karine.amis@telecom-bretagne.eu organization: Lab.-STICC, Telecom Bretagne, Brest, France – sequence: 3 givenname: Thierry surname: Chonavel fullname: Chonavel, Thierry email: thierry.chonavel@telecom-bretagne.eu organization: Lab.-STICC, Telecom Bretagne, Brest, France – sequence: 4 givenname: Pierre surname: Siohan fullname: Siohan, Pierre email: pierre.siohan@orange.com organization: Orange Labs., Rennes, France |
| BackLink | https://hal.science/hal-01197396$$DView record in HAL |
| BookMark | eNp9kTtv2zAURokiBeqk_QPpQqBLO8glKfE1us4TkOHByUxQMpXQoESXpAr434eKggwZOpG4ON8l7z3n4GzwgwHgEqMlxkj-flhvN5slQZguSUUqIdEnsMCUigIJys_AAiGJCsa5-ALOYzwghCpUlguQVnDt--OYdLJ-0M6d4HXX2daaIcErG9tgkoF_bCpqr_d2eIIr9-SDTc897HyA25urDdydYjJ9hLuxOZg2weTh7pgvQbti6p57N9bZdIK17W2KX8HnTrtovr2dF-Dx5vphfVfU29v79aou2gqxVFRMVJowzoQWpmWtKTmZaszsdYkQyxPsqW4ErQgjuJOibFhDNUMdaRA2uLwAv-a-z9qpY7C9DifltVV3q1pNNYSx5KVk_yb258weg_87mphUn6c3zunB-DEqzGVJuKSUZfTHB_Tgx5CXlykmJJFScpopMlNt8DEG073_ACM1SVOv0tQkTb1JyyHxIdTaWU1epnX_j36fo9YY8_4Wz96lqMoXAAWlaQ |
| CODEN | IECMBT |
| CitedBy_id | crossref_primary_10_1049_iet_com_2019_0916 crossref_primary_10_1109_TWC_2021_3070363 crossref_primary_10_1109_JIOT_2020_2990538 crossref_primary_10_1049_cmu2_12256 crossref_primary_10_1109_ACCESS_2019_2963571 crossref_primary_10_1016_j_optcom_2025_131700 crossref_primary_10_1109_LCOMM_2016_2521358 crossref_primary_10_1109_ACCESS_2019_2962266 crossref_primary_10_3390_s24237644 crossref_primary_10_1109_TVT_2019_2914003 |
| Cites_doi | 10.1109/GLOCOM.1996.594454 10.1109/4234.831031 10.1109/26.380108 10.1016/j.sigpro.2003.12.004 10.1109/26.469440 10.1155/2008/643081 10.1109/26.20079 10.1109/ISIT.1998.708791 10.1109/TCOMM.2014.031614.130660 10.1109/ICC.2001.936857 10.1109/ICC.1999.765384 10.1109/78.995090 10.1109/TPWRD.2012.2196714 10.1109/26.818869 10.1109/GLOCOM.1997.644387 10.1109/ISPLC.2012.6201292 10.1109/VETECS.2000.851292 10.1007/BF01934364 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2015 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2015 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | 97E RIA RIE AAYXX CITATION 7SP 8FD L7M F28 FR3 1XC VOOES |
| DOI | 10.1109/TCOMM.2015.2424890 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET Electronic Library CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Engineering Research Database Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) |
| DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Engineering Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-0857 |
| EndPage | 2272 |
| ExternalDocumentID | oai:HAL:hal-01197396v1 3717016011 10_1109_TCOMM_2015_2424890 7090984 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACIWK ACKIV ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IES IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 ZCA ZCG AAYXX CITATION 7SP 8FD L7M RIG F28 FR3 1XC VOOES |
| ID | FETCH-LOGICAL-c406t-4684a26768a8ec6ce37246846eda3006403d5ab8542621f983b6b5a60f2b01e13 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 13 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000356299500026&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0090-6778 |
| IngestDate | Sat Nov 29 15:04:48 EST 2025 Mon Sep 29 05:52:58 EDT 2025 Mon Jun 30 10:17:28 EDT 2025 Sat Nov 29 01:41:35 EST 2025 Tue Nov 18 21:42:11 EST 2025 Wed Aug 27 02:49:10 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Keywords | Greedy algorithm Bit-loading rate-adaptive OFDM low-complexity algorithm |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c406t-4684a26768a8ec6ce37246846eda3006403d5ab8542621f983b6b5a60f2b01e13 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ORCID | 0000-0003-3406-0426 0000-0002-3130-7772 |
| OpenAccessLink | https://hal.science/hal-01197396 |
| PQID | 1689299975 |
| PQPubID | 85472 |
| PageCount | 12 |
| ParticipantIDs | proquest_miscellaneous_1793279556 crossref_primary_10_1109_TCOMM_2015_2424890 crossref_citationtrail_10_1109_TCOMM_2015_2424890 hal_primary_oai_HAL_hal_01197396v1 proquest_journals_1689299975 ieee_primary_7090984 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-June 2015-6-00 20150601 2015-06 |
| PublicationDateYYYYMMDD | 2015-06-01 |
| PublicationDate_xml | – month: 06 year: 2015 text: 2015-June |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on communications |
| PublicationTitleAbbrev | TCOMM |
| PublicationYear | 2015 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) – name: Institute of Electrical and Electronics Engineers |
| References | ref13 ref12 ghosh (ref2) 2010 ref15 ref11 ref10 (ref5) 0 ref17 ref16 starr (ref18) 1999 (ref4) 2010 ref24 bingham (ref19) 2002 ref23 ref26 ref25 ref20 ref22 ref21 (ref6) 0 ref27 ref8 ref7 prasad (ref1) 2004 ref9 hanzo (ref3) 2000 fischer (ref14) 1996 |
| References_xml | – start-page: 724 year: 1996 ident: ref14 article-title: A new loading algorithm for discrete multi-tone transmission publication-title: Proc IEEE Globecom – ident: ref13 doi: 10.1109/GLOCOM.1996.594454 – ident: ref10 doi: 10.1109/4234.831031 – year: 2004 ident: ref1 publication-title: OFDM for Wireless Communication – ident: ref12 doi: 10.1109/26.380108 – ident: ref15 doi: 10.1016/j.sigpro.2003.12.004 – ident: ref27 doi: 10.1109/26.469440 – year: 2002 ident: ref19 publication-title: ADSL VDSL and Multicarrier Modulation – ident: ref11 doi: 10.1155/2008/643081 – ident: ref22 doi: 10.1109/26.20079 – year: 2010 ident: ref4 – year: 2010 ident: ref2 publication-title: Fundamentals of LTE – ident: ref23 doi: 10.1109/ISIT.1998.708791 – ident: ref17 doi: 10.1109/TCOMM.2014.031614.130660 – ident: ref21 doi: 10.1109/ICC.2001.936857 – year: 2000 ident: ref3 publication-title: Single and Multi-Carrier Quadrature Amplitude Modulation-Principles and Application for Personal Communications WLANs and Broadcasting – year: 1999 ident: ref18 publication-title: Understanding Digital Subscriber Line Technology – year: 0 ident: ref5 – ident: ref8 doi: 10.1109/ICC.1999.765384 – ident: ref16 doi: 10.1109/78.995090 – ident: ref25 doi: 10.1109/TPWRD.2012.2196714 – ident: ref9 doi: 10.1109/26.818869 – ident: ref7 doi: 10.1109/GLOCOM.1997.644387 – ident: ref26 doi: 10.1109/ISPLC.2012.6201292 – ident: ref20 doi: 10.1109/VETECS.2000.851292 – start-page: 311 year: 0 ident: ref6 article-title: Multi-channel modulation – ident: ref24 doi: 10.1007/BF01934364 |
| SSID | ssj0004033 |
| Score | 2.2407596 |
| Snippet | This paper considers bit-loading algorithms to maximize throughput under total power and spectral mask constraints in interference-free OFDM systems. The... |
| SourceID | hal proquest crossref ieee |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 2261 |
| SubjectTerms | Algorithm design and analysis Algorithms Bit-loading Complexity theory Computational efficiency Engineering Sciences Greedy Algorithm Greedy algorithms Heuristic Loading Low-complexity algorithm Mathematical analysis Maximization OFDM Orthogonal Frequency Division Multiplexing Rate adaptive Signal and Image processing Spectra Subcarriers Switches Throughput Vectors (mathematics) |
| Title | A Computationally Efficient Discrete Bit-Loading Algorithm for OFDM Systems Subject to Spectral-Compatibility Limits |
| URI | https://ieeexplore.ieee.org/document/7090984 https://www.proquest.com/docview/1689299975 https://www.proquest.com/docview/1793279556 https://hal.science/hal-01197396 |
| Volume | 63 |
| WOSCitedRecordID | wos000356299500026&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-0857 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004033 issn: 0090-6778 databaseCode: RIE dateStart: 19720101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fb9MwED6tEw_wwICByDYmg3iDbLYT_3os26o9tBsPA-0tchx3q1Qa1KaT9t_P56RhEmgSb5FzsaycfT6fv_sO4LMXZXCiBU290BIPKC4tTVWlPJOZcoxbG1G-P8fq4kJfX5vvW_C1z4Xx3kfwmT_Cx3iXX9VujaGyY0UNNTofwEAp1eZq_cmBpFnHOIlwdqU3CTLUHF-dXE4miOISR5gModH-PtqEBrcIgYy1Vf4yyHGXGe383_hewcvOmyTDVv2vYcsv3sCLRxyDu9AMSVu5oYv6ze_JWaSNCF2R01mwGsFtJt9mTTquI56eDOc39XLW3P4iwaEll6PTCel4zUkwMxi3IU1NsHA9RknSaFGaFmR7T2LC1Oot_BidXZ2cp12phdSFHb1Jc6lzy2U4e1jtnXQ-UxzbpK9sFm_7skrYUgsksGdTo7NSlsJKOuUlZZ5l72B7US_8eyAV5SW3lROOmZxOtWVTaStunMhteFUmwDb_vnAdDzmWw5gX8TxCTRH1VaC-ik5fCXzpv_ndsnA8Kf0pqLQXRALt8-G4wLZYZi0z8o4lsIsK7KU63SVwsJkBRbeaVwWTOniRxiiRwMf-dViHeLliF75eB5lg6LgyQsi9f_e8D89xkC3M7AC2m-Xaf4Bn7q6ZrZaHcTI_AJos8BM |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fb9MwED5tAwl44NdACwwwiDfIZjuxYz-WbVURacdDQXuLHMdllboGtemk_ff4nDRMAiHxFjkXy8rZ5_P5u-8A3jtReida0NgJJfGAYuNSV1XME5lklnFjAsr3e55NJuriQn_dgY99LoxzLoDP3BE-hrv8qrYbDJUdZ1RTrdJduCPSlLM2W-t3FiRNOs5JBLRnapsiQ_Xx9OR8PEYclzjCdAiFFvjWNrR7iSDIUF3lD5Mc9pnho_8b4WN42PmTZNBOgCew45ZP4cEtlsF9aAakrd3Qxf0WN-QsEEf4rsjp3NsN7ziTT_MmzuuAqCeDxY96NW8ur4h3acn58HRMOmZz4g0NRm5IUxMsXY9xkjjYlKaF2d6QkDK1fgbfhmfTk1HcFVuIrd_TmziVKjVc-tOHUc5K65KMY5t0lUnCfV9SCVMqgRT2bKZVUspSGElnvKTMseQ57C3rpTsAUlFeclNZYZlO6UwZNpOm4tqK1PhXZQRs--8L2zGRY0GMRRFOJFQXQV8F6qvo9BXBh_6bny0Pxz-l33mV9oJIoT0a5AW2hUJriZbXLIJ9VGAv1ekugsPtDCi69bwumFTej9Q6ExG87V_7lYjXK2bp6o2X8aaOZ1oI-eLvPb-Be6PpOC_yz5MvL-E-DrgFnR3CXrPauFdw11438_XqdZjYvwA5tPNa |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Computationally+Efficient+Discrete+Bit-Loading+Algorithm+for+OFDM+Systems+Subject+to+Spectral-Compatibility+Limits&rft.jtitle=IEEE+transactions+on+communications&rft.au=Thanh+Nhan+Vo&rft.au=Amis%2C+Karine&rft.au=Chonavel%2C+Thierry&rft.au=Siohan%2C+Pierre&rft.date=2015-06-01&rft.pub=IEEE&rft.issn=0090-6778&rft.volume=63&rft.issue=6&rft.spage=2261&rft.epage=2272&rft_id=info:doi/10.1109%2FTCOMM.2015.2424890&rft.externalDocID=7090984 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0090-6778&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0090-6778&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0090-6778&client=summon |