2012 Fourth International Conference on Computational Intelligence and Communication Networks
Implementation of Different Non-Recursive FIR Band-
pass Filters using Fractional Fourier Transform
Somesh Chaturvedi*, Mahendra Kumar%, Girish Parmar# and Pankaj Shukla+
Department of Electronics Engineering, UCE, Rajasthan Technical University, Kota 324 022 (India)
Abstract This paper Proposed Implementation of
Nonrecursive Finite Impulse Response (FIR) filter
with the help of Kaiser window and Fractional
Fourier Transform (FRFT). The window shape
parameter is tuned for the transition band by
considering linear phase FRFT FIR filter. FRFT of
Kaiser Window is taken and convolved with the
response function for tuning purposes of the
transition band which makes effective transition
band. This proposed method includes the change of
parameters of Kaiser window by which other
windows like Rectangle, Bartlett, Hamming Blackman
and Hanning windows are generated by using FRFT.
The merit of using FRFT in FIR filter design is that
the impulse response need not be recomputed to
improve filter sharpening and thus online
improvement in the frequency response can be
obtained.
Index TermsFourier Transform, Fractional Fourier
transform, Kaiser window, FIR filter.
I. INTRODUCTION
Now-a-days Fractional Fourier transform has been widely
used as tool in signal processing [1], quantum mechanics
and quantum optics [2-5], pattern recognisation [6] and
study of time frequency distribution [7]. As the
mathematics reveals that the generation of the Fourier
transform is the fractional Fourier transform [FRFT],
which are explained in [2,4]. The FRFT can be
interpreted as the rotation of angle  in the time
frequency plane. The basic properties of FRFT as, when
rotation angle  = /2 corresponds to the classical Fourier
transform,  = 0 corresponds an Identity operator and
when we apply FRFT on a signal, the signal decomposes
into chirps i.e., complex exponentials with linearly
varying instantaneous frequencies.
Since FIR filter of linear phase, inherent stability,
negligible quantization noise and can be efficiently
implanted in multi-rate digital signal processing
applications, so it is used frequently in many areas of
signal processing then the infinite impulse response (IIR)
filters. In general FIR filters can be derived with the help
of windows, sampling and optimal polynomials [8-9].
The design of filters with Fourier transform provides the
greatest mismatch occurring as the edges of the transition
band. The ringing occurs at the edges because of the
finite series Fourier transform cannot produce the sharp
edges at the transition band.
So suitable windows are to be taken to produce an
effective transition band. Kaiser window function
E-mail:*chaturvedi.somesh17@gmail.com,%miresearchlab@gmail.com
#
girish_parmar2002@yahoo.com., +shuklapec@rediffmail.com
978-0-7695-4850-0/12 $26.00 2012 IEEE
DOI 10.1109/CICN.2012.131
provides maximum side lobe decreases and tuning in
dBs. The parameter  (Bessels coefficient) of Kaiser
window we can achieve different type of windows like
Rectangular, Bartlett, Hanning, Hamming, Blackman
window. By combining Kaiser window with FRFT we
can get the better results than the normal Fourier
transform cases. The organization of the paper is as
follows:
The section II deals with Fractional Fourier transform,
section III deals with design of windows using Kaiser,
section IV deals with implementation of tuning procedure
using convolution. Section V deals with simulation and
results and section VI deals with the conclusion.
II. FRACTIONAL FOURIER TRANSFORM
The FRFT belongs to the class of timefrequency
representations that have been extensively used by the
signal processing community. In all the timefrequency
representations, one normally uses a plane with two
orthogonal axes corresponding to time and frequency. If
consider a signal x(t) to be represented along the time
axis and its ordinary Fourier transform X(f) to be
represented along the frequency axis, then the Fourier
transform operator (denoted by F) can be visualized as a
change in representation of the signal corresponding to a
counter clockwise rotation of the axis by an angle /2.
This is consistent with some of the observed properties of
the Fourier transform. For example, two successive
rotations of the signal through /2 will result in an
inversion of the time axis. Moreover, four successive
rotations will leave the signal unaltered since a rotation
through 2 of the signal should leave the signal unaltered.
The FRFT is a linear operator that corresponds to the
rotation of the signal through an angle which is not a
multiple of /2, i.e. it is there presentation of the signal
along the axis u making an angle  with the time axis.
i). Definition
The FRFT is defined with the help of the
transformation kernel K as [5-6] :
(t u ) if is a multiple of 2
K (t , u ) = (t + u ) if + is a multiple of 2
1 j cot if is not a multiple of
2
343
 (1) of the ordinary Fourier transform 4 times and therefore
also acts as the identity operator, i.e. Fo = F/2 = I:
Another useful form of writing the square root factor
preceding the transformation kernel; K can be obtained
by using [9] : (b) Fourier transform operator. F/2 is the Fourier
transform operator. The FRFT of order = /2 gives the
Fourier transform of the input signal.
1 j cot je j
= (2)
2 2 sin
(c) Successive applications of FRFT. Successive
The FRFT is defined using this kernel as FRFT of applications of FRFT are equivalent to a single transform
order  of x (t) denoted by : whose order is equal to the sum of the individual orders.
F(F)= F+

X (u ) = x(t ) K (t, u)dt

(3) (d) Inverse. The FRFT of order -  is the inverse of the
FRFT of order a since F-(F)= F- = Fo= I:
where;

1 j cot j ( u cot / 2)
x(t )e j ( t cot / 2) jut cos ec ( ) dt ;
2 2

e iv). Applications of FRFT

2

X (u ) = if is not a multipleof The FRFT, being just an extension of the classical
x(t ) Fourier transform, can be used effectively in all situations
; if is a multiple of 2
where the Fourier transform is presently being used.
x( t ) ; if + is multiple of 2 Some gains can be expected in most of these applications
because of the additional degree of freedom (angle of
(4) rotation) that the FRFT provides us with.

ii). Computation of the FRFT

The FRFT of a signal x(t) can be computed by the III. DESIGN OF WINDOWS USING KAISER
following steps : WINDOW

1. product by a chirp-chirps are functions whose In a Kaiser window, the side lobe level can be controlled
frequency is linearly increasing with time. with respect to the main lobe peak by varying a parameter
2. a Fourier transform with its argument scaled by  .The width of the main lobe can be varied by adjusting
cosec(). the length of the filter. The Kaiser window function is
3. another product by a chirp. given by:
4. a product by a complex constant. I0 ( ) N 1
, for n
It is also found that the FRFT of a signal x(t) exists k (n) = I 0 ( ) 2 (5)
under the same conditions in which its Fourier transform 0,
exists. In order to discuss the various properties of the otherwise
FRFT, it would be ideal to denote the FRFT in an Where  is an independent variable determined by
operator notation. Kaiser. The parameter  is expressed by:
0.5
2n 2
= 1 (6)
N 1
iii). Properties of the FRFT The modified Bessel function of the first kind, I 0 ( x) ,
can be computed from its power series expansion given
Let, F denote the operator corresponding to the FRFT by:
of angle; . Under this notation, some of the important 2
1 x k
properties of the FRFT[7-9] operator are listed below : I 0 ( x) = 1 + (7)
k ! 2
k =1

( 0.25 x ) + ( 0.25 x )
(a) Identity operator. Fo is the identity operator. The 2 2 2 3
FRFT of order  = 0 is the input signal itself. The FRFT 0.25 x 2
= 1+ + + ......... (8)
(1!) ( 3!)
2 2
of order = 2 corresponds to the successive application (2!)2
E-mail:*chaturvedi.somesh17@gmail.com,%miresearchlab@gmail.com
#
girish_parmar2002@yahoo.com., +shuklapec@rediffmail.com

344
The actual pass band ripple ( Ap ) and minimum stop response, if required, filter frequency response can be
sharpened by changing the FRFT order.
band attenuation ( As ) is given by:
1+ p V. SIMULATION RESULTS
Ap = 20 log10 dB (9) Results for method of tuning using Kaiser for different
1 p window value shown in fig: 1-6.
As = 20 log10 s dB (10)
1) Rectangular window (=0)
The transition bandwidth is:

F = f s f p (11)

The different values of  emulates the different window

functions which is expressed in table-1
TABLE-I  VERSUS WINDOW FUNCTION
 Window Function
0 Rectangular
1.33 Bartlett
3.86 Hanning
4.86 Hamming
7.04 Blackman
3 Kaiser

In this paper an attempt has been done for evalued all

windows using FRFT on Kaiser window. Fig.1 Frequency response of Kaiser window for =0 at different values
The modified impulse response is computed using: of 

N 1 2) Bartlett window (=1.33)

h(n) = wk (n)hd (n). for n (12)
2
The main lobe width, the peak side lobe level can be
varied by varying the parameters  and N. The side lobe
peak can be varied by varying the parameter . The
window shape parameter provides a convenient
continuous control over the fundamental window trade-
off between side-lobe level and main-lobe width. Larger
the value  provides lower side-lobe levels, but at the
price of a wider main lobe. Widening the main lobe
reduces frequency resolution when the window is used
for spectrum analysis.

IV. IMPLEMENTATION OF TUNING

PROCEDURE

An FIR digital filter operation is a linear convolution of

Fig.2 Frequency response of Kaiser window for =1.33 at different
the finite duration impulse response with the input signal values of 
sequence x (n) . The filtering operation in the frequency 3) Hanning window (=3.86)
domain is done using the FFT/IFFT algorithms [11].
Impulse response, h(n) for Kaiser window [12]. FIR
h(n) = wk (n)hd (n) where hd (n) are
filter is given by
the desired or ideal impulse response, and wk ( n) , the
Kaiser window sequence.
In this scheme, in place of impulse response coefficients,
window function coefficients wk ( n) are computed
corresponding to the initial filtering requirements. FFT of
wk (n) is then obtained by taking FRFT order = 1,
and is circularly convolved with the desired frequency
E-mail:*chaturvedi.somesh17@gmail.com,%miresearchlab@gmail.com
#
girish_parmar2002@yahoo.com., +shuklapec@rediffmail.com

345
 Fig.5 Frequency response of Kaiser window for =7.04 at different
values of 

Fig.3 Frequency response of Kaiser window for =3.86 at different

values of 
6) Kaiser w indow (=3)
4) Hamming window (=4.86)

Fig.6 Frequency response of Kaiser window for =3 at

Fig.4 Frequency response of Kaiser window for =4.86 at different
values of  different values of 

VI. CONCLUSION
5) Blackman window (=7.04)
In this paper we implemented FRFT Rectangular
,Bartlett, Hanning, Hamming and Blackman window

E-mail:*chaturvedi.somesh17@gmail.com,%miresearchlab@gmail.com
#
girish_parmar2002@yahoo.com., +shuklapec@rediffmail.com

346
from FRFT Kaiser window as the parameter  changed
for different values =0,1.33,3.86,4.86,7.04 and 3.
FIR filters should have less transition region and less
ripples in the pass and stop band. This can be achieved by
reducing the main lobe width and side lobe level. From
this work we can get the optimal FIR filters by using
FRFT, As  decreases from 1 to 0.1 main lobe width
decreases .So we can reduces the transition region.
In the conventional method of filter design, if the
transition band of an existing filter is to be sharpened a
filter redesign involving re-computation of impulse
response coefficients is required or we can cascade mere
filters in series. In this work, variability in the transition
band characteristics has been achieved by designing the
filter by convolving the FRFT of window function. This
approach does not require a redesign involving the
computation of impulse response coefficients as
decreasing the FRFT angle is observed to be analogous to
increasing the filter order. Computational burden can thus
be reduced by this method as sharp transitions are
obtained on line by simply reducing the FRFT order.

REFERENCES

[1] L.B. Almeida, The Fractional Fourier transform and time

frequency Representation, IEEE trans. Signal Processing, vol.
42, pp.3084-3091, Nov. 1994
[2]. J.R.Fonollosa and C.L.Nikias, A new time-frequency
distribution, in Proc. IEEE Int. Conf. Accoust, Speech, Signal
Processing, 1994, pp.IV-301-304
[3]. P.V.Muralidhar, A.S.SrinavasaRao, Dr. S. K. Nayak
FractionalFourier Transform Based FIR Window Function by;
Proceedings ofIInd International conference RSPS-2010
sponsored byIEEE(Hyderabad section).
[4] F. Hlawatsch and G. F. Bourdeaux-Bartels, Linear and quadratic
ime frequency signal representations, IEEE Signal Processing
Mag., vol. 9,no. 2, pp. 2147, Apr. 1992.
[5] M. R. Port off, Time-frequency representation of digital signals
and systems based on short-time Fourier analysis, IEEE Trans.
Acoust.,Speech, Signal Processing, vol. ASSP-28, no. 1, pp. 55-
69, Feb.1980.
[6] L. Cohen, Time-frequency distributions-A review, Proc. IEEE,
vol.77, no. 7, pp. 941-981, July 1989
[7] L. B. Almeida, An introduction to the angular Fourier
transform, inProc. 1993 IEEE Int. Con$ Acoust., Speech,
Signal Processing (Minneapolis,MN), April 1993.
[8] LJ. Stankovia, T. Alieva, M. J. Bastiaans: "Fractional-Fourier-
domain weighted Wigner distribution", IEEECon$ SSPA,
Singapore, August 200 1.
[9] B. Santhanam and J. H. McClellan, The discrete rotational
Fourier transform, IEEE Trans. Signal Processing, vol. 42, pp.
994998, Apr.1996.
[10] H. M. Ozaktas, O. Arikan, M. A. Kutay, and G. Bozdagi, Digital
computationof the fractional Fourier transform, IEEE Trans.
Signal Processing,vol. 44, pp. 21412150, Sept. 1996.
[11]. D. J. DeFatta, J. G. Lucas, and W. S. Hodgkiss, Digital
Signal processing: A system design approach, Wiley (1995).
[12]. J. F. Kaiser, Nonrecursive digital filter design using the I0-
Sinh window function, Proc. IEEE Int. Symp. Circuits
System, 202 (1974).

E-mail:*chaturvedi.somesh17@gmail.com,%miresearchlab@gmail.com
#
girish_parmar2002@yahoo.com., +shuklapec@rediffmail.com

347