Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1517
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electrical Engineering-
dc.creatorSiu, WC-
dc.creatorChan, YH-
dc.creatorChau, LP-
dc.date.accessioned2014-12-11T08:26:27Z-
dc.date.available2014-12-11T08:26:27Z-
dc.identifier.isbn0-7803-2431-5-
dc.identifier.urihttp://hdl.handle.net/10397/1517-
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.rights© 1995 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.en_US
dc.rightsThis 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.en_US
dc.subjectAlgorithmsen_US
dc.subjectBinary sequencesen_US
dc.subjectCalculationsen_US
dc.subjectComputational complexityen_US
dc.subjectElectric filtersen_US
dc.subjectMathematical modelsen_US
dc.subjectMathematical transformationsen_US
dc.subjectNumerical analysisen_US
dc.subjectRecursive functionsen_US
dc.subjectStatistical methodsen_US
dc.subjectComputational methodsen_US
dc.subjectDigital signal processingen_US
dc.subjectFunctionsen_US
dc.subjectNumerical methodsen_US
dc.titleNew 2ⁿ discrete cosine transform algorithm using recursive filter structureen_US
dc.typeConference Paperen_US
dcterms.abstractIt is always desirable to look for more efficient algorithms for the realization of the discrete cosine transform (DCT). In this paper, we generalize a formulation for converting a length-2ⁿ DCT into n groups of equations, then apply a novel technique for its implementation. The sizes of the groups are 2[sup m], for m = n-1, ...., 0. While their structures are extremely regular. The realization can then be converted into the simplest recursive filter form, which is of particularly simple for practical implementation.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationICASSP : The 1995 International Conference on Acoustics, Speech and Signal Processing : conference proceedings : May 9-12, 1995, Detroit, Michigan, U.S.A., v. 2, p. 1169-1172-
dcterms.issued1995-
dc.identifier.scopus2-s2.0-0028996226-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
Recursive Filter Structure_95.pdf284.85 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

66
Last Week
0
Last month
Citations as of Jun 26, 2022

Downloads

42
Citations as of Jun 26, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.