High performance Block
Floating-Point FFT based on Approximate
Computation and Conflict-Free Access
21VL798-Project Dissertation Phase 1
Presented by
TELLURI VANI SAI BHAVANI-BL.EN.P2VLD24024
Under the guidance of
Dr.PARAMASIVAM.C
Department of
Electronics and Communication Engineering
09/15/2025
Problem Statement
• FFT operations in 5G, medical imaging, DSP applications demand
intensive computation, leading to high energy consumption.
• Conventional FFT architectures occupy large chip area due to complex
butterfly units and memory buffers.
• Frequent memory access during FFT stages causes bottlenecks,
limiting throughput and real-time performance.
• Fixed-point FFTs can make small mistakes when rounding numbers,
which lowers the accuracy of the results.
09/15/2025
Literature Survey Paper 2:
Title:
Authors:
Date of Conference:
Summary:
09/15/2025
Literature Survey Paper 2:
Objective:
Methodology:
Inference:
09/15/2025
Methodology
Tools Required:
• MATLAB for FFT golden response.
• Modelsim for RTL development and verification.
• Genus for sythesis.
09/15/2025
Month Work to be implemented
July 2025 Literature survey of FFT,conflict-free,block
floating-point format.
August 2025 Design butterfly computation units
integrating approximate multipliers.
September 2025 Implements block floating-point format for
the data managing.
October 2025 Architect a conflict-free, parallel-access
multi-bank memory .
November 2025 Develop and validate FFT architecture.
09/15/2025
Reference:
1. X. Zhang, Z. Yu, S. Qiao and Y. Zhan, "Hardware Implementation of Block
Floating-Point FFT Based on Approximate Computation and Conflict-Free
Access," in IEEE Access, vol. 13, pp. 106989-106997, 2025, doi:
10.1109/ACCESS.2025.3578531.
2. J. Chen, K. Lin, L. Yang, and W. Ye, ‘‘An energy-efficient edge processor for
radar-based continuous fall detection utilizing mixed-radix FFT and updated
blockwise computation,’’ IEEE Internet Things J., vol. 11, no. 19, pp. 32117–
32128, Oct. 2024, doi: 10.1109/JIOT.2024.3422251.
3. Q.-J. Xing, Z.-G. Ma, and Y.-K. Xu, ‘‘A novel conflict-free parallel memory
access scheme for FFT processors,’’ IEEE Trans. Circuits Syst. II, Exp. Briefs,
vol. 64, no. 11, pp. 1347–1351, Nov. 2017, doi:10.1109/TCSII.2017.2683643.
09/15/2025
THANK YOU
09/15/2025
Questions asked
• What is fast in fft?
• What is your novality?
• Already we take values in exponent values, so what is different in
block floating point value?
• What are the applications?
• Why matlab?do we get precise values in matlab?
09/15/2025