Sei sulla pagina 1di 6

OPTIMAL TREE DESIGN FOR WAVELET PACKET

MODULATION
Rohit Kamath (08307920)
Sarang Pendharkar(08307002)
Nitin Soni(08307R24)

Abstract:- Wavelet Packet Modulation (WPM) can be seen as a modified version of


OFDMA system. The bandwidth performance of WPM is said to be similar to OFDM
systems but has some benefits such as flexibility in selection of carriers and elimination of
the need for a circular prefix [1]. This project aims at implementing a WPM system by
choosing the right tree structure which would minimize the mean square error between the
desired and received signal for a particular channel condition. This is achieved by Adaptive
wavelet packet filter bank. Effect of using different family of wavelets is also observed.

1. Introduction to Wavelet Packet Modulation


In the orthogonal wavelet decomposition technique any signal is decomposed into its
approximation coefficients and detailed coefficients. And in the next step only the
approximation part is similarly decomposed and the detailed part is untouched. But in case of
wavelet packet decomposition both the approximation and detailed part of the signal is
further analysed. This decomposition results in a binary tree structure. Various tree structures
are possible for a given depth of stages fig.1 .

Fig.1 Different possible tree structures in WPT

Wavelet packet decomposition generates a set of orthogonal bases for a given


function. These bases can be used to carry symbols to give rise to a multidimensional
modulation technique. Since these bases are orthogonal in frequency, such system is very
similar to a multicarrier OFDM system. The wavelet packet bases are localized both in time
and frequency. The following block diagram with elaborated tree structure shows a basic
structure of a Wavelet packet modulation system.
Fig.2(a) WPM transmitter (b) receiver

2. Optimal Tree Design

The performance of a multicarrier modulating system directly depends on the


waveforms it makes use of. Since several fading effects and noise conditions of the channel
can severely degrade a particular waveform while may, effect less on the others. Hence the
choice of proper bases function for modulation is very important. As different binary tree
structures gives rise to different set of bases function. Different wavelet packet bases have
different immunity levels to the various effects of the channel, such as ISI and addition of
Gaussian noise. One of the reasons being, the distance between the time-frequency tiles of
various wavelet packet bases. Hence choosing the right tree structure becomes an important
problem.
Best Tree selection has been done in various different ways in the literature. One of
the widely used one is using the entropy of the input signal. In this project we are using an
LMS approach to choose the most appropriate tree structure [3]. Here we estimate the
channel condition at the transmitter and get the optimal filter weights using LMS algorithm
on the estimated signal and a predefined desired signal. The tree which converges the fastest
and with minimum of mean square error is chosen to be the optimum tree, and is used for
transmission. Every tree structure needs to provide equal bit rate to maintain consistency.

3. Implementation of wavelet packet transform with adaptive filters


To reduce complexity we have implemented the tree structures with depth of two. At
the transmitter, to realize Quadrature Amplitude modulation (QAM), four orthogonal wavelet
packet bases are chosen as carriers each of which is modulated using single serial to parallel
converted data (M-ary). These four bases are passed through the wavelet packet synthesis
filter to get a single time domain signal, which will be transmitted.
Fig. 3 Figure demonstrating Nobel’s
identity for downsampling

At the receiver an Adaptive wavelet packet analysis filter is used to get back the four
orthogonal wavelet packet bases. And the data can be extracted out of them by taking a dot
product with the corresponding bases functions. The structure of the filter bank is simplified
by using Nobel’s Identity for downsampling and upsampling fig. 3. And each branch of the
analysis filter uses an adaptive filter to reduce the noise and fading effects. Structure of the
adaptive filter is shown in fig.4(a)

Fig. 4(a) Adaptive modification of receiver Wave packet analysis part (b) Transversal adaptive filter

A single input adaptive transversal filter is used in each branch of the modified tree,
fig.4(b). Weight update equation for LMS is given by
ܹ௡ାଵ = ܹ௡ + 2ߤ݁௡ ܺ௡
Where Wn is the adaptive weights of the filter at nth iteration, en = dn-yn and Xn is the
input signal vector taken L at a time, where L is the number of taps in the filter.
The advantage of having such an adaptive filter is that it provides the necessary
filtering to the decomposed signal which would reduce the effect of channel on the
transmitted signal. After enough number of iterations this filter can effectively remove many
channel effects
Here we try to replicate the conditions of the receiver at the transmitter itself. Hence a
simulated noisy input (x’(n))
x’(n)) is given to the replica of receiver along with a predefined
desired signal, fig.5(a).. The adaptive filter part in each branch of the analysis filter bank
adjusts its weights suitable to the channel condition and hence the LMS algorithm converges
after several iterations.. The same procedure is simultaneously repeated for each tree structure
and the best tree is the one which has minimum mean square error (MSE) at the end of
transmission of the predefined signal.
signal
At the receiver a similar structure is built where in, the tree structure with minimum
MSE is selected for decoding. For this to happen,happen initial training sequence needs to be
transmitted.
As mentioned earlier that we need to maintain a constant bit rate irrespective of the
tree structure, for a particular depth. In order to achieve this, more bits are given in series to
certain branches which have less number of filters in cascade than others. For example
considering the tree shown in fig.1(b) the first branch is given two symbols of information,
informatio
whereas others are given single symbol.

4. Results and Inferences


We have implemented the LMS algorithm for two tree structures given in fig.1(a)
fig.1( and
(b). Channel conditions of Additive white Gaussian noise and different impulse responses of
channel have been tried. It is observed that WPM with adaptive filters gives very good
performance even under as low SNR as -10db. Haar and DB6 wavelet packet packe bases were used
for this project.. Performance of DB6 bases is better compared to that of Haar bases under low
SNR conditions. Also the minimum MSE is higher in case of Haar bases. The results
obtained for two tree structures for SNR of 10db through a AWGN N channel is given as
follows.

Fig. 5 db6 Wavelet packet bases transmitted and received (tree1


( 10db SNR)
Fig. 6 Symbols transmitted and received (10db SNR)

Fig. 7 LMS mean square error against iterations for tree1 and tree2

Notice that in fig.6 initial training symbols received are in error. After the
convergence of LMS the output symbols are correct. Also in fig.7 minimum MSE is less for
tree1.
Conclusion

Wavelet Packet Modulation with adaptive filter gives very good performance even
under very low SNR conditions. These wavelet packets are more immune to Inter symbol
interference and inter channel interference. Different channel conditions require transmission
using different tree structures for better performance. This modulation scheme gives more
flexibility in the selection of carriers which is very much required in future communication
systems such as cognitive radio.
References
[1] Antony Jamin and Petri Mahonen "Wavelet Packet modulation for wireless
communications", Wireless Comm and Mobile Comm Journal, Mar 2006, Vol. 5, Issue
2.
[2] R. Lindsey and J. C. Dill, “Wavelet packet modulation: a generalized method for
orthogonally multiplexed communications,” in IEEE 27th Southeastern Symposium on
System Theory, 1995, pp. 392–396
[3] Zhong Weizhi, Guo Qing, Yang Mingchuan and Guo Yan, “Optimal Tree Design for
Wavelet Packet Modulation Based on Adaptive Least Mean Square Algorithm”, IEEE,
Wireless Comm, Netw and Mobile Computing, 2008. WiCOM '08. 4th Intl Conf on 12-
14 Oct. 2008 Page(s):1 - 4
[4] A.R. Lindsey , “Generalised Orthogonally Multiplexed Communication Via Wavelet
Packet Bases”, Ph.D. Thesis,Ohio University,1995.
[5] Jingmin Xin and Akira Sano, “Adaptive System Identification Based on Generalized
Wavelet Decomposition”, Applied Mathematics And Computation, 69:97-109
,Elsevier Science Inc., 1995
[6] N. Gonz´alez Prelcic, F. P´erez Gonz´alez and M.E. Dom´ınguez Jim´enez, “Wavelet
Packet-Based Subband Adaptive Equalization” , ResearchProject Ref. TIC-96-0500-
C10-10.
[7] Zajing Chen, Nurgen Erdol and Feng Bao, “Adaptive Filter With Wavelet Filter
Bank”,IEEE ,SOUTHCON’95.
[8] Li-ping Zhu, Yi-Sheng Zhu, senior member, Huilan Zou, Zhihong Chen, “Performance
Of Wavelet Packet Mdulation-based Multicarrer Spread spectrum System Over
Rayleigh Fading Channel” , CCECE/CCGEI May 5-7 2008 Niagara Falls. Canada 978-1-
4244-1643-1/08/$25.00 _ 2008 IEEE
[9] Gao,Xingxin, Lu Mingquan and Feng Zhenming, “Optimal wavelet packet based
Multicarrier Modulation Over Multipath Wireless channel, IEEE 0-7803-7547-5/02,
2002
[10] Alan R. Lindsey “Wavelet Packet Modulation for Orthogonally Multiplexed
Communication” IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 45, NO. 5, MAY
1997

Potrebbero piacerti anche