Fast Convolution Method and Its Application in Mask Optimization for Intensity Calculation Using Basis Expansion

2014 ◽  
Vol 23 (12) ◽  
pp. 4982-4995 ◽  
Author(s):  
Yaping Sun ◽  
Jinyu Zhang ◽  
Yan Wang ◽  
Zhiping Yu
Keyword(s):  
Basis Expansion ◽  
Fast Convolution ◽  
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.

Enhanced hard decision based on multi-dimensional basis expansion in PAM4 transmission

2021 ◽  
pp. 127168
Author(s):  
Honghang Zhou ◽  
Yan Li ◽  
Wei Li ◽  
Jifang Qiu ◽  
Xiaobin Hong ◽  
...  
Keyword(s):  
Basis Expansion ◽  
Hard Decision

scholarly journals Efficient Fast-Convolution-Based Waveform Processing for 5G Physical Layer

2017 ◽  
Vol 35 (6) ◽  
pp. 1309-1326 ◽  
Author(s):  
Juha Yli-Kaakinen ◽  
Toni Levanen ◽  
Sami Valkonen ◽  
Kari Pajukoski ◽  
Juho Pirskanen ◽  
...  
Keyword(s):  
Physical Layer ◽  
Fast Convolution ◽  
Waveform Processing
Sign in / Sign up

Export Citation Format

Share Document