Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 34 for “"radix 2"”.
-
Design and implementation of Radix-3/Radix-2 based novel hybrid SAR ADC in scaled CMOS technologies
… speed up the conversion process, we introduce a radix-3 SAR ADC which can compute 1:6 bits per cycle. To our knowledge, it is the first fully programmable and efficiently hardware controlled radix-3 SAR ADC. We had to use two comparators per cycle due to ADC architecture and we proposed a simple …
-
Comparison of Radix-w and Radix-3 Fast Fourier Transform Algorithms
In this essay a radix-3 FFT algorithm is described and implemented. A modified radix-2 FFT algorithm from the subroutine "FOUREA" of the IEEE Library is also included. Comparisons of the two FFT algorithms are given in terms of the number of computations required and in terms of the accuracy …
-
New approaches for the design of low-complexity radix-based FFT and FHT algorithms
… of the algorithms. To achieve these objectives, radix-based algorithms are proposed by introducing new decomposition strategies, efficient index mappings, and by an appropriate use of the Kronecker product. A general decomposition method, which is based on the radix-2 approach, valid for any …
-
Lygiagretizuota greitoji Furje transformacija naudojant CUDA /
… are explorer. Mathematical properties selected radix-2 Cooley-Tukey and radix-2, radix-4, radix-8, radix-16 Stockham algorithms are described. This is accompanied by examination of CUDA parallel programming model and its practices with regard to implementation optimization. Lastly, CUDA enabled …
-
Efficient Integer Representations for Cryptographic Operations
Every positive integer has a unique radix 2 representation which uses the digits {0,1}. However, if we allow digits other than 0 and 1, say {0,1,-1}, then a positive integer has many representations. Of these <i>redundant</i> representations, it is possible to choose one that has few nonzero …
-
Frequency Domain Approaches to Fault Detection in Closed-Loop Systems
… test signals is performed by means of a mixed radix-2 fast Fourier transformation technique. This technique avoids the synchronisation problems which arise when the more conventional radix-2 transformation is used with pseudo-random binary test signals. A novel method of parameter sensitivity …
-
Performance prediction of fast Fourier transform algorithms on loosely coupled multiprocessors
… study we examine the effects of implementing the Radix 2, the Radix 4 and the Prime Factor Fast Fourier Transform algorithms on two instances of message-based multiprocessor architectures. The machines we use are a 16 node Intel iPSC Hypercube, running the Intel operating system version 3.1 and …
-
Switch-based Fast Fourier Transform processor
… presents a switch-based architecture to design radix-2 FFT processors. The processor employs M processing elements, 2M memory arrays and M Read Only Memories (ROMs). One processing element performs one radix-2 butterfly operation. The memory arrays are designed as single-port memory, where each …
-
Modular pipeline fast Fourier transform algorithm
… The architecture and control logic for both a radix-2 and radix-4 modular pipeline FFT is explained and compared to the traditional pipeline FFT. Further, this methodology facilitates the hardware computation of long FFTs when compared to previous techniques. The new logic developed to control …
-
Methods for performing discrete fourier transforms on the TSM32020 microprocessor
… is large enough for a 32K point single butterfly radix-2 FFT computation. The direct DFT program performs a 64 point complex DFT in 7.16 milliseconds. The FFT speed is excellent, although not comparable to modern digital spectrum analyzers. The single butterfly radix-2 FFT program computes a 1024 …
-
Evaluation of Data-Path Topologies for Self-Timed Conditional Statements
… also presents the derivation of four new radix-2 division algorithms that offer a simpler quotient selection logic compared to the existing radix-2 division algorithms. A circuit optimization technique called Glissando is presented in this research. Glissando exploits a simple idea that …
-
Some software and hardware implementations of the fast Hartley transform
… speed-optimized software implementations of the radix-2 and split-radix FHT algorithms are presented initially, and then applied to the problems of convolution, computation of power spectra, image degradation, and image restoration. Subsequent work involved the development of a new bit-reversal …
-
A design of floating point FFT using Genesil Silicon Compiler.
… exponent is an excess-8 number represented using radix-2. A 16 bit reduced word size floating-point arithematic unit for high speed signal analysis was implemented. The layout verification, functional simulation, and timing analysis of these units have been performed on the Genesil Silicon …
-
Digital processing of system responses
… the discrete Fourier transform,<br/><br/>{b) the radix-2 fast Fourier transform, and<br/><br/>(c) the mixed radix fast Fourier transform.<br/><br/>It has been shown that if the radix-2 fast Fourier transform is used unacceptable results are obtained. However, because the sequence length of …
-
A comparison of 2D fourier and spatial techniques for removing noise in real time x-ray radiography
… using both Fourier and spatial techniques. The radix-2 method of performing an FFT was selected for this investigation because of ease of implementation and reasonable computation time for a data transfer processor. The Fourier domain techniques were found to be better suited for removing …
-
The fast fourier transform in assembly languages of microprocessor 68000 and microcontroller 8052
<p>In this report, the 256 point radix-2 FFT algorithm is written in assembly languages of microprocessor 68000( or 68008) and microcontroller 8052( or 8051). The data used can be upto 30 bits, of which the least significant 12 bits are assigned for fractional part.</p><p>The FFT code in assembly …
-
Removing Redundancies of Fast Fourier Transform Computations
… The proposed computation is based on a modified radix-2 algorithm, which removes the redundant operations from the flow-graph. A new processing element is proposed using two radix-2 butterflies which can process four inputs in parallel. A novel conflict-free memory addressing scheme is proposed …
-
Direct sampling receivers for broadband communications
… voltage for comparator, optimal reduced radix-2 capacitor ratio for low-power reference buffers and higher conversion speed, etc. The lane-to-lane mismatches in a time-interleave ADC are minimized by using optimal floor plan and then are calibrated digitally. Three prototypes: the …
Page 1 of 2