Ching Chuen Jong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Ching Chuen Jong has a total of 65 co-authors. Here are the top co-authors by number of shared publications:
- Chip-Hong Chang
Nanyang technological university, Singapore, Singapore
18 shared publications Fei Xu
Xilinx Asia Pacific Pte. Ltd., Singapore
8 shared publicationsJoshua Yung Lih Low
Nanyang Technological University, Singapore
7 shared publicationsManas Ranjan Meher
Integrated Systems Research Laboratory, School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore
4 shared publicationsXianwu Xing
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798
4 shared publicationsJeremy Yung Shern Low
VIRTUS IC Design Centre of Excellence, School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798
3 shared publications
Latest Publications
- 13 July 2022
- Published by Elsevier in Microelectronics Journal
- Vol. 127
Non-iterative division circuit design with accuracy and performance trade-off based on mixed integer linear programming approach
- 13 July 2022
- Published by Elsevier in Microelectronics Journal
- Vol. 127
Non-iterative division circuit design with accuracy and performance trade-off based on mixed integer linear programming approach
- 2 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 29  (6) , 1868-1877
A High-Throughput VLSI Architecture for Real-Time Full-HD Gradient Guided Image Filter
Guided image filtering (GIF) has been applied widely in recent years as a solution to the ever increasing demand of high performance filtering, especially for real-time image/video processing. Lately proposed gradient domain guided image filter (GDGIF) is one of the typical works focusing on improving the quality of the filtering result of the original GIF, dealing with the halo-artifacts problem for edge-preserving smoothing. However, due to the involvement of global pixel values in the computation, high computation complexity and additional complex operation, there is no existing VLSI design for the gradient guided filter. This paper presents a high throughput VLSI architecture for real-time Full-HD (1920 × 1080) GDGIF. Four techniques are used in the newly proposed design to reduce the computation complexity and increase the processing throughput. First, a pre-processing stage is introduced to address the problem of global parameters required in the GDGIF. Second, multi-scale down-samplings are adopted for reducing circuit size and processing time. Then, a parallel structure operated at a higher frequency is used at the output stage to restore the full image size and to achieve high throughput at the same time. Last, approximated computation is introduced to eliminate speed bottleneck by simplifying the complex exponentiation operation. Based on the STM 65 nm CMOS technology, the implementation results show that the proposed architecture is able to support Full-HD image filtering at a throughput above 75 frame/second, with a design area of 586314 μm2 and power consumption of 18.5mW.
- 2 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 29  (6) , 1868-1877
A High-Throughput VLSI Architecture for Real-Time Full-HD Gradient Guided Image Filter
Guided image filtering (GIF) has been applied widely in recent years as a solution to the ever increasing demand of high performance filtering, especially for real-time image/video processing. Lately proposed gradient domain guided image filter (GDGIF) is one of the typical works focusing on improving the quality of the filtering result of the original GIF, dealing with the halo-artifacts problem for edge-preserving smoothing. However, due to the involvement of global pixel values in the computation, high computation complexity and additional complex operation, there is no existing VLSI design for the gradient guided filter. This paper presents a high throughput VLSI architecture for real-time Full-HD (1920 × 1080) GDGIF. Four techniques are used in the newly proposed design to reduce the computation complexity and increase the processing throughput. First, a pre-processing stage is introduced to address the problem of global parameters required in the GDGIF. Second, multi-scale down-samplings are adopted for reducing circuit size and processing time. Then, a parallel structure operated at a higher frequency is used at the output stage to restore the full image size and to achieve high throughput at the same time. Last, approximated computation is introduced to eliminate speed bottleneck by simplifying the complex exponentiation operation. Based on the STM 65 nm CMOS technology, the implementation results show that the proposed architecture is able to support Full-HD image filtering at a throughput above 75 frame/second, with a design area of 586314 μm2 and power consumption of 18.5mW.
- 4 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 65  (1) , 175-184
Range Mapping—A Fresh Approach to High Accuracy Mitchell-Based Logarithmic Conversion Circuit Design
A high accuracy Mitchell-based logarithmic conversion method for integrated circuit design is presented in this paper. A novel technique named range mapping is proposed to perform the conversion with a fresh approach that compresses the range of approximation to smaller than one-third of the range of the Mitchell fraction m. After mapping, the compressed range possesses three favorable properties. Specifically, the compressed range is smaller, and has smaller gradient variation and fewer Mitchell fractions. All the three properties facilitate accuracy improvement when a four-region piecewise linear approximation is subsequently developed and applied on the compressed range. With the proposed method, the maximum absolute error and maximum absolute error percentage are improved by 15% and 25%, respectively, when compared with the best existing results by Kim et al. and De Caro et al., respectively. The proposed design is implemented in STM 90-nm CMOS technology, and its performance evaluated and compared with the well-known Mitchell-based methods.
- 4 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 65  (1) , 175-184
Range Mapping—A Fresh Approach to High Accuracy Mitchell-Based Logarithmic Conversion Circuit Design
A high accuracy Mitchell-based logarithmic conversion method for integrated circuit design is presented in this paper. A novel technique named range mapping is proposed to perform the conversion with a fresh approach that compresses the range of approximation to smaller than one-third of the range of the Mitchell fraction m. After mapping, the compressed range possesses three favorable properties. Specifically, the compressed range is smaller, and has smaller gradient variation and fewer Mitchell fractions. All the three properties facilitate accuracy improvement when a four-region piecewise linear approximation is subsequently developed and applied on the compressed range. With the proposed method, the maximum absolute error and maximum absolute error percentage are improved by 15% and 25%, respectively, when compared with the best existing results by Kim et al. and De Caro et al., respectively. The proposed design is implemented in STM 90-nm CMOS technology, and its performance evaluated and compared with the well-known Mitchell-based methods.
- 24 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A VLSI architecture for real-time gradient guided image filtering
High performance filtering has been in ever increasing demand for a range of applications, especially for real-time image/video processing. Guided image filter is one of the widely used image filters. Among them, the gradient domain guided image filter for edge-preserving smoothing and for mitigating the halo-artifacts problem existed in the current guided image filters is reported recently. Due to its computation complexity and the requirement of global pixel values in the computation, there is no existing VLSI implementation of gradient domain guided image filter. This paper presents such a VLSI architecture incorporated with techniques to reduce computation complexity and increase processing throughput. Subsampling technique is adopted in the design to save computation cost in terms of size and power consumption, without visually hampering the filtering result. Parallel structure is used at the output stage to restore the full image size and to achieve high throughput. Based on the STM 90-nm CMOS technology, the synthesis result shows that the proposed architecture is able to support Full-HD (1920 × 1080) image filtering at a throughput above 60 frame/s, with a design area of 726671.6µm2 and power consumption of 9.85mW. Compared to the existing design, it can achieve two times higher throughput, and has 11.25% smaller size and 56.3% lower power consumption.
- 24 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A VLSI architecture for real-time gradient guided image filtering
High performance filtering has been in ever increasing demand for a range of applications, especially for real-time image/video processing. Guided image filter is one of the widely used image filters. Among them, the gradient domain guided image filter for edge-preserving smoothing and for mitigating the halo-artifacts problem existed in the current guided image filters is reported recently. Due to its computation complexity and the requirement of global pixel values in the computation, there is no existing VLSI implementation of gradient domain guided image filter. This paper presents such a VLSI architecture incorporated with techniques to reduce computation complexity and increase processing throughput. Subsampling technique is adopted in the design to save computation cost in terms of size and power consumption, without visually hampering the filtering result. Parallel structure is used at the output stage to restore the full image size and to achieve high throughput. Based on the STM 90-nm CMOS technology, the synthesis result shows that the proposed architecture is able to support Full-HD (1920 × 1080) image filtering at a throughput above 60 frame/s, with a design area of 726671.6µm2 and power consumption of 9.85mW. Compared to the existing design, it can achieve two times higher throughput, and has 11.25% smaller size and 56.3% lower power consumption.
- 1 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
A curve fitting approach for non-iterative divider design with accuracy and performance trade-off
This paper presents an approach based on the curve fitting method for the design of non-iterative divider circuits with accuracy and area-delay product (ADP) trade-offs. The curved surfaces representing the quotient are partitioned into several regions, each of which is then approximated by a square/triangular plane. The planes are obtained by using the curve fitting method for accuracy optimization. The proposed architecture for implementing the planes contains only simple arithmetic operations and a look-up table. Several non-iterative divider circuits with different accuracies and ADPs are obtained. The accuracy achieved in terms of the maximum absolute error percentage (MAEP) ranges from 1.87% to 0.14%. The MAEP of 0.14% is 30% better than the one achieved by the best existing non-iterative divider.
- 1 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
A curve fitting approach for non-iterative divider design with accuracy and performance trade-off
This paper presents an approach based on the curve fitting method for the design of non-iterative divider circuits with accuracy and area-delay product (ADP) trade-offs. The curved surfaces representing the quotient are partitioned into several regions, each of which is then approximated by a square/triangular plane. The planes are obtained by using the curve fitting method for accuracy optimization. The proposed architecture for implementing the planes contains only simple arithmetic operations and a look-up table. Several non-iterative divider circuits with different accuracies and ADPs are obtained. The accuracy achieved in terms of the maximum absolute error percentage (MAEP) ranges from 1.87% to 0.14%. The MAEP of 0.14% is 30% better than the one achieved by the best existing non-iterative divider.
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1778-1781
Memory-efficient discrete wavelet transform architecture based on wordlength optimization
Unlike the existing designs that improve the memory efficiency by reducing the on-chip memory words, we propose a memory-efficient 2-D DWT architecture which improves the memory efficiency by reducing the wordlength of the on-chip memory. Based on our recently proposed memory-efficient 2-D DWT architecture, which achieves the highest memory efficiency among the existing designs, we analyze the dynamic range and optimize the required integer bit (IB) width of every internal signal for memory reduction. We construct an architecture-specific accuracy model for both 9/7 and 5/3 2-D DWT and optimize the factional bit (FB) width of every internal signal without sacrificing the precision of the output. Theoretical estimation shows a 17.5% reduction of the temporal memory regardless of input image size and throughput. In addition, the arithmetic resource is reduced. The synthesis results in 90-nm CMOS show a better area-delay product (ADP) of 25.1% over the best existing design.
- 1 May 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1778-1781
Memory-efficient discrete wavelet transform architecture based on wordlength optimization
Unlike the existing designs that improve the memory efficiency by reducing the on-chip memory words, we propose a memory-efficient 2-D DWT architecture which improves the memory efficiency by reducing the wordlength of the on-chip memory. Based on our recently proposed memory-efficient 2-D DWT architecture, which achieves the highest memory efficiency among the existing designs, we analyze the dynamic range and optimize the required integer bit (IB) width of every internal signal for memory reduction. We construct an architecture-specific accuracy model for both 9/7 and 5/3 2-D DWT and optimize the factional bit (FB) width of every internal signal without sacrificing the precision of the output. Theoretical estimation shows a 17.5% reduction of the temporal memory regardless of input image size and throughput. In addition, the arithmetic resource is reduced. The synthesis results in 90-nm CMOS show a better area-delay product (ADP) of 25.1% over the best existing design.
- 9 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 64  (00189340) , 1
Unified Mitchell-based Approximation for Efficient Logarithmic Conversion Circuit
This paper presents a novel method named the Unified Mitchell-based Approximation (UMA) to obtain an optimized Mitchell-based logarithmic conversion circuit for any desired conversion accuracy up to 14 bits. UMA is the first method that is able to obtain a conversion circuit when a specific accuracy is required. In this work, we studied and analyzed five design parameters and their impact on accuracy and hardware merits. We formulate the hardware model of the error correction circuit in the conversion circuit for performance evaluation. Given an accuracy requirement, the proposed method explores the design space of the five design parameters. As the design space is theoretically huge, we propose constraints for the range of the parameter values and develop a systematical search algorithm for exploring the design space. UMA is able to obtain an area-delay product optimized circuit for each of the conversion accuracies achieved by the existing Mitchell-based designs. Synthesis results in 90 nm CMOS technology show that the circuits obtained are comparable or better than the existing Mitchell-based designs with the same accuracy objective. Nine of the fifteen circuits obtained achieve better area-delay product by more than 50 percent. In addition, UMA is able to obtain circuits for any accuracy from 4 to 14 bits, while the best accuracy achieved by the existing Mitchell-based methods is less than 12 bits.
- 9 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 64  (00189340) , 1
Unified Mitchell-based Approximation for Efficient Logarithmic Conversion Circuit
This paper presents a novel method named the Unified Mitchell-based Approximation (UMA) to obtain an optimized Mitchell-based logarithmic conversion circuit for any desired conversion accuracy up to 14 bits. UMA is the first method that is able to obtain a conversion circuit when a specific accuracy is required. In this work, we studied and analyzed five design parameters and their impact on accuracy and hardware merits. We formulate the hardware model of the error correction circuit in the conversion circuit for performance evaluation. Given an accuracy requirement, the proposed method explores the design space of the five design parameters. As the design space is theoretically huge, we propose constraints for the range of the parameter values and develop a systematical search algorithm for exploring the design space. UMA is able to obtain an area-delay product optimized circuit for each of the conversion accuracies achieved by the existing Mitchell-based designs. Synthesis results in 90 nm CMOS technology show that the circuits obtained are comparable or better than the existing Mitchell-based designs with the same accuracy objective. Nine of the fifteen circuits obtained achieve better area-delay product by more than 50 percent. In addition, UMA is able to obtain circuits for any accuracy from 4 to 14 bits, while the best accuracy achieved by the existing Mitchell-based methods is less than 12 bits.
- 24 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 61  (20) , 4975-4987
A Memory-Efficient High-Throughput Architecture for Lifting-Based Multi-Level 2-D DWT
In this paper, we present a novel memory-efficient high-throughput scalable architecture for multi-level 2-D DWT. We studied the existing DWT architectures and observed that data scanning method has a significant impact on the memory efficiency of DWT architecture. We propose a novel parallel stripe-based scanning method based on the analysis of the dependency graph of the lifting scheme. With the new scanning method for multi-level 2D DWT, a high memory efficient scalable parallel pipelined architecture is developed. The proposed architecture requires no frame memory and a temporal memory of size only 3 N +682 for the 3-level DWT decomposition with an image of size N ×N pixels with 32 pixels processed concurrently. The elimination of frame memory and the small temporal memory lead to significant reduction in overall size. The proposed architecture has a regular structure and achieves 100% hardware utilization. The synthesis results in 90 nm CMOS process show that the proposed architecture achieves a better area-delay product by 60% and higher throughput by 97% when compared to the best existing design for the CDF (Cohen-Daubechies-Favreau) 9/7 2-D DWT.
- 24 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 61  (20) , 4975-4987
A Memory-Efficient High-Throughput Architecture for Lifting-Based Multi-Level 2-D DWT
In this paper, we present a novel memory-efficient high-throughput scalable architecture for multi-level 2-D DWT. We studied the existing DWT architectures and observed that data scanning method has a significant impact on the memory efficiency of DWT architecture. We propose a novel parallel stripe-based scanning method based on the analysis of the dependency graph of the lifting scheme. With the new scanning method for multi-level 2D DWT, a high memory efficient scalable parallel pipelined architecture is developed. The proposed architecture requires no frame memory and a temporal memory of size only 3 N +682 for the 3-level DWT decomposition with an image of size N ×N pixels with 32 pixels processed concurrently. The elimination of frame memory and the small temporal memory lead to significant reduction in overall size. The proposed architecture has a regular structure and achieves 100% hardware utilization. The synthesis results in 90 nm CMOS process show that the proposed architecture achieves a better area-delay product by 60% and higher throughput by 97% when compared to the best existing design for the CDF (Cohen-Daubechies-Favreau) 9/7 2-D DWT.
- 8 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 60  (8) , 502-506
A Memory-Efficient Scalable Architecture for Lifting-Based Discrete Wavelet Transform
In this brief, we propose a new parallel lifting-based 2-D DWT architecture with high memory efficiency and short critical path. The memory efficiency is achieved with a novel scanning method that enables tradeoff of external memory bandwidth and on-chip memory. Based on the data flow graph of the flipped lifting algorithm, processing units (PUs) are developed for maximally utilizing the inherent parallelism. With S number of PUs, the throughput can be scaled while keeping the latency constant. Compared with the best existing architecture, the proposed architecture requires less memory. For an N × N image, the proposed architecture consumes a total of only 3N + 24S words of transposition memory, temporal memory, and pipeline registers. The synthesized results in a 90-nm CMOS process show that it achieves better area-delay products than the best existing design by 32.3%, 31.5%, and 27.0% when S = 2, 4, and 8, respectively, and by 26%, 26%, and 22% when the overhead for buffering the required overlapped pixels is taken into account.
- 8 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 60  (8) , 502-506
A Memory-Efficient Scalable Architecture for Lifting-Based Discrete Wavelet Transform
In this brief, we propose a new parallel lifting-based 2-D DWT architecture with high memory efficiency and short critical path. The memory efficiency is achieved with a novel scanning method that enables tradeoff of external memory bandwidth and on-chip memory. Based on the data flow graph of the flipped lifting algorithm, processing units (PUs) are developed for maximally utilizing the inherent parallelism. With S number of PUs, the throughput can be scaled while keeping the latency constant. Compared with the best existing architecture, the proposed architecture requires less memory. For an N × N image, the proposed architecture consumes a total of only 3N + 24S words of transposition memory, temporal memory, and pipeline registers. The synthesized results in a 90-nm CMOS process show that it achieves better area-delay products than the best existing design by 32.3%, 31.5%, and 27.0% when S = 2, 4, and 8, respectively, and by 26%, 26%, and 22% when the overhead for buffering the required overlapped pixels is taken into account.
- 1 May 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02714302,p. 2219-2222
Non-iterative high speed division computation based on Mitchell logarithmic method
A novel non-iterative circuit for computing division based on logarithm is proposed in the paper. Mitchell-based methods are used for the logarithmic and antilogarithmic conversions. Merging the conversion stages in the implementation is not possible if the existing antilogarithmic conversion algorithms are used. Thus, the critical path has at least two carry propagate adders (CPAs). This work introduces a new antilogarithmic algorithm to merge the two conversion stages into a single one to remove one of the two CPAs. Compared to the best existing Mitchell-based logarithmic division computation method used in a 3-D graphic system, the proposed design achieves improvements by 45.4% and 34.8%, respectively, in computation speed and area-delay product with an area overhead of 19.5%.
- 1 May 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02714302,p. 2219-2222
Non-iterative high speed division computation based on Mitchell logarithmic method
A novel non-iterative circuit for computing division based on logarithm is proposed in the paper. Mitchell-based methods are used for the logarithmic and antilogarithmic conversions. Merging the conversion stages in the implementation is not possible if the existing antilogarithmic conversion algorithms are used. Thus, the critical path has at least two carry propagate adders (CPAs). This work introduces a new antilogarithmic algorithm to merge the two conversion stages into a single one to remove one of the two CPAs. Compared to the best existing Mitchell-based logarithmic division computation method used in a 3-D graphic system, the proposed design achieves improvements by 45.4% and 34.8%, respectively, in computation speed and area-delay product with an area overhead of 19.5%.