Granular Gain of Low-Dimensional Lattices from Binary Linear Codes

Search this article

Abstract

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.

Journal

References(8)*help

See more

Related Projects

See more

Details 詳細情報について

Report a problem

Back to top