Fast algorithm for the 3-D DCT-II

Recently, many applications for three-dimensional (3-D) image and video compression have been proposed using 3-D discrete cosine transforms (3-D DCTs). Among different types of DCTs, the type-II DCT (DCT-II) is the most used. In order to use the 3-D DCTs in practical applications, fast 3-D algorithms are essential. Therefore, in this paper, the 3-D vector-radix decimation-in-frequency (3-D VR DIF) algorithm that calculates the 3-D DCT-II directly is introduced. The mathematical analysis and the implementation of the developed algorithm are presented, showing that this algorithm possesses a regular structure, can be implemented in-place for efficient use of memory, and is faster than the conventional row-column-frame (RCF) approach. Furthermore, an application of 3-D video compression-based 3-D DCT-II is implemented using the 3-D new algorithm. This has led to a substantial speed improvement for 3-D DCT-II-based compression systems and proved the validity of the developed algorithm

Coherent multidimensional spectroscopy in the gas phase

Recent work applying multidimentional coherent electronic spectroscopy at dilute samples in the gas phase is reviewed. The development of refined phase-cycling approaches with improved sensitivity has opened-up new opportunities to probe even dilute gas-phase samples. In this context, first results of 2-dimensional spectroscopy performed at doped helium droplets reveal the femtosecond dynamics upon electronic excitation of cold, weakly-bound molecules, and even the induced dynamics from the interaction with the helium environment. Such experiments, offering well-defined conditions at low temperatures, are potentially enabling the isolation of fundamental processes in the excitation and charge transfer dynamics of molecular structures which so far have been masked in complex bulk environments.Comment: Invited Review Articl

Advanced Synthetic Aperture Radar Based on Digital Beamforming and Waveform Diversity

This paper introduces innovative SAR system concepts for the acquisition of high resolution radar images with wide swath coverage from spaceborne platforms. The new concepts rely on the combination of advanced multi-channel SAR front-end architectures with novel operational modes. The architectures differ regarding their implementation complexity and it is shown that even a low number of channels is already well suited to significantly improve the imaging performance and to overcome fundamental limitations inherent to classical SAR systems. The more advanced concepts employ a multidimensional encoding of the transmitted waveforms to further improve the performance and to enable a new class of hybrid SAR imaging modes that are well suited to satisfy hitherto incompatible user requirements for frequent monitoring and detailed mapping. Implementation specific issues will be discussed and examples demonstrate the potential of the new techniques for different remote sensing applications

Results on lattice vector quantization with dithering

The statistical properties of the error in uniform scalar quantization have been analyzed by a number of authors in the past, and is a well-understood topic today. The analysis has also been extended to the case of dithered quantizers, and the advantages and limitations of dithering have been studied and well documented in the literature. Lattice vector quantization is a natural extension into multiple dimensions of the uniform scalar quantization. Accordingly, there is a natural extension of the analysis of the quantization error. It is the purpose of this paper to present this extension and to elaborate on some of the new aspects that come with multiple dimensions. We show that, analogous to the one-dimensional case, the quantization error vector can be rendered independent of the input in subtractive vector-dithering. In this case, the total mean square error is a function of only the underlying lattice and there are lattices that minimize this error. We give a necessary condition on such lattices. In nonsubtractive vector dithering, we show how to render moments of the error vector independent of the input by using appropriate dither random vectors. These results can readily be applied for the case of wide sense stationary (WSS) vector random processes, by use of iid dither sequences. We consider the problem of pre- and post-filtering around a dithered lattice quantifier, and show how these filters should be designed in order to minimize the overall quantization error in the mean square sense. For the special case where the WSS vector process is obtained by blocking a WSS scalar process, the optimum prefilter matrix reduces to the blocked version of the well-known scalar half-whitening filter