Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

On the Computation of 2-Dimensional Recurrence Equations

Giuseppe Natale

TL;DR

The paper demonstrates how a 2-dimensional recurrence problem can be reduced to a mono-dimensional recurrence problem where the Kogge and Stone algorithm is applicable, with the computation time becoming proportional to $log_2(2n-1)$.

Abstract

The paper demonstrates how a 2-dimensional recurrence problem can be reduced to a mono-dimensional recurrence problem where the Kogge and Stone algorithm is applicable, with the computation time - excluding the reduction step - becoming proportional to $log_2(2n-1)$.

On the Computation of 2-Dimensional Recurrence Equations

TL;DR

The paper demonstrates how a 2-dimensional recurrence problem can be reduced to a mono-dimensional recurrence problem where the Kogge and Stone algorithm is applicable, with the computation time becoming proportional to .

Abstract

The paper demonstrates how a 2-dimensional recurrence problem can be reduced to a mono-dimensional recurrence problem where the Kogge and Stone algorithm is applicable, with the computation time - excluding the reduction step - becoming proportional to .
Paper Structure (3 sections, 8 equations, 1 figure)

This paper contains 3 sections, 8 equations, 1 figure.

Table of Contents

  1. Introduction
  2. Discussion
  3. Appendix: Example

Figures (1)

  • Figure 1: Wavefront computation pattern induced by the dependence relation in (\ref{['eq:2d']}).

Theorems & Definitions (1)

  • proof