Abstract: Assistant serving a software platform which operates intermittently on use cases, comprising: a. an interface receiving a formal description of the use cases including a characterization of each along dimensions; and a formal description of the platform's possible configurations including a formal description of execution environments supported by the platform including for each environment a characterization thereof along the dimensions; and b.

Abstract: The method for decoding a received signal in a multiple input/multiple output system uses QR-decomposition of the linear channel matrix, but then applies a non-Euclidean norm during tree traversal. Two separate hardware units, namely an MCU and a MEU, art provided for concurrent operation. The MCU determines a next child node, while the MEU determines next best parent nodes on the previously processed tree levels, which makes it possible to retrace the path to a next starting node without investing dedicated processing steps (e.g., cycles). On each tree level, the possible coordinates are grouped into several circular sets in the complex plane, and a series of decision boundaries is calculated for each set that allows a quick evaluation of the optimum coordinate in each set.

Abstract: The present application describes a method for transmitting data through a MIMO-OFDM system which requires the computation of a function f(H(sk)), where H is the channel matrix and sk=exp(j*2*pi*k/N). The method splits function f into a first, nonpolynomial part, which is in turn a function of one or more polynomial functions in sk.

Abstract: The method for decoding a received signal in a multiple input/multiple output system uses QR-decomposition of the linear channel matrix, but then applies a non-Euclidean norm during tree traversal. Two separate hardware units, namely an MCU and a MEU, art provided for concurrent operation. The MCU determines a next child node, while the MEU determines next best parent nodes on the previously processed tree levels, which makes it possible to retrace the path to a next starting node without investing dedicated processing steps (e.g., cycles). On each tree level, the possible coordinates are grouped into several circular sets in the complex plane, and a series of decision boundaries is calculated for each set that allows a quick evaluation of the optimum coordinate in each set.

Abstract: The present application describes a method for transmitting data through a MIMO-OFDM system which requires the computation of a function f(H(sk)), where H is the channel matrix and sk=exp(j*2*pi*k/N). The method splits function f into a first, nonpolynomial part, which is in turn a function of one or more polynomial functions in sk.