Topic
Hartley transform
About: Hartley transform is a research topic. Over the lifetime, 2709 publications have been published within this topic receiving 79944 citations.
Papers published on a yearly basis
Papers
More filters
••
01 Jan 2008TL;DR: In this paper, the FFT Algorithm with Radix-2 Decimation-in-Frequency (DIF) algorithm is presented, which is based on the Radix 2 Bit Reversal algorithm.
Abstract: This chapter contains sections titled: Introduction Development of the FFT Algorithm with Radix-2 Decimation-in-Frequency FFT Algorithm with Radix-2 Decimation-in-Time FFT Algorithm with Radix-2 Bit Reversal for Unscrambling Development of the FFT Algorithm with Radix-4 Inverse Fast Fourier Transform Programming Examples References
124 citations
01 Jan 1969
TL;DR: This chapter contains sections titled: Introduction, An Algorithm Suggested by Chirp Filtering, and An Algorithm Suggested By ChirP Filtering.
Abstract: This chapter contains sections titled: Introduction, An Algorithm Suggested by Chirp Filtering
121 citations
••
IBM1
TL;DR: The contributions of many investigators are described and placed in historical perspective in this paper on the fast Fourier transform algorithm.
Abstract: The fast Fourier transform algorithm has a long and interesting history that has only recently been appreciated. In this paper, the contributions of many investigators are described and placed in historical perspective.
121 citations
••
TL;DR: A new convolution structure for the LCT is introduced that preserves the convolution theorem for the Fourier transform and is also easy to implement in the designing of filters.
Abstract: The linear canonical transform (LCT) plays an important role in many fields of optics and signal processing. Many properties for this transform are already known, however, the convolution theorems don't have the elegance and simplicity comparable to that of the Fourier transform (FT), which states that the Fourier transform of the convolution of two functions is the product of their Fourier transforms. The purpose of this letter is to introduce a new convolution structure for the LCT that preserves the convolution theorem for the Fourier transform and is also easy to implement in the designing of filters. Some of well-known results about the convolution theorem in FT domain, fractional Fourier transform (FRFT) domain are shown to be special cases of our achieved results.
120 citations
••
TL;DR: In this article, the authors proposed an optical orthogonal frequency division multiplexing (O-OFDM) scheme, suitable for intensity-modulated direct-detection systems, where the modulation/demodulation processing takes advantage of the fast Hartley transform algorithm.
Abstract: We present a novel optical orthogonal frequency division multiplexing (O-OFDM) scheme, suitable for intensity-modulated direct-detection systems, where the modulation/demodulation processing takes advantage of the fast Hartley transform algorithm. Due to the properties of the discrete Hartley transform (DHT), the conventional transmission scheme can be streamlined. We demonstrate that asymmetrically clipping (AC) technique can also be applied to DHT-based OFDM; the signal can be transmitted without the need of a DC bias, resulting in a power-efficient system, not affected by clipping noise. Hermitian symmetry is not required for the input signal. Therefore, this technique supports the double of input symbols compared to both AC and DC-biased O-OFDM, based on standard Fourier processing. The analysis in an additive white Gaussian noise channel shows that the same performance can be achieved by replacing 4, 16, and 64 QAM (quadrature-amplitude modulation) AC optical-OFDM with a simpler system based on DHT, using binary phase-shift keying (BPSK), 4 and 8 PAM (pulse-amplitude modulation), respectively.
115 citations