J
Jeremy Yung Shern Low
Researcher at Nanyang Technological University
Publications - 16
Citations - 272
Jeremy Yung Shern Low is an academic researcher from Nanyang Technological University. The author has contributed to research in topics: Residue number system & Adder. The author has an hindex of 6, co-authored 16 publications receiving 238 citations.
Papers
More filters
Journal ArticleDOI
An 8T Differential SRAM With Improved Noise Margin for Bit-Interleaving in 65 nm CMOS
Do Anh-Tuan,Jeremy Yung Shern Low,Joshua Yung Lih Low,Zhi Hui Kong,Xiao Liang Tan,Kiat Seng Yeo +5 more
TL;DR: A fully differential 8T SRAM that allows efficient bit-interleaving to achieve soft-error tolerance with conventional Error Correcting Code (ECC) and consumes less power when compared to the conventional 6T design is used.
Journal ArticleDOI
Design and Sensitivity Analysis of a New Current-Mode Sense Amplifier for Low-Power SRAM
TL;DR: Sensitivity analysis has proven that the new current-mode sense amplifier offers the best reliability with the smallest standard deviation and bit-error-rate, which makes it a wise choice for contemporary high-complexity systems where reliability and power consumption are of major concerns.
Journal ArticleDOI
Simple, Fast, and Exact RNS Scaler for the Three-Moduli Set $\{2^{n} - 1, 2^{n}, 2^{n} + 1\}$
TL;DR: The experimental results show that the proposed RNS scaler is smaller and faster than the most area-efficient adder- based design and the fastest ROM-based design besides being the most power efficient among all scalers evaluated for the same three-moduli set.
Journal ArticleDOI
A New Approach to the Design of Efficient Residue Generators for Arbitrary Moduli
TL;DR: This paper presents a new design of efficient residue generators and the design approach is demonstrated with large input wordlength of 64 bits for arbitrary moduli of up to 6 bits, and the proposed design eliminates the bottleneck carry propagation additions and modular adder tree of existing designs, and circumvents the undesirably high architectural disparity.
Journal ArticleDOI
Erratum to “Efficient VLSI Implementation of $2^{n}$ Scaling of Signed Integer in RNS { $ 2^{n} -1 , 2^{n} , 2^{n} +1$ }”
TL;DR: In this brief, a fast and area efficient 2n signed integer RNS scaler for the moduli set {2n-1, 2n,2n+1} is proposed and achieves at least 21.6% of area saving, 28.8% of speedup, and 32.5% of total power reduction for n ranging from 5 to 8.