DocumentCode
3070027
Title
Closest point algorithms with lp norm for root lattices
Author
Takizawa, Kenichirou ; Yagi, Hideki ; Kawabata, Tsutomu
Author_Institution
Dept. of Inf. & Commun. Eng., Univ. of Electro-Commun., Tokyo, Japan
fYear
2010
fDate
13-18 June 2010
Firstpage
1042
Lastpage
1046
Abstract
We study quantizers with lp norm, with p ≥ 1, for the root lattices. Our algorithms extend the ones proposed by Conway and Sloane [1] with l2 norm. They proposed an interesting algorithm for An lattice, but without proof of the optimality. We give the proof of the optimality with our extended case of lp norm. We also give an algorithm for E6 and its dual, which are not described in [1].
Keywords
quantisation (signal); closest point algorithm; optimality proof; quantizers; root lattices; Algebra; Lattices; Rate-distortion; Vector quantization; Yagi-Uda antennas;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location
Austin, TX
Print_ISBN
978-1-4244-7890-3
Electronic_ISBN
978-1-4244-7891-0
Type
conf
DOI
10.1109/ISIT.2010.5513727
Filename
5513727
Link To Document