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!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2012.2192429