Low complexity Fourier Transform using double square-waves

This paper proposes a simplified method for computation of Fourier Transform by employing double square-waves, called double square-waves Fourier transform (DS-FT). Compared to the conventional single square-wave, double square-waves can increase the resolution of signals. Thus, the orthogonality is kept so the bit-error-rate (BER) performance is better than that of Fourier transform using a conventional single square-wave. Our results confirm that the BER performance is significantly improved. The BER performance by the conventional waveform has residual bit error at BER level of 1.5 x 10^-3, while BER of the proposed method has no residual bit error up to the BER level of 1 x 1CT7. In addition, the proposed DS-FT has no restriction in its size (e.g. power of two, etc.) as in fast Fourier transform (FFT). Therefore DS-FT is applicable to any size of Fourier transform.