Hong-Ming Chiu

Projects

Building Oscilloscope on FPGA

We built a simple oscilloscope using Nexys 4 DDR board and PCB. First, the PCB transforms the input voltage signal into a signal with an acceptable voltage range for the FPGA board input, as well as generating knobs' control signal. The FPGA board then takes the processed signal and control signal to display waveforms, change voltage scale, adjust sweep time, etc. This work is the final project of the Digital Laboratory class at NYCU.

[ Code ] [ Video ]
Graph Learning: Causal Graph Process (CGP) & Sparse Vector Autoregressive model (SVAR)

This work contains the impelmentation and comparison of two graph learning algorithms, Causal Graph Process (CGP) and Sparse Vector Autoregressive model (SVAR). These two graph learning methods can be used to derive the graph representation among a large number of unstructured time series data, and then make predictions on the future data.

[ Code ] [ Slides ]
Contributors: Hong-Ming Chiu
Model Change Detection System

This is a demo for the model change detection system on a landmine dataset. The model change detection system utilized KL-divergence and machine learning algorithms to classify landmines data collected from different surface conditions. This demo is built during the independent study in UIUC.

[ Code ]
Contributors: Hong-Ming Chiu
Huffman Coding Hardware

Implemented 8-bit Huffman coding algorithm using System Verilog. The system takes an image as an input, the image contains 100 pixels and each pixel value is an integer between 1 to 6 (inclusive). The system then outputs the Huffman Code for each pixel value based on the source probability distribution (more frequent pixel values will have the shorter codewords). This is the final project of the Digital Circuit and Systems class in NYCU.

[ Code ]
Minimum Mean Cycle Problem

Designed an algorithm for finding the Minimum Mean Cycle in a weighted directed graph using dynamic programming. This algorithm is an extension of the Bellman-Ford algorithm for computing single source shortest paths, and it is capable of finding the minimum mean cycle in polynomial time. This is the final project of the Advanced Algorithm class in NCTU.

[ Code ]
Contributors: Hong-Ming Chiu