DocumentCode :
2266491
Title :
Index assignment for scalar quantization with M-ary phase shift keying
Author :
Chan, H.Y. ; Mow, W.H. ; Leung, C.S.
fYear :
2005
fDate :
4-9 Sept. 2005
Firstpage :
357
Lastpage :
361
Abstract :
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
Keywords :
mean square error methods; phase shift keying; travelling salesman problems; vector quantisation; M-ary phase shift keying; nonbinary index assignment; scalar quantization; traveling salesman problem; Constellation diagram; Decoding; Distortion measurement; Lattices; Mean square error methods; Phase shift keying; Probability distribution; Protection; Quantization; Traveling salesman problems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
Type :
conf
DOI :
10.1109/ISIT.2005.1523354
Filename :
1523354
Link To Document :
بازگشت