On decoding product lattices

Amir J. Salomon, Ofer Amrani

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A product lattice is a high-dimensional lattice constructed using two lower dimensional lattices, in equivalence to binary product block codes constructed from two lower dimensional binary block codes. However, decoding methods typically used for binary product codes do not necessarily apply to product lattices. In this work several approaches for decoding product lattices are presented. In particular, bounded-distance decoding, which relies on the fact that all the rows and columns of the product lattice are points in the component lattices, is detailed. This property of product lattices enables one to efficiently decode the product lattice by employing separate decoders for the (much smaller dimensional) component lattices. Measures for the efficiency of these decoding methods are derived, and it is shown, also by means of computer simulation, that they are comparable to known decoding methods of lattices both in terms of effective coding gain and complexity.

Original languageEnglish
Title of host publicationProceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005
Pages179-182
Number of pages4
DOIs
StatePublished - 2005
EventIEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005 - Rotorua, New Zealand
Duration: 29 Aug 20051 Sep 2005

Publication series

NameProceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005

Conference

ConferenceIEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005
Country/TerritoryNew Zealand
CityRotorua
Period29/08/051/09/05

Fingerprint

Dive into the research topics of 'On decoding product lattices'. Together they form a unique fingerprint.

Cite this