Optimal index assignment for multiple description scalar quantization with translated lattice codebooks

Zhang, G; Klejsa, J; Kleijn, WB

Optimal index assignment for multiple description scalar quantization with translated lattice codebooks

Zhang, G

Klejsa, J Kleijn, WB

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Signal Processing, 2012, 60 (8), pp. 4444 - 4451
Issue Date:: 2012-07-23

Closed Access

	Filename	Description	Size
	06200358.pdf	Published Version	331.69 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zhang, G https://orcid.org/0000-0003-4521-542X	en_US
dc.contributor.author	Klejsa, J	en_US
dc.contributor.author	Kleijn, WB	en_US
dc.date.issued	2012-07-23	en_US
dc.identifier.citation	IEEE Transactions on Signal Processing, 2012, 60 (8), pp. 4444 - 4451	en_US
dc.identifier.issn	1053-587X	en_US
dc.identifier.uri	http://hdl.handle.net/10453/115375
dc.description.abstract	We design a K -description scalar quantizer, whose construction is based on a structure of translated scalar lattices and a lattice in K-1 dimensional space. The use of translated lattices provides a performance advantage by exploiting a so-called staggering gain. The use of the K-1 dimensional lattice facilitates analytic insight into the performance and significantly speeds up the computation of the index assignment compared to state-of-the-art methods. Using a common decoding method, the proposed index assignment is proven to be optimal for the K-description case. It is shown that the optimal index assignment is not unique. This is illustrated for the two-description case, where a periodic index assignment is selected from possible optimal assignments and described in detail. The performance of the proposed quantizer accurately matches theoretic analysis over the full range of operational redundancies. Moreover, the quantizer outperforms the state-of-the-art MD scheme as the redundancy among the description increases. © 2012 IEEE.	en_US
dc.relation.ispartof	IEEE Transactions on Signal Processing	en_US
dc.relation.isbasedon	10.1109/TSP.2012.2199315	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	Optimal index assignment for multiple description scalar quantization with translated lattice codebooks	en_US
dc.type	Journal Article
utslib.citation.volume	8	en_US
utslib.citation.volume	60	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
utslib.copyright.status	closed_access
pubs.issue	8	en_US
pubs.publication-status	Published	en_US
pubs.volume	60	en_US

Abstract:

We design a K -description scalar quantizer, whose construction is based on a structure of translated scalar lattices and a lattice in K-1 dimensional space. The use of translated lattices provides a performance advantage by exploiting a so-called staggering gain. The use of the K-1 dimensional lattice facilitates analytic insight into the performance and significantly speeds up the computation of the index assignment compared to state-of-the-art methods. Using a common decoding method, the proposed index assignment is proven to be optimal for the K-description case. It is shown that the optimal index assignment is not unique. This is illustrated for the two-description case, where a periodic index assignment is selected from possible optimal assignments and described in detail. The performance of the proposed quantizer accurately matches theoretic analysis over the full range of operational redundancies. Moreover, the quantizer outperforms the state-of-the-art MD scheme as the redundancy among the description increases. © 2012 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/115375