Loading…
Power Allocation and Capacity Analysis for FBMC-OQAM With Superimposed Training
Superimposed training (ST) is a semiblind channel estimation technique, proposed for orthogonal frequency division multiplexing (OFDM), where training sequences are added to data symbols, avoiding the use of dedicated pilot-subcarriers, and increasing the available bandwidth compared with pilot symb...
Saved in:
Published in: | IEEE access 2019, Vol.7, p.46968-46976 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Superimposed training (ST) is a semiblind channel estimation technique, proposed for orthogonal frequency division multiplexing (OFDM), where training sequences are added to data symbols, avoiding the use of dedicated pilot-subcarriers, and increasing the available bandwidth compared with pilot symbol assisted modulation (PSAM). Filter bank multicarrier offset quadrature amplitude modulation (FBMC-OQAM) is a promising waveform technique considered to replace the OFDM, which takes advantage of well-designed filters to avoid the use of cyclic prefix and reduce the out-band-emissions. In this paper, we provide the expressions of the average channel capacity of the FBMC-OQAM combined with either PSAM or ST schemes, considering imperfect channel estimation and the presence of the pilot sequences. In order to compute the capacity expression of our proposal, ST-FBMC-OQAM, we analyze the channel estimation error and its variance. The average channel capacity is deduced considering the noise, data interference from ST, and the intrinsic self-interference of the FBMC-OQAM. Additionally, to maximize the average channel capacity, the optimal value of data power allocation is also obtained. The simulation results confirm the validity of the capacity analysis and demonstrate the superiority of the ST-FBMC-OQAM over existing proposals. |
---|---|
ISSN: | 2169-3536 2169-3536 |
DOI: | 10.1109/ACCESS.2019.2909405 |