File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Multiplier-less implementation of linear phase cosine modulated filter banks with composite channel number

TitleMultiplier-less implementation of linear phase cosine modulated filter banks with composite channel number
Authors
Issue Date2002
Citation
Proceedings - Ieee International Symposium On Circuits And Systems, 2002, v. 4, p. IV/13-IV/16 How to Cite?
AbstractThis paper studies fast algorithm for implementing the multiplier-less discrete cosine transform and discrete sine transform required in the Linear-Phase Cosine-Modulated Filter Banks (LP-CMFB). It is shown that the modulation involves both the type-I discrete cosine transform (DCT-I) and discrete sine transform (DST-I) of the same sequence, which can be computed together via a real-valued discrete Fourier transform (DFT) and a real-valued odd-DFT. This in turn can be computed by fast Fourier transform (FFT) algorithm of appropriate length. The resulting algorithm is very efficient, highly regular and supports wide range of transform lengths. Using the proposed algorithm and a new multiplier-less FFT-like transformation, multiplier-less realization of the LP-CMFB is obtained. Its arithmetic complexity is analyzed and an example is given to illustrate the principle of the proposed algorithm.
Persistent Identifierhttp://hdl.handle.net/10722/158334
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorYiu, PMen_US
dc.contributor.authorChan, SCen_US
dc.date.accessioned2012-08-08T08:59:06Z-
dc.date.available2012-08-08T08:59:06Z-
dc.date.issued2002en_US
dc.identifier.citationProceedings - Ieee International Symposium On Circuits And Systems, 2002, v. 4, p. IV/13-IV/16en_US
dc.identifier.issn0271-4310en_US
dc.identifier.urihttp://hdl.handle.net/10722/158334-
dc.description.abstractThis paper studies fast algorithm for implementing the multiplier-less discrete cosine transform and discrete sine transform required in the Linear-Phase Cosine-Modulated Filter Banks (LP-CMFB). It is shown that the modulation involves both the type-I discrete cosine transform (DCT-I) and discrete sine transform (DST-I) of the same sequence, which can be computed together via a real-valued discrete Fourier transform (DFT) and a real-valued odd-DFT. This in turn can be computed by fast Fourier transform (FFT) algorithm of appropriate length. The resulting algorithm is very efficient, highly regular and supports wide range of transform lengths. Using the proposed algorithm and a new multiplier-less FFT-like transformation, multiplier-less realization of the LP-CMFB is obtained. Its arithmetic complexity is analyzed and an example is given to illustrate the principle of the proposed algorithm.en_US
dc.languageengen_US
dc.relation.ispartofProceedings - IEEE International Symposium on Circuits and Systemsen_US
dc.titleMultiplier-less implementation of linear phase cosine modulated filter banks with composite channel numberen_US
dc.typeConference_Paperen_US
dc.identifier.emailChan, SC:scchan@eee.hku.hken_US
dc.identifier.authorityChan, SC=rp00094en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0036287615en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0036287615&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume4en_US
dc.identifier.spageIV/13en_US
dc.identifier.epageIV/16en_US
dc.identifier.scopusauthoridYiu, PM=6701686204en_US
dc.identifier.scopusauthoridChan, SC=13310287100en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats