Results 1  10
of
107,237
KATZ’S MIDDLE CONVOLUTION ALGORITHM
, 2006
"... Abstract. This is an expository account of Katz’s middle convolution operation on local systems over P 1 − {q1,...,qn}. We describe the Betti and de Rham versions, and point out that they give isomorphisms between different moduli spaces of local systems, following Völklein, DettweilerReiter, Harao ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Reiter, HaraokaYokoyama. Kostov’s program for applying the Katz algorithm is to say that in the range where middle convolution no longer reduces the rank, one should give a direct construction of local systems. This has been done by Kostov and CrawleyBoevey. We describe here an alternative construction using
Iterative decoding of binary block and convolutional codes
 IEEE TRANS. INFORM. THEORY
, 1996
"... Iterative decoding of twodimensional systematic convolutional codes has been termed “turbo” (de)coding. Using loglikelihood algebra, we show that any decoder can he used which accepts soft inputsincluding a priori valuesand delivers soft outputs that can he split into three terms: the soft chann ..."
Abstract

Cited by 599 (43 self)
 Add to MetaCart
channel and a priori inputs, and the extrinsic value. The extrinsic value is used as an a priori value for the next iteration. Decoding algorithms in the loglikelihood domain are given not only for convolutional codes hut also for any linear binary systematic block code. The iteration is controlled by a
AN IMPROVED CONVOLUTION ALGORITHM FOR DISCRETELY SAMPLED ASIAN OPTIONS
"... Abstract. We suggest an improved FFT pricing algorithm for discretely sampled Asian options with general independently distributed returns in the underlying. Our work complements the studies of Carverhill and Clewlow (1990), Benhamou (2002), and Fusai and Meucci (2008), and, if we restrict our att ..."
Abstract
 Add to MetaCart
attention only to lognormally distributed returns, also Veµceµr (2002). While the existing convolution algorithms compute the density of the underlying state variable by moving forward on a suitably de
ned state space grid our new algorithm uses backward price convolution, which resembles classical lattice
A LowPower Image Convolution Algorithm
 in Proc. IEEE Int. Conf. Acoust. Speech Signal Process
, 2003
"... We describe a lowpower image convolution algorithm for variable voltage processors. The algorithm takes advantages of common properties of popular kernels. Unlike a direct algorithm of convolution operation where the dynamic voltage scaling (DVS) feature of variable voltage processors cannot be use ..."
Abstract
 Add to MetaCart
We describe a lowpower image convolution algorithm for variable voltage processors. The algorithm takes advantages of common properties of popular kernels. Unlike a direct algorithm of convolution operation where the dynamic voltage scaling (DVS) feature of variable voltage processors cannot
A Package for Generating, Manipulating, and Testing Convolution Algorithms
, 2003
"... This report describes a Maple package created for exploring the techniques of Winograd, Nussbaumer, and others for computing “fast” convolution algorithms. After codifying known convolution techniques into a common framework of bilinear algorithms built from parameterized matrices and algebraic oper ..."
Abstract
 Add to MetaCart
This report describes a Maple package created for exploring the techniques of Winograd, Nussbaumer, and others for computing “fast” convolution algorithms. After codifying known convolution techniques into a common framework of bilinear algorithms built from parameterized matrices and algebraic
A Tree Convolution Algorithm for the Solution of Queueing Networks
 Commun. ACM
, 1982
"... A new algorithm called the tree convolution algorithm for the computation of normalization constants and performance measures of productform queueing algorithms, in the solution of networks with many service centers and many sparse routing chains. (A network is said to have sparse routing chains ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
A new algorithm called the tree convolution algorithm for the computation of normalization constants and performance measures of productform queueing algorithms, in the solution of networks with many service centers and many sparse routing chains. (A network is said to have sparse routing
FPGA IMPLEMENTATION OF A VEDIC CONVOLUTION ALGORITHM
"... In digital signal processing convolution is a fundamental computation that is ubiquitous in many application areas. In order to compute convolution of long sequence, OverlapAdd method (OLA) and OverlapSave method (OLS) methods are employed. In this paper, block convolution process is proposed usin ..."
Abstract
 Add to MetaCart
using a multiplier architecture based on vertical and crosswise algorithm of Ancient Indian Vedic Mathematics and embedding it in OLA method for reducing calculations.And as the vedic multiplier is been used it is named as Vedic convolution algorithm.The coding is done in VHDL (Very High Speed
Convolution Algorithms for BMAP/G/1Queues
, 1996
"... The equilibrium state probabilities for queues with batch Markovian arrival processes are determined in form of matrix expressions, in which the central item to be computed is the so called fundamentalperiodmatrix G . G appears as the solution of the nonlinear matrix equation G = A n G n S , o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
S , or as the infinite sum over matrices G n , which in turn are functions of the matrices A n as has been shown in [1]. In this note we present new convolution algorithms for the computation of the matrices A n , and the sum G = G n S , which are stable and  in all probability  much more efficient than any
UFLIC: A Line Integral Convolution Algorithm For Visualizing Unsteady Flows
 In Proceedings Visualization ’97
, 1997
"... This paper presents an algorithm, UFLIC (Unsteady Flow LIC), to visualize vector data in unsteady flow fields. Using the Line Integral Convolution (LIC) as the underlying method, a new convolution algorithm is proposed that can effectively trace the flow's global features over time. The new alg ..."
Abstract

Cited by 53 (2 self)
 Add to MetaCart
This paper presents an algorithm, UFLIC (Unsteady Flow LIC), to visualize vector data in unsteady flow fields. Using the Line Integral Convolution (LIC) as the underlying method, a new convolution algorithm is proposed that can effectively trace the flow's global features over time. The new
Connexions module: m16339 1 Convolution Algorithms ∗
, 2010
"... One of the main applications of the FFT is to do convolution more e from the de nition which is: ciently than the direct calculation which, with a change of variables, can also be written as: y (n) = ∑ h (m) x (n − m) (1) y (n) = ∑ x (m) h (n − m) (2) This is often used to lter a signal x (n) wi ..."
Abstract
 Add to MetaCart
One of the main applications of the FFT is to do convolution more e from the de nition which is: ciently than the direct calculation which, with a change of variables, can also be written as: y (n) = ∑ h (m) x (n − m) (1) y (n) = ∑ x (m) h (n − m) (2) This is often used to lter a signal x (n
Results 1  10
of
107,237