Patent ID: 6995764
Filing Date: 2006-02-07
Classification: G06F

Abstract:
1. A method for automatic placing of the tasks of an application in a signal-processing machine comprising a first stage ( 101 ) in which, starting with data structured into tables visually displayed in the form of Cartesian identifiers (X, Y, Z, T), by implementing at least one transformation on these data (F), a set of elementary transforms is available in a library, for each transform, at input, at least one operand application table ( 30 ) is established, and, at the output, at least one result application table is established, an operand pattern ( 33 ) is established at the input to each elementary transform and a result pattern ( 34 ) is established at the exit, for each Cartesian-coordinate axis, at least two elements of the operand pattern and of the operand application table, on the one hand, of the result pattern and of the result application table on the other hand, are put into correspondence, and the refined relations characteristic of the accesses in the tables are used in signal processing in order to establish, by iteration, by the use of software included in the graphics tool, on the basis of at least two correspondences, all the accesses necessary for the complete execution of the transform in question, followed by a second stage ( 103 ) in which, starting from an input table which is sampled with an input pattern ( 901 ) according to an input-assemblage relationship and an input-paving relationship, each of these patterns is made to undergo an elementary transform ET which delivers output patterns ( 202 ), and an output table ( 201 ) is made up by assembling these output patterns according to an output-paving relationship and an output-aligning relationship, a first output multidimensional space is determined including a first set of axes (Q 1 , Q 0 ) corresponding to the axes of the table which is the quotient of the output table and the output pattern, itself regarded as an output-divisor table, and a second set of axes (D 1 , D 0 ) corresponding to the axes of this output-divisor table, this first space thus comprising all the outputs of the output table ranged in such a way as to be able to be traversed successively by one incrementation of the clock of the processor, and a first matrix for projection {MP} of this first space to the output table is determined, which makes it possible automatically to determine a first coding making it possible to place the outputs in the output table, characterized in that it is followed by a third stage ( 110 ) implementing a method using Table Distribution Operators ( 201 ), called TDOs, formed by a sequence of Elementary Operators ( 301 ), called EOs, which are separated by linking spaces ( 302 ), in order to describe the connections between the elements of a Sender space ( 202 ) N e , and the elements of a Receiver space ( 203 ) N r .