Optimal Wavelet Packet Modulation under finite complexity constraint

Wavelet Packet Modulation (WPM) uses an arbitrary time-frequency plane tiling to create orthogonal subchannels of different bandwidths and symbol rates in a multichannel system. The Wavelet Packet Tree is implemented by iterating a perfect reconstruction two channel transmultiplexer. We derive operating conditions for the capacity-optimal tree for a given communication channel and power budget. We present a fast tree-selection algorithm which achieves this optimum for the case of a finite complexity transceiver. It is found that optimal-WPM outperforms conventional multichannel systems of equal complexity for ISI channels.

[1]  Shlomo Shamai,et al.  Information rates for a discrete-time Gaussian channel with intersymbol interference and stationary inputs , 1991, IEEE Trans. Inf. Theory.

[2]  Andrzej Drygajlo,et al.  Perceptual speech coding and enhancement using frame-synchronized fast wavelet packet transform algorithms , 1999, IEEE Trans. Signal Process..

[3]  K Ramchandran,et al.  Best wavelet packet bases in a rate-distortion sense , 1993, IEEE Trans. Image Process..

[4]  Martin Vetterli,et al.  Perfect transmultiplexers , 1986, ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  Michael A. Tzannes,et al.  Overlapped Discrete Multitone Modulation for High Speed Copper Wire Communication , 2006, IEEE J. Sel. Areas Commun..

[6]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[7]  Alan R. Lindsey,et al.  Wavelet packet modulation for orthogonally multiplexed communication , 1997, IEEE Trans. Signal Process..

[8]  Jelena Kovacevic,et al.  Wavelets and Subband Coding , 2013, Prentice Hall Signal Processing Series.