Discrete bit-loading for OFDM systems under BER-constraint and imperfect CSI

In this paper, a low complexity discrete bit loading is proposed for OFDM systems over a fading channel and imperfect channel state information (CSI). The available CSI at the transmitter can be partially known due to imperfection in channel estimation, interferences or the Doppler spread. These imp...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International journal of electronics letters Ročník 10; číslo 3; s. 283 - 295
Hlavní autori: Ait Saadi, Hocine, Dahmani, Samir, Maamoun, Mountassar
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Abingdon Taylor & Francis 03.07.2022
Taylor & Francis Ltd
Predmet:
Algorithms
Bit error rate
bit-loading
Complexity
constellation
CSI
Defects
fading channel
Iterative methods
OFDM
Subcarriers
ISSN:2168-1724, 2168-1732
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In this paper, a low complexity discrete bit loading is proposed for OFDM systems over a fading channel and imperfect channel state information (CSI). The available CSI at the transmitter can be partially known due to imperfection in channel estimation, interferences or the Doppler spread. These imperfections increase the bit error rate (BER) for each subchannel. Uniform power allocation and finite granularity for constellation size are used to maximise spectral efficiency subject to a target average BER. The proposed bit loading algorithm, starts by loading all the subcarriers with an initial bit vector obtained using the available CSI and under constraint of the target BER and the maximum number of bits allowed. Then, we introduce the errors on the CSI in the new formula of the average BER calculated initially by using all the subcarriers indexes of the initial bit vector. Iteratively, only the subcarriers, which violate the constraint on the average BER, are used for the updating; they are unloaded until reaching the final bit vector. Therefore, the set of concerned sub-carriers decreases after each iteration, this results in a significant reduction in the computational complexity.
AbstractList In this paper, a low complexity discrete bit loading is proposed for OFDM systems over a fading channel and imperfect channel state information (CSI). The available CSI at the transmitter can be partially known due to imperfection in channel estimation, interferences or the Doppler spread. These imperfections increase the bit error rate (BER) for each subchannel. Uniform power allocation and finite granularity for constellation size are used to maximise spectral efficiency subject to a target average BER. The proposed bit loading algorithm, starts by loading all the subcarriers with an initial bit vector obtained using the available CSI and under constraint of the target BER and the maximum number of bits allowed. Then, we introduce the errors on the CSI in the new formula of the average BER calculated initially by using all the subcarriers indexes of the initial bit vector. Iteratively, only the subcarriers, which violate the constraint on the average BER, are used for the updating; they are unloaded until reaching the final bit vector. Therefore, the set of concerned sub-carriers decreases after each iteration, this results in a significant reduction in the computational complexity.
Author Ait Saadi, Hocine
Maamoun, Mountassar
Dahmani, Samir
Author_xml – sequence: 1
  givenname: Hocine
  orcidid: 0000-0001-6954-0847
  surname: Ait Saadi
  fullname: Ait Saadi, Hocine
  email: hocine.aitsaadi@gmail.com
  organization: University BLIDA1
– sequence: 2
  givenname: Samir
  orcidid: 0000-0001-6683-2692
  surname: Dahmani
  fullname: Dahmani, Samir
  organization: University BLIDA1
– sequence: 3
  givenname: Mountassar
  orcidid: 0000-0003-1598-4500
  surname: Maamoun
  fullname: Maamoun, Mountassar
  organization: University BLIDA1
BookMark eNp9kE9LAzEQxYNUsNZ-BCHgeWuS3U2yN7W2WqgU_HMO2WRWtmyTmqRIv71bWj06lxmG994wv0s0cN4BQteUTCiR5JZRLqlgxYQRRie0IpJTcoaGh31GRc4GfzMrLtA4xjXpS3LOKjFEy8c2mgAJcN2mrPPatu4TNz7g1fzxBcd9TLCJeOcsBPwwe82MdzEF3bqEtbO43WwhNGASnr4trtB5o7sI41MfoY_57H36nC1XT4vp_TIzjNCUaUtyaXIgeSPLMjecVyUAsEJI2zAjSk3AWi4lh6rmBallKWQvBylq23-Yj9DNMXcb_NcOYlJrvwuuP6mYIKQQrKrKXlUeVSb4GAM0ahvajQ57RYk6sFO_7NSBnTqx6313R1_reg4b_e1DZ1XS-86HJmhn2qjy_yN-ACpEdVQ
Cites_doi 10.1109/18.641562
10.1109/TCOMM.2005.847141
10.1109/LCOMM.2016.2521358
10.1109/26.634685
10.1007/b117713
10.1109/WCL.2013.052813.130085
10.1109/TWC.2006.05004
10.1109/LCOMM.2013.031313.122583
10.1109/RWS.2012.6175359
10.1109/26.950343
10.1109/TWC.2005.850313
10.1109/VTCSpring.2018.8417547
10.1109/26.380108
10.1109/TWC.2012.072512.120171
ContentType Journal Article
Copyright 2021 Informa UK Limited, trading as Taylor & Francis Group 2021
2021 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2021 Informa UK Limited, trading as Taylor & Francis Group 2021
– notice: 2021 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SP
8FD
L7M
DOI 10.1080/21681724.2021.1908610
DatabaseName CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList
Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2168-1732
EndPage 295
ExternalDocumentID 10_1080_21681724_2021_1908610
1908610
Genre Research Article
GroupedDBID 0BK
0R~
30N
4.4
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABLIJ
ABPAQ
ABXUL
ABXYU
ACGFS
ADCVX
ADGTB
ADMLS
AEISY
AEOZL
AEPSL
AEYOC
AFRVT
AGDLA
AHDZW
AIJEM
AIYEW
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQTUD
ARCSS
BLEHA
CCCUG
DGEBU
EBS
EUPTU
GTTXZ
H13
HZ~
IPNFZ
KYCEM
LJTGL
M4Z
O9-
RIG
RNANH
ROSJB
RTWRZ
SNACF
SOJIQ
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TTHFI
TUROJ
ZGOLN
AAYXX
CITATION
7SP
8FD
ADYSH
L7M
ID FETCH-LOGICAL-c201t-ad038c3e03f8553c6695eee2478df2c75a0edd6886e9b640b85783e0e87bd1903
IEDL.DBID TFW
ISSN 2168-1724
IngestDate Fri Jul 25 04:58:11 EDT 2025
Sat Nov 29 06:39:42 EST 2025
Mon Oct 20 23:47:07 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c201t-ad038c3e03f8553c6695eee2478df2c75a0edd6886e9b640b85783e0e87bd1903
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-1598-4500
0000-0001-6954-0847
0000-0001-6683-2692
PQID 2700472995
PQPubID 2031296
PageCount 13
ParticipantIDs proquest_journals_2700472995
crossref_primary_10_1080_21681724_2021_1908610
informaworld_taylorfrancis_310_1080_21681724_2021_1908610
PublicationCentury 2000
PublicationDate 07/03/2022
PublicationDateYYYYMMDD 2022-07-03
PublicationDate_xml – month: 07
  year: 2022
  text: 07/03/2022
  day: 03
PublicationDecade 2020
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle International journal of electronics letters
PublicationYear 2022
Publisher Taylor & Francis
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
References cit0011
cit0001
cit0010
Brent R. (cit0004) 1973
Qiu X. (cit0012) 1999; 47
cit0008
cit0009
cit0006
cit0017
cit0007
cit0015
cit0005
cit0016
cit0002
cit0013
cit0003
cit0014
References_xml – ident: cit0008
  doi: 10.1109/18.641562
– ident: cit0011
  doi: 10.1109/TCOMM.2005.847141
– ident: cit0013
  doi: 10.1109/LCOMM.2016.2521358
– ident: cit0007
  doi: 10.1109/26.634685
– ident: cit0010
  doi: 10.1007/b117713
– ident: cit0002
  doi: 10.1109/WCL.2013.052813.130085
– volume-title: Algorithms for minimization without derivatives
  year: 1973
  ident: cit0004
– ident: cit0016
  doi: 10.1109/TWC.2006.05004
– ident: cit0014
  doi: 10.1109/LCOMM.2013.031313.122583
– ident: cit0003
  doi: 10.1109/RWS.2012.6175359
– ident: cit0001
– ident: cit0006
  doi: 10.1109/26.950343
– volume: 47
  start-page: 1218
  issue: 6
  year: 1999
  ident: cit0012
  publication-title: IEEE Transactions on Communications
– ident: cit0015
  doi: 10.1109/TWC.2005.850313
– ident: cit0009
  doi: 10.1109/VTCSpring.2018.8417547
– ident: cit0005
  doi: 10.1109/26.380108
– ident: cit0017
  doi: 10.1109/TWC.2012.072512.120171
SSID ssj0000866297
Score 2.1865454
Snippet In this paper, a low complexity discrete bit loading is proposed for OFDM systems over a fading channel and imperfect channel state information (CSI). The...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Index Database
Publisher
StartPage 283
SubjectTerms Algorithms
Bit error rate
bit-loading
Complexity
constellation
CSI
Defects
fading channel
Iterative methods
OFDM
Subcarriers
Title Discrete bit-loading for OFDM systems under BER-constraint and imperfect CSI
URI https://www.tandfonline.com/doi/abs/10.1080/21681724.2021.1908610
https://www.proquest.com/docview/2700472995
Volume 10
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Online Journals
  customDbUrl:
  eissn: 2168-1732
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000866297
  issn: 2168-1724
  databaseCode: TFW
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NS8MwFA8yPOjBb3E6JQevnf1Kmh51W1GYU3TqbqFJEyjIJm317_clbWVDxIMeS_tC-l5e3i8v7wOhcy8NCfM84RAdRHBAiVJHhLECxSOSkEC51Eb5Po-jyYTNZvF9E01YNmGV5gyt60IRdq82yp2Kso2Iu_A9ysDuGo-I7_XBojFqk6wA2Zs1Pk1evrws8Ir6tsOKIXIMVZvG89NAKwZqpXzpt-3a2qBk-x9mv4O2GgCKL-sVs4vW1HwPbS6VJdxH42EOmwmgaSzyynld2DB7DDPEd8nwFtfFn0ts0s8KfDV6cKQBmabXRIVhWjgHKF6YMBE8eLw5QE_JaDq4dpquC44EMFA5aeYGTIKUAs1AWpLSmCil_DBimfZlRFJXZRlljKpY0NAVDJQePlcsEhn8TnCIOvPFXB0hLFKwj6kOBOCCkIYanqUnGIBMqv0o1l3Ub1nN3-riGtxrapa2bOKGTbxhUxfFywLhlfVq6LoFCQ9-oe210uONnpbcXLuHcL6IyfEfhj5BG77JijBe36CHOlXxrk7Ruvyo8rI4syvyE3Jw2cE
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDI7QQAIOvBGDATlw7VgfSdMj7KFNdEOCAbtFTZtIldCGtsLvx-4DbUKIAxyr1lFqx_EXxw9CruzIY8K2lcWM68MBxY8s5QUaFI_FjLm6xfMo3-fQH43EZBIs58JgWCWeoU1RKCLfq1G50RldhcRdOzYXYHjRJeLYTTBpgmOW1ToDW4thfePey5efBd5xJ--xglQWklWJPD-NtGKiVgqYftuwcyvU2_2P-e-RnRKD0pti0eyTNT09INtLlQkPSdhJYT8BQE1VmlmvszzSnsIU6X2vM6RF_ecFxQy0Ob3tPlgx4kxsN5FRmBdNAY3PMVKEth8HR-Sp1x23-1bZeMGKAQ9kVpS0XBGDoFwjQGAx5wHTWjueLxLjxD6LWjpJuBBcB4p7LSVA7-FzLXyVwO-4x6Q2nU31CaEqAhMZGVcBNPC4Z-A5tpUAnMmN4wemTpoVr-VbUV9D2mXZ0opNEtkkSzbVSbAsEZnljg1TdCGR7i-0jUp8slTVhcSbdw-OGAE7_cPQl2SzPx6GMhyM7s7IloNJEugEdhukls3f9TnZiD-ydDG_yJfnJ0AL3eI
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDI7QQAgOvBGDATlw7VgfSdMjbFRMjDHBgN2iJk2kSmib2sLvx-kDbUKIAxyrNlVqx_EX1_6M0IUdeYTZtrCIdn04oPiRJbxAgeERSYirOrTI8n0Z-MMhm0yCUZVNmFVpleYMrUuiiGKvNsY9j3WdEXfp2JSB3zUREcdug0dj1BRZrRbkWLCkx-HrV5gF7lGnaLFiRllmWF3H89ObljzUEn_pt_26cELh9j9MfwdtVQgUX5VLZhetqOke2lzgJdxHg14CuwnAaSyS3HqbFXn2GGaIH8LePS7ZnzNs6s9SfH3zaEmDMk2ziRzDtHACWDw1eSK4-9Q_QM_hzbh7a1VtFywJaCC3orjjMglqcjUDdUlKA6KUcjyfxdqRPok6Ko4pY1QFgnodwcDq4XHFfBHD57iHqDGdTdURwiICBxlpVwAw8Kin4VraggHKpNrxA91E7VrUfF6ya3C7Ii2txcSNmHglpiYKFhXC8yKsocseJNz9ZWyr1h6vDDXj5r-7BweMgBz_4dXnaH3UC_mgP7w7QRuOqZAwEWC3hRp5-q5O0Zr8yJMsPSsW5yeOktyG
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=Discrete+bit-loading+for+OFDM+systems+under+BER-constraint+and+imperfect+CSI&rft.jtitle=International+journal+of+electronics+letters&rft.au=Ait+Saadi%2C+Hocine&rft.au=Dahmani%2C+Samir&rft.au=Maamoun%2C+Mountassar&rft.date=2022-07-03&rft.issn=2168-1724&rft.eissn=2168-1732&rft.volume=10&rft.issue=3&rft.spage=283&rft.epage=295&rft_id=info:doi/10.1080%2F21681724.2021.1908610&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_21681724_2021_1908610
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2168-1724&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2168-1724&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2168-1724&client=summon