Ephraim Feig
IEEE Transactions on Communications
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
IEEE Transactions on Communications
Ephraim Feig
IEEE Transactions on Magnetics
Ephraim Feig, Michael Ben-Or
Linear Algebra and Its Applications
Viresh Ratnakar, Ephraim Feig, et al.
IS&T/SPIE Electronic Imaging 1995