Restaurant De Caron
Diner van 17u30 tot 21u00
Zondag van 16u30 tot 21u00
Woensdag en donderdag gesloten
Reservaties enkel telefonisch op 014/70.59.78
Instagram Feed


Cfo estimation with autoregressive process

1 Introduction

The OFDM modulation features been trusted in modern communication systems, as a result of its robustness against the frequency selectivity in wireless channel. With inserting Cyclic Prefix (CP), OFDM system can converta rate of recurrence selective channel into a parallel collection of frequency flat channels, resulting in an excellent simplified equalizer which increases the robustness of OFDM system against inter symbol interference (ISI). OFDM has been used in important applications like Wireless LAN IEEE 802.11a, IEEE 802.11g, IEEE 802.11n, IEEE 802.11ac, and IEEE 802.11ad, Digital Audio Broadcasting (DAB), Digital television set DVB-T/T2 (terrestrial), DVB-H (handheld), DMB-T/H, DVB-C2 (cable), Worldwide Interoperability for Microwave Gain access to (WiMAX), Asymmetric Digital Subscriber Series (ADSL) and The LTE and LTE Advanced 4G mobile phone standards.

OFDM systems are extremely sensitive to frequency synchronization. ­That is because of Doppler shift (due how to write an evaluation essay to relative motion) and a mismatch between carrier frequency by the non-synchronized native oscillators or between transmitter and receiver. The CFO could be several times bigger than the subcarrier spacing. It is generally divide into an integer portion and a fractional part. Fractional component of CFO introduces inter-carrier interference (ICI) between subcarriers. It corrupts the mutual orthogonality between subcarriers and effects in bit error price (BER) degradation. Integer CFO will not expose ICI between subcarriers, but does expose a cyclic change of info subcarriers and a phase change proportional to OFDM symbol amount. The orthogonality between subcarriers is still maintained however the received data symbols, which were mapped to the OFDM spectrum, are now in the incorrect position.

Imprecise CFO estimation triggers to a severe performance degradation due to the reduction of the signalamplitude at the productivity of every matched filter and the interference between adjacent subchannels [1]. In the newest years so many works have already been directed toward the progression of CFO synchronization options for OFDM systems operating in both data-aided and non-data-aided (or blind) contexts. On top of that, a combination of data-aided and blind strategies has been recently considered, which described semiblind approach. For instance, blind methods with applying the orthogonality between null subcarriers cushioned in the transmitted OFDM symbol and the information-bearing subcarriers, stick out in [2,3], and in [4] redundant data held within the cyclic prefix (CP) preceding the OFDM symbols permitted estimation without additional pilots, joint symbol timing and CFO optimum likelihood (ML) estimator provides been derived. In [5] frequency offsets are approximated by inserting null subcarriers right into a one OFDM block and a deterministic maximal likelihood (ML) procedure for CFO estimation provides been derived.

In this paper we describe a method for estimating the CFO with exploiting an autoregressive (AR) procedure from a finite number of noisy measurements of received signal[6]. The method utilizes a modified group of Yule-Walker (YW) equations that bring about a quadratic eigenvalue trouble that, when solved, provides estimates of the AR parameters and we can estimate CFO from AR parameters.


In OFDM systems, info are dispatched block by block. A number of complex data is split into blocks and allocated to subcarriers. Let come to be the complex data owned by the – OFDM block, the – block of the OFDM signal could be expressed as

, (1)

where , may be the normalizing element. and will be the symbol duration and subcarrier spacing of OFDM, respectively. For simpleness we omit the index . We can certainly perform OFDM with DFT, which is often efficiently testmyprep.com applied by low complexity fast Fourier transform (FFT).

The sampling space of an OFDM transmission of bandwidth B is


The discrete-time transmit transmission, is


which is known as the DFT of the sequence if . Hence, the IFFT of the data block is

, (4)

After eliminating the Cyclic Prefix and spending FFT, the complex envelope of the baseband received transmission in an OFDM block in the lack of timing offset and channel distortion can be described as


where is the channel response at the k-th subcarrier regularity, is additive noises, which can be assumed to get zero-mean, uncorrelated, circular intricate Gaussian random vector (C-CGRV) [7], with variance


We can write (5) as


If we use training symbols for transmitting data (or we can merely multiply to ) then we are able to believe that (or ), now we can easily write as


3 Quadratic Eigenvalue CFO Estimation

We desire to estimate CFO as a frequency based estimation difficulty which resulting in a Quadratic Eigenvalue trouble.

Consider this received transmission without noise component. Remember that α is a frequent and may be omitted.


we can easily assume then we are able to rewrite the equation (8) to:


which (9) yield that


By multiplying (10) by and spending expectation provides Yule-Walker equations of purchase one as follows


we may use (7) to have

. (12)

substituting (12) to (11) yields


rearranging (13) we’ve first order AR process


now we can increase (14) from lag=0 to lag=q and


Now we are able to write in matrix form



, , and . (17)

where is definitely a column vector having zeros, and in order that a unique solution is guaranteed. The sizes of , B, and V happen to be and respectively. By multiplying both sides of (16) by leads to the quadratic eigenvalue trouble [6]


where (19)

Each of the matrices in (19) has dimension . There happen to be so many methods to resolve the quadratic eigenvalue issue [8]. One technique is to define


It is obviously confirmed that solving (18) is add up to solving the 4-dimensional linear eigenvalue problem


Let be eigenvectors solving (21) these, along with their corresponding eigenvalues, appear in complex conjugate pairs [8]. The proposed subspace approach can be solved the following [6].

1) Type estimates of the autocorrelation matrix described in (17).

2) Form the matrices and described in (19).

3) Form the matrices P and Q defined in (20).

4) Solve the generalized eigenvalue problem


5) The estimation of AR parameter, of the generalized eigenvector associated with the generalized eigenvalue having minimum modulus. The estimation of is normally given by

where denote the th entry of .

Now we are able to estimate the CFO by



[1] P.H. Moose, A method for orthogonal rate of recurrence division multiplexing regularity offset correction, IEEE Trans.Comm. 42 (October 1994) 2908-2914.[2] H. Liu, U. Tureli, A high-efficiency carrier estimator for OFDM communications, IEEE Trans. Comm. Lett. 2 (April1998) 104-106.[3] U. Tureli, H. Liu, M.D. Zoltowski, OFDM blind carrier offset estimation: ESPRIT, IEEE Trans. Comm. 48 (9)(September 2000) 1459-1461.[4] J.J. van de Beek, M. Sandell, P.O. Bo ¨ rjesson, ML estimation of period and frequency offset in OFDM devices, IEEE Trans.Signal Method. 45 (July 1997) 1800-1805.

[5] M. Ghogho, A. Swami and G.B. Giannakis, "Optimized null-subcarrier assortment for CFO estimation in OFDM over frequency-selective fading channels", vol. 1, pp. 202-206.

[6] C.E. Davila, "A subspace method of estimation of autoregressive parameters from noisy measurements", IEEE Trans. Signal Processing, vol. 46, no. 2, pp. 531-534, 1998.

[7] B. Picinbono, On circularity, IEEE Trans. Signal Process. 42 (December 1994) 3473-3482.

[8] F. Chatelin, Eigenvalues of Matrices. NY: Wiley, 1993.

Sorry, the comment form is closed at this time.