Research article · May 2013
Research articlePublished Dec 2014
Design of FFT Processor Using Modified Modulo 2n+1 Adder
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
In this paper we present two different architectures for modulo 2n+1 adders and by using this an efficient FFT computation is performed. One of the architecture is based on a sparse carry computation unit in which only some of the carries are computed. In this an inverted circular idempotency property of the parallel prefix carry operator is used and its efficiency is increased by a new prefix operator. The resulting adders will be having less area and power. The second architecture is derived by modifying modulo 2n-1 adders with minor hardware overhead. By using this adders we can implement FFT processor with improved performance
Subjects
EngineeringAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · Apr 2014
Performance improvement in FIR filter using Residue Number System with modulo adders and multipliers
Research article · Mar 2014
A New Class Of Modulo 𝟐𝒏 − 𝟐𝒌 − 𝟏 Adder for Multi-Channel RNS
Research article · Jul 2014
Design and FPGA Implementation of 64-Point FFT Processor
Research article · 5 Jan 2016
Design of Low Power CMOS Parallel Prefix Adder Cell
More from this journal
The newest in International Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering.
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalInternational Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering
- SubjectEngineering
- BylineArticles whose byline prints “Fathima Nishah P”
- BylineArticles whose byline prints “Ruksana Maitheen”
