An efficient VLSI design of a new CRT-based reverse converter for the moduli set {2ⁿ, 2²ⁿ − 1, 2²ⁿ⁺¹ − 1}
by Edem Kwedzo Bankas; Kazeem Alagbe Gbolagade
International Journal of Circuits and Architecture Design (IJCAD), Vol. 1, No. 3, 2014

Abstract: This paper presents an efficient reverse converter for a recently proposed 5n bit dynamic range moduli set {2²ⁿ - 1, 2ⁿ, 2²ⁿ⁺¹ - 1}. Our proposed converter is based on the New Chinese Remainder Theorem I scheme. The resulting architecture is adder based and memoryless consisting of two CSAs, three CPAs and a multiplexer which makes it suitable for efficient VLSI implementation. The proposed scheme is evaluated both theoretically and experimentally. From the theoretical point of view, our reverse converter outperforms the best known equivalent state-of-the-art in terms of both speed and area cost. Additionally, FPGA implementation results indicate that, on the average, our proposed reverse converter achieves about 16.03% reduction in hardware resources when compared with the existing state-of-the-art reverse converters. Also, in terms of conversion time, our proposed reverse converter is approximately 9.46% faster than the best known state-of-the-art.

Online publication date: Wed, 08-Apr-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Circuits and Architecture Design (IJCAD):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com