Jérôme Lebrun

Learn More
This correspondence deals with multiwavelets which are a recent generalization of wavelets in the context of time-varying lter banks and with their applications to signal processing and especially compression. By their inherent structure, multiwavelets are t for processing multi-channel signals. This is the main issue we will be interested in here. The(More)
—This paper deals with multiwavelets and the different properties of approximation and smoothness associated with them. In particular, we focus on the important issue of the preservation of discrete-time polynomial signals by multifilterbanks. We introduce and detail the property of balancing for higher degree discrete-time polynomial signals and link it to(More)
This paper deals with multiwavelets which are a recent generalization of wavelets in the context of multirate l-ter banks and their applications to signal processing and especially compression. By their inherent structure, multi-wavelets are t for processing multi-channel signals. First, we will recall some general results on multiwavelets and the(More)
Biorthogonal wavelets have been used with great success in most of the recent transform image coders. By using the new balanced multiwavelets, one can now easily design fully orthogonal linear phase FIR transform schemes. The aim of our work is to assess whether the added orthogo-nality yields a performance gain compared to traditional biorthogonal(More)
To combine the high power efficiency of Continuous Phase Modulation (CPM) with either high spectral efficiency or enhanced performance in low Signal to Noise conditions, some authors have proposed to introduce CPM in a MIMO frame, by using Space Time Codes (STC). In this paper, we address the code design problem of Space Time Block Codes combined with CPM(More)
In this paper, a new algorithm for the blind identification of SISO communication channels is introduced. Based on methods from computational algebraic geometry, the approach achieves a full description of the solution space and thus avoids the local minima issue of adaptive algorithms. Furthermore, unlike most symbolic methods, the computational cost is(More)
In this paper, we introduce further our recently designed family of L 2 orthogonal Space-Time codes for CPM. With their advantage of maintaining both the constant envelope properties of CPM, the diversity of Space-Time codes and moreover orthogonality, and thus reduced decoding complexity, these codes are also full rate, even for more than two transmitting(More)