Reconfigurable Multi-Butterfly Parallel Radix-r FFT Processor ()

Jiyang Yu^{}, Bowen Cheng^{}, Zongling Li^{}, Weiwei Liu^{}, Luyuan Wang^{}

China Academy of Space Technology, Beijing, China.

**DOI: **10.4236/jdaip.2019.73006
PDF HTML XML
417
Downloads
695
Views
Citations

China Academy of Space Technology, Beijing, China.

The design of reconfigurable multi-butterfly parallel radix-r FFT (Fast Fourier Transform) processors is proposed. FFT is widely used in signal processing, and the application needs real-time and high performance, while most of the traditional designs are limited to the power of two, which wastes the buffers and multipliers in big data. In response to the problem, we improve the parallel FFT algorithm with the design of reconfigurable control machine combined with buffer/multiplier, and the cost function with the input of radix/number/paddling number/time consuming is deduced. Constrained with the number of buffer and multipliers, the radix and number can be computed with the optimum cost function, and the resolution space of computing performance and hardware cost is presented. The proposed guarantees the real-time performance with better flexibility compared with the previous literature, and the comparison also suggests the effectiveness of the design.

Keywords

Share and Cite:

Yu, J. , Cheng, B. , Li, Z. , Liu, W. and Wang, L. (2019) Reconfigurable Multi-Butterfly Parallel Radix-r FFT Processor. *Journal of Data Analysis and Information Processing*, **7**, 91-107. doi: 10.4236/jdaip.2019.73006.

1. Introduction

The Fourier Transform is the basic algorithm for time-frequency domain processing, and the necessary tool for digital spectrum analysis. The Fast Fourier Transform (FFT), as the element theory in signal processing, is widely used in the research on electromagnetic characteristics, satellite navigation and communications and radar signal processing [1] . The DSP chips were often used for the FFT real-time implementation, and nowadays the ASIC of FFT could decrease the cost and enhance the performance, which makes the great success in practice.

S. A. Salehi provided pipeline architecture for FFT which is limited to the power of two [2] . A normal I/O order radix-2 architecture for MIMO is shown in [3] . The pruning mechanism is applied to reduce the time consuming, while the performance is affected by points [4] [5] reduced circuit complexity for large N-point FFT with single-path delay feedback, and the radix is also limited to 2^{2}. The traditional FFT design, is basically restricted to the radix-2/4 and the corresponding architectures, while the buffers and multipliers can be easily wasted for big data processing; and the previous literature often optimize the computing with constant parallel architectures, which makes it difficult to balance between performance and resources.

In previous works, [6] enhanced the performance by computing 4-channel FFT with single butterfly, which is focused on parallel data flow between multiple FFTs. The in-place radix-r architecture is deduced in [1] , and a constant geometry is proposed in [7] .

The reconfigurable multi-butterfly parallel radix-r FFT processor is proposed, based on the improved parallel strategy. By designing configurable controller combined with hardware resources such as cache/multiplier, the parallel algorithm is improved. The design cost function of FFT with the input of radix, point, zero paddling and calculation time is given. In the actual design process, taking cache and multiplier resources as constraints, the optimal FFT design architecture is obtained by calculating the radix and number of points under the optimal cost function. The form of solution space is given for the computational performance and resource occupation of the design. Because of the use of processor architecture, the algorithm can be adjusted according to the availability of resources in the actual hardware design process, which not only ensures the flexibility of the design, but also guarantees the real-time requirements of parallel computing.

The architecture of parallel FFT processor is given in Section 2, include the internal sub-module design and connection relationship; the performance is analyzed based on the parallel architecture in Section 3, and the improved parallel algorithm is deduced for the designed processor; Section 4 compares the design with previous literatures; Section 5 concludes.

2. The Parallel FFT Design

The point is configured by the external input interface, while the optimal radix and the parallel degree of multipliers are deduced by point. Then the parameters are used to form the FFT architecture.

The whole architecture in Figure 1 mainly includes: parameter calculation, FFT control, butterfly computing unit, input/output buffer, data buffer, telemetry component. Data is input buffer first, internal control parameters are calculated according to input parameters. FFT control controls butterfly computing unit, telemetry component and related cache. The final calculation results are output by output buffer, parameters and internal state are output by telemetry component. The internal architecture is shown as in Figure 2.

Figure 1. Multi-butterfly parallel radix-r FFT architecture.

Figure 2. The internal architecture of the FFT processor.

2.1. The Work Mode of FFT Processor

Processor receives external input data, and output results after calculation. The workflow is as follow: first use internal cache to receive external input data, and the register set save external input and output control information; then, calculate input data; at last, output results to output cache, refresh the register set, and waiting for the external data.

2.2. The Internal Architecture of FFT Processor

According to the workflow of the processor, the internal hardware structure of the processor in Figure 3 is as follow.

The processor mainly includes 8 sub-modules:

1) State Processing Unit;

2) Inline Bus;

3) Integer Processing Unit;

Figure 3. The internal architecture of SPU for FPGA.

4) Floating-Point Processing Unit;

5) Reg Set;

6) Input Memory;

7) Middle Memory;

8) Output Memory.

While, SPU is used to handle all state controls generated according to the algorithm; ILB is used to connect three-tier cache and floating-point processing units and to interact with SPU for data; IPU is used to support integer computing requirements in SPU; FPUG are used for the floating-point computing; RS receive the input control information and internal state interaction; IM store the data input, and MM store the intermediate data, while OM store the results.

2.3. The Design of Sub-Modules

2.3.1. State Processing Unit (SPU)

The state processing unit (SPU) is used to control and command all working components. Its function is to extract the state code from the state memory, send it to the state code register, and then enter the state decoder for decoding. According to the state code information, all the internal information needed for various operations is updated, so that all parts can coordinate their work and complete the various operations specified by the state code.

The SPU includes timing control logic, state code memory, state code register, state code decoder, state counter SC (State Count), state address register, state code pointer register SPTR and stack pointer register SP. Its internal structure is shown below.

1) Timing Control Logic

When the FPGA is started, the SPU is controlled to take out the state code and increase the state count.

2) State Code Register

Store the status code currently being executed.

3) Sate Code Decoder

When the state code is fed into the state decoder, the state code is decoded by the decoder, that is, the state code is converted into various specific operations, so that the state machine can correctly perform various functions required.

4) State Address Register

To store the next status code address to be executed. When a status code is removed from the status code memory according to the SC pointing address, SC automatically adds 1/2/3 to the next status code. When reset, (SC) = 0, so the address selection of system status code must start from unit 0.

There are two ways to form a status code address: one is to execute sequentially, adding 1/2/3 through SC; the other is to change the sequence of execution procedures. Generally, the transfer address is formed by the transfer class status code and sent to the status code address register as the next status code address.

1) State Code Pointer Register

SPTR is used to address external data to form an external data address pointer.

2) Stack Pointer

SP is used to store the top address of the stack. The stack accesses data according to the “first in, last out” principle.

2.3.2. Inline Bus (ILB)

The inline bus ILB in Figure 4 updates the internal control register by decoding the data written by the SPU, and controls the data transmission between the connected components according to the value of the register. These data transfers in Figure 5 include:

1) Data transmission from input cache IM to intermediate cache MM;

2) Data Transfer from Intermediate Cache MM to Intermediate Cache MM;

3) Data transmission from intermediate cache MM to output cache OM;

4) Data transmission from intermediate buffer MM to floating point processing unit group FPUG;

5) Data transmission from FPUG to intermediate cache MM.

2.3.3. Integer Processing Unit (IPU)

The main function of IPU module in Figure 6 is to carry out arithmetic logic operation, and complete data transmission, calculation and bit variable processing tasks with SPU. Among them, arithmetic logic operation is mainly composed of ACC, general register B, register, Boolean processor and operation state register PSW. As shown in the figure below.

2.3.4. Floating-Point Processing Unit (FPUG)

Floating point processing unit group FPUG in Figure 7 is used to calculate the output data of intermediate buffer MM, including four basic computing modules: floating point addition, multiplication, division and square. The number of

Figure 4. The internal architecture of ILB.

Figure 5. ILB inner modules data transmission indication.

each module varies according to the task requirements of parallel FFT computing and the amount of remaining resources of current FPGA. Once the design requirements are identified, the number of four modules can no longer change.

2.3.5. Memory Group (MG)

Internal cache has three parts: input cache IM, intermediate cache MM and output cache OM. All three caches are dual-port RAM.

Figure 6. IPU inner modules data transmission indication.

Figure 7. FPUG inner modules data transmission indication.

3. Analysis of Computational Performance

3.1. The FFT Algorithm

Suppose the point is N, where $N={r}^{M}$ , r, M is the positive. Then, the radix-r FFT can be represented as [1] :

$\begin{array}{c}\left[\begin{array}{c}{X}_{m}\left({j}_{1}\right)\\ {X}_{m}\left({j}_{2}\right)\\ \vdots \\ {X}_{m}\left({j}_{r}\right)\end{array}\right]=\left[\begin{array}{cccc}{W}_{N}^{{r}^{M-1}\times \left(0\times 0\right)}& {W}_{N}^{{r}^{M-1}\times \left(0\times 1\right)}& \cdots & {W}_{N}^{{r}^{M-1}\times \left[0\times \left(r-1\right)\right]}\\ {W}_{N}^{{r}^{M-1}\times \left(1\times 0\right)}& {W}_{N}^{{r}^{M-1}\times \left(1\times 1\right)}& \cdots & {W}_{N}^{{r}^{M-1}\times \left[1\times \left(r-1\right)\right]}\\ \vdots & \vdots & \ddots & \vdots \\ {W}_{N}^{{r}^{M-1}\times \left[\left(r-1\right)\times 0\right]}& {W}_{N}^{{r}^{M-1}\times \left[\left(r-1\right)\times 1\right]}& \cdots & {W}_{N}^{{r}^{M-1}\times \left[\left(r-1\right)\times \left(r-1\right)\right]}\end{array}\right]\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\times \left[\begin{array}{c}{X}_{m-1}\left({j}_{1}\right)\\ {X}_{m-1}\left({j}_{2}\right)\cdot {W}_{N}^{p}\\ \vdots \\ {X}_{m-1}\left({j}_{r}\right)\cdot {W}_{N}^{\left(r-1\right)p}\end{array}\right]\end{array}$ (1)

${j}_{1+{k}_{m-1}}=l\cdot {r}^{M-m+1}+{k}_{m-1}\cdot {r}^{M-m}+q$ (2)

$l={\displaystyle \underset{i=0}{\overset{m-2}{\sum}}{k}_{i}\cdot {r}^{m-2-i}}$ (3)

$q={\displaystyle \underset{i=0}{\overset{M-m-1}{\sum}}{n}_{i}\cdot {r}^{i}}$ (4)

3.2. The Parallel FFT Algorithm

For the N_{0}-point parallel FFT (
${N}_{0}$ is positive integer), the pre-work should be done as:

1) Choose the current optimal radix-r and FFT point N;

2) The parallel computing flow is designed according to the number of current hardware additive multiplication.

3.2.1. Parameter Calculation

This section describes the parameter calculation method and implementation process.

1) Number of Zero Complementation Points

For the N_{0}-point FFT, the actual number of points N of FFT is calculated by radix-r.

$N={r}^{\lceil {\mathrm{log}}_{r}{N}_{0}\rceil}$ (5)

where, $\lceil \text{\hspace{0.05em}}\rceil $ is the ceiling operation.

The number of zeros to be paddling is

$\Delta \left(r\right)={r}^{\lceil {\mathrm{log}}_{r}{N}_{0}\rceil}-{N}_{0}$ (6)

where, $r\in \left[2,\lfloor \sqrt{{r}^{\lceil {\mathrm{log}}_{r}{N}_{0}\rceil}}\rfloor \right]$ .

2) Time Consuming

For the radix-r N-point FFT, time consuming is:

$\begin{array}{c}T=\beta {r}^{2.5}{r}^{\lceil {\mathrm{log}}_{r}{N}_{0}\rceil -1}\lceil {\mathrm{log}}_{r}{N}_{0}\rceil \\ =\beta {r}^{1.5+\lceil {\mathrm{log}}_{r}{N}_{0}\rceil}\lceil {\mathrm{log}}_{r}{N}_{0}\rceil \end{array}$ (7)

where, $\beta \ge 1$ , represents the time coefficients caused by branch jumps, data access and computing module delays in current computing systems. When the hardware structure is fixed, $\beta $ is fixed. In this paper, $\beta =15.7$ .

3) Optimal Parameter Selection Based on Cost Function

In the calculation of FFT, the choice of parameters should take into account not only the calculation speed, but also the current occupancy of space resources. Therefore, the calculation time and zero-filling points should be unified planning.

$\gamma \left(\gamma >0\right)$ is defined as the ratio of computing time to buffer cost. Then the total cost function is

$\delta =\Delta +\gamma T$ (8)

The process of determining parameter r is to find the minimum value of $\delta \left(r\right)$ , which is ${r}_{\mathrm{min}\left(\delta \left(r\right)\right)}$ .

Examples are as follows:

For the ${N}_{0}=171$ point FFT, the zeros paddling of different radix are as in Figure 8.

The computing cycles for different radix are as in Figure 9.

Suppose $\gamma ={10}^{-3}$ , then the cost function $\delta \left(r\right)$ is as in Figure 10.

From Table 1, the radix should be 6 according to the least zeros paddling, and should be 2 according to the minimum computing cycles. The optimal radix is 3 with the minimum cost function by generally analysis.

Figure 8. Zeros paddling comparison for different radix.

Figure 9. Computing cycles for different radix.

Table 1. Comparison of main parameters for different radix.

Figure 10. Cost function with different radix.

4) The Implementation of Parameters Computing

Generally, logarithmic calculation is calculated by look-up table method and CORDIC algorithm. Because parameters can be calculated in the initialization process, the real-time requirement for parameter calculation is not high. The use of look-up table method and CORDIC algorithm will occupy a large amount of memory resources or logical resources. In this design, a simple integer logarithmic calculation method is designed by local optimization of Taylor series expansion method and table lookup (256 table lookup data).

The optimal radix could be deduced according to (4)-(8), in which the transcendental functions are used frequently.

The logarithm of traditional Taylor series expansion is as follows

$\mathrm{ln}\left(1+x\right)={\displaystyle \underset{i=1}{\overset{\infty}{\sum}}{\left(-1\right)}^{i-1}{x}^{i}/i}$ (9)

In the finite order, the closer x approaches 1, the greater the error. This leads to a high order of accuracy in order to ensure the whole range.

The derivation is as follows,

$\mathrm{ln}\left(1+x\right)=\mathrm{ln}\left(2\left(1+x\right)/2\right)=\mathrm{ln}2+\mathrm{ln}\left(1+0.5\left(x-1\right)\right)$ (10)

The following improvements are made to Taylor series expansion

$\mathrm{ln}\left(1+x\right)=\{\begin{array}{l}\mathrm{ln}\left(1+x\right),\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}x\in \left(0,0.5\right]\\ \mathrm{ln}2+\mathrm{ln}\left(1+0.5\left(x-1\right)\right),\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}x\in \left(0.5,1\right]\end{array}$ (11)

The error of formula (11) is less than 10^{−4}, as shown in the following Figure 11.

In the process of parameter calculation, for practical use, the point N_{0} is less than 65,536, which can be expressed by 16-bit integer. At this time, the radix r will not exceed 256, and can be expressed by 8-bit integers.

The calculation of formula (4)-(8) is mainly concentrated on the logarithm of r obtained from N_{0}, which is deduced as follows.

$\mathrm{ln}\left({N}_{0}\right)=\mathrm{ln}\left(256{N}_{0H}+{N}_{0L}\right)=\mathrm{ln}256+\mathrm{ln}{N}_{0H}+\mathrm{ln}\left(1+\frac{{N}_{0L}}{256{N}_{0H}}\right)$ (12)

And,

${\mathrm{log}}_{r}{N}_{0}=\frac{\mathrm{ln}{N}_{0}}{\mathrm{ln}r}$ (13)

Figure 11. Improved Taylor series expansion error.

where, $0<\frac{{N}_{0L}}{256{N}_{0H}}<1$ , ${N}_{0H}<256$ .

For N_{0}, the logarithm of r can be simplified into the following three steps: 1/(lnr) and
$\mathrm{ln}{N}_{0H}$ are calculated by using 8-bit 256 data lookup tables;
$\mathrm{ln}\left(1+{N}_{0L}/\left(256{N}_{0H}\right)\right)$ is calculated according to (11); the results plus a constant ln256, and then are divided by lnr, which is
${\mathrm{log}}_{r}{N}_{0}$ .

3.2.2. Implementation of Parallel Computing

In the process of any radix FFT processing, the butterfly computing matrix W is first calculated, which is only related to the calculating series M and the base number r. Therefore, after calculating the parameters, W is calculated once and stored, and then only data is taken out for calculation in each butterfly calculation. The r-ary reverse order of input data can ensure the correct order of settlement results when calculating the output. Each iteration needs to calculate N/r butterfly calculation. Before each butterfly calculation, the twiddle factor needs to be calculated. In fact, the rotating factor can be selected in the butterfly calculation matrix W. This ensures that the twiddle factor does not need additional calculation, calculates the address of the number of operands for butterfly calculation, takes out r operands, and the rotating factor and the butterfly meter. The calculation matrix is multiplied separately to complete the butterfly calculation, and the storage address of the calculated butterfly results is stored.

Because Singleton’s fixed structure is adopted in the design of the algorithm, X and Y caches are used to store the input and output of each fixed structure. The pseudo code of the whole algorithm is as follows.

For the case of only one multiplier and one adder, the whole algorithm flow needs to be serially operated according to the above pseudo-code, and the calculation time is as described above.

As can be seen from the above algorithm, there are two ways to improve the algorithm by using parallel computing method:

1) Parallel computation is carried out for the matrix operation in the butterfly computation of line 15 of the algorithm.

2) Parallel computing is carried out for N/r butterfly computing units.

The Radix used in practical application is generally less than r = 10. Winograd’s second-order matrix multiplication is not suitable for use. Therefore, the traditional matrix multiplication structure (mid-product algorithm) is used for calculation.

In butterfly computing process, the r data of A(fetch_idx) are multiplied by r twiddle factors to form the r multiplication is not suitable for use. Therefore, the traditional matrix multiplication of
$r\times r$ matrix and
$r\times 1$ vector, needs r^{2} multiplications and r(r − 1) additions.

The parallel computing architectures are discussed as follow with the different resources:

1) When the number of multipliers n_{m} is less than r^{2}, and the number of additions n_{a} is less than r(r − 1);

The twiddle factors must be pre-processed, and the time cost is
$\lceil r/{n}_{m}\rceil $ ; the time cost of matrix multiplication is
$\mathrm{max}\left\{\lceil {r}^{2}/{n}_{m}\rceil ,\lceil r\left(r-1\right)/{n}_{a}\rceil \right\}$ . The parallel process applies n_{m} threads computing. For convenience,
${n}_{a}\ge {n}_{m}+1$ .

Set r = 5 and n_{m} = 3 as the example, to illustrate the parallel design of butterfly. Denote the operands as op_{i}, the twiddle factors as tf_{i}, and the product of the two as
$o{{p}^{\prime}}_{i}$ ; the butterfly matrix is denoted as w_{i}_{,j}, and the result is opo_{i}, where
$i,j\in \left[0,r-1\right]$ . And the parallel proceed is as follow in Figure 12.

2) When the number of multipliers n_{m} is not less than r^{2}, and the number of additions n_{a} is not less than r(r − 1).

The resources of adders and multipliers are greater than a fully parallel requirement, and multi-butterflies could be configured parallel to enhance the performance. The parallel degree is $P=\mathrm{min}\left\{\lceil {n}_{m}/{r}^{2}\rceil ,\lceil {n}_{a}/r\left(r-1\right)\rceil \right\}$ . When ${n}_{a}\ge {n}_{m}+1$ , $P=\lceil {n}_{m}/{r}^{2}\rceil $ . Each group includes Q = N/r/P butterflies.

Improve the alg. 1, then the multi-butterfly parallel FFT alg. 2 is as follow in Figure 13.

3.3. Analysis of Parallel Algorithm

3.3.1. Time Cost Analysis of Parallel Algorithm

According to the performance of the parallel alg. in Section 3.2.2, the gap pipelines in the single butterfly and the multi-butterfly are adjusted to enhance the parallelism. In each state the time cost of the butterfly is deduced as:

1) When the number of multipliers n_{m} is less than r^{2}, and the number of additions n_{a} is less than r(r − 1);

${T}_{bf}=\lceil {r}^{2}/{n}_{m}\rceil \frac{N}{r}$ (14)

2) When the number of multipliers n_{m} is not less than r^{2}, and the number of additions n_{a} is not less than r(r − 1).

Figure 12. The parallel threads of Mul. and Add.

Figure 13. The Alg.1 and Alg.2 for FFT.

${T}_{bf}=\frac{N}{r\lceil {n}_{m}/{r}^{2}\rceil}$ (15)

Then, the total time cost is

${T}_{fft}=\{\begin{array}{l}{\mathrm{log}}_{r}N\lceil {r}^{2}/{n}_{m}\rceil \frac{N}{r},\text{\hspace{0.17em}}\text{\hspace{0.05em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}{n}_{m}<{r}^{2}\\ {\mathrm{log}}_{r}N\frac{N}{r\lceil {n}_{m}/{r}^{2}\rceil},\text{\hspace{0.17em}}\text{\hspace{0.05em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{if}\text{\hspace{0.17em}}{n}_{m}\ge {r}^{2}\end{array}$ (16)

3.3.2. Resources Cost Analysis of Parallel Algorithm

The buffers of 8 modules in FFT processor are composed by block ram, while the SPU/ILB/IPU/RG/FPUG occupies the slices. The first 4 modules resources consuming are the same with different parallel degree, and the resources of FPUG increases with parallel degree growth.

Take Xilinx Virtex-II 3000 as an example, SPU/ILB/IPU/RG costs 2973 slices; floating-point adder costs 273 slices; floating-point multiplier costs 75 slices and 4 fix-point multipliers. Then, the total costs are

$SrCost=2973+273{n}_{m}+75{n}_{a}$ (17)

According to (17), the parameters space is depicted in Figure 14. The plane of value 14,336 represents the maximum slices in Xilinx Virtex-II 3000, and the vertical oblique plane represents boundary ( ${n}_{a}\ge {n}_{m}+1$ ). The appropriate parameters can be selected according to the space.

4. Comparison

The design method in this paper is compared with the previous literature [1] [6] [8] [9] . According to Table 2, it can be seen that the design method is flexible, the same computing performance occupies the least resources in the application process, and the optimal design parameters can be obtained according to the actual situation of hardware resources.

5. Conclusion

This paper presents a design method of configurable multi-butterfly parallel computing radix-r FFT processor. In the information processing process, FFT has a wide range of applications, large demand and high real-time requirements. The existing design methods are mainly limited to base 2/4 and the corresponding parallel architecture. It is easy to waste storage and multiplier resources with different number of points and multipliers under large data. In order to solve this problem, the parallel FFT algorithm is improved by designing a configurable

Table 2. Comparison of different parallel algorithms.

Figure 14. The parameters space.

controller combined with hardware resources such as buffer and multiplier. The FFT design cost function with cardinality, number of points, number of zeros and computing time as input are given. In the actual design process, with the constraints of buffer and multiplier resources, the optimal FFT design architecture is obtained by calculating the number of points and cardinality under the optimal cost function and the form of solution space is given for the calculated performance and resource occupancy. The design method in this paper has good flexibility, and its parallel computing architecture also guarantees the real-time performance of the calculation. The comparison with the previous literature shows that the design method is effective under the same design parameters.

Acknowledgements

This work was carried out by Professor Dan Huang and Professor Zong Qi (Chongqing University of Technology). We gratefully acknowledge their invaluable cooperation in preparing this application note.

Conflicts of Interest

The authors declare no conflicts of interest.

[1] | Yu, J.-Y., Huang, D., Li, X., et al. (2016) Conflict-Free Architecture for Multi-Butterfly Parallel Processing In-Place Radix-r FFT. IEEE 13th International Conference on Signal Processing, Chengdu, 6-10 November 2016, 496-501. |

[2] |
Salehi, S.A., Amirfattahi, R. and Parhi, K.K. (2013) Pipeline Architectures for Real-Valued FFT and Hermitian-Symmetric IFFT with Real Datapaths. IEEE Transactions on Circuits and Systems II: Express Briefs, 60, 507-511.
https://doi.org/10.1109/TCSII.2013.2268411 |

[3] |
Glittas, A.X., Sellathurai, M. and Lakshminarayanan, G. (2016) A Normal I/O Order Radix-2 FFT Architecture to Process Twin Data Streams for MIMO. IEEE Transaction on Very Large Scale Integration Systems, 24, 2402-2406.
https://doi.org/10.1109/TVLSI.2015.2504391 |

[4] | Ayhan, T., Dehaene, W. and Verhelst, M. (2014) A 128: 2048/1536 Point FFT Hardware Implementation with Output Pruning. 22nd European Signal Processing Conference, Lisbon, 1-5 September 2014, 266-270. |

[5] |
Siu, T., Sham, C. and Lau, F.C.M. (2017) Operating Frequency Improvement on FPGA Implementation of a Pipeline Large-FFT Processor. 19th International Conference on Advanced Communication Technology, Bongpyeong, 19-22 February 2017, 5-9. https://doi.org/10.23919/ICACT.2017.7890046 |

[6] | Yu, J.-Y., Huang, D., Li, X., et al. (2013) Four Parallel Channels Radix-4 FFT with Single Floating-Point Butterfly. Applied Mechanics and Materials, 427-429, 708-711. |

[7] |
Ma, C., Qu, X., Chen, H., et al. (2013) A Novel Conflict-Free Parallel Memory Access Scheme for FFT Constant Geometry Architecture. Science China, Information Sciences, 4, 57-63. https://doi.org/10.1007/s11432-013-4826-5 |

[8] |
Vinodh Kumar, C. and Sastry, K.R.K. (2017) Design and Implementation of FFT Pruning Algorithm on FPGA. 7th International Conference on Cloud Computing, Data Science & Engineering, Noida, 12-13 January 2017, 739-743.
https://doi.org/10.1109/CONFLUENCE.2017.7943248 |

[9] |
Santhosh, L. and Thomas, A. (2013) Implementation of Radix 2 and Radix 22 FFT Algorithms on Spartan6 FPGA. 4th International Conference on Computing, Communications and Networking Technologies, Tiruchengode, 4-6 July 2013, 1-4.
https://doi.org/10.1109/ICCCNT.2013.6726840 |

Journals Menu

Copyright © 2021 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.