✦ LIBER ✦

Fast Sign Detection for RNS $(2^{n}-1,2^{n},2^{n}+1)$

✍ Scribed by Tomczak, T.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast Sign Detection Algorithm for the RN

✍ Xu, Minghe; Bian, Zhenpeng; Yao, Ruohe 📂 Article 📅 2015 🏛 IEEE 🌐 English ⚖ 899 KB

Shifter circuits for {2n+1, 2n, 2n−1} RN

✍ Bakalis, D.; Vergos, H.T. 📂 Article 📅 2009 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 102 KB

RNS-to-Binary Converters for Two Four-Mo

✍ Mohan, P. V. Ananda; Premkumar, A. B. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 505 KB

Simple, Fast, and Exact RNS Scaler for t

✍ Chang, Chip-Hong ;Low, Jeremy Yung Shern 📂 Article 📅 2011 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 710 KB

Efficient VLSI Implementation of $2^{{n}

✍ Tay, Thian Fatt; Chang, Chip-Hong; Low, Jeremy Yung Shern 📂 Article 📅 2013 🏛 IEEE 🌐 English ⚖ 609 KB

Fast Modulo 2^{n} - (2^{n - 2} + 1) Addi

✍ Patel, R.A.; Benaissa, M.; Boussakta, S. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 907 KB