Bit-Plane Coding of Lattice Codevectors
Summary :
In a sign-magnitude representation of binary lattice codevectors, only a few least significant bit-planes are constrained due to the structure of the lattice, while there is no restriction on other more significant bit-planes. Hence, any convenient bit-plane coding method can be used to encode the lattice codevectors, with modification required only for the lattice-defining, least-significant bit-planes. Simple encoding methods for the lattice-defining bit-planes of the D4, RE8, and Barnes-Wall 16-dimensional lattices are described. Simulation results for the encoding of a uniform source show that standard bit-plane coding together with the proposed encoding provide about the same performance as integer lattice vector quantization when the bit-stream is truncated. When the entire bit-stream is fully decoded, the granular gain of the lattice is realized.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E96-A No.8 pp.1817-1820
- Publication Date
- 2013/08/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E96.A.1817
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Wisarn PATCHOO
Bangkok University
Thomas R. FISCHER
Washington State University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Wisarn PATCHOO, Thomas R. FISCHER, "Bit-Plane Coding of Lattice Codevectors" in IEICE TRANSACTIONS on Fundamentals,
vol. E96-A, no. 8, pp. 1817-1820, August 2013, doi: 10.1587/transfun.E96.A.1817.
Abstract: In a sign-magnitude representation of binary lattice codevectors, only a few least significant bit-planes are constrained due to the structure of the lattice, while there is no restriction on other more significant bit-planes. Hence, any convenient bit-plane coding method can be used to encode the lattice codevectors, with modification required only for the lattice-defining, least-significant bit-planes. Simple encoding methods for the lattice-defining bit-planes of the D4, RE8, and Barnes-Wall 16-dimensional lattices are described. Simulation results for the encoding of a uniform source show that standard bit-plane coding together with the proposed encoding provide about the same performance as integer lattice vector quantization when the bit-stream is truncated. When the entire bit-stream is fully decoded, the granular gain of the lattice is realized.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E96.A.1817/_p
Copy
@ARTICLE{e96-a_8_1817,
author={Wisarn PATCHOO, Thomas R. FISCHER, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Bit-Plane Coding of Lattice Codevectors},
year={2013},
volume={E96-A},
number={8},
pages={1817-1820},
abstract={In a sign-magnitude representation of binary lattice codevectors, only a few least significant bit-planes are constrained due to the structure of the lattice, while there is no restriction on other more significant bit-planes. Hence, any convenient bit-plane coding method can be used to encode the lattice codevectors, with modification required only for the lattice-defining, least-significant bit-planes. Simple encoding methods for the lattice-defining bit-planes of the D4, RE8, and Barnes-Wall 16-dimensional lattices are described. Simulation results for the encoding of a uniform source show that standard bit-plane coding together with the proposed encoding provide about the same performance as integer lattice vector quantization when the bit-stream is truncated. When the entire bit-stream is fully decoded, the granular gain of the lattice is realized.},
keywords={},
doi={10.1587/transfun.E96.A.1817},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - Bit-Plane Coding of Lattice Codevectors
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1817
EP - 1820
AU - Wisarn PATCHOO
AU - Thomas R. FISCHER
PY - 2013
DO - 10.1587/transfun.E96.A.1817
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E96-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2013
AB - In a sign-magnitude representation of binary lattice codevectors, only a few least significant bit-planes are constrained due to the structure of the lattice, while there is no restriction on other more significant bit-planes. Hence, any convenient bit-plane coding method can be used to encode the lattice codevectors, with modification required only for the lattice-defining, least-significant bit-planes. Simple encoding methods for the lattice-defining bit-planes of the D4, RE8, and Barnes-Wall 16-dimensional lattices are described. Simulation results for the encoding of a uniform source show that standard bit-plane coding together with the proposed encoding provide about the same performance as integer lattice vector quantization when the bit-stream is truncated. When the entire bit-stream is fully decoded, the granular gain of the lattice is realized.
ER -
English
