Hardware Efficient Mixed Radix-25/16/9 FFT for LTE Systems, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.23, issue.2, pp.221-229, 2015. ,
DOI : 10.1109/TVLSI.2014.2304834
Pipelined FFT for wireless communications supporting 128-2048 / 1536 -point transforms ,
DOI : 10.1109/globalsip.2013.6737133
Historical notes on the fast Fourier transform, Proc. of the IEEE, pp.1675-16775959, 1967. ,
DOI : 10.1109/tau.1967.1161903
URL : http://148.204.64.201/paginas anexas/voz/articulos interesantes/IEEE TAAODSP/18.pdf
Two's complement, Cornell University lecture notes, 2000. ,
A New Representation of FFT Algorithms Using Triangular Matrices, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.63, issue.10, pp.1737-1745, 2016. ,
DOI : 10.1109/TCSI.2016.2587822
A New Representation of FFT Algorithms Using Triangular Matrices, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.63, issue.10, pp.1737-1745, 2016. ,
DOI : 10.1109/TCSI.2016.2587822
Multiplierless Unity-Gain SDF FFTs, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.24, issue.9, pp.3003-3007, 2016. ,
DOI : 10.1109/TVLSI.2016.2542583
URL : http://liu.diva-portal.org/smash/get/diva2:1046263/FULLTEXT01
Feedforward FFT Hardware Architectures Based on Rotator Allocation, IEEE Transactions on Circuits and Systems I: Regular Papers, issue.99, pp.1-12, 2017. ,
DOI : 10.1109/TCSI.2017.2722690
Low-Complexity Multiplierless Constant Rotators Based on Combined Coefficient Selection and Shift-and-Add Implementation (CCSSI), IEEE Transactions on Circuits and Systems I: Regular Papers, vol.61, issue.7, pp.2002-2012, 2014. ,
DOI : 10.1109/TCSI.2014.2304664
URL : http://liu.diva-portal.org/smash/get/diva2:738039/FULLTEXT01
A 4096-Point Radix-4 Memory-Based FFT Using DSP Slices, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.25, issue.1, pp.375-379, 2017. ,
DOI : 10.1109/TVLSI.2016.2567784
URL : http://liu.diva-portal.org/smash/get/diva2:1086602/FULLTEXT02
Simplified Design of Constant Coefficient Multipliers, Circuits, Systems & Signal Processing, vol.25, issue.2, pp.225-251, 2006. ,
DOI : 10.1007/s00034-005-2505-5
Addition Aware Quantization for Low Complexity and High Precision Constant Multiplication, IEEE Signal Processing Letters, vol.17, issue.2, pp.173-176, 2009. ,
DOI : 10.1109/LSP.2009.2036384
URL : http://liu.diva-portal.org/smash/get/diva2:285764/FULLTEXT01
Low power commutator for pipelined FFT processors, Proc. IEEE Int. Symp. Circuits Syst, pp.5274-52771465825, 2005. ,
Design and implementation of a 1024-point pipeline FFT processor, Proc. IEEE Custom Integrated Circuits Conf, pp.131-134694922, 1998. ,
A High-Throughput Radix-16 FFT Processor With Parallel and Normal Input/Output Ordering for IEEE 802.15.3c Systems, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.59, issue.8, pp.1752-1765, 2011. ,
DOI : 10.1109/TCSI.2011.2180430
Minimum weight modified signed-digit representations and fast exponentiation, Electronics Letters, vol.25, issue.17, pp.1171-1172, 1989. ,
DOI : 10.1049/el:19890785
A high performance four-parallel 128, p.64 ,
Improved Matching-Pursuit Implementation for LTE Channel Estimation, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.61, issue.1, pp.226-237, 2014. ,
DOI : 10.1109/TCSI.2013.2264695
Hardware-Efficient Twiddle Factor Generator for Mixed Radix-2/3/4/5 FFTs, 2016 IEEE International Workshop on Signal Processing Systems (SiPS), pp.201-206, 2016. ,
DOI : 10.1109/SiPS.2016.43
Multiplierless reconfigurable processing element for mixed radix-2/3/4/5 FFTs, 2017 IEEE International Workshop on Signal Processing Systems (SiPS), pp.1-6, 2017. ,
DOI : 10.1109/SiPS.2017.8110007
Unified architecture for 2, 3, 4, 5, and 7-point DFTs based on Winograd Fourier transform algorithm, Electronics Letters, vol.49, issue.5, pp.348-349, 2013. ,
DOI : 10.1049/el.2012.0577
URL : http://liu.diva-portal.org/smash/get/diva2:492039/FULLTEXT01
Generation of all radix-2 fast Fourier transform algorithms using binary trees, 2011 20th European Conference on Circuit Theory and Design (ECCTD), pp.677-6806043634, 2011. ,
DOI : 10.1109/ECCTD.2011.6043634
Design Approaches, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.64, issue.6, pp.1456-1467, 2017. ,
DOI : 10.1109/TCSI.2017.2654451
An introduction to programming the Winograd Fourier transform algorithm (WFTA), IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.25, issue.2, pp.152-1651162924, 1977. ,
DOI : 10.1109/TASSP.1977.1162924
Time-Efficient Single Constant Multiplication Based on Overlapping Digit Patterns, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.17, issue.9, pp.1353-1357, 2009. ,
DOI : 10.1109/TVLSI.2008.2003004
A generator of memory-based, runtimereconfigurable 2 n 3 m 5 k FFT engines, Proc. IEEE Int. Conf. Acoust. Speech Signal Process, pp.1016-1020, 2016. ,
Area-Efficient 128- to 2048/1536-Point Pipeline FFT Processor for LTE and Mobile WiMAX Systems, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.23, issue.9, pp.1793-1800, 2015. ,
DOI : 10.1109/TVLSI.2014.2350017