|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 85 - Issue 18 |
| Published: January 2014 |
| Authors: H. Siewobr, K. A. Gbolagade |
10.5120/14939-2911
|
H. Siewobr, K. A. Gbolagade . Modulo Operation Free Reverse Conversion in the {2^(2n+1)-1,2^n,2^2n-1} Moduli Set. International Journal of Computer Applications. 85, 18 (January 2014), 6-14. DOI=10.5120/14939-2911
@article{ 10.5120/14939-2911,
author = { H. Siewobr,K. A. Gbolagade },
title = { Modulo Operation Free Reverse Conversion in the {2^(2n+1)-1,2^n,2^2n-1} Moduli Set },
journal = { International Journal of Computer Applications },
year = { 2014 },
volume = { 85 },
number = { 18 },
pages = { 6-14 },
doi = { 10.5120/14939-2911 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2014
%A H. Siewobr
%A K. A. Gbolagade
%T Modulo Operation Free Reverse Conversion in the {2^(2n+1)-1,2^n,2^2n-1} Moduli Set%T
%J International Journal of Computer Applications
%V 85
%N 18
%P 6-14
%R 10.5120/14939-2911
%I Foundation of Computer Science (FCS), NY, USA
This paper proposes a fast Mixed Radix Conversion based reverse converter for the recently proposed moduli set ?{2?^(2n+1)-1,2^n,2^2n-1}. It shows that the computation of multiplicative inverses could be eliminated from the conversion process and presents a low complexity and modulo operation free implementation. Theoretical analysis shows that the proposed scheme outperforms all state of the art equivalent converters in terms of both area cost and delay.