If the desired sample-rate is an integer multiple of the existing one, it is sufficient to oversample the input using an interpolation filter. Likewise, if the existing sample-rate is an integer multiple of the one you want out, you can employ a decimation or undersampling. However, if the ratio between input and output sample-rate is an arbitrary number, matters become more complicated. An arb...

Abstract The problem of synchronous Fractional Sample Rate Conversion (FSRC) of a digital signal by L/M, where L and M are coprime integers [3,13], is revisited. Based on a novel approach two different efficient causal block implementations of FSRC are concurrently derived and compared with each other. While the computational load of both structures, being performed in an LTI MIMO subsystem at ...

The evolution towards applications with increasing functionalities leads to the need of high flexible systems that support a high number of different standards while decreasing the required hardware space. Therefore a high configurable platform being able to handle a multitude of standards is needed. One main issue is the tradeoff between performance and space consumption. We present a generic,...

In this paper, we propose a new motion estimation method. The proposed motion estimation method enhances the image quality by using the temporal symmetry in the phase correlation method. Experimental results show that the average PSNR of the proposed method is up to 1.36 dB higher than that of the benchmark methods. Also, the computation time of the proposed method is very low compared to the b...

In this paper, we present a novel algorithm for sampling rate conversion by an arbitrary factor. Theoretically, sampling rate conversion of a discrete-time (DT) sequence can be performed by converting the sequence to a series of continuous-time (CT) impulses. This series of impulses is filtered with a CT lowpass filter, and the output is then sampled at the desired rate. If the CT filter is cho...

A frame interpolation algorithm for frame rate up-conversion of progressive image sequences is proposed. The algorithm is based on simple motion compensation and linear interpolation. A motion vector is searched for each pixel in the interpolated image and the resulting motion eld is median ltered to remove inconsistent vectors. Averaging along the motion trajectory is used to produce the inter...

In this paper, a novel block-based motion compensated frame interpolation (MCI) algorithm is proposed to enhance the temporal resolution of video sequences. We formulated motion estimation into MAP framework, and solved it via Bayesian belief propagation. By effectively incorporating a priori knowledge of the motion field and optimizing the whole motion field synchronously, it could derive more...

1961 APPENDIX 1) m-sequences: We use the notation fa a ag to denote the sequence fa 1 ; a 2 ; 111g, and fa a a k g to denote the shifted sequence fa k+1 ; a k+2 ; 1 11g. We consider a binary m-sequence fa a ag with period P. Some properties of m-sequences which will be used in our discussion in Section IV are [10] • A1: One period of an m-sequence contains exactly (P + 1)=2 ones and (P 0 1)=2 z...