Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/16216
Title: Fast mersenne number transforms for the computation of discrete fourier transforms
Authors: Siu, WC 
Constantinides, AG
Keywords: Discrete Fourier transforms
Mersenne number transforms
Signal processing
Issue Date: 1985
Publisher: Elsevier
Source: Signal processing, 1985, v. 9, no. 2, p. 125-131 How to cite?
Journal: Signal processing 
Abstract: In this paper we present results on the computation of Discrete Fourier Transforms (DFT) using Mersenne Number Transforms (MNT). It is shown that in the case of Mersenne-composite Number Transforms, the number of multiplications per point for real input data is never more than one, even for sequence lengths exceeding one thousand points. The computation time per point for a length (2P + 1)-point DFT is simply equal to the time for one MNT multiplication and 3 MNT additions if a high-speed, parallel hardware module is used to implement the MNT unit. This new approach allows a large choice of wordlengths and in addition the control of data flow is extremely simple. We also present the results obtained by using Winograd's Fourier Transform Algorithm and the nested MNT to compute efficiently the DFT's of long sequences. We also show that the number of additions can be reduced significantly if Pseudo Mersenne-Number Transforms are used for the computation of DFTs.
URI: http://hdl.handle.net/10397/16216
ISSN: 0165-1684
EISSN: 1872-7557
DOI: 10.1016/0165-1684(85)90035-0
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

106
Last Week
1
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.