Sequency Domain Design of Frequency Filters

Each discrete transform has its advantages over other transforms. Fourier domain filters are easier to design than Walsh domain filters. But Walsh transforms can be computed much faster than Fourier transforms. This paper considers the problem of designing a Walsh domain filter, given a Fourier domain filter. Same procedure can be applied to other transforms. Given a Slant filter its equivalent Fourier filter or Walsh ifiter can be found.