Author:
G. Deepa, ,Mastani Dr. S. Aruna,
Abstract
The Fast Fourier Transform is incomplete without bit-reversal. Novel parallel circuits for calculating bit reversal on data which is coming parallel are presented in this paper. The circuits are simplest, consisting of memories and multiplexers, and have the benefit of requiring the fewest multiplexers of all architectures for parallel bit reversal thus far, and tiny overall memory.
Publisher
Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP
Subject
Management of Technology and Innovation,General Engineering
Reference10 articles.
1. B. Gold and C. M. Rader, Digital Processing of Signals. New York: McGraw Hill, 1969.
2. M. Garrido and J. Grajal, "Optimum circuits for bit-dimension permutations," IEEE Trans. VLSI Syst.
3. M. Garrido, J. Grajal, and O. Gustafsson, "Optimum circuits for bit reversal," IEEE Trans. Circuits Syst. II, vol. 58, no. 10, pp. 657-661, Oct. 2011.
4. F. Serre, T. Holenstein, and M. Pu¨schel, "Optimal circuits for streamed linear permutations using RAM," in Proc. ACM/SIGDA Int. Symp. FPGAs. ACM, Feb. 2016, pp. 215-223.
5. S.-J. Huang, S.-G. Chen, M. Garrido, and S.-J. Jou, "Continuous-flow parallel bit-reversal circuit for MDF and MDC FFT architectures," IEEE Trans. Circuits Syst. I, vol. 61, no. 10, pp. 2869-2877, Oct. 2014.