A fast convolution method using basis expansion for highly efficient intensity calculation in mask optimization

2013 ◽  
Author(s):  
Yaping Sun ◽  
Yehua Zuo ◽  
Jinyu Zhang ◽  
Yan Wang ◽  
Zhiping Yu
Keyword(s):  
Basis Expansion ◽  
Fast Convolution ◽  
Highly Efficient ◽  
Intensity Calculation ◽  
Convolution Method

A Fast Convolution Method and Its Application in Photomask Synthesis for Wafer Contour Fidelity Using Linear Basis Expansions

2019 ◽  
Vol 44 (1) ◽  
pp. 203-208
Author(s):  
Jinyu Zhang ◽  
Yao Peng ◽  
Zuochang Ye ◽  
Yan Wang ◽  
Zhiping Yu
Keyword(s):  
Fast Convolution ◽  
Linear Basis ◽  
Convolution Method

scholarly journals FAST DCT ALGORITHM FOR VIDEO TRANSMISSION

2012 ◽  
Vol 9 (1) ◽  
Author(s):  
I Wayan Sutaya
Keyword(s):  
Video Transmission ◽  
Transformation Matrix ◽  
Second Step ◽  
Fast Convolution ◽  
Long Time ◽  
The One ◽  
Convolution Method

This paper presents a fast DCT algorithm by using convolution method. Multipliers will be a crucial process in designing a fast DCT algorithm because they take a long time to complete their process. Reducing a number of multipliers is the one way to make a fast DCT algorithm. This paper shows how to reduce multipliers by using two steps: the first step is by grouping transformation matrix to be two groups in which this process uses the folding concept. The second step is by using fast convolution by inspection to minimize multipliers.   Keywords : multiplier, fast DCT, fast convolution, folding.

scholarly journals FAST DCT ALGORITHM FOR VIDEO TRANSMISSION

2012 ◽  
Vol 9 (1) ◽  
Author(s):  
I Wayan Sutaya
Keyword(s):  
Video Transmission ◽  
Transformation Matrix ◽  
Second Step ◽  
Fast Convolution ◽  
Long Time ◽  
The One ◽  
Convolution Method

This paper presents a fast DCT algorithm by using convolution method. Multipliers will be a crucial process in designing a fast DCT algorithm because they take a long time to complete their process. Reducing a number of multipliers is the one way to make a fast DCT algorithm. This paper shows how to reduce multipliers by using two steps: the first step is by grouping transformation matrix to be two groups in which this process uses the folding concept. The second step is by using fast convolution by inspection to minimize multipliers.   Keywords : multiplier, fast DCT, fast convolution, folding.

Highly efficient and selective photocatalytic CO2 to CO conversion in aqueous solution

2020 ◽  
Vol 56 (27) ◽  
pp. 3851-3854 ◽  
Author(s):  
Xiaomin Chai ◽  
Hai-Hua Huang ◽  
Huiping Liu ◽  
Zhuofeng Ke ◽  
Wen-Wen Yong ◽  
...  
Keyword(s):  
Aqueous Solution ◽  
Photocatalytic Performance ◽  
Aqueous Media ◽  
Highly Efficient ◽  
Co Conversion

A Co-based complex displayed the highest photocatalytic performance for CO2 to CO conversion in aqueous media.

Tuning the pore structures and photocatalytic properties of a 2D covalent organic framework with multi-branched photoactive moieties

Nanoscale ◽  
2020 ◽  
Vol 12 (30) ◽  
pp. 16136-16142
Author(s):  
Xuan Wang ◽  
Ming-Jie Dong ◽  
Chuan-De Wu
Keyword(s):  
Photocatalytic Properties ◽  
Effective Strategy ◽  
Covalent Organic Framework ◽  
Highly Efficient ◽  
Pore Structures ◽  
Local Connection ◽  
Organic Framework

An effective strategy to incorporate accessible metalloporphyrin photoactive sites into 2D COFs by establishing a 3D local connection for highly efficient photocatalysis was developed.

Sign in / Sign up

Export Citation Format

Share Document