Abhishek Bhattacharjee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Abhishek Bhattacharjee has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
Dheeraj Kumar Sahu
2 shared publicationsSambhu Nath Pradhan
2 shared publications- Sambhu Nath Pradhan
Department of Electronics and Communication Engineering, National Institute of Technology, Agartala, Tripura, India
2 shared publications - Abhishek Nag
Department of ECE, National Institute of Technology, Agartala, Agartala, India
1 shared publication Apangshu Das
1 shared publicationKaushik Das
1 shared publication
Latest Publications
- 12 September 2024
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 33 (18)
Efficient Hardware Architecture Design of Radix-22 Fast Fourier Transform Using Coordinate Rotation Digital Computer
The fast Fourier transform (FFT) is a widely used algorithm for computing the discrete Fourier transform (DFT) in real-time signal processing. Achieving high performance with minimal resource usage is crucial for any real-time application. This paper introduces an architecture based on coordinate rotation digital computer (CORDIC) for implementing a radix-[ ] FFT. Traditional FFT implementations require complex twiddle factor multiplications, which is not cost-effective in terms of hardware utilization. To address this issue, we have proposed a radix-8 CORDIC-based approach integrated with FFT computation. The proposed radix-8 CORDIC requires fewer stages than the conventional radix-2 CORDIC, enhancing computational efficiency and reducing hardware utilization. The feedforward radix-[ ] FFT architecture is presented where the butterflies of the FFT are computed with the help of radix-8 CORDIC. A total of three FFT architectures are developed supporting 16-, 1024- and 2048-point FFTs. The proposed FFT architectures are developed using Verilog-HDL code and implemented on a Virtex-7 field-programmable gate array (FPGA). The FPGA-based radix-[ ] FFT achieves a clock frequency of 323.4[ ]MHz and utilizes minimal FPGA resources. Processing of 2048 data samples takes only 4.06[ ][ ]S by the proposed FPGA-based design. Additionally, two ASICs have been designed: the 1024-point FFT ASIC occupies an area of 1.079[ ]mm2, and the 2048-point FFT ASIC occupies an area of 1.544 mm2. The proposed FFT ASICs have better-normalized area per FFT and energy per FFT than the state-of-the-art designs.
- 12 September 2024
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 33 (18)
Efficient Hardware Architecture Design of Radix-22 Fast Fourier Transform Using Coordinate Rotation Digital Computer
The fast Fourier transform (FFT) is a widely used algorithm for computing the discrete Fourier transform (DFT) in real-time signal processing. Achieving high performance with minimal resource usage is crucial for any real-time application. This paper introduces an architecture based on coordinate rotation digital computer (CORDIC) for implementing a radix-[ ] FFT. Traditional FFT implementations require complex twiddle factor multiplications, which is not cost-effective in terms of hardware utilization. To address this issue, we have proposed a radix-8 CORDIC-based approach integrated with FFT computation. The proposed radix-8 CORDIC requires fewer stages than the conventional radix-2 CORDIC, enhancing computational efficiency and reducing hardware utilization. The feedforward radix-[ ] FFT architecture is presented where the butterflies of the FFT are computed with the help of radix-8 CORDIC. A total of three FFT architectures are developed supporting 16-, 1024- and 2048-point FFTs. The proposed FFT architectures are developed using Verilog-HDL code and implemented on a Virtex-7 field-programmable gate array (FPGA). The FPGA-based radix-[ ] FFT achieves a clock frequency of 323.4[ ]MHz and utilizes minimal FPGA resources. Processing of 2048 data samples takes only 4.06[ ][ ]S by the proposed FPGA-based design. Additionally, two ASICs have been designed: the 1024-point FFT ASIC occupies an area of 1.079[ ]mm2, and the 2048-point FFT ASIC occupies an area of 1.544 mm2. The proposed FFT ASICs have better-normalized area per FFT and energy per FFT than the state-of-the-art designs.
- 1 February 2022
- Published by Springer Nature in Journal of Electronic Testing
- Vol. 38 (1) , 91-105
Design of Power Gated SRAM Cell for Reducing the NBTI Effect and Leakage Power Dissipation During the Hold Operation
- 1 February 2022
- Published by Springer Nature in Journal of Electronic Testing
- Vol. 38 (1) , 91-105
Design of Power Gated SRAM Cell for Reducing the NBTI Effect and Leakage Power Dissipation During the Hold Operation
- 3 May 2021
- Published by Wiley in International Journal of Circuit Theory and Applications
- Vol. 49 (7) , 1902-1915
Lookup table‐based negative‐bias temperature instability effect and leakage power co‐optimization using genetic algorithm approach
- 3 May 2021
- Published by Wiley in International Journal of Circuit Theory and Applications
- Vol. 49 (7) , 1902-1915
Lookup table‐based negative‐bias temperature instability effect and leakage power co‐optimization using genetic algorithm approach
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 156-157
POSTER: Exploiting Approximations for Energy/Quality Tradeoffs in Service-Based Applications
Approximations and redundancies allow mobile and distributed applications to produce answers or outcomes of lesser quality at lower costs. This paper introduces RAPID, a new programming framework and methodology for service-based applications with approximations and redundancies. Finding the best service configuration under a given resource budget becomes a constrained, dual-weight graph optimization problem.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 156-157
POSTER: Exploiting Approximations for Energy/Quality Tradeoffs in Service-Based Applications
Approximations and redundancies allow mobile and distributed applications to produce answers or outcomes of lesser quality at lower costs. This paper introduces RAPID, a new programming framework and methodology for service-based applications with approximations and redundancies. Finding the best service configuration under a given resource budget becomes a constrained, dual-weight graph optimization problem.