Show simple item record

dc.contributor.authorSuresh, T.
dc.date.accessioned2009-01-21T10:04:16Z
dc.date.available2009-01-21T10:04:16Z
dc.date.issued1996
dc.identifier.citationDefence Science Journal, Vol.46; 253-255p.
dc.identifier.urihttp://drs.nio.org/drs/handle/2264/2200
dc.description.abstractFast Fourier Transform (FFT) is an important tool required for signal processing in defence applications. This paper reports an improved method for generating bit reversed numbers needed in calculating FFT using radix-2. The refined algorithm takes advantage of some features of the bit reversed numbers, using intermediate array for storage and imporved procedure for calculating base values required when generating bit reversed numbers.
dc.language.isoen
dc.publisherDESIDOC, New Delhi
dc.rightsCopyright [1996]. All efforts have been made to respect the copyright to the best of our knowledge. Inadvertent omissions, if brought to our notice, stand for correction and withdrawal of document from this repository.
dc.subjectmethodology
dc.subjectinstruments
dc.subjectsignal processing
dc.subjectfourier analysis
dc.subjectalgorithms
dc.titleImproved method of generating bit reversed numbers for calculating fast fourier transform
dc.typeJournal Article


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record