Chiou-Yng Lee

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Subquadratic Space-Complexity Digit-Serial Multipliers Over <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> Using Generalized <formula formulatype="inline"><tex Notation="TeX">$(a,b)$</ IEEE Transactions on Circuits and Systems I: Regular Papers	2021-08-26	Paper
Area-Efficient Subquadratic Space-Complexity Digit-Serial Multiplier for Type-II Optimal Normal Basis of <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> Using Symmetric TMVP and Block Recombination Te IEEE Transactions on Circuits and Systems I: Regular Papers	2021-08-26	Paper
Comment on “Subquadratic Space-Complexity Digit-Serial Multipliers Over <inline-formula> <tex-math notation="LaTeX">$GF(2^{m})$</tex-math> </inline-formula> Using Generalized <inline-formula> <tex-math notation="LaTeX"&g IEEE Transactions on Circuits and Systems I: Regular Papers	2021-08-26	Paper
Efficient Subquadratic Space Complexity Architectures for Parallel MPB Single- and Double-Multiplications for All Trinomials Using Toeplitz Matrix-Vector Product Decomposition IEEE Transactions on Circuits and Systems I: Regular Papers	2021-08-26	Paper
Efficient Digit-Serial KA-Based Multiplier Over Binary Extension Fields Using Block Recombination Approach IEEE Transactions on Circuits and Systems I: Regular Papers	2021-08-26	Paper
Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomials IEEE Transactions on Computers	2018-07-09	Paper
Concurrent Error Detection and Correction in Gaussian Normal Basis Multiplier over GF(2^m) IEEE Transactions on Computers	2017-08-08	Paper
A Linear Time Pessimistic Diagnosis Algorithm for Hypermesh Multiprocessor Systems under the PMC Model IEEE Transactions on Computers	2017-06-20	Paper
Low-Latency Digit-Serial Systolic Double Basis Multiplier over <formula formulatype="inline"> <tex Notation="TeX">$\mbi GF{(2^m})$</tex> </formula> Using Subquadratic Toeplitz Matrix-Vector Product Approach IEEE Transactions on Computers	2017-06-20	Paper
Multiplexer implementation of low-complexity polynomial basis multiplier in $\mathrm{GF}(2^m)$ using all one polynomial Information Processing Letters	2013-04-04	Paper
Efficient bit-parallel multipliers over finite fields GF(2ᵐ) Computers and Electrical Engineering	2010-11-25	Paper
Low-complexity multiplexer-based normal basis multiplier over GF(2ᵐ) Journal of Zhejiang University. Science A	2010-01-11	Paper
Multiplexer-based bit-parallel systolic multipliers over GF($2^m)$ Computers and Electrical Engineering	2008-08-15	Paper
Scalable and systolic architecture for computing double exponentiation over $\text{GF}(2^m)$ Acta Applicandae Mathematicae	2006-11-06	Paper
Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm Computers and Electrical Engineering	2006-10-10	Paper

Research outcomes over time

This page was built for person: Chiou-Yng Lee