Ephraim Feig, Elliot Linzer
Advances in Applied Mathematics
Given efficient scaled discrete cosine transforms (DCT's) of size p and q, where p and q are relatively prime, we present methods for constructing fast algorithms to compute scaled DCT's and scaled inverse DCT's of size pq. Extensions to multidimensional transforms are also given. © 1995 IEEE
Ephraim Feig, Elliot Linzer
Advances in Applied Mathematics
Viresh Ratnakar, Ephraim Feig, et al.
IS&T/SPIE Electronic Imaging 1995
Ephraim Feig
Journal of Algorithms
Ephraim Feig, Fred Greenleaf
Applied Optics