File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Multiplier-less discrete sinusoidal and lapped transforms using sum-of-powers-of-two (SOPOT) coefficients

TitleMultiplier-less discrete sinusoidal and lapped transforms using sum-of-powers-of-two (SOPOT) coefficients
Authors
KeywordsElectronics
Issue Date2001
PublisherIEEE.
Citation
Proceedings - Ieee International Symposium On Circuits And Systems, 2001, v. 2, p. II13-II16 How to Cite?
AbstractThis paper proposes a new family of multiplier-less discrete cosine and sine transforms called the SOPOT DCTs and DSTs. The fast algorithm of Wang [10] is used to parameterize all the DCTs and DSTs in terms of certain (2×2) matrices, which are then converted to SOPOT representation using a method previously proposed by the authors [7]. The forward and inverse transforms can be implemented with the same set of SOPOT coefficients. A random search algorithm is also proposed to search for these SOPOT coefficients. Experimental results show that the (2×2) basic matrix can be implemented, on the average, in 6 to 12 additions. The proposed algorithms therefore require only O(N log2N) additions, which is very attractive for VLSI implementation. Using these SOPOT DCTs/DSTs, a family of SOPOT Lapped Transforms (LT) is also developed. They have similar coding gains but much lower complexity than their real-valued counterparts.
Persistent Identifierhttp://hdl.handle.net/10722/46218
ISSN

 

DC FieldValueLanguage
dc.contributor.authorChan, SCen_HK
dc.contributor.authorYiu, PMen_HK
dc.date.accessioned2007-10-30T06:45:02Z-
dc.date.available2007-10-30T06:45:02Z-
dc.date.issued2001en_HK
dc.identifier.citationProceedings - Ieee International Symposium On Circuits And Systems, 2001, v. 2, p. II13-II16en_HK
dc.identifier.issn0271-4310en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46218-
dc.description.abstractThis paper proposes a new family of multiplier-less discrete cosine and sine transforms called the SOPOT DCTs and DSTs. The fast algorithm of Wang [10] is used to parameterize all the DCTs and DSTs in terms of certain (2×2) matrices, which are then converted to SOPOT representation using a method previously proposed by the authors [7]. The forward and inverse transforms can be implemented with the same set of SOPOT coefficients. A random search algorithm is also proposed to search for these SOPOT coefficients. Experimental results show that the (2×2) basic matrix can be implemented, on the average, in 6 to 12 additions. The proposed algorithms therefore require only O(N log2N) additions, which is very attractive for VLSI implementation. Using these SOPOT DCTs/DSTs, a family of SOPOT Lapped Transforms (LT) is also developed. They have similar coding gains but much lower complexity than their real-valued counterparts.en_HK
dc.format.extent429987 bytes-
dc.format.extent1825 bytes-
dc.format.extent27162 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofProceedings - IEEE International Symposium on Circuits and Systemsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2001 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_HK
dc.subjectElectronicsen_HK
dc.titleMultiplier-less discrete sinusoidal and lapped transforms using sum-of-powers-of-two (SOPOT) coefficientsen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0271-4302&volume=2&spage=13&epage=16&date=2001&atitle=Multiplier-less+discrete+sinusoidal+and+lapped+transforms+using+sum-of-powers-of-two+(sopot)+coefficientsen_HK
dc.identifier.emailChan, SC:scchan@eee.hku.hken_HK
dc.identifier.authorityChan, SC=rp00094en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ISCAS.2001.920994en_HK
dc.identifier.scopuseid_2-s2.0-0034995954en_HK
dc.identifier.hkuros58465-
dc.identifier.volume2en_HK
dc.identifier.spageII13en_HK
dc.identifier.epageII16en_HK
dc.identifier.scopusauthoridChan, SC=13310287100en_HK
dc.identifier.scopusauthoridYiu, PM=6701686204en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats