In most of the Communication Systems the Fourier transform is the main concept to process the signals which are used in the system. Then the FFT/IFFT comes in to the picture for fast signal processing, but the FFT/IFFT has some delays present and area of the implementation is very large . So we need to design an architecture which is optimized in terms of both delay and area. The Main Reason for the delay and complexity of the architecture due to the complex multiplications implementation present in the Fast Fourier Transform due to the twiddle factors (𝑤𝑁 𝑟 ). Then the proposed pipeline architecture leads to decreasing of the complex multiplications . But the delay is present in this architecture also. Here we propose Pipeline architecture which removes the complex multiplications using the twiddle factors. In this Pipeline architecture we are going to use the delay elements, switch elements and basic butterfly structure and the input data stream is divided in to two half streams and processing is done at the same time and output data stream will also be in two half data streams and here the number of complex multiplications will be reduced a lot which reduces the cost of implementation.
The right to download or print any of the pages of this thesis (Material) is granted by the copyright owner only for personal or classroom use. The author retains all proprietary rights, including copyright ownership. Any reproduction or editing or other use of this Material by any means requires the express written permission of the copyright owner. Except as provided above, or any use beyond what is allowed by fair use (Title 17 Section 107 U.S.C.), you may not reproduce, republish, post, transmit or distribute any Material from this web site in any physical or digital form without the permission of the copyright owner of the Material. Inquiries regarding any further use of these materials should be addressed to Administration, Jernigan Library, Texas A&M University-Kingsville, 700 University Blvd. Kingsville, Texas 78363-8202, (361)593-3416.