Journal ArticleDOI
Prime-factor Hartley and Hartley-like transform calculation using transversal filter-type structures
Said Boussakta,A.G.J. Holt +1 more
- Vol. 136, Iss: 5, pp 269-277
TLDR
The Hartley transform as mentioned in this paper is a real-to-real transform that can be implemented using transversal filter-type structures, and it is suitable for VLSI implementation.Abstract:
The advances in digital fabrication technology have led to a new generation of integrated circuits capable of performing fast arithmetic operations, and opened the door to the consideration of algorithms that may be implemented with simple structures. When the number of data samples in the input block is prime or a product of primes, the Hartley transform can readily be mapped to circular convolutions and then implemented using transversal filter-type structures. Such a structure is simple and regular, and hence it is suitable for VLSI implementation. The Hartley transform is real-to-real and it is the same for both forward and inverse transformations. Hence, it is simpler and may therefore be somewhat faster than the DFT implemented by the same approach.read more
Citations
More filters
Journal ArticleDOI
A VLSI constant geometry architecture for the fast Hartley and Fourier transforms
TL;DR: In this paper, an application-specific architecture for the parallel calculation of the decimation in time and radix 2 fast Hartley (FHT) and Fourier (FFT) transforms is presented.
Patent
Noise suppression apparatus
Akira Nohara,Jyoji Kane +1 more
TL;DR: In this article, a noise suppression apparatus comprising a tuner 1 which selectively receiving a radio wave signal to be received and transforming it into an electric signal, a field information detector 2 which detects electric field information of the radio wave signals received by the tuner and an amplifier 7 which outputs a noiseless signal outputted from the noise canceler 4.
Patent
Radio receiver noise suppression system
Akira Nohara,Joji Kane +1 more
TL;DR: In this article, the authors proposed a noise suppression scheme that includes a tuner 1 which selectively receives a radio wave signal and transforms it into an electric signal H(k), a field information detector 2 which detects electric field information of the signal received by the tuner, a noise data generator 6 which generates a noise pattern W(k), and an amplifier 7 which outputs a noiseless signal outputted from the noise canceler 4.
Proceedings ArticleDOI
Fast algorithms for computing the discrete W transforms
Sammy Chan,K.L. Ho +1 more
TL;DR: It is found that an odd length type II and III DWT can be mapped to a discrete Hartley transform (DHT) by means of a simple index mapping.
Journal ArticleDOI
New radix-3 and −6 decimation-in-frequency fast Hartley transform algorithms
K. M. M. Prabhu,A. Nagesh +1 more
TL;DR: From the results, it is seen that the radix-3 and -6 FHT algorithms presented are comparable to the split-radix FHT algorithm in terms of their operation count and will be more efficient when the sequence length is closer to an integer power of the corresponding radix.
References
More filters
Book
Introduction to Number Theory
TL;DR: This chapter discusses the Factorization of Integers, a branch of Arithmetic Functions, which addresses the problem of how to estimate the number of factors in a discrete-time system.
Book
The Hartley transform
TL;DR: The author describes the fast algorithm he discovered for spectral analysis and indeed any purpose to which Fourier Transforms and the Fast Fourier Transform are normally applied.
Book
Fast Transforms Algorithms, Analyses, Applications
TL;DR: This chapter discusses Fourier Series and Fourier Transform Algorithms, Discrete Fourier Transforms, DFT Filter Shapes and Shaping, and Spectral Analysis Using the FFT.
Book ChapterDOI
Introduction to Algebraic Number Theory
TL;DR: By an algebraic number we mean a number 9 which is a root of the algebraic equation as mentioned in this paper, and the number 9 is the number of the first number in the equation.