A Discrete Bit Loading Algorithm for FBMC/OQAM

In this letter the discrete rate maximization problem is investigated for FBMC/OQAM. The analysis reveals that if there is crosstalk certain bit allocations violate the power constraints. Aiming at ensuring the feasibility along with alleviating the complexity we have devised a novel iterative algor...

Full description

Saved in:
Bibliographic Details
Published in:IEEE signal processing letters Vol. 19; no. 6; pp. 324 - 327
Main Authors: Caus, M., Perez-Neira, A. I., Garcia-Armada, A.
Format: Journal Article Publication
Language:English
Published: New York IEEE 01.06.2012
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Allocations
Channels
Complexity theory
Computer simulation
Crosstalk
Discrete rate maximization
Enginyeria de la telecomunicació
FBMC/OQAM
Feasibility
Fiber optics
Fibres òptiques
Frequency modulation
Interference
Maximization
OFDM
Optical communications
Radiocomunicació i exploració electromagnètica
Radiodifusió per ràdio
Signal processing algorithms
Signal to noise ratio
Upper bounds
Vectors
Xarxes de comunicacion
Àrees temàtiques de la UPC
ISSN:1070-9908, 1558-2361
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In this letter the discrete rate maximization problem is investigated for FBMC/OQAM. The analysis reveals that if there is crosstalk certain bit allocations violate the power constraints. Aiming at ensuring the feasibility along with alleviating the complexity we have devised a novel iterative algorithm, which always converges. Simulation-based results show that the proposed algorithm performs close to the upper bound for high-coherence bandwidth channels. Under highly frequency selective channels the existing algorithms are not able to guarantee the target SER whereas our approach guarantees the QoS.
AbstractList In this letter the discrete rate maximization problem is investigated for FBMC/OQAM. The analysis reveals that if there is crosstalk certain bit allocations violate the power constraints. Aiming at ensuring the feasibility along with alleviating the complexity we have devised a novel iterative algorithm, which always converges. Simulation-based results show that the proposed algorithm performs close to the upper bound for high-coherence bandwidth channels. Under highly frequency selective channels the existing algorithms are not able to guarantee the target SER whereas our approach guarantees the QoS.
In this letter the discrete rate maximization problem is investigated for FBMC/OQAM. The analysis reveals that if there is crosstalk certain bit allocations violate the power constraints. Aiming at ensuring the feasibility along with alleviating the complexity we have devised a novel iterative algorithm, which always converges. Simulation-based results show that the proposed algorithm performs close to the upper bound for high-coherence bandwidth channels. Under highly frequency selective channels the existing algorithms are not able to guarantee the target SER whereas our approach guarantees the QoS. Peer Reviewed
Author Garcia-Armada, A.
Perez-Neira, A. I.
Caus, M.
Author_xml – sequence: 1
  givenname: M.
  surname: Caus
  fullname: Caus, M.
  email: marius.caus@upc.edu
  organization: Dept. of Signal Theor. & Commun., Univ. Politec. de Catalunya (UPC), Barcelona, Spain
– sequence: 2
  givenname: A. I.
  surname: Perez-Neira
  fullname: Perez-Neira, A. I.
  email: ana.isabel.perez@upc.edu
  organization: Dept. of Signal Theor. & Commun., Univ. Politec. de Catalunya (UPC), Barcelona, Spain
– sequence: 3
  givenname: A.
  surname: Garcia-Armada
  fullname: Garcia-Armada, A.
  email: agarcia@tsc.uc3m.es
  organization: Dept. of Signal Theor. & Commun., Univ. Carlos III of Madrid, Leganés, Spain
BookMark eNp9kEFrGzEQhUVJoUmae6CXhVxyWXsk7Wqlo-PWScDGLU3OYqzVJjLrVSLJh_77arFpwIceZkYD75vRvAtyNvjBEnJNYUIpqOny988JA8omjCpWMfWJnNO6liXjgp7lNzRQKgXyC7mIcQsAksr6nExmxXcXTbDJFncuFUuPrRteiln_4oNLr7ui86FY3K3m0_Wv2eor-dxhH-3VsV6S58WPp_lDuVzfP85ny9JUIFOpBLSyVlC12HZis-mEMGiqtuMMWceRI1UtCmwUM6ppOmn5xiJKnlPVGuCXhB7mmrg3Olhjg8GkPbqPZgwGDcupkk2dmdsD8xb8-97GpHf5Mtv3OFi_j5oCY9kARZssvTmRbv0-DPmirAJWjzEOhOMngo8x2E6_BbfD8CeL9Gi6zqbr0XR9ND0j4gQxLmFyfkgBXf8_8NsBdNbaf3sEbQQDzv8CbgqNkw
CODEN ISPLEM
CitedBy_id crossref_primary_10_1007_s11276_023_03388_4
crossref_primary_10_1002_ett_3541
Cites_doi 10.1109/78.995073
10.1109/ICC.1999.765384
10.1109/4234.831031
10.1109/ICASSP.2001.940488
10.1109/LSP.2009.2035380
10.1109/ICASSP.2011.5947032
10.1109/MSP.2011.940267
ContentType Journal Article
Publication
Contributor Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions
Universitat Politècnica de Catalunya. A&MP - Grup de Processament d'Arrays i Sistemes Multicanal
Contributor_xml – sequence: 1
  fullname: Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions
– sequence: 2
  fullname: Universitat Politècnica de Catalunya. A&MP - Grup de Processament d'Arrays i Sistemes Multicanal
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2012
Attribution-NonCommercial-NoDerivs 3.0 Spain info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/3.0/es
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2012
– notice: Attribution-NonCommercial-NoDerivs 3.0 Spain info:eu-repo/semantics/openAccess <a href="http://creativecommons.org/licenses/by-nc-nd/3.0/es/">http://creativecommons.org/licenses/by-nc-nd/3.0/es/</a>
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
XX2
DOI 10.1109/LSP.2012.2192429
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
Recercat
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Technology Research Database

Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2361
EndPage 327
ExternalDocumentID oai_recercat_cat_2072_204875
2637168261
10_1109_LSP_2012_2192429
6176203
Genre orig-research
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAWTH
AAYJJ
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
F5P
HZ~
H~9
ICLAB
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
RNS
TAE
TN5
VH1
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
RIG
F28
FR3
XX2
ID FETCH-LOGICAL-c408t-960d85904dadf6bbf66cac4df32a2f3a3a19da6a792c977f8e3beaa83eaa4dc03
IEDL.DBID RIE
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000303069500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1070-9908
IngestDate Fri Nov 07 13:52:20 EST 2025
Sun Sep 28 08:00:57 EDT 2025
Mon Jun 30 10:18:22 EDT 2025
Sat Nov 29 01:48:40 EST 2025
Tue Nov 18 21:44:01 EST 2025
Tue Aug 26 17:09:04 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c408t-960d85904dadf6bbf66cac4df32a2f3a3a19da6a792c977f8e3beaa83eaa4dc03
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
OpenAccessLink https://recercat.cat/handle/2072/204875
PQID 1002500255
PQPubID 75747
PageCount 4
ParticipantIDs csuc_recercat_oai_recercat_cat_2072_204875
proquest_miscellaneous_1022908917
ieee_primary_6176203
crossref_primary_10_1109_LSP_2012_2192429
proquest_journals_1002500255
crossref_citationtrail_10_1109_LSP_2012_2192429
PublicationCentury 2000
PublicationDate 2012-06-01
PublicationDateYYYYMMDD 2012-06-01
PublicationDate_xml – month: 06
  year: 2012
  text: 2012-06-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE signal processing letters
PublicationTitleAbbrev LSP
PublicationYear 2012
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References (ref3) 1987
ref8
ref7
ref4
ref6
boche (ref9) 2002; 1
ref5
ref2
ref1
References_xml – ident: ref1
  doi: 10.1109/78.995073
– ident: ref4
  doi: 10.1109/ICC.1999.765384
– ident: ref5
  doi: 10.1109/4234.831031
– ident: ref7
  doi: 10.1109/ICASSP.2001.940488
– ident: ref6
  doi: 10.1109/LSP.2009.2035380
– ident: ref8
  doi: 10.1109/ICASSP.2011.5947032
– volume: 1
  start-page: 87
  year: 2002
  ident: ref9
  article-title: A general duality theory for uplink and downlink beamforming
  publication-title: Proc VTC
– year: 1987
  ident: ref3
  publication-title: Ensemble modem structure for imperfect transmission media
– ident: ref2
  doi: 10.1109/MSP.2011.940267
SSID ssj0008185
Score 2.045914
Snippet In this letter the discrete rate maximization problem is investigated for FBMC/OQAM. The analysis reveals that if there is crosstalk certain bit allocations...
In this letter the discrete rate maximization problem is investigated for FBMC/OQAM. The analysis reveals that if there is crosstalk certain bit allocations...
SourceID csuc
proquest
crossref
ieee
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 324
SubjectTerms Algorithms
Allocations
Channels
Complexity theory
Computer simulation
Crosstalk
Discrete rate maximization
Enginyeria de la telecomunicació
FBMC/OQAM
Feasibility
Fiber optics
Fibres òptiques
Frequency modulation
Interference
Maximization
OFDM
Optical communications
Radiocomunicació i exploració electromagnètica
Radiodifusió per ràdio
Signal processing algorithms
Signal to noise ratio
Upper bounds
Vectors
Xarxes de comunicacion
Àrees temàtiques de la UPC
Title A Discrete Bit Loading Algorithm for FBMC/OQAM
URI https://ieeexplore.ieee.org/document/6176203
https://www.proquest.com/docview/1002500255
https://www.proquest.com/docview/1022908917
https://recercat.cat/handle/2072/204875
Volume 19
WOSCitedRecordID wos000303069500001&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/IET Electronic Library (IEL) (UW System Shared)
  customDbUrl:
  eissn: 1558-2361
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008185
  issn: 1070-9908
  databaseCode: RIE
  dateStart: 19940101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dT4MwEL_MxQd98Gsa0Wkw8UUjWwcM2sdNXXzY5oya7I2UcuiSOczG_PvtAUMTjYkPkBJK09zR--hdfwdwrtUAOk6rRUF3CjNKZQmG3KIgGvNCyeI4zIpN-MMhH4_FqAJX5VkYRMySz7BBzSyWHyVqSVtlTa1tPZugPdd838_PapVSlxRPnl_ILC1h-SokyUSz_ziiHC67YZO3kRmTXyqoqhZLVZRW-SGPMyXT2_7f9HZgqzAmzU7O_V2o4GwPNr9BDNag0TFvJlo0aNvY7E5Ss59kSfNmZ_qSzCfp65uprVaz1x1cN-8fOoN9eO7dPl3fWUWNBEu5jKeWdkAi3hbMjWQUe2EYe56Syo1ix5Z27EhHtkQkPekLW2lTL-bohCgld_TNjRRzDqA6S2Z4CGZbhG7sC-Su0g20Q3S59Dm6EQuVaisDmiuyBaoAEKc6FtMgcySYCDShAyJ0UBDagIvyi_ccPOOPvpfEiUDLeZwrmQaEe10-0GUzX_dm5GEZUCPyl4MWlDegvuJfUCzFBYEyazOPXCcDzsrXehFRZETOMFlSH4K959p1Pfp95GPYoMnmOWJ1qKbzJZ7AuvpIJ4v5afYnfgLjXdiz
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dT9swED-hDgn2ML6Glo2xIPHCtLSu4yb2Y_momGgLaCDxZjnOBSqxZmrT_f3zJWlAGkLiIZGjOJZ1F9-H7_w7gEOnBjAMu10KulOY0dhAMZQBBdFYlBiWZUlZbCIej-XdnbpagR_NWRhELJPPsE3NMpaf5nZBW2Udp20jTtCe73pC8G51WquRu6R6qgxDFjgZK5dBSaY6w19XlMXF25z8jdKcfFJCLTtf2Lq4yn8SuVQzg423TXATPtTmpN-v-L8FKzjdhvfPQAZ3oN33TydOODjr2D-eFP4wL9Pm_f7jfT6bFA-_fWe3-oPj0Unn8ro_-gi3g7Obk_OgrpIQWMFkETgXJJU9xURq0ixKkiyKrLEizUJueBaa0HRVaiITK26dsZdJDBM0RobuJlLLwl1oTfMpfgK_pxKRxQqlsK6BPEEhTSxRpCyxtmc96CzJpm0NIU6VLB516UowpR2hNRFa14T24Kj54k8Fn_FK3-_ECe0kPc6sKTQhXzcPdHEWu96MfCwPdoj8zaA15T3YW_JP14txTrDMztAj58mDg-a1W0YUGzFTzBfUh4DvpXNeP7888jdYO78ZDfXw5_jiC6zTxKuMsT1oFbMFfoVV-7eYzGf75V_5D1GN2_o
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+Discrete+Bit+Loading+Algorithm+for+FBMC%2FOQAM&rft.jtitle=IEEE+signal+processing+letters&rft.au=Caus%2C+M%C3%A0rius&rft.au=Perez-Neira%2C+Ana+I.&rft.au=Garcia-Armada%2C+Ana&rft.date=2012-06-01&rft.issn=1070-9908&rft.eissn=1558-2361&rft.volume=19&rft.issue=6&rft.spage=324&rft.epage=327&rft_id=info:doi/10.1109%2FLSP.2012.2192429&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_LSP_2012_2192429
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1070-9908&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1070-9908&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1070-9908&client=summon