This paper presents algorithms that allow the realization of multi-valued functions as a multi-level network consisting of minand max-gates. The algorithms are based on bi-decomposition of function intervals, a generalization of incompletely specified functions. Multi-valued derivation operators are applied to compute decomposition structures. For validation the algorithms have been implemented...

This paper introduces the umodules, a generalisation of the notion of module in graph theory. The structure to be decomposed, so-called homogeneous relation, captures among other undirected graphs, tournaments, digraphs, and 2−structures. Our resulting decomposition scheme when restricted to undirected graphs generalises the well-studied modular graph decomposition, and meets the recently intro...

This paper presents the novel approach for pre-coding in multiple input and multiple output systems using arithmetic mean decomposition. This proposed decomposition scheme has low complexity than popular geometric mean decomposition. CORDIC based Givens rotation is used for making the channel matrix as bi-diagonal matrix and then 2x2 singular value decomposition and 2x2 arithmetic mean decompos...