Note on B-splines, wavelet scaling functions, and Gabor frames

Let g be a continuous, compactly supported function on such that the integer translates of g constitute a partition of unity. We show that the Gabor system (g,a,b), with window g and time-shift and frequency-shift parameters a,b>0 has no lower frame bound larger than 0 if b=2,3,... and a>0. In particular, (g,a,b) is not a Gabor frame if g is a continuous, compactly supported wavelet scaling function and if b=2,3,... and a>0. We give an example for our result for the case that g=B/sub 1/, the triangle function supported by [-1,1], by showing pictures of the canonical dual corresponding to (g,a,b) where ab=1/4 and b crosses the lines N=2,3,.     

Acceleration of the frame algorithm

Shows how polynomial acceleration techniques which have been developed for the solution of large linear systems can be employed to improve and accelerate the frame algorithm. These methods permit a reduction in the number of necessary iterations by an order of magnitude when the frame algorithm is slow. The author gives several examples from the theory of irregular sampling, from wavelet theory and from Gabor theory where these methods are probably mandatory for efficient reconstruction