File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Multiplier-less real-valued FFT-like transformation (ML-RFFT) and related real-valued transformations

TitleMultiplier-less real-valued FFT-like transformation (ML-RFFT) and related real-valued transformations
Authors
Issue Date2003
Citation
Proceedings - Ieee International Symposium On Circuits And Systems, 2003, v. 4, p. IV257-IV260 How to Cite?
AbstractThis paper proposes a new multiplier-less Fast Fourier Transform-like (ML-RFFT) transformation for real-valued sequence. Like the ML-FFT, it parameterizes the twiddle factors in the conventional radix-2n or split-radix real-valued FFT algorithm as certain rotation-like matrices and approximates the associated parameters inside these matrices by the sum-of-power-of-two (SOPOT) or canonical signed digits (CSD) representations. Because of the symmetry in the algorithm, it only requires about half the number of additions as required by the ML-FFT. Moreover, using the mappings between the DFT and the DCTs and DWTs, new ML-FFT-based transformation called ML-DCTs and ML-DWTs are derived. Design examples of the new transformations are given to demonstrate the proposed approach.
Persistent Identifierhttp://hdl.handle.net/10722/158408
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorChan, SCen_US
dc.contributor.authorTsui, KMen_US
dc.date.accessioned2012-08-08T08:59:29Z-
dc.date.available2012-08-08T08:59:29Z-
dc.date.issued2003en_US
dc.identifier.citationProceedings - Ieee International Symposium On Circuits And Systems, 2003, v. 4, p. IV257-IV260en_US
dc.identifier.issn0271-4310en_US
dc.identifier.urihttp://hdl.handle.net/10722/158408-
dc.description.abstractThis paper proposes a new multiplier-less Fast Fourier Transform-like (ML-RFFT) transformation for real-valued sequence. Like the ML-FFT, it parameterizes the twiddle factors in the conventional radix-2n or split-radix real-valued FFT algorithm as certain rotation-like matrices and approximates the associated parameters inside these matrices by the sum-of-power-of-two (SOPOT) or canonical signed digits (CSD) representations. Because of the symmetry in the algorithm, it only requires about half the number of additions as required by the ML-FFT. Moreover, using the mappings between the DFT and the DCTs and DWTs, new ML-FFT-based transformation called ML-DCTs and ML-DWTs are derived. Design examples of the new transformations are given to demonstrate the proposed approach.en_US
dc.languageengen_US
dc.relation.ispartofProceedings - IEEE International Symposium on Circuits and Systemsen_US
dc.titleMultiplier-less real-valued FFT-like transformation (ML-RFFT) and related real-valued transformationsen_US
dc.typeConference_Paperen_US
dc.identifier.emailChan, SC:scchan@eee.hku.hken_US
dc.identifier.emailTsui, KM:kmtsui@eee.hku.hken_US
dc.identifier.authorityChan, SC=rp00094en_US
dc.identifier.authorityTsui, KM=rp00181en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-17944392354en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-17944392354&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume4en_US
dc.identifier.spageIV257en_US
dc.identifier.epageIV260en_US
dc.identifier.scopusauthoridChan, SC=13310287100en_US
dc.identifier.scopusauthoridTsui, KM=7101671591en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats