Efficient CORDIC-based systolic architectures for the discrete Hartley ...
Recommend Documents
Nov 28, 1994 - by Bracewell in 1983 as an alternative to the well known discrete Fourier transform (DFT) [l]. For a data sequence {x,}:::, its DHT is defined as.
AbstractâNovel architectures for 1-D and 2-D discrete wavelet transform (DWT) by using lifting schemes are presented in this paper. An embedded decimation ...
Abstractâ A new fast algorithm for computing the discrete. Hartley transform (DHT) is presented, which is based on the expansion of the transform matrix.
In this paper, a new fast Hartley transform (FHT) algorithm- radix-22 suitable for pipeline implementation of the discrete. Hartley transform (DHT) is presented.
Received October 2'1, 1985; acceptor] Iuly 28, 1986 liracewell has proposed the discrete Hartley transform (l)H'l') as a substitute for the discrete Fourier ...
receiver, the received signal vector r=[rN.l rN.2 ... rl rolT and the IDHT-modulated data vector s have the following relation: r = Ps + n = HOHs + n = HOS + n.
Bracewell (4) has shown that a fast implementation of the. DHT (FHT) is possible for any transform length N = 2P. The Bracewell fast algorithm is shown in Figure ...
This paper presents a real-valued discrete multicamer modulation approach that is based on the use of the discrete Hartley transform (DHT) and its inverse ...
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 41, NO. 5, MAY 1993. Area-Efficient Architectures for the Viterbi. Algorithm-Part 11: Applications.
Hartley transform (DHT) as a substitute for the discrete fourier transform (DFT) [4,5]. ..... Implementation in FPGA Using Census Transform for Effective. Resource ...
and e(;) represent desired, input, output, and error feedback signals. It is known that given values, pinax, are the same for I-D and 2-D adaptive systems, so the.
parity prediction arithmetic operators,â IEEE Design Test Mag.,. April/June 1997. ... the computation of modular multiplication in RSA cryptosystems. In the.
S.C. KNOWLES AND J.G. McWHIRTER. Signal Processing Group, Royal Signals and Radar Establishment, Saint Andrews Road, Great Malvern, Worcestershire ...
the running time of optimised implementations in the C programming language. ... to compute the DGT is to window a signal in the time domain, and then compute an FFT of ... actual timings of the algorithms on a standard desktop computer. 2.
used of 256 Discrete Tchebichef Transform can produce concurrently four formants ... DTT has been applied in several computer vision and image processing.
International Conference on Graphic and Image Processing (ICGIP 2012), ... is the vowel 'O' and the consonant 'RA' from the International Phonetic Alphabet.
network providers are beginning to build private video delivery networks to deliver ... storage, content servers and a local area network (LAN) [8]. ... Cisco 10008.
paper, we first present fast convolution algorithm and its matrix form. Then based on the fast ... hardware reconfigurability, convolutional neural network (CNN).
for CSG [1], volume rendering [13, 16], haptics in volume render- ing [4] ... calculating a small occupancy map containing a single bit per sub- cube of the volume ..... The percentage of empty voxels is given in Table 1, but does not reveal any ...
intruders more easily than hardware, jeopardizing the whole application security [21]. .... For elliptic curve defined over GF(p), two different forms of formulae are.
ABSTRACT. Efficient hardware acceleration architectures are proposed for the most demanding MPEG-4 core profile algorithms, namely; tex- ture motion ...
Apr 25, 2014 - M. Balakrishnan · K. Paul. Department of Computer Science Engineering, Indian Institute of Technology, Delhi, India e-mail: [email protected].
Dec 6, 2004 - of ASIC design, including potential for parallelism, very efficient ..... This problem is a standard graph theory problem in physical design automation known as âmin- ..... However, in practice, buffers and synchronization will.
Efficient CORDIC-based systolic architectures for the discrete Hartley ...
Nov 28, 1994 - Abstract: The paper presents two new linear systolic architectures for the one-dimensional dis- crete Hartley transform (DHT). Both architectures.
Efficient CORDIC-based systolic architectures for the discrete Hartley transform W.-H. Fang J.-D. Lee
Indexing terms: Discrete Hartley transform, Signal processing, Systolic arrays, VLSI
Abstract: The paper presents two new linear systolic architectures for the one-dimensional discrete Hartley transform (DHT). Both architectures exhibit several desired features such as regularity, modularity and high pipelineability, which make them amenable to VLSI hardware implementation. In addition these new architectures use the CORDIC (co-ordinate rotation digital computer) algorithm as the basic function for each PE (processing element) which has been shown to be an appealing approach to compute trigonometric functions. Combination of these two array processors to form a new fully pipelined meshconnected systolic architecture for the two-dimensional (2-D) DHT is also addressed. This new architecture, which uses Horner’s rule and the symmetric property of the transform by folding the data either in the time domain or in the frequency domain, yield higher throughput with reduced hardware complexity compared with other existing ones for both the 1-D and 2-D case.
1
Introduction
The discrete Hartley transform (DHT) was first presented by Bracewell in 1983 as an alternative to the well known discrete Fourier transform (DFT) [l]. For a data sequence {x},:, its DHT is defined as N-1
