dc.contributor.author | Suresh, T. | |
dc.date.accessioned | 2009-01-21T10:04:16Z | |
dc.date.available | 2009-01-21T10:04:16Z | |
dc.date.issued | 1996 | |
dc.identifier.citation | Defence Science Journal, Vol.46; 253-255p. | |
dc.identifier.uri | http://drs.nio.org/drs/handle/2264/2200 | |
dc.description.abstract | Fast 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.iso | en | |
dc.publisher | DESIDOC, New Delhi | |
dc.rights | Copyright [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.subject | methodology | |
dc.subject | instruments | |
dc.subject | signal processing | |
dc.subject | fourier analysis | |
dc.subject | algorithms | |
dc.title | Improved method of generating bit reversed numbers for calculating fast fourier transform | |
dc.type | Journal Article | |