This is essentially a combinatorial optimization problem with a exponentially large search space, which makes finding the optimal mapping practically infeasible for large networks.
We also recall the optimal MAP and ML detectors.
Finally, we employ a traditional algorithm to find the optimal mapping.
The optimal mapping of a parallel program is strongly dependent on the granularity and network architecture.
If the optimal MAP receiver is considered, the complexity is significantly increased.
However, the search for the optimal mapping of virtual networks is an NP-hard problem[6].
For the motion detection, our mapping algorithm (Section 4) finds optimal mapping solutions in terms of storage (column 5).
We hypothesize that intradermal TSC is the optimal mapping technique and can be used alone to identify SLNs.
We focus on the problem of finding the optimal mapping of pipeline algorithms on a ring of processors.
This paper presents an approach to the automated identification of optimal mapping choices in a Simulink-to-MPSoC design flow.
An optimal mapping of the RLS lattice onto the LNS arithmetic units found by the cyclic scheduling was used.
