z-logo
Premium
Blind carrier frequency offset mitigation in space–time block‐coded multicarrier code division multiple access uplink transmission
Author(s) -
Chen TungChou,
Lin TsuiTsai
Publication year - 2016
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.2823
Subject(s) - carrier frequency offset , computer science , telecommunications link , multipath propagation , orthogonal frequency division multiple access , estimator , transmission (telecommunications) , algorithm , robustness (evolution) , electronic engineering , orthogonal frequency division multiplexing , real time computing , telecommunications , frequency offset , statistics , mathematics , channel (broadcasting) , biochemistry , chemistry , engineering , gene
Summary In this paper, a novel blind carrier frequency offset (CFO) estimation is proposed on the basis of the linearly constrained optimization for the uplink transmission of space–time block‐coded multicarrier code division multiple access systems. First, the full‐dimensional spatial‐and‐temporal data are formed to avoid violation of the second‐order statistics in the conventional receiver design. A set of weight vectors is then provided for acquiring each multipath signal from the desired user while the others get rejected. Finally, the estimated CFO is obtained in accordance with maximizing the well‐defined measurement function, which is formulated by collecting all the output powers of the receiver. A space–time averaging technique is also proposed to enhance the robustness to the finite sample effect. Simulation study confirms that with the proposed CFO estimator used in the preceding, the receiver can successfully achieve the same performance of the optimal receiver working in the absence of CFO. Copyright © 2014 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here