Sunrui Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sunrui Zhang has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoxin Cui
Peking University Shenzhen Graduate School
7 shared publications - Feng Wei
Peking University Shenzhen Graduate School, Shenzhen, China
6 shared publications Xing Zhang
Institute of Microelectronics, Peking University, Beijing, China
4 shared publicationsHuixian Huang
Peking University Shenzhen Graduate School, Shenzhen, China
1 shared publication- Qixue Zhang
Key Laboratory of Integrated Microsystems, Peking University Shenzhen Graduate School, Shenzhen, China
1 shared publication Yongliang Chen
Peking University Shenzhen Graduate School, Shenzhen, China
1 shared publication
Latest Publications
- 7 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 34 (1) , 280-293
A Reconfigurable Built-In Self-Test Scheme for the Evaluation Circuits of Digital SRAM-IMC Architectures
Digital static random access memory-based in-memory computing (SRAM-IMC) is a promising computation paradigm to break the von-Neumann bottleneck. However, the IMC architectures also bring a series of challenges for testing, because of the circuit structures and operations that do not exist in the conventional memories. One of the challenges is the testing of evaluation circuits in the digital SRAM-IMC architectures, because the primary inputs (PIs) of the evaluation circuits cannot be directly accessed by the testers. Several test approaches such as the conventional logic built-in self-test (LBIST) modules, the indirect and the scan-chain-based test methods are proposed to address this issue. Nevertheless, these solutions suffer from the low test performance or the high area consumption. This work proposes a reconfigurable built-in self-test (BIST) scheme for the evaluation circuits. By reusing the IMC bitcells and operations, the proposed BIST scheme implements the separate pattern generation (PG) and response analysis (RA) processes. Furthermore, the diverse pattern generators, including the Fibonacci linear feedback shift register (LFSR) and weighted LFSR (WLFSR) with adjustable feedback polynomials and the cellular automata (CA), are realized to improve the test efficiency and fault coverage. The evaluation results show that the proposed BIST scheme has better test performance comparing with the indirect and the scan-chain-based test approaches. The proposed BIST scheme has comparable test performance, whereas it has much less area overhead comparing with the conventional LBIST schemes. Additionally, the proposed BIST scheme is testable and repairable.
- 7 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 34 (1) , 280-293
A Reconfigurable Built-In Self-Test Scheme for the Evaluation Circuits of Digital SRAM-IMC Architectures
Digital static random access memory-based in-memory computing (SRAM-IMC) is a promising computation paradigm to break the von-Neumann bottleneck. However, the IMC architectures also bring a series of challenges for testing, because of the circuit structures and operations that do not exist in the conventional memories. One of the challenges is the testing of evaluation circuits in the digital SRAM-IMC architectures, because the primary inputs (PIs) of the evaluation circuits cannot be directly accessed by the testers. Several test approaches such as the conventional logic built-in self-test (LBIST) modules, the indirect and the scan-chain-based test methods are proposed to address this issue. Nevertheless, these solutions suffer from the low test performance or the high area consumption. This work proposes a reconfigurable built-in self-test (BIST) scheme for the evaluation circuits. By reusing the IMC bitcells and operations, the proposed BIST scheme implements the separate pattern generation (PG) and response analysis (RA) processes. Furthermore, the diverse pattern generators, including the Fibonacci linear feedback shift register (LFSR) and weighted LFSR (WLFSR) with adjustable feedback polynomials and the cellular automata (CA), are realized to improve the test efficiency and fault coverage. The evaluation results show that the proposed BIST scheme has better test performance comparing with the indirect and the scan-chain-based test approaches. The proposed BIST scheme has comparable test performance, whereas it has much less area overhead comparing with the conventional LBIST schemes. Additionally, the proposed BIST scheme is testable and repairable.
- 11 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (4) , 1813-1826
MarchGen: A March Sequence Generation Method for Faults With an Arbitrary Number of Operations in RAMs
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 multioperation 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 an arbitrary number of operations. First, 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 (TSs) 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 TSs, and the generation time is roughly linear with the size of the input set.
- 11 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (4) , 1813-1826
MarchGen: A March Sequence Generation Method for Faults With an Arbitrary Number of Operations in RAMs
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 multioperation 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 an arbitrary number of operations. First, 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 (TSs) 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 TSs, and the generation time is roughly linear with the size of the input set.
- Open Access
- 1 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
A VC Dimension-Oriented Improvement Method of PUFs for the Anti-Modeling-Attack Capability
The physical unclonable function (PUF) serves as a security primitive of circuits, which is applicable to the embedded systems with lightweight authentication function. However, the modeling attack, which estimates the unknown CRPs by establishing the mathematical model of PUF, is a real threat to the PUF based crypto-systems. Subsequently, the anti-modeling-attack PUF becomes a research hotspot. The systematic design method of secure PUF is still a open issue, although some secure PUF schemes have been proposed based on the repeated trials. This work proposes a security improvement method of PUFs to enhance the anti-modeling-attack capability. The growth function and the Vapnik-Chervonenkis (VC) dimension of PUF are defined as the indicators of PUF security. The proposed method regards the improvement of PUF as an optimization problem, which aims to obtain a PUF scheme with the better security indicators. Guided by the indicators, the proposed method is able to specify the improvement sites of PUF and the techniques to be applied. In addition, three approaches are proposed to inspire the new security improvement techniques. An improved arbiter PUF and an improved array-based PUF are designed as the instances of the results from the proposed method. Both of the improved PUF schemes have the stronger security than the original schemes.
- 1 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
Open AccessA VC Dimension-Oriented Improvement Method of PUFs for the Anti-Modeling-Attack Capability
The physical unclonable function (PUF) serves as a security primitive of circuits, which is applicable to the embedded systems with lightweight authentication function. However, the modeling attack, which estimates the unknown CRPs by establishing the mathematical model of PUF, is a real threat to the PUF based crypto-systems. Subsequently, the anti-modeling-attack PUF becomes a research hotspot. The systematic design method of secure PUF is still a open issue, although some secure PUF schemes have been proposed based on the repeated trials. This work proposes a security improvement method of PUFs to enhance the anti-modeling-attack capability. The growth function and the Vapnik-Chervonenkis (VC) dimension of PUF are defined as the indicators of PUF security. The proposed method regards the improvement of PUF as an optimization problem, which aims to obtain a PUF scheme with the better security indicators. Guided by the indicators, the proposed method is able to specify the improvement sites of PUF and the techniques to be applied. In addition, three approaches are proposed to inspire the new security improvement techniques. An improved arbiter PUF and an improved array-based PUF are designed as the instances of the results from the proposed method. Both of the improved PUF schemes have the stronger security than the original schemes.
- 24 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Device and Materials Reliability
- Vol. 24 (3) , 390-400
Design of Highly Reliable 14T and 16T SRAM Cells Combined With Layout Harden Technique
The node upset may occur in the memory cell if the charged particle from cosmos rays or packaging materials strikes the integrated circuit. Radiation-hardened-by-design (RHBD) techniques introduce redundant transistors in the SRAM cell to improve its ability of recovering from the undesired node upset. However, the extra redundant transistors may increase the number of sensitive nodes in the SRAM cell, which decreases its capability of node-upset tolerance in turn. This work proposes an RHBD 14T SRAM cell and an RHBD 16T SRAM cell. Both the proposed SRAM cells only have two sensitive nodes. The proposed SRAM cells are able to recover from all the SNU cases. The layout harden technique is used to protect the proposed cells from SEMNU, and the blank of the hardened layout is reused so the proposed 14T and 16T SRAM cells consume the same area. Although the proposed cells have more transistors, the hardened layout areas of NS-10T/ PS-10T/ RHD-12T/ RHBD-10T/ RHBD-10TVLSI/ QUCCE-12T are respectively 1.78×/ 1.78×/ 1.83×/ 1.78×/ 1.78×/ 1.99× larger than that of the proposed cells. The reason is that the layout harden technique is easier to be applied to the proposed cells because they only have two sensitive nodes.
- 24 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Device and Materials Reliability
- Vol. 24 (3) , 390-400
Design of Highly Reliable 14T and 16T SRAM Cells Combined With Layout Harden Technique
The node upset may occur in the memory cell if the charged particle from cosmos rays or packaging materials strikes the integrated circuit. Radiation-hardened-by-design (RHBD) techniques introduce redundant transistors in the SRAM cell to improve its ability of recovering from the undesired node upset. However, the extra redundant transistors may increase the number of sensitive nodes in the SRAM cell, which decreases its capability of node-upset tolerance in turn. This work proposes an RHBD 14T SRAM cell and an RHBD 16T SRAM cell. Both the proposed SRAM cells only have two sensitive nodes. The proposed SRAM cells are able to recover from all the SNU cases. The layout harden technique is used to protect the proposed cells from SEMNU, and the blank of the hardened layout is reused so the proposed 14T and 16T SRAM cells consume the same area. Although the proposed cells have more transistors, the hardened layout areas of NS-10T/ PS-10T/ RHD-12T/ RHBD-10T/ RHBD-10TVLSI/ QUCCE-12T are respectively 1.78×/ 1.78×/ 1.83×/ 1.78×/ 1.78×/ 1.99× larger than that of the proposed cells. The reason is that the layout harden technique is easier to be applied to the proposed cells because they only have two sensitive nodes.
- 11 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 71 (8) , 3935-3939
An in-Array Build-In Self-Test Scheme for Embedded SRAM Array
An in-array Build-In Self-Test (BIST) scheme is proposed for the embedded SRAM array. The linear feedback shift register (LFSR) is used to implement the pattern generator, and the single/multiple-input signature register (SISR/MISR) is used to implement the response compactor. The proposed BIST scheme only consumes half the number of transistors and area compared with the conventional LFSR/MISR BIST, and it is testable. The conventional BIST circuit outside the SRAM array is unnecessary if the proposed BIST scheme is applied. The proposed BIST scheme is able to implement various March sequences to test the other part of the memory array.
- 11 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 71 (8) , 3935-3939
An in-Array Build-In Self-Test Scheme for Embedded SRAM Array
An in-array Build-In Self-Test (BIST) scheme is proposed for the embedded SRAM array. The linear feedback shift register (LFSR) is used to implement the pattern generator, and the single/multiple-input signature register (SISR/MISR) is used to implement the response compactor. The proposed BIST scheme only consumes half the number of transistors and area compared with the conventional LFSR/MISR BIST, and it is testable. The conventional BIST circuit outside the SRAM array is unnecessary if the proposed BIST scheme is applied. The proposed BIST scheme is able to implement various March sequences to test the other part of the memory array.
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 71 (4) , 2329-2333
An 11T SRAM Cell for the Dual-Direction In-Array Logic/CAM Operations
The in-memory computing (IMC) architecture eliminates the frequent data transfers between the memory banks and the processor cores. Researchers have utilized different SRAM cells to implement the in-memory logic operations. However, most of the previous works implement the column-wise logic/CAM operations, which require the column-wise stored operands. These column-wise logic/CAM operations are incompatible with the traditional row-wise SRAM mode. This brief proposes an SRAM cell with 11 transistors, which can work in four operation modes: the SRAM mode, the logic mode, and the BCAM/TCAM modes. All the operations in these four modes can be performed both in the column-wise and the row-wise style. The incompatibility between different modes is eliminated. In the logic mode, the proposed SRAM achieves frequency of 595MHz and energy consumption of 17.94fJ/bit at 1.2V with TSMC 65nm technology file. In the BCAM/TCAM modes, it can work with 407MHz, and it consumes 0.62fJ/bit and 1.38fJ/bit at 1.2V
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 71 (4) , 2329-2333
An 11T SRAM Cell for the Dual-Direction In-Array Logic/CAM Operations
The in-memory computing (IMC) architecture eliminates the frequent data transfers between the memory banks and the processor cores. Researchers have utilized different SRAM cells to implement the in-memory logic operations. However, most of the previous works implement the column-wise logic/CAM operations, which require the column-wise stored operands. These column-wise logic/CAM operations are incompatible with the traditional row-wise SRAM mode. This brief proposes an SRAM cell with 11 transistors, which can work in four operation modes: the SRAM mode, the logic mode, and the BCAM/TCAM modes. All the operations in these four modes can be performed both in the column-wise and the row-wise style. The incompatibility between different modes is eliminated. In the logic mode, the proposed SRAM achieves frequency of 595MHz and energy consumption of 17.94fJ/bit at 1.2V with TSMC 65nm technology file. In the BCAM/TCAM modes, it can work with 407MHz, and it consumes 0.62fJ/bit and 1.38fJ/bit at 1.2V
- 2 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (12) , 3416-3430
An Area-Efficient In-Memory Implementation Method of Arbitrary Boolean Function Based on SRAM Array
In-memory computing is an emerging computing paradigm to breakthrough the von-Neumann bottleneck. The SRAM based in-memory computing (SRAM-IMC) attracts great concerns from industries and academia, because the SRAM is technology compatible with the widely-used MOS devices. The digital SRAM-IMC scheme has advantages on stability and accuracy of computing results, compared with the analog SRAM-IMC schemes. However, few logic operations can be implemented by the current digital SRAM-IMC architectures. Designers have to insert some special logic modules to facilitate the complex computation. To address this issue, this work proposes an area-efficient implementation method of arbitrary Boolean function in SRAM array. Firstly, a two-input SRAM LUT is designed to realize the arbitrary two-input Boolean functions. Then, the logic merging and the spatial merging techniques are proposed to reduce the area consumption of the SRAM-IMC scheme. Finally, the SOP-based SRAM-IMC architecture is proposed, and the merged SOPs are mapped into and computed in it. The evaluation results on LGsynth’91, IWLS’93 and EPFL benchmarks show that, the area of the synthesis results based on the ABC tool is 3.69, 5.72 and 1.86 times of the circuit area from the proposed SRAM-IMC scheme in average respectively. Furthermore, the circuit area from the original SOP-based SRAM-IMC scheme is 2.07, 1.99 and 1.86 times in average of the circuit area from the proposed SRAM-IMC scheme respectively. The performance evaluation results show that the cycle consumption of the proposed SRAM-IMC scheme is independent to the scale of the input Boolean functions.
- 2 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 72 (12) , 3416-3430
An Area-Efficient In-Memory Implementation Method of Arbitrary Boolean Function Based on SRAM Array
In-memory computing is an emerging computing paradigm to breakthrough the von-Neumann bottleneck. The SRAM based in-memory computing (SRAM-IMC) attracts great concerns from industries and academia, because the SRAM is technology compatible with the widely-used MOS devices. The digital SRAM-IMC scheme has advantages on stability and accuracy of computing results, compared with the analog SRAM-IMC schemes. However, few logic operations can be implemented by the current digital SRAM-IMC architectures. Designers have to insert some special logic modules to facilitate the complex computation. To address this issue, this work proposes an area-efficient implementation method of arbitrary Boolean function in SRAM array. Firstly, a two-input SRAM LUT is designed to realize the arbitrary two-input Boolean functions. Then, the logic merging and the spatial merging techniques are proposed to reduce the area consumption of the SRAM-IMC scheme. Finally, the SOP-based SRAM-IMC architecture is proposed, and the merged SOPs are mapped into and computed in it. The evaluation results on LGsynth’91, IWLS’93 and EPFL benchmarks show that, the area of the synthesis results based on the ABC tool is 3.69, 5.72 and 1.86 times of the circuit area from the proposed SRAM-IMC scheme in average respectively. Furthermore, the circuit area from the original SOP-based SRAM-IMC scheme is 2.07, 1.99 and 1.86 times in average of the circuit area from the proposed SRAM-IMC scheme respectively. The performance evaluation results show that the cycle consumption of the proposed SRAM-IMC scheme is independent to the scale of the input Boolean functions.