27 citations · 60 across the 15 of their papers we have counts for
17 papers
Numerical Stability of DFT Computation for Signals with Structured Support
Charantej Reddy Pochimireddy, Aditya Siripuram, Brad Osgood
We consider the problem of building numerically stable algorithms for computing Discrete Fourier Transform (DFT) of - length signals with known frequency support of size . A…
Best Möbius approximations of convex and concave mappings
Martin Chuaqui, Brad Osgood
We study the best Möbius approximations (BMA) to convex and concave conformal mappings of the disk, including the special case of mappings onto convex polygons. The crucial factor…
Fast DFT Computation for Signals with Structured Support
Charantej Reddy P, Aditya Siripuram, Brad Osgood
Suppose an length signal has known frequency support of size . Given sample access to this signal, how fast can we compute the DFT? The answer to this question depends on th…
A Note on the Convolution of Circle Impulses
Brad Osgood
We present a formula for the convolution of two circle impulses. The derivation uses a classical addition theorem for Bessel functions.
Computing the Discrete Fourier Transform of signals with spectral frequency support
P Charantej Reddy, V S S Prabhu Tej, Aditya Siripuram +1
We consider the problem of finding the Discrete Fourier Transform (DFT) of length signals with known frequency support of size . When is a power of 2 and the frequency…
Convolution Idempotents with a given Zero-set
Aditya Siripuram, Brad Osgood
We investigate the structure of N-length discrete signals h satisfying h*h=h that vanish on a given set of indices. We motivate this problem from examples in sampling, Fuglede's co…