SMUL-FFT: A Streaming Multiplierless Fast Fourier Transform
نویسندگان
چکیده
Beamspace processing is an emerging paradigm to reduce hardware complexity in all-digital millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) basestations. This approach exploits sparsity of mmWave channels but requires spatial discrete Fourier transforms (DFTs) across the antenna array, which must be performed at baseband sampling rate. To mitigate resulting DFT implementation bottleneck, we propose a fully-unrolled Streaming MUltiplierLess (SMUL) fast Transform (FFT) engine that performs one transform per clock cycle. The proposed SMUL-FFT architecture avoids multipliers by restricting twiddle factors sum-of-powers-of-two, substantial power and area savings. Compared state-of-the-art FFTs, our ASIC designs 65nm CMOS demonstrate more than 45% 17% improvements energy-efficiency area-efficiency, respectively, without noticeably increasing error-rate MIMO systems.
منابع مشابه
Fast Fourier Transform ( FFT )
The DFT can be reduced from exponential time with the Fast Fourier Transform algorithm. Fast Fourier Transform (FFT) One wonders if the DFT can be computed faster: Does another computational procedure an algorithm exist that can compute the same quantity, but more e ciently. We could seek methods that reduce the constant of proportionality, but do not change the DFT's complexity O ( N ) . Here,...
متن کاملFourier Transforms and the Fast Fourier Transform ( FFT ) Algorithm
and the inverse Fourier transform is f (x) = 1 2π ∫ ∞ −∞ F(ω)e dω Recall that i = √−1 and eiθ = cos θ+ i sin θ. Think of it as a transformation into a different set of basis functions. The Fourier transform uses complex exponentials (sinusoids) of various frequencies as its basis functions. (Other transforms, such as Z, Laplace, Cosine, Wavelet, and Hartley, use different basis functions). A Fo...
متن کاملA Method for Validating Multidimensional Fast Fourier Transform (FFT) Algorithms,
A method is described for validating fast Fourier transforms (FFTs) based on the use of simple input fiinctions whose discrete Fourier transforms can be evaluated in closed form. Explicit analytical results are developed for one-dimensional and two-dimensional discrete Fourier transforms. The analytical results are easily generalized to higher dimensions. The results offer a means for validatin...
متن کاملPathologies cardiac discrimination using the Fast Fourir Transform (FFT) The short time Fourier transforms (STFT) and the Wigner distribution (WD)
This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds. The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...
متن کاملLecture 20: Discrete Fourier Transform and FFT
basically saying we care not about the rest of x[n], since it is zero. Pretend that it is periodic for analysis purpose since for the DFT it makes no difference. Defined only for 0≤ n,k ≤ N−1. The rest is zero. This means the inherent periodicity is not represented. Notation x[n] DFT ←→ X [k] Lots of properties (similar to DFS) circular convolution is important. Given x1[n] and x2[n], form x̃1[n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Circuits and Systems Ii-express Briefs
سال: 2021
ISSN: ['1549-7747', '1558-3791']
DOI: https://doi.org/10.1109/tcsii.2021.3064238