Learn More
—Zero padding (ZP) of multicarrier transmissions has recently been proposed as an appealing alternative to the traditional cyclic prefix (CP) orthogonal frequency-division multiplexing (OFDM) to ensure symbol recovery regardless of the channel zero locations. In this paper, both systems are studied to delineate their relative merits in wireless systems(More)
The publication of the Cooley-Tukey fast Fourier transform (FIT) algorithm in 1965 has opened a new area in digital signal processing by reducing the order of complexity of some crucial computational tasks like Fourier transform and convolution from N 2 to N log2 N, where N is the problem size. The development of the major algorithms (Cooley-Tukey and(More)
We propose two related iterative algorithms for computing the capacity of discrete memoryless channels. The celebrated Blahut-Arimoto algorithm is a special case of our framework. The formulation of these algorithms is based on the natural gradient and proximal point methods. We also provide interpretations in terms of notions from information geometry. A(More)
—This paper proposes a new blind channel estimation method for orthogonal frequency division multiplexing (OFDM) systems. The algorithm makes use of the redundancy introduced by the cyclic prefix to identify the channel based on a subspace approach. Thus, the proposed method does not require any modification of the transmitter and applies to most existing(More)
— This paper presents a novel approach to the blind linear equalization of possibly nonminimum phase and time-varying communication channels. In the context of channel diversity , we introduce the concept of mutually referenced equalizers (MRE's) in which several filters are considered, the outputs of which act as training signals for each other. A(More)
Oversampled filter banks (OFBs) provide an overcomplete representation of their input signal. This paper describes how OFBs can be considered as error-correcting codes acting on real or complex sequences, very much like classical binary convolutional codes act on binary sequences. The structured redundancy introduced by OFBs in subband signals can be used(More)
Several algorithms are reviewed for computing various types of wavelet transforms: the Mallat algorithm, the " a trous " algorithm and their generalizations by Shensa. The goal is 1) to develop guidelines for implementing discrete and continuous wavelet transforms efficiently, 2) to compare the various algorithms obtained and give an idea of possible gains(More)