Construction of turbo lattices

Author

Sakzad, Amin ; Sadeghi, Mohammad-Reza ; Panario, Daniel

Author_Institution

Dept. of Math. & Comput. Sci., Amirkabir Univ. of Technol., Tehran, Iran

fYear

2010

fDate

Sept. 29 2010-Oct. 1 2010

Firstpage

14

Lastpage

21

Abstract

In this work we introduce and establish the concept of turbo lattices. We employ a routine method for constructing lattices, called Construction D, to construct turbo lattices. This kind of construction needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our bases codes. Therefore, we first build a set of nested turbo codes based on nested interleavers and nested convolutional codes. Then by means of these codes, along with construction D, we construct turbo lattices. Several properties of Construction D lattices and specially many characteristics of turbo lattices including the minimum distance, coding gain, kissing number and the probability of error under a maximum likelihood decoder over AWGN channel are investigated.

Keywords

AWGN channels; convolutional codes; interleaved codes; linear codes; maximum likelihood decoding; turbo codes; AWGN channel; coding gain; construction D lattices; maximum likelihood decoder; nested convolutional codes; nested interleaver code; nested linear codes; probability of error; turbo codes; turbo lattices construction; AWGN channels; Block codes; Convolutional codes; Generators; Lattices; Turbo codes; Construction D; Lattice; Turbo codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on

Conference_Location

Allerton, IL

Print_ISBN

978-1-4244-8215-3

Type

conf

DOI

10.1109/ALLERTON.2010.5706882

Filename

5706882