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
••
TL;DR: In the correspondence, a fair comparative analysis of algorithms for the fast Hartley transform (FHT) and the real valued fast Fourier transform (RVFFT) is presented and a new and more accurate model for the prediction of execution time of the algorithm is proposed.
Abstract: In the correspondence, a fair comparative analysis of algorithms for the fast Hartley transform (FHT) and the real valued fast Fourier transform (RVFFT) is presented. The complexity analysis and run-time comparisons are conducted and explained simultaneously. The complexity analysis shows great similarity between RVFFT and FHT. The run-time comparisons also show negligible differences, with some small advantages to RVFFT. The influence of the compiler on the execution time may be more significant than the choice of the algorithm. Also, a new and more accurate model for the prediction of execution time of the algorithm is proposed. >
20 citations
••
TL;DR: This paper presents a modified convolution and product theorem in the LCT domain derived by a representation transformation in quantum mechanics, which is compared with the existing convolution theorem and is found to be a better and befitting proposition.
Abstract: The Linear Canonical Transform LCT is a four parameter class of integral transform which plays an important role in many fields of signal processing. Well-known transforms such as the Fourier Transform FT, the FRactional Fourier Transform FRFT, and the FreSnel Transform FST can be seen as special cases of the linear canonical transform. Many properties of the LCT are currently known but the extension of FRFTs and FTs still needs more attention. This paper presents a modified convolution and product theorem in the LCT domain derived by a representation transformation in quantum mechanics, which seems a convenient and concise method. It is compared with the existing convolution theorem for the LCT and is found to be a better and befitting proposition. Further, an application of filtering is presented by using the derived results.
20 citations
••
26 Jun 2011
TL;DR: In this article, the performance of selective mapping (SLM), interleaving and partial transmit sequence (PTS) techniques for transmitting real-valued OFDM signals is analyzed for optical orthogonal frequency division multiplexing (O-OFDM) systems.
Abstract: In this paper, we present different peak-to-average power ratio (PAPR) reduction techniques, for optical orthogonal frequency division multiplexing (O-OFDM) systems based on both the fast Fourier transform (FFT) and the fast Hartley transform (FHT). We analyze the performance of selective mapping (SLM), interleaving and partial transmit sequence (PTS) techniques for transmitting real-valued OFDM signals. In O-OFDM systems based on FFT, a direct implementation of PTS and interleaving techniques destroy the Hermitian symmetry. In FHT-based O-OFDM, all the proposed techniques are implemented and compared, showing that PTS provides the highest PAPR reduction. Furthermore, we demonstrate that the proposed solutions considerably improve the bit error rate (BER), by reducing the clipping noise in intensity-modulated direct-detection O-OFDM systems.
19 citations
01 Jan 2015
TL;DR: In this article, the authors explored the use of the Hilbert transform for three different applications: electrocardiography, the Hilbert-Huang transform and modulo-modulo transform.
Abstract: The Hilbert transform is a widely used transform in signal processing. In this thesis we explore its use for three different applications: electrocardiography, the Hilbert-Huang transform and modul ...
19 citations