On the realization of 2-D orthogonal state-space systems

The problem of Roesser model realization is considered in this paper. Sample-by-sample scheduling techniques are discussed, which utilize index mapping functions, resulting in column-by-column, row-by-row, and diagonal-by-diagonal implementations. It is shown that the diagonal-by-diagonal implementation requires specific approach, and can be realized using a novel switched delay structure. An adopted technique is presented for the realization of memoryless block of orthogonal 2-D state-space equations, which leads to a structure consisting of Givens rotations, possibly a −1 multiplier, and unit delays. Processing time and concurrency issues of such approach are briefly discussed.