ChingSsuyuan
**Love Design** Master degree in progress/ Master of Science in Electrical Computer Engineering at Boston University
Ms in ECE Boston UniversityBoston, MA
Pinned Repositories
ChingSsuyuan
Config files for my GitHub profile.
CPU_Implement_Verilog
Implement Single Cycle RISC-V Datapath
Fibonacci_sequence_RISC-V
Implement a Seq_array task to store an array starting at memory address 0x80. The listThe array should be initialized to contain the first 32 elements of the Fibonacci sequence:
Image-Segmentation-By-Network-Flow
Image K Segmentations /Opencv/ Network flow/ High resolution
Off-line-Minimum-Algorithm
Off-Line-Minimum(m, n) for i = 1 to n determine j such that i is in K_j if j not equal to m + 1 extracted[j] = i let l be the smallest value greater than j for which set K_l exists K_l = union( K_j, K_l), destroying K_j return extracted
Proto_vEB_Tree
realize vEB tree structure and test with numbers
Research-On-Chiplets
EC601 Project: Research on Chiplet Encapsulation Technology
Segmented-Least-Squares
we have an integer k, and we need to find the best fit for the points with exactly k line segments.
Siyuan_Project
My personal Design Project of EC601
Vivado_State_Machine_Project
Vivado state machine verilog codes
ChingSsuyuan's Repositories
ChingSsuyuan/CPU_Implement_Verilog
Implement Single Cycle RISC-V Datapath
ChingSsuyuan/Fibonacci_sequence_RISC-V
Implement a Seq_array task to store an array starting at memory address 0x80. The listThe array should be initialized to contain the first 32 elements of the Fibonacci sequence:
ChingSsuyuan/Proto_vEB_Tree
realize vEB tree structure and test with numbers
ChingSsuyuan/Segmented-Least-Squares
we have an integer k, and we need to find the best fit for the points with exactly k line segments.
ChingSsuyuan/Vivado_State_Machine_Project
Vivado state machine verilog codes
ChingSsuyuan/ChingSsuyuan
Config files for my GitHub profile.
ChingSsuyuan/Image-Segmentation-By-Network-Flow
Image K Segmentations /Opencv/ Network flow/ High resolution
ChingSsuyuan/Off-line-Minimum-Algorithm
Off-Line-Minimum(m, n) for i = 1 to n determine j such that i is in K_j if j not equal to m + 1 extracted[j] = i let l be the smallest value greater than j for which set K_l exists K_l = union( K_j, K_l), destroying K_j return extracted
ChingSsuyuan/Research-On-Chiplets
EC601 Project: Research on Chiplet Encapsulation Technology
ChingSsuyuan/Siyuan_Project
My personal Design Project of EC601
ChingSsuyuan/Min_Heap_implement
Implement a non-standard binary min-heap structure
ChingSsuyuan/OracleBrain
ChingSsuyuan/Timsort_with_comparisons
Simple Timsort and Mergesort Algorithm Implement in C Codes; Comparsion between different sorting algorithms; run .cpp to see; codes in .h file