MSE Analysis of Sampling Frequency Offset Estimation Scheme for OFDM-Based Digital Radio Mondiale (DRM) Systems

A precise estimation and compensation of sampling frequency offset (SFO) is an important issue in an orthogonal frequency division multiplexing (OFDM) system because of its time-variant behavior. This paper considers the problem of SFO estimation for OFDM-based digital radio mondiale (DRM) systems....

Full description

Saved in:
Bibliographic Details
Published in:Wireless personal communications 2013-07, Vol.71 (2), p.1271-1281
Main Authors: Shin, Won-Jae, Seo, Jeongwook, You, Young-Hwan
Format: Article
Language:English
Subjects:
Access methods and protocols, osi model
Applied sciences
Broadcasting. Videocommunications. Audiovisual
Communications Engineering
Complexity
Computation
Computer Communication Networks
Computer science
control theory
systems
Computer simulation
Digital
Engineering
Exact sciences and technology
Networks
Offsets
Orthogonal Frequency Division Multiplexing
Radio
Sampling
Signal,Image and Speech Processing
Simulation
Software
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
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!
Description
Summary:A precise estimation and compensation of sampling frequency offset (SFO) is an important issue in an orthogonal frequency division multiplexing (OFDM) system because of its time-variant behavior. This paper considers the problem of SFO estimation for OFDM-based digital radio mondiale (DRM) systems. In this study, we develop expressions for the mean square error (MSE) of the conventional SFO estimators used in the OFDM-based DRM system. Their low-complexity variants and computation complexity are reported. The theoretical MSE analysis for different algorithms are validated by Monte-Carlo simulations within the framework of the OFDM parameter and pilot pattern defined in the DRM specification. It is also shown that the computation complexity of the low-complexity variants is significantly reduced, compared with that of original versions.
ISSN:0929-6212
1572-834X
DOI:10.1007/s11277-012-0873-2