High Through-Put VLSI Architecture for FFT Computation
Author:
SreenathKashyap S.
Publisher
Springer New York
Reference17 articles.
1. Westte NHE, Harris D (2011) CMOS VLSI Design, Pearson-Addison-Wesley, 4th edn
2. Brent RP, Kung, HT (1982) A regular layout for parallel adders. IEEE Trans Comput C-31:260–264
3. Harris D (2003) A taxonomy of parallel prefix networks. In: Proceeding 37th Asilomar conference signals systems and computers, pp 2213–2217
4. Kogge PM, Stone HS (1973) A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Trans Comput C-22(8):786–793
5. Ndai P, Lu S, Somesekhar D, Roy K (2007) Fine grained redundancy in adders. In: International symposium on quality electronic design pp 317–321