PDF Archive

Easily share your PDF documents with your contacts, on the Web and Social Networks.

Share a file Manage my documents Convert Recover PDF Search Help Contact

19I16 IJAET0916949 v6 iss4 1615to1621.pdf

Preview of PDF document 19i16-ijaet0916949-v6-iss4-1615to1621.pdf

Page 1 2 3 4 5 6 7

Text preview

International Journal of Advances in Engineering & Technology, Sept. 2013.
ISSN: 22311963
represented by N mixed radix digits. The digits can be generated sequentially through residue
subtraction. In [9] the design of residue number system (RNS) to binary converters was considered.
The moduli set uses moduli of uniform word length (n to n+1bits). It is derived from a previously
investigated four-moduli set. Three RNS-to-binary converters were proposed for this moduli set: one
using mixed radix conversion and the other two using Chinese Remainder Theorem. In [10] various
FFT processors, such as pipelined or memory-based architectures, have been proposed for different
applications have been shown. Authors designed Radix-2 FFT Algorithm and Radix-4 FFT Algorithm
of a system by using FFT controller. Authors in [11] present about how the 128-point mixed radix
FFT/IFFT algorithm implemented to power consumption and hardware cost also be saved. Memory
based FFT architecture decompose a larger FFT computation into several cascaded smaller FFTs and
utilizes a single FFT core to reduce the hardware cost. Section II gives developing Mixed Radix
system for any two integers using two radices. In Section III results and discussion for all possible
ways in which the mixed radix Multiplication takes place has been discussed. Section IV presents
conclusion and scope for the future work. Section V gives the applications in Computers.



Considering N1 and N 2 as any integers consisting of radices r1 , r2 , then general representation of any
integer is given below as:

N1  r2 r1m2  r1m1  m0
N2  r2 r1n2  r1n1  n0
N1  N2   r2 r1m2  r1m1  m0    r2r1n2  r1n1  n0 


log  N1  N2   log   r2 r1m2  r1m1  m0    r2 r1n2  r1n1  n0  

log  N1  N2   log  r2 r1m2  r1m1  m0   log  r2 r1n2  r1n1  n0 


Applying antilog to the both sides of (4), the value of N1  N 2 is obtained.
In Mixed Radix the combination can be

r1  2; r2  3 then m1  0,1; m2  0,1, 2
r1  2; r2  5 then m1  0,1, 2; m2  0,1, 2,3
r1  2; r2  7 then m1  0,1, 2,3; m2  0,1, 2,3, 4
and so on as shown in [1].
There can be four cases for the integers in the mixed radix form represented:
Case 1: If N1  even; N2  even, the output of results with all possible values of m1 , m2 , n1 , n2 are
considered under the criteria of Mixed Radix applicability with the help of a code generated in
MATLAB and obtained the possible values of N1 and N2 , along with N1 * N2 .
% N1 is even and N2 is even (multiplication)
syms r1 r2 m1 m2 n1 n2 m0 n0 N1 N2;
for m1=0:1:(r1-1)
for n1=0:1:(r1-1)
for m2=0:1:(r2-1)
for n2=0:1:(r2-1)
fprintf('\n m2
fprintf('\n %3.4f %3.4f %3.4f %3.4f %3.4f %3.4f %3.4f %3.4f
n0, N1, N2, N1*N2)


Vol. 6, Issue 4, pp. 1615-1621