research-article

On the multiplicative complexity of discrete cosine transforms

Authors:

E. Feig,

S. WinogradAuthors Info & Claims

IEEE Transactions on Information Theory, Volume 38, Issue 4

Pages 1387 - 1391

https://doi.org/10.1109/18.144722

Published: 01 September 2006 Publication History

Abstract

The multiplicative complexity of discrete cosine transforms (DCTs) of arbitrary dimensions on input sizes, which are powers of two, are obtained. New upper bounds on the multiplicative complexity of scaled DCTs on input sizes, which are powers of two, are also obtained

Cited By

View all

Barbareschi MBarone SBosio AHan JTraiola M(2022)A Genetic-algorithm-based Approach to the Design of DCT Hardware AcceleratorsACM Journal on Emerging Technologies in Computing Systems10.1145/350177218:3(1-25)Online publication date: 29-Jan-2022
https://dl.acm.org/doi/10.1145/3501772
Ding KJiang DZeng FLin JYin J(2020)A Fast Transform Algorithm based on VVCProceedings of the 2020 4th International Conference on Computer Science and Artificial Intelligence10.1145/3445815.3445829(80-85)Online publication date: 11-Dec-2020
https://dl.acm.org/doi/10.1145/3445815.3445829
Liu XBao H(2015)Efficient Implementation of 2-D FCT with Reduced Memory Access for Programmable DSPsJournal of Signal Processing Systems10.1007/s11265-013-0851-280:2(153-161)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1007/s11265-013-0851-2
Show More Cited By

Recommendations

The discrete fractional cosine and sine transforms

This paper is concerned with the definitions of the discrete fractional cosine transform (DFRCT) and the discrete fractional sine transform (DFRST). The definitions of DFRCT and DFRST are based on the eigen decomposition of DCT and DST kernels. This is ...
Fractional cosine, sine, and Hartley transforms

In previous papers, the Fourier transform (FT) has been generalized into the fractional Fourier transform (FRFT), the linear canonical transform (LCT), and the simplified fractional Fourier transform (SFRFT). Because the cosine, sine, and Hartley ...
Symmetric convolution and the discrete sine and cosine transforms

This paper discusses the use of symmetric convolution and the discrete sine and cosine transforms (DSTs and DCTs) for general digital signal processing. The operation of symmetric convolution is a formalized approach to convolving symmetrically extended ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

IEEE Transactions on Information Theory Volume 38, Issue 4

July 1992

255 pages

ISSN:0018-9448

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 September 2006

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Barbareschi MBarone SBosio AHan JTraiola M(2022)A Genetic-algorithm-based Approach to the Design of DCT Hardware AcceleratorsACM Journal on Emerging Technologies in Computing Systems10.1145/350177218:3(1-25)Online publication date: 29-Jan-2022
https://dl.acm.org/doi/10.1145/3501772
Ding KJiang DZeng FLin JYin J(2020)A Fast Transform Algorithm based on VVCProceedings of the 2020 4th International Conference on Computer Science and Artificial Intelligence10.1145/3445815.3445829(80-85)Online publication date: 11-Dec-2020
https://dl.acm.org/doi/10.1145/3445815.3445829
Liu XBao H(2015)Efficient Implementation of 2-D FCT with Reduced Memory Access for Programmable DSPsJournal of Signal Processing Systems10.1007/s11265-013-0851-280:2(153-161)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1007/s11265-013-0851-2
Hatim ABelkouch SAakif MHassani MChabini N(2013)Design optimization of the quantization and a pipelined 2D-DCT for real-time applicationsMultimedia Tools and Applications10.1007/s11042-012-1043-y67:3(667-685)Online publication date: 1-Dec-2013
https://dl.acm.org/doi/10.1007/s11042-012-1043-y
Cintra R(2011)An Integer Approximation Method for Discrete Sinusoidal TransformsCircuits, Systems, and Signal Processing10.1007/s00034-011-9318-530:6(1481-1501)Online publication date: 1-Dec-2011
https://dl.acm.org/doi/10.1007/s00034-011-9318-5
Mikhael WMoataz MWahab ARagothaman P(2007)Novel transform domain principal component analysis (PCA) techniques and some applicationsProceedings of the 11th WSEAS International Conference on Computers10.5555/1353956.1354031(420-426)Online publication date: 26-Jul-2007
https://dl.acm.org/doi/10.5555/1353956.1354031
Pan ZPan WMilenkovic AYoo SEtzkorn L(2004)Complexity-distortion tradeoffs in variable complexity 2-D DCTProceedings of the 42nd annual ACM Southeast Conference10.1145/986537.986652(460-465)Online publication date: 2-Apr-2004
https://dl.acm.org/doi/10.1145/986537.986652

View Options

View options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

The discrete fractional cosine and sine transforms

Fractional cosine, sine, and Hartley transforms

Symmetric convolution and the discrete sine and cosine transforms

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations