This paper presents an efficient architecture for performing 128 points to 1M points Fast Fourier Transformation (FFT) based on mixed radix-2/4/8 butterfly unit. The proposed FFT architecture reduces the computation cost by taking the advantage of the radix-8 FFT algorithm while remaining compatible with sequences whose data length is an integral power of 2. Further optimizations for reconfigur...

This note presents two new fast discrete cosine transform computation algorithms: a radix-3 and a radix-6 algorithm. These two Manuscript received November 21, 1991; revised January 4, 1993. The authors are with the Department of Electronic Engineering, Hong IEEE Log Number 921 1527. Kong Polytechnic, Hung Hom, Kowloon, Hong Kong. new algorithms are superior to the conventional radix-2 algorith...

This paper proposes practical receipt-free voting schemes which are suitable for (nation wide) large scale elections. One of the proposed scheme requires the help of the voting commission, and needs a physical assumption, the existence of an untappable channel. The other scheme does not require the help of the commission, but needs a stronger physical assumption, the existence of a voting booth...

1087 puts of each module in a special way to cause the output of the total algorithm to be in proper order 111, 191. This results in the fxtest algorithm, but the program must be written for a specific length. A fourth method is similar, but achieves the unscrambling by properly choosing the mulitplier constants in the modules [IO]. A program based on this method could transform many different ...

In this work we present a new CORDIC algorithm for the vectoring mode, based on the use of radix-4, preserving a complexity in the microrotations that is similar to that of the conventional radix-2 CORDIC. The use of this radix, together with the inclusion in the CORDIC algorithm of the zero skipping technique, reduces by more than half the number of iterations with respect to the conventional ...

FFT mainly involved important role in electronics & communication field. The various types of FFT radix algorithm have analyzed and is to be modified in future. As a result of its exhaustive computational necessities, it occupies large area and consumes high power if implemented in hardware. Efficient algorithms are developed to improve its architecture.In this paper, we have conversed about FF...

Switched-capacitor (SC) signal processing, :ing a sampled-data, analog-circuit technique, has a natural affinity to multiple-valued logic (MVL). Its simplicity in creating and manipulating signedsignals (in the form of voltage or charge) in any desired radix makes the SC topology a unique circuit technique for MVL implementation, especially when the base value is relatively high. In this paper,...

This project presents implementation of a pipelined complex fused FFT processor for multipurpose applications . In this project, both radix-2 and radix-4 floating point butterflies are implemented with more efficiency and with the two fused floating-point operations. Reusability is the main concern in this project. By using fusing concept common required components are shared by different opera...