This paper investigates how the modularity of these transforms can be used to achieve fault tolerant designs that strive to achieve minimal hardware redundancy.

This paper investigates how the modularity of these transforms can be used to achieve fault tolerant designs that strive to achieve minimal hardware redundancy.

Fault tolerant designs are presented for both the MNT and the MDFT and the resulting efficiencies of the two designs are analyzed and compared.

Jan 15, 2020 · The MDFT enables overlap-add FFT block processing to be implemented without zero padding, resulting in reduced computational complexity and ...

Oct 11, 2024 · Fault tolerant designs for fast convolution implemented with modified transforms. ... Quadratic Modified Fermat Transforms for fast convolution ...

Fault tolerant designs for fast convolution implemented with modified transforms ... convolution implemented with the 2-D Modified Discrete Fourier Transform.

The Goertzel algorithm is commonly used to compute single points of the Discrete Fourier Transform as it reduces the computational complexity.

They concluded that the 8-bit integer design is much more reliable than a 32-bit floating-point implementation, and although larger parallelism increases ...

Jenkins, 'Quadratic Modified Fermat Transforms for Fast Convolution and ... Jenkins, 'Special Fault Tolerant properties of FFT-based transform domain ...

Feb 17, 2022 · According to our experiments, winograd convolution can be utilized to reduce fault-tolerant design overhead by 27.49% or energy consumption by ...