Geunsu Seo
Geunsu Seo has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Heung-No Lee
Gwangju Institute of Science and Technology
1 shared publication - Jehyuk Jang
School of Electrical Engineering and Computer Science, Gwangju Institute of Science and Technology (GIST), 123 Cheomdangwagi-ro, Buk-gu, Gwangju 61005, Korea
1 shared publication - Jongjin Kang
The Hanwha System, Seongnam 13524, Korea
1 shared publication - Minjae Lee
Gwangju Institute of Science and Technology
1 shared publication - Seonggeon Kim
The School of Electrical and Computer Science, Gwangju Institute of Science and Technology, Gwangju 61005, Korea
1 shared publication - Uihyun Yun
The School of Electrical and Computer Science, Gwangju Institute of Science and Technology, Gwangju 61005, Korea
1 shared publication
Latest Publications
- Open Access
- 18 September 2018
- Published by MDPI AG in Electronics
- Vol. 7 (9) , 206
Reduced Computational Complexity Orthogonal Matching Pursuit Using a Novel Partitioned Inversion Technique for Compressive Sensing
This paper reports a field-programmable gate array (FPGA) design of compressed sensing (CS) using the orthogonal matching pursuit (OMP) algorithm. While solving the least-squares (LS) problem in the OMP algorithm, the complexity of the matrix inversion operation at every loop is reduced by the proposed partitioned inversion that utilizes the inversion result in the previous iteration. By the proposed matrix (n × n) inversion method inside the OMP, the number of operations is reduced down from O(n3) to O(n2). The OMP algorithm is implemented with a Xilinx Kintex UltraScale. The architecture with the proposed partitioned inversion involves 722 less DSP48E compared with the conventional method. It operates with a sample period of 4 ns, signal reconstruction time of 27 μs, and peak signal to noise ratio (PSNR) of 30.26 dB.
- 18 September 2018
- Published by MDPI AG in Electronics
- Vol. 7 (9) , 206
Open AccessReduced Computational Complexity Orthogonal Matching Pursuit Using a Novel Partitioned Inversion Technique for Compressive Sensing
This paper reports a field-programmable gate array (FPGA) design of compressed sensing (CS) using the orthogonal matching pursuit (OMP) algorithm. While solving the least-squares (LS) problem in the OMP algorithm, the complexity of the matrix inversion operation at every loop is reduced by the proposed partitioned inversion that utilizes the inversion result in the previous iteration. By the proposed matrix (n × n) inversion method inside the OMP, the number of operations is reduced down from O(n3) to O(n2). The OMP algorithm is implemented with a Xilinx Kintex UltraScale. The architecture with the proposed partitioned inversion involves 722 less DSP48E compared with the conventional method. It operates with a sample period of 4 ns, signal reconstruction time of 27 μs, and peak signal to noise ratio (PSNR) of 30.26 dB.