On the theoretical lower bound of the multiplicative complexity for DCT

Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1504

Title:	On the theoretical lower bound of the multiplicative complexity for DCT
Authors:	Chan, YH Siu, WC
Issue Date:	1993
Source:	1993 IEEE International Symposium on Circuits and Systems : Chicago, IL, May 3-6, 1993, p. 750-753
Abstract:	In this paper, we present a discussion on DCT algorithms based on convolutions. It is shown that these approaches can provide effective solutions to realize DCTs. Besides, they provide a theoretical lower bound on the number of multiplications required for the realization of DCTs. Some fast short length DCT algorithms have also been derived from these approaches.
Keywords:	Algorithms Computational complexity Digital arithmetic
Publisher:	IEEE
ISBN:	0-7803-1254-6
Rights:	© 1993 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Appears in Collections:	Conference Paper

File	Description	Size	Format
Multiplicative complexity for DCT_93.pdf		304.6 kB	Adobe PDF	View/Open

Status	open access
File Version	Version of Record

View full-text via PolyU eLinks

147

Last Week
2

Last month

Citations as of Apr 14, 2024

146

Citations as of Apr 14, 2024

Check