We propose a new algorithm for finding sparse solution of a linear system of equations using I ₀ minimization. The proposed algorithm relies on approximating the non-smooth I ₀ (pseudo) norm with a differentiable function. Unlike other approaches, we utilize a particular definition of I ₀ norm which states that the I ₀ norm of a vector can be computed as the I ₁ norm of its sign vector. Then, using a smooth approximation of the sign function, the problem is converted to I ₁ minimization. This problem is solved via iterative proximal algorithms. Our simulations on both synthetic and real data demonstrate the promising performance of the proposed scheme.