Fast implementations of fuzzy arithmetic operations using fast Fourier transform (FFT)
From MaRDI portal
Recommendations
- An efficient representation format for fuzzy intervals based on symmetric membership functions
- Fast convolution and fast Fourier transform under interval and fuzzy uncertainty
- Computational method to evaluate fuzzy arithmetic operations
- A parametric representation of fuzzy numbers and their arithmetic operators
Cited in
(5)- Fast convolution and fast Fourier transform under interval and fuzzy uncertainty
- High-speed DSP-based implementation of piecewise-affine and piecewise-quadratic fuzzy systems.
- Fuzzy strategic replacement analysis
- An efficient representation format for fuzzy intervals based on symmetric membership functions
- FFT Implementation with Fused Floating-Point Operations
This page was built for publication: Fast implementations of fuzzy arithmetic operations using fast Fourier transform (FFT)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1282871)