New algorithms set is considered for fast VLSI-implementation for matrix operations in signal and image processing. These algorithms are designed by analogy with the well-known CORDIC-algorithm, but they are multidimensional. They are suitable for fast software realization by RISC-processors also. Such algorithms may be utilized for designing VLSI array processors for the eigenvalues, singular values, least squares and other linear algebra problems.

Finding the location of some object is one of the important features of the robot systems or the 3G wireless communication systems. Many valuable location based, services can be enabled by this new feature. All location determination techniques use standard trigonometric complex computation methods that are usually implemented in software. In this paper, we propose a new algorithm that uses only simple add and shift operations in the computation and therefore can be implemented in hardware. Our results show improvements of our algorithm in computation time, implementation simplicity and location accuracy over the traditional used method.

Finding the location of an object is one of the important features of robotics applications, electronic warfare positioning, and the 3G/4G wireless communication systems. Many valuable location based services can be enabled by this new feature. Position estimation from Time Difference of Arrival measurements is one of the commonly used methods. This approach is based on intersections of hyperbolic curves defined by the time differences of arrival of signals received from different sources. The location is determined using standard trigonometric complex computation methods that are usually implemented in software. In this paper, we propose a new algorithm that uses only simple add and shift operations in the computation and therefore can be implemented in hardware. Our results show improvements of our algorithm in computation time, and implementation simplicity over the traditional used method.

Location estimation of an object is one of the important features of robot systems or the 3G/4G wireless communication systems. Positioning fixed from ranges to three stations plus an additional piece of information is investigated. As a rule, location determination techniques use standard complex computation methods that are usually implemented in software. In this paper, we propose a new algorithm that uses only simple add and shift operations in the computation and therefore can be implemented in hardware. Results show improvements of our algorithm in computational cost and implementation simplicity over the traditionally used method.