طراحی مبدل معکوس برای مجموعه پیمانه {2n-1,2n,2 2n-1 -1}
پایان نامه
- وزارت علوم، تحقیقات و فناوری - دانشگاه شهید بهشتی - دانشکده مهندسی برق و کامپیوتر
- نویسنده سارا سزاوار دخت فاروقی
- استاد راهنما کیوان ناوی
- تعداد صفحات: ۱۵ صفحه ی اول
- سال انتشار 1387
چکیده
چکیده ندارد.
منابع مشابه
ضرب‌کننده و ضرب‌جمع‌کننده پیمانه 2n+1 برای پردازنده سیگنال دیجیتال
Nowadays, digital signal processors (DSPs) are appropriate choices for real-time image and video processing in embedded multimedia applications not only due to their superior signal processing performance, but also of the high levels of integration and very low-power consumption. Filtering which consists of multiple addition and multiplication operations, is one of the most fundamental operatio...
متن کاملResidue-to-binary arithmetic converter for moduli set {2n -1, 2n, 2n+1, 2n+1 -1}
This paper presents a new reverse converter architecture for the moduli set { 2 -1, 2, 2 +1, 2-1}. It exploits the special properties of the numbers of the form 1 2 ± , and extends the dynamic range of the present triple moduli based systems. Here we use a combination of CRT and MRC for reverse conversion. With a pipelined system the throughput rate is that of a single 3n+1 bit binary adder delay.
متن کاملFast Sign Detection Algorithm for the RNS Moduli Set 2n+1-1, 2n-1, 2n
This brief presents a fast sign detection algorithm for the residue number system moduli set {2n+1 − 1, 2n − 1, 2n}. First, a sign detection algorithm for the restricted moduli set is described. The new algorithm allows for parallel implementation and consists exclusively of modulo 2n additions. Then, a sign detection unit for the moduli set {2n+1 − 1, 2n − 1, 2n} is proposed based on the new s...
متن کاملMemoryless RNS-to-binary converters for the {2n+1 - 1, 2n, 2n - 1} moduli set
In this paper, we propose two novel memoryless reverse converters for the moduli set {2 − 1, 2, 2 − 1}. The first proposed converter does not entirely cover the dynamic range while the second proposed converter covers the entire dynamic range. First, we simplify the Chinese Remainder Theorem in order to obtain a reverse converter that utilizes mod-(2 − 1) operation. Second, we further reduce th...
متن کاملFully parallel comparator for the moduli set {2n, 2n-1, 2n+1}
A novel circuit based on sign detection is introduced in this paper which uses the subtraction for comparing two numbers without carrying out a full comparison and conversion. Thus, the proposed schema decreases the delay significantly using only a little redundant hardware in contrast to previous works. Also the time complexity of the new design has the best results comparing to the previous w...
متن کاملAdder based residue to binary number converters for (2n-1, 2n, 2n+1)
Based on an algorithm derived from the New Chinese Remainder Theorem I, we present three new residue-to-binary converters for the residue number system (2 1 2 2 + 1) designed using 2 -bit or -bit adders with improvements on speed, area, or dynamic range compared with various previous converters. The 2 -bit adder based converter is faster and requires about half the hardware required by previous...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
نوع سند: پایان نامه
وزارت علوم، تحقیقات و فناوری - دانشگاه شهید بهشتی - دانشکده مهندسی برق و کامپیوتر
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023