In the field of industrial control applications, this digital technology is appropriate to reach an optimum between the control performances, the controller algorithm complexity and the design flexibility.
We identify a tradeoff between search-retrieval efficiency and algorithm complexity.
However, the paper only shows the differences between these possibilities in terms of algorithm complexity as well as visualization results, and does not make an analysis with volume datasets.
This involves identifying overlap areas between quadrilateral flux-areas and regular square grid cells which is non-trivial and leads to some algorithm complexity.
Before discussing the algorithm complexity, we first distinguish between three types of operations involved in our method: (a) feature vector computation, (b) feature vector comparison, and (c) basic floating-point arithmetic operation.
Though the space of unused triangles is iteratively reduced as the algorithm progresses, this does not affect the algorithm complexity: if the number of COGs is c, the algorithm complexity is O(c)* O g), assuming a O(1) lookup for a common edge between a triangle and a COG, and since O(c) = O g) in the worst case, the overall complexity is O g).
The simplified message passing algorithm provides a trade-off between implementation complexity and decoding performance using hard/soft-decision based algorithms.
Several popular VSSLMS algorithms are investigated and the algorithm providing the best trade-off between complexity and performance is chosen as the proposed VSSDLMS algorithm.
The complexity of the proposed sphere decoding algorithms for MIMO detection is significantly reduced, and the algorithm provides an attractive tradeoff between complexity and performance.
We studied an appropriate reconstruction algorithm searching for the best compromise between computational complexity and high precision.
