Winograd algorithm - PowerPoint PPT Presentation

Fast Convolution

Fast Convolution. Chapter 8 Fast Convolution. Introduction Cook-Toom Algorithm and Modified Cook-Toom Algorithm Winograd Algorithm and Modified Winograd Algorithm Iterated Convolution Cyclic Convolution Design of Fast Convolution Algorithm by Inspection. 2. Introduction.

★ ★ ★ ★ ★

807 views • 50 slides

基于 FFT 的频域 RS 译码

基于 FFT 的频域 RS 译码. 季文洁 2014.3.21. 频域译码. FFT. Prime factor Cyclostome FFT. Prime factor. e.g. GF(2 4 ) N=15=3×5. CFFT. CFFT. e.g. GF(2 3 ). polynomial. F= ALf. CFFT. 选择一组正规基 ( γ , γ 2 , γ 4 ) ，此处取 γ = α 3 ，满足 γ+γ 2 + γ 4 = 1 ）. F= ALf. Winograd Algorithm.

★ ★ ★ ★ ★

394 views • 14 slides

View Winograd algorithm PowerPoint (PPT) presentations online in SlideServe. SlideServe has a very huge collection of Winograd algorithm PowerPoint presentations. You can view or download Winograd algorithm presentations for your school assignment or business presentation. Browse for the presentations on every topic that you want.