Conference paper
Channel coding considerations for wireless LANs
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Paper
The multiplicative complexity of discrete cosine transforms
Abstract
We obtain the multiplicative complexity of discrete cosine transforms in all cases. It is given as a function of the multiplicative complexity of discrete Fourier transforms. The latter have all been determined previously. © 1992.
Related
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
Joy Y. Cheng, Daniel P. Sanders, et al.
SPIE Advanced Lithography 2008