In this paper, we analyze the quantization error effects of the radix-22 FFT algorithm. We propose per tone models for the error power. This is a different approach from the com-mon choice of a maximum or mean value over the spectrum. In particular, we treat three different errors: 1) due to input quantization, 2) due to coefficient quantization and 3) due to quantization after a multiplication. This analysis is applied to a DMT scheme. Simulation results agree with the theoretical predictions. 1
A special case of floating point data representation is block floating point format where a block of...
This paper studies the round-off analysis, design and implementation, and applications of the multip...
The efficient computation of Discrete Fourier Transform (DFT) is an important issue as it is used in...
Abstract—In this correspondence the analysis of overall quantization loss for the Fast Fourier Trans...
Abstract—In this paper, we investigate the effect of fixed-point arithmetics with limited precision ...
This Master Thesis studies the different quantization effects in hardware architecture due to the us...
Through several algorithmic changes, the FFT and its variants have not only breathed a new lease of ...
Finite word length effects for frequency-domain implementation of chromatic dispersion compensation ...
Abstract—This correspondence presents an analysis of the finite register length influence on the acc...
The paramount importance enjoyed by the FFT algorithm and its variants is amply demonstrated by the ...
In this thesis, first we investigate the principle of finding the optimized coefficient set of IntFF...
A study of the quantization noise in FFT (fast Fourier transform) processors is undertaken with the ...
This paper analyzes the effects of quantization noise on the error correcting capability of a popula...
International audienceAnalysis This research work focuses on the design of a high-resolution fast Fo...
International audienceSystems based on fixed-point arithmetic, when carefully designed, seem to beha...
A special case of floating point data representation is block floating point format where a block of...
This paper studies the round-off analysis, design and implementation, and applications of the multip...
The efficient computation of Discrete Fourier Transform (DFT) is an important issue as it is used in...
Abstract—In this correspondence the analysis of overall quantization loss for the Fast Fourier Trans...
Abstract—In this paper, we investigate the effect of fixed-point arithmetics with limited precision ...
This Master Thesis studies the different quantization effects in hardware architecture due to the us...
Through several algorithmic changes, the FFT and its variants have not only breathed a new lease of ...
Finite word length effects for frequency-domain implementation of chromatic dispersion compensation ...
Abstract—This correspondence presents an analysis of the finite register length influence on the acc...
The paramount importance enjoyed by the FFT algorithm and its variants is amply demonstrated by the ...
In this thesis, first we investigate the principle of finding the optimized coefficient set of IntFF...
A study of the quantization noise in FFT (fast Fourier transform) processors is undertaken with the ...
This paper analyzes the effects of quantization noise on the error correcting capability of a popula...
International audienceAnalysis This research work focuses on the design of a high-resolution fast Fo...
International audienceSystems based on fixed-point arithmetic, when carefully designed, seem to beha...
A special case of floating point data representation is block floating point format where a block of...
This paper studies the round-off analysis, design and implementation, and applications of the multip...
The efficient computation of Discrete Fourier Transform (DFT) is an important issue as it is used in...