A Novel Chirp Based Modulation and Detection Scheme Using Fractional Fourier Transform

Yuhong Li #, Jianhua Lu * , Youzheng Wang *

#

Department of Electronic Engineering Tsinghua University Beijing 100084,China yuhongli@tsinghua.edu.cn

*

Aerospace Research Center Tsinghua University Beijing 100084,China yzhwang @tsinghua.edu.cn The aim of this paper is to present some recently study results of chirp based modulation and detection scheme based on the FrFT. We explore using chirp signals with different initial frequencies for binary signaling instead of usual up-chirp and down-chirp, which employ matched filter to detect signals. Namely, the input data are modulated onto two chirp waveforms which have the same slope of instantaneous frequency and different initial frequency. At receiver, we employ FrFT to detect and extract the desired signal from chirp carriers. The rest of this paper is organized as follows. Section 2 provides the description of discrete fractional Fourier transform and chirp based modulation and detection scheme for wireless communication systems using FrFT. Section 3 gives some simulation results and performance analysis. Finally, we conclude this paper in section 4. II. SYSTEM DESCRIPTION

AbstractIn this paper, a novel chirp based modulation and detection strategy for wireless communication systems using fractional Fourier transform (FrFT) is presented. In this scheme, the input data are mapped onto two chirp signals which have different initial frequencies and the same chirp rate, the received signals are detected and extracted by using FrFT. We evaluate the performance of proposed system over general additive white Gaussion noise (AWGN) channel, simulation results show that the bit error rate (BER) is improved greatly. Keywords-fractional modulation Fourier transform (FrFT); chirp;

I.

INTRODUCTION

The traditional Fourier transform (FT) is one of the most frequently used tools for signal processing and analysis. For FT, it is customary to use the time-frequency plane, i.e. two orthogonal time and frequency axes to analyze signal. The FT can be interpreted as a rotation of signal by the angle / 2 in the timefrequency plane and represented as an orthogonal signal representation for sinusoidal signal. However, the fractional Fourier transform (FrFT) performs a rotation of signal in the continuous timefrequency plane to any angle and serves as an orthonormal signal representation for the chirp signal. For 0 < < / 2 , the FrFT give the signal representation in the hybrid time frequency domain, especially, at =0, the FrFT give a signal representation in the time domain, at = / 2 , the FrFT give a signal representation in the Fourier domain. The fractional Fourier transform is a generalization of the ordinary Fourier transform with many potential applications. The FrFT has been proposed in[1][2] and has attracted a considerable amount of attention, resulting in many applications in the areas of quantum mechanics and quantum optics[3]-[8], optical beam propagation and optical diffraction theory, and optical systems and optical signal processing, swept-frequency filters, time-variant filtering and multiplexing[9], pattern recognition, and study of timefrequency distributions. The FrFT has been related to wavelet transforms, neural networks, and is also related to various chirp-related operations, especially in time-varying signal analysis [10].

A. Discrete Fractalional Fourier Transform The FrFT is also called angular Fourier transform or rotational Fourier transform in some documents. The FRFT of a signal s(t) is defined as Where, p = 2 / , K p (t , u ) is transformation kernel as

S p (u ) = {Fp [s (t )]}(u ) = s (t ) K p (t , u )dt

+

(1)

(t u ), = 2n K p (t , u ) = (t + u ), = (2n 1) j ( t 2 +u 2 ) 1 j cot 2 (cot jut csc ) e , n 2 The inverse FRFT (IFTFR) can be given as

(2)

s (t ) = S p (u )k p (t , u )du

(3)

Many fast algorithms for realizing discrete FrFT have been developed[11]-[14]. We use an efficient and accurate algorithm for digitally computing the continuous FrFT integral [13],

978-1-4244-4067-2/09/$25.00 2009 IEEE

872

Wireless VITAE09

which maps the N samples of the original function to the N samples of the transform. In many of the applications of FrFT, it is possible to improve performance by using of the FrFT instead of the usual Fourier transform. Since in document [13] we can see that the fractional transform can be computed in about the same time as the ordinary transform, these performance improvements come at no additional cost. To give one concrete example, in some cases, filtering in a fractional Fourier domain, rather than the ordinary Fourier domain, allows one to decrease the mean square error in estimating a distorted and noisy signal [15]. B. Chirp based Wireless Systems and Signal Processing The design of a chirp based wireless communication systems is based on the adoption of a chirp modulation & extract strategy by means of which input data are mapped onto different center frequency chirp carriers and detect the desired signals by using FrFT. Figure 1 shows the block diagram of chirp-based transmitter and receiver.

III.

SYSTEM SIMULATION

In this section, we design and simulate a chirp based modulation and detection scheme for wireless communication systems using fractional Fourier transform. Figure 2 shows the chirp I with initial frequency of 50Hz and chirp II with initial frequency of 10Hz Both chirp I and chirp II have the same slope of instantaneous frequency 10.

Figure2. Chirp I and chirp II signals

Figure 3 shows the real part, imaginary part and absolute value of FrFT for received signals.

Figure1. Block diagram of chirp based transmitter and receiver

We employ the chirp modulation and detection scheme that input data are mapped onto different chirp waveforms, i.e. the data 1 is denoted by chirp I and the data 0 is denoted by chirp II , then the chirp signals are transmitted through a AGWN channel At the receiver, extract the input data from the different initial frequency chirp signals by searching an appropriate angle parameter and then using a fast O ( N log N ) algorithm for discrete FrFT. Each chirp signal at a given optimal angle will appear a sharp impulse in the FrFT domain which is related to the initial frequencies of the transmitted chirp signals. If we recover the transmitted chirp waveforms, we can take a bandpass filter in the FrFT domain to remove the noise and other interference, then return to the time domain by using IFrFT. For system simulation, the steps of the filtering in the FrFT domain and IFrFT are not needed. At receiver, the optimal was already obtained by using above search algorithm. The FrFT of received data at optimal is taken, then output data will be recovered by detection and decision to get the BER.

Figure3. Real part, imaginary part and absolute value of FrFT

Figure4. Real part, imaginary part and absolute value of FrFT for received signal after filtering.

Figure 4 shows the real part, imaginary part and absolute value of FrFT for received signal after filtering in the FrFT domain. Figure 5 shows the original and recovered signals.

873

data are modulated onto two chirp waveforms which have different initial frequencies instead of traditional up-chirp and down-chirp signals. At receiver, signal is detected and extracted by using the FrFT instead of the autocorrelation of up-chirp and down-chirp. We simulate and evaluate the BER performance of our proposed chirp based system, apparent BER improvement is achieved and potential study is suggested. ACKNOWLEDGMENT This work is supported by the Post-doctor Science Foundation of China (No.20080430374), National 973 Project of China (No.2007CB310601), and National HighTech Research and Development 863 Program of China (No.2007AA01Z2b3).
Figure5. Original and recovered signals. [1] [2] [3]

REFERENCES
A. C. McBride and F. H. Kerr, On Namias fractional Fourier transforms,IMA J. Appl. Math., vol. 39, pp. 159175, 1987. V. Namias, The fractional order Fourier transform and its application to quantum mechanics, J. Inst. Math. Applicat., vol. 25, pp. 241265,1980. K. Vogel and H. Risken, Determination of quasiprobability distributions in terms of probability distributions for the rotated quadrature phase,Phys. Rev. A, vol. 40, pp. 2847-2849, 1989. B. Yurke, W. Schleich, and D. F. Walls, Quantum superposition generated by quantum nondemolition measurements, Phys. Rev. A, vol.42, pp. 1703-1711, 1990. W. Vogel and W. Schleich, Phase distribution of a quantum statewithout using phase states, Phys. Rev. A, vol. 44, pp. 7642-7646, 1991. D. T. Smithey, M. Beck, M. G. Raymer, and A. Faridanil, Measurement of the Wigner distribution and the density matrix of a light mode using optical homodyne tomography: Application to squeezed
states and the vacuum, Phys. Rev. Lett., vol. 70, pp. 1244-1247, 1993.

[4]

[5]

[6]

[7] Figure6. BER performance of chirp based modulation and detection scheme using FrFT

[8]

We simulate the above chirp based modulation and detection scheme for wireless communication systems using fractional Fourier transform and focus on comparison of the BER performance with theoretical curve of BPSK in AWGN channel. The theoretical BER of BPSK in general AWGN channel is 1 (4) Pe = erfc( Eb / N 0 ) 2 From Figure 6, it is apparent that the chirp based modulation and detection scheme provides about 5dB advantage in power than theoretical BER of BPSK at the same BER in AWGN channel. The BER performance of the proposed chirp carrier system is improved greatly. IV. CONLUSIONS

M. Beck, M. G. Raymer, I. A. Walmsley, and V. Kong, Chronocyclictomography for measuring the amplitude and phase structure of optical pulses, Opt. Lett., vol. 18, pp. 2041-2043, 1993.M. M.G. Raymer, M. Beck, and D. F. McAlister, Complex wave-field reconstruction using phase-space tomography, Phys. Rev. Lett., vol.72,
pp. 1137-1140, 1994.

[9]

[10]

[11]

[12]

[13] [14]

The FrFT is a well-known and powerful time-frequency analysis and signal processing tool especially for the processing of non-stationary signals. In this paper, we studied and explored a chirp based modulation and detection scheme for wireless communication systems using FrFT. The input

[15]

H. M. Ozaktas, B. Barshan, D. Mendlovic, and L. Onural, Convolution,filtering, and multiplexing in fractional Fourier domains and their relation to chirp and wavelet transforms, J. Opt. Soc. Amer. A, vol.11, pp. 547-559, 1994. Discrete fractional Fourier transform based on orthogonal projections Soo-Chang Pei; Min-Hung Yeh; Chien-Cheng Tseng; Signal Processing, IEEE Transactions on [see also Acoustics, Speech, and Signal Processing,IEEE Transactions on Volume 47,Issue 5,May 1999 Page(s):1335 - 1348 B.Santhanam and J.H.McClellan.The discrete rotational Fourier transform [J].IEEETransactions on Signal Processing,1996,42(4):994998. HaldumM.Ozaktas,Orhan Arikan,M.Alper Kutay and Gozde Bozdagi.Digital Computation of the Fractional Fourier Transform [J].IEEE Transactons on Signal Processing,1996,44(9):2141-2150. Soo-Chang Pei,Min-Hung Yeh.Two dimensional discrete fractional Fourier transform [J].IEEE,Signal Processing,1998,67,99-108. Soo-Chang Pei,Min-Hung Yeh and Chien-Cheng Tseng.Discrete fractional fourier transform based on orthogonal projections [J]. IEEE Transactions on Signal Processing,1999,47(5):1335-1347 M. A. Kutay, H. M. Ozaktas, L. Onural, and 0. Arikan, Optimalfiltering in fractional Fourier domains, in Proc. IEEE Int. Conj Acoust.,Speech, Signal Processing, Detroit, MI, 1995.

874