Index assignment for scalar quantization with M-ary phase shift keying

This paper studies the problem of non-binary index assignment for scalar quantizer with M-ary Phase Shift Keying (M-PSK). An interesting observation enables us to well approximate this problem to the well-known Traveling Salesman Problem (TSP). A unique optimum solution to the approximation is resulted. Optimality of the solution is agreed by simulation results.