Ephraim Feig
IEEE Transactions on Magnetics
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 Magnetics
Louis Auslander, Ephraim Feig, et al.
IEEE Transactions on Acoustics, Speech, and Signal Processing
Don Coppersmith, Ephraim Feig, et al.
IEEE TSP
Ephraim Feig, Elliot Linzer
Advances in Applied Mathematics