In the Orthogonal Frequency-Division Multiplexing (OFDM) based transceivers, digital computation of the Discrete Fourier Transform (DFT) is a power hungry process. Reduction in the hardware cost and power consumption is possible by implementing the DFT processor with analogue circuits. This thesis presents the real-time recursive DFT processor. Previously, changing the transform length and scaling the power could only be performed by digital Fast Fourier Transform (FFT) processors. By using the real-time recursive DFT processor, the decimation filter is eliminated. Thus, further reduction in the hardware cost and power consumption of the multi-standard transceiver is achieved. The real-time recursive DFT processor was designed in 180 nm CMO...
[[abstract]]In this paper, we propose a programmable fixed-point digital signal processor for wirele...
To impose the reconfigurability and reusability of digital circuits for millimeterwave transmitter a...
The Fast Fourier Transform (FFT) Algorithm is an efficient way to calculate the Discrete Fourier Tra...
In some cases, signal processing is easier in frequency-domain and Discrete Fourier Transform (DFT) ...
In the recent past, communication is predominantly becoming wireless which is a drastic shift from w...
The prevalent need for very high-speed digital signals processing in wireless communications has dri...
Fast Fourier transform has been used in wide range of applications such as digital signal processing...
[[abstract]]© 1999 Institute of Electrical and Electronics Engineers - This paper presents a novel V...
Abstract—This paper presents a new dynamic voltage and frequency scaling (DVFS) FFT processor for MI...
In modern technologies, the DSP algorithms behind the VLSI architectures play a significant role. Th...
In this paper, a novel high-performance 8k-point fast Fourier transform(DFT) processor architecture ...
Efficient FFT processor is one of the key components in the implementation of wideband Multicarrier ...
International audienceBeing an essential issue in digital systems, especially battery-powered device...
In this article, we present a novel fixed-point 16-bit word-width 64-point FFT/IFFT processor develo...
Fast Fourier Transform (FFT) processing is one of the key procedure in popular Orthogonal Frequency ...
[[abstract]]In this paper, we propose a programmable fixed-point digital signal processor for wirele...
To impose the reconfigurability and reusability of digital circuits for millimeterwave transmitter a...
The Fast Fourier Transform (FFT) Algorithm is an efficient way to calculate the Discrete Fourier Tra...
In some cases, signal processing is easier in frequency-domain and Discrete Fourier Transform (DFT) ...
In the recent past, communication is predominantly becoming wireless which is a drastic shift from w...
The prevalent need for very high-speed digital signals processing in wireless communications has dri...
Fast Fourier transform has been used in wide range of applications such as digital signal processing...
[[abstract]]© 1999 Institute of Electrical and Electronics Engineers - This paper presents a novel V...
Abstract—This paper presents a new dynamic voltage and frequency scaling (DVFS) FFT processor for MI...
In modern technologies, the DSP algorithms behind the VLSI architectures play a significant role. Th...
In this paper, a novel high-performance 8k-point fast Fourier transform(DFT) processor architecture ...
Efficient FFT processor is one of the key components in the implementation of wideband Multicarrier ...
International audienceBeing an essential issue in digital systems, especially battery-powered device...
In this article, we present a novel fixed-point 16-bit word-width 64-point FFT/IFFT processor develo...
Fast Fourier Transform (FFT) processing is one of the key procedure in popular Orthogonal Frequency ...
[[abstract]]In this paper, we propose a programmable fixed-point digital signal processor for wirele...
To impose the reconfigurability and reusability of digital circuits for millimeterwave transmitter a...
The Fast Fourier Transform (FFT) Algorithm is an efficient way to calculate the Discrete Fourier Tra...