Granular Gain of Low-Dimensional Lattices from Binary Linear Codes

Misako KOTANI  Shingo KAWAMOTO  Motohiko ISAKA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E95-A   No.12   pp.2168-2170
Publication Date: 2012/12/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E95.A.2168
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
granular gain,  lattice,  linear codes,  quantization,  

Full Text: PDF>>
Buy this Article




Summary: 
Granular gain of low-dimensional lattices based on binary linear codes is estimated using a quantization algorithm which is equivalently a soft-decision decoding of the underlying code. It is shown that substantial portion of the ultimate granular gain is achieved even in limited dimensions.