A low complexity Euclidean norm approximation

The need for real-time computation of the Euclidean norm of a vector arises frequently in many signal processing applications such as vector median filtering, vector quantization and multiple-input multiple-output wireless communication systems. In this correspondence, we examine the properties of a linear combination of the 1-norm and the infinity norm as an approximation to the Euclidean norm of real-valued vectors. The approximation requires only two multiplications regardless of the vector length and does not require sorting of the absolute values of the vector entries. Numerical results show that the considered approximation incurs negligible performance degradations in typical applications.X1112sciescopu