Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Huixian Huang

dblp:53/4550 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
hardware verification and test
1.012026
MarchGen: A March Sequence Generation Method for Faults With an Arbitrary Number of Operations in RAMs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Electronic design automation › hardware verification and test
memory testing
1.012026
MarchGen: A March Sequence Generation Method for Faults With an Arbitrary Number of Operations in RAMs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026
Electronic design automation › hardware test › integrated circuit testing
RAM fault models
0.312026
MarchGen: A March Sequence Generation Method for Faults With an Arbitrary Number of Operations in RAMs · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026

Methods — techniques the papers use, named apart from their topics

heuristic march sequence generation · 1.0fault hierarchy analysis · 1.0
YearPublicationVenuePosition
2026 MarchGen: A March Sequence Generation Method for Faults With an Arbitrary Number of Operations in RAMs
abstract
The March test is a widely-applied test method for memory arrays. Nowadays, the advanced memory technologies keep introducing new types of defects, which bring diverse multi-operation fault models in turn. The automatic March sequence generation methods are preferred to avoid the inefficient manual design. Most previous methods generate the March sequences that cover limited types of faults and strongly depend on the specific characteristics of known faults. To address this issue, this work proposes MarchGen, a March sequence generation method for memory faults with arbitrary number of operations. Firstly, the fault hierarchies, reduced taxonomy and generic test conditions of 2-composite faults are analyzed. Then, the heuristic March sequence generation workflow is designed accordingly, which takes either fault models or test sequences as input. Three optimization strategies are utilized to improve the fault coverage of the generated March sequences and the generation time consumption. The evaluation results show that the proposed method has low dependence on fault types. The generated March sequences reach 100% fault coverage for any simple and 2-composite faults or test sequences, and the generation time is roughly linear with the size of input set.
Sunrui Zhang, Xiaole Cui, Huixian Huang, Xing Zhang 0002
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
2022 An obfuscation scheme of scan chain to protect the cryptographic chips
abstract
The scan chain, as the most popular structured design for testability (DfT) approach, significantly improves the controllability and observability of the circuit under test (CUT). However, the scan chain can be exploited by the hackers to retrieve the secret information in the cryptographic chip. This work proposes an obfuscation scheme of scan chain with test key. The scan chain is divided into segments by the multiplexers, and the linear feedback shift registers (LFSRs) are constructed by the scan cells in the chain. The selection signals of the multiplexers are controlled by the test key bits, and the two input signals of the multiplexers are the original scan chain data and the feedback data of the corresponding LFSR, respectively. The scan chain works normally if all the key bits are correct. Any wrong key bit leads to the flips on the selection signal of the inserted multiplexer periodically during the test mode, and the scan output is obfuscated. Analysis and simulation results demonstrate that the proposed scheme is resilient against the previous scan-based attacks, while maintaining the advantages of the scan testing,
Huixian Huang, Xiaole Cui, Xiaoxin Cui
ATS1
2022 Customer-satisfaction-aware and deadline-constrained profit maximization problem in cloud computing
Siyi Chen 0001, Fengchao Ma, Huixian Huang
J. Parallel Distributed Comput.4
2009 Rough neural network modeling based on fuzzy rough model and its application to texture classification
Dongbo Zhang 0003, Yaonan Wang 0001, Huixian Huang
Neurocomputing3