Uses of Class
at.dms.kjc.sir.linear.transform.LinearTransform

Packages that use LinearTransform

at.dms.kjc.sir.linear.transform

Performs algebraic combination of adjacent linear filters in the stream graph.

Uses of LinearTransform in at.dms.kjc.sir.linear.transform

Subclasses of LinearTransform in at.dms.kjc.sir.linear.transform

class	LinearTransformNull Represents a null transform -- eg no transform to apply.
class	LinearTransformPipeline Represents a pipeline combination transform.
class	LinearTransformSplitJoin Contains the code for merging all the filters from a split join into a single monolithic matrix.

Methods in at.dms.kjc.sir.linear.transform that return LinearTransform

static LinearTransform

LinearTransformPipeline.calculate(List<LinearFilterRepresentation> linearRepList) Sets up the calculation of the overall linear representation of a sequential list of linear representations. If filter one computes y = xA1 + b1 and filter 2 computes y=xA2 + b2 then the overall filter filter1 --> filter 2 will compute y = (xA1 + b1)A2 + b2 = xA1A2 + (b1A2 + b2), which itself can be represented with the LFR: A = A1A2 and b = (b1A2 + b2). There are a bunch of subtlties involved with computing the overall representation due to various size restrictions (eg the sizes of the matrices have to be compatible.

static LinearTransform

LinearTransformSplitJoin.calculateDuplicate(List<LinearFilterRepresentation> representationList, int[] joinerWeights) Calculate the necessary information to combine the splitjoin when the splitter is a duplicate.