A Radix-2 DIT FFT with reduced arithmetic complexity

Qadeer, Shaik; Khan, Mohammed Zafar Ali; Sattar, Syed Abdul; Ahmed, M.F.

doi:10.1109/icacci.2014.6968324

Cited by 11 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A modified version of the split-radix proposed in [125] lowers the flop count by ~5.6% without sacrificing numerical accuracy. In [126], by scaling the Twiddle Factor 4 , the authors decrease the number of multiplication counts without affecting the number of additions. In addition, this modification also improves the signal-to-quantization noise ratio (SQNR) by more than 1.6 dB.…”

Section: Fft/ifft Functionsmentioning

confidence: 99%

A Tutorial on the Characterisation and Modelling of Low Layer Functional Splits for Flexible Radio Access Networks in 5G and Beyond

Pérez-Romero,

Sallent,

Gelonch

et al. 2023

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

The centralization of baseband (BB) functions in a radio access network (RAN) towards data processing centres is receiving increasing interest as it enables the exploitation of resource pooling and statistical multiplexing gains among multiple cells, facilitates the introduction of collaborative techniques for different functions (e.g., interference coordination), and more efficiently handles the complex requirements of advanced features of the fifth generation (5G) new radio (NR) physical layer, such as the use of massive multiple input multiple output (MIMO). However, deciding the functional split (i.e., which BB functions are kept close to the radio units and which BB functions are centralized) embraces a trade-off between the centralization benefits and the fronthaul costs for carrying data between distributed antennas and data processing centres. Substantial research efforts have been made in standardization fora, research projects and studies to resolve this trade-off, which becomes more complicated when the choice of functional splits is dynamically achieved depending on the current conditions in the RAN. This paper presents a comprehensive tutorial on the characterisation, modelling and assessment of functional splits in a flexible RAN to establish a solid basis for the future development of algorithmic solutions of dynamic functional split optimisation in 5G and beyond systems. First, the paper explores the functional split approaches considered by different industrial fora, analysing their equivalences and differences in terminology. Second, the paper presents a harmonized analysis of the different BB functions at the physical layer and associated algorithmic solutions presented in the literature, assessing both the computational complexity and the associated performance. Based on this analysis, the paper presents a model for assessing the computational requirements and fronthaul bandwidth requirements of different functional splits. Last, the model is used to derive illustrative results that identify the major trade-offs that arise when selecting a functional split and the key elements that impact the requirements.

show abstract

Section: Fft/ifft Functionsmentioning

confidence: 99%

A Tutorial on the Characterisation and Modelling of Low Layer Functional Splits for Flexible Radio Access Networks in 5G and Beyond

Pérez-Romero,

Sallent,

Gelonch

et al. 2023

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

show abstract

“…Now the x(n) sequences for the first and second part of X(k)even will be X(k)even,1st part = x(0), x(4), x (8), x (12); X(k)even,2nd part = x(2), x(6), x (10), x (14); The equation for X(k)odd will be…”

Section: =0mentioning

confidence: 99%

“…W4 kn ….…..….. (3) where n = 0, 1, 2, 3, and N = 16. Now the x(n) sequences for the first and second part of X(k)odd will be X(k)odd,1st part = x(1), x(5), x (9), x(13); X(k)odd,2nd part = x(3), x (7), x (11), x (15); Now putting the value of x(n) sequences in the equation 2, we get the even sequences X(0)even = x(0).W4 0 + x(4).W4 0 + x (8).W4 0 + x (12).W4 0 + W8 0 [x(2).W4 0 + x(6).W4 0 + x (10).W4 0 + x (14) (2).W4 0 + x (6).W4 3 + x (10).W4 6…”

Section: =0mentioning

confidence: 99%

Comparison of Discrete Fourier Transform and Fast Fourier Transform with Reduced Number of Multiplication and Addition Operations

2020

International Journal of Applied Mathematics and Informatics

View full text Add to dashboard Cite

Fast Fourier Transform is an advanced algorithm for computing Discrete Fourier Transform efficiently. Although the results available from the operation of Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT) are same, but exploiting the periodicity and symmetry property of phase factor Fast Fourier Transform computes the Discrete Fourier Transform using reduced number of multiplication and addition operations. The basic structure used in the operations of Fast Fourier Transform is the Butterfly structure. For the implementation of Fast Fourier Transform the two methods are used such as decimation in time (DIT) and decimation in frequency (DIF). Both the methods give same result but for decimation in time of Fast Fourier Transform bit reversed inputs are applied and for decimation in frequency of Fast Fourier Transform normal order inputs are applied, and the result is reversed again. In this paper, operations for DFT and FFT have been discussed and shown with examples. It is found that generalized formula for FFT have been described same in the books, but the expressions in the intermediate computations for the first decimation and second decimation are different in the various books of Digital Signal Processing. The expressions in the intermediate computation of FFT described in different books are broadly compared in this paper

show abstract

Low Power and Complexity Implementation of the Modified FFT with a New Bit-Slicing Scheme

Qadeer,

Keerthan,

Azeemuddin

et al. 2023

J. Inst. Eng. India Ser. B

View full text Add to dashboard Cite

A Radix-2 DIT FFT with reduced arithmetic complexity

Cited by 11 publications

References 6 publications

A Tutorial on the Characterisation and Modelling of Low Layer Functional Splits for Flexible Radio Access Networks in 5G and Beyond

A Tutorial on the Characterisation and Modelling of Low Layer Functional Splits for Flexible Radio Access Networks in 5G and Beyond

Comparison of Discrete Fourier Transform and Fast Fourier Transform with Reduced Number of Multiplication and Addition Operations

Low Power and Complexity Implementation of the Modified FFT with a New Bit-Slicing Scheme

Contact Info

Product

Resources

About