File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Error analysis and complexity optimization for the multiplier-less FFT-like transformation (ML-FFT)

TitleError analysis and complexity optimization for the multiplier-less FFT-like transformation (ML-FFT)
Authors
KeywordsElectronics
Issue Date2004
PublisherIEEE.
Citation
Proceedings - Ieee International Symposium On Circuits And Systems, 2004, v. 3, p. III401-III404 How to Cite?
AbstractThis paper studies the effect of the signal round-off errors on the accuracies of the multiplier-less Fast Fourier Transform-like transformation (ML-FFT). The idea of the ML-FFT is to parameterize the twiddle factors in the conventional FFT algorithm as certain rotation-like matrices and approximate the associated parameters inside these matrices by the sum-of-power-of-two (SOPOT) or canonical signed digits (CSD) representations. The error due to the SOPOT approximation is called the coefficient round-off error. Apart from this error, signal round-off error also occurs because of insufficient wordlengths. Using a recursive noise model of these errors, the minimum hardware to realize the ML-FFT subject to the prescribed output bit accuracy can be obtained using a random search algorithm. A design example is given to demonstrate the effectiveness of the proposed approach.
Persistent Identifierhttp://hdl.handle.net/10722/46429
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorTsui, KMen_HK
dc.contributor.authorChan, SCen_HK
dc.contributor.authorTse, KWen_HK
dc.date.accessioned2007-10-30T06:49:40Z-
dc.date.available2007-10-30T06:49:40Z-
dc.date.issued2004en_HK
dc.identifier.citationProceedings - Ieee International Symposium On Circuits And Systems, 2004, v. 3, p. III401-III404en_HK
dc.identifier.issn0271-4310en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46429-
dc.description.abstractThis paper studies the effect of the signal round-off errors on the accuracies of the multiplier-less Fast Fourier Transform-like transformation (ML-FFT). The idea of the ML-FFT is to parameterize the twiddle factors in the conventional FFT algorithm as certain rotation-like matrices and approximate the associated parameters inside these matrices by the sum-of-power-of-two (SOPOT) or canonical signed digits (CSD) representations. The error due to the SOPOT approximation is called the coefficient round-off error. Apart from this error, signal round-off error also occurs because of insufficient wordlengths. Using a recursive noise model of these errors, the minimum hardware to realize the ML-FFT subject to the prescribed output bit accuracy can be obtained using a random search algorithm. A design example is given to demonstrate the effectiveness of the proposed approach.en_HK
dc.format.extent319205 bytes-
dc.format.extent3821 bytes-
dc.format.extent1822 bytes-
dc.format.extent27162 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
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©2004 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.titleError analysis and complexity optimization for the multiplier-less FFT-like transformation (ML-FFT)en_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0271-4302&volume=3&spage=401&epage=404&date=2004&atitle=Error+analysis+and+complexity+optimization+for+the+multiplier-less+FFT-like+transformation+(ML-FFT)en_HK
dc.identifier.emailTsui, KM: kmtsui11@hku.hken_HK
dc.identifier.emailChan, SC: ascchan@hkucc.hku.hken_HK
dc.identifier.emailTse, KW: kwtse@eee.hku.hken_HK
dc.identifier.authorityTsui, KM=rp00181en_HK
dc.identifier.authorityChan, SC=rp00094en_HK
dc.identifier.authorityTse, KW=rp00180en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ISCAS.2004.1328768en_HK
dc.identifier.scopuseid_2-s2.0-4344673746en_HK
dc.identifier.hkuros90059-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-4344673746&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume3en_HK
dc.identifier.spageIII401en_HK
dc.identifier.epageIII404en_HK
dc.identifier.scopusauthoridTsui, KM=7101671591en_HK
dc.identifier.scopusauthoridChan, SC=13310287100en_HK
dc.identifier.scopusauthoridTse, KW=7102609851en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats