Chiou-Yng Lee

From MaRDI portal
Person:605722

Available identifiers

zbMath Open lee.chiou-yngMaRDI QIDQ605722

List of research outcomes

PublicationDate of PublicationType
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">$(a, b)$</tex-math> </inline-formula>-Way Karatsuba Algorithm”2021-08-26Paper
Efficient Subquadratic Space Complexity Architectures for Parallel MPB Single- and Double-Multiplications for All Trinomials Using Toeplitz Matrix-Vector Product Decomposition2021-08-26Paper
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)$</tex></formula>-Way Karatsuba Algorithm2021-08-26Paper
Efficient Digit-Serial KA-Based Multiplier Over Binary Extension Fields Using Block Recombination Approach2021-08-26Paper
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 Techniques2021-08-26Paper
Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomials2018-07-09Paper
Concurrent Error Detection and Correction in Gaussian Normal Basis Multiplier over GF(2^m)2017-08-08Paper
A Linear Time Pessimistic Diagnosis Algorithm for Hypermesh Multiprocessor Systems under the PMC Model2017-06-20Paper
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 Approach2017-06-20Paper
Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial2013-04-04Paper
Efficient bit-parallel multipliers over finite fields GF\((2^m)\)2010-11-25Paper
Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\)2010-01-11Paper
Multiplexer-based bit-parallel systolic multipliers over GF(\(2^m)\)2008-08-15Paper
Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\)2006-11-06Paper
Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm2006-10-10Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Chiou-Yng Lee