Lattices over Eisenstein integers for compute-and-forward

Nihat Engin Tunali, Krishna R. Narayanan, Joseph Boutros, Yu Chih Huang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Citations (Scopus)

Abstract

We consider the use of lattice codes over Eisenstein integers for implementing a compute-and-forward protocol in wireless networks when channel state information is not available at the transmitter. We prove the existence of a sequence of infinite-dimensional nested lattices over Eisenstein integers where the coarse lattice is simultaneously good for quantization and additive white Gaussian noise (AWGN) channel coding and the fine lattice is good for AWGN channel coding. Using this, we show that the information rates achievable with nested lattice codebooks over Eisenstein integers can be higher than those achievable with nested lattices over integers considered by Nazer and Gastpar in [1] for some set of channel realizations. We also propose a practical coding scheme based on the concatenation of a non-binary low density parity check code with a modulation scheme derived from the ring of Eisenstein integers.

Original languageEnglish
Title of host publication2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Pages33-40
Number of pages8
DOIs
Publication statusPublished - 1 Dec 2012
Event2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012 - Monticello, IL, United States
Duration: 1 Oct 20125 Oct 2012

Other

Other2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
CountryUnited States
CityMonticello, IL
Period1/10/125/10/12

Fingerprint

Channel coding
Channel state information
Transmitters
Wireless networks
Modulation
Network protocols

Keywords

  • Compute-and-Forward
  • Eisenstein integers
  • Lattice codes

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Tunali, N. E., Narayanan, K. R., Boutros, J., & Huang, Y. C. (2012). Lattices over Eisenstein integers for compute-and-forward. In 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012 (pp. 33-40). [6483196] https://doi.org/10.1109/Allerton.2012.6483196

Lattices over Eisenstein integers for compute-and-forward. / Tunali, Nihat Engin; Narayanan, Krishna R.; Boutros, Joseph; Huang, Yu Chih.

2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012. 2012. p. 33-40 6483196.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tunali, NE, Narayanan, KR, Boutros, J & Huang, YC 2012, Lattices over Eisenstein integers for compute-and-forward. in 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012., 6483196, pp. 33-40, 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, Monticello, IL, United States, 1/10/12. https://doi.org/10.1109/Allerton.2012.6483196
Tunali NE, Narayanan KR, Boutros J, Huang YC. Lattices over Eisenstein integers for compute-and-forward. In 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012. 2012. p. 33-40. 6483196 https://doi.org/10.1109/Allerton.2012.6483196
Tunali, Nihat Engin ; Narayanan, Krishna R. ; Boutros, Joseph ; Huang, Yu Chih. / Lattices over Eisenstein integers for compute-and-forward. 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012. 2012. pp. 33-40
@inproceedings{4c7f4171da694ed28fbf5cacc9cac620,
title = "Lattices over Eisenstein integers for compute-and-forward",
abstract = "We consider the use of lattice codes over Eisenstein integers for implementing a compute-and-forward protocol in wireless networks when channel state information is not available at the transmitter. We prove the existence of a sequence of infinite-dimensional nested lattices over Eisenstein integers where the coarse lattice is simultaneously good for quantization and additive white Gaussian noise (AWGN) channel coding and the fine lattice is good for AWGN channel coding. Using this, we show that the information rates achievable with nested lattice codebooks over Eisenstein integers can be higher than those achievable with nested lattices over integers considered by Nazer and Gastpar in [1] for some set of channel realizations. We also propose a practical coding scheme based on the concatenation of a non-binary low density parity check code with a modulation scheme derived from the ring of Eisenstein integers.",
keywords = "Compute-and-Forward, Eisenstein integers, Lattice codes",
author = "Tunali, {Nihat Engin} and Narayanan, {Krishna R.} and Joseph Boutros and Huang, {Yu Chih}",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/Allerton.2012.6483196",
language = "English",
isbn = "9781467345385",
pages = "33--40",
booktitle = "2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012",

}

TY - GEN

T1 - Lattices over Eisenstein integers for compute-and-forward

AU - Tunali, Nihat Engin

AU - Narayanan, Krishna R.

AU - Boutros, Joseph

AU - Huang, Yu Chih

PY - 2012/12/1

Y1 - 2012/12/1

N2 - We consider the use of lattice codes over Eisenstein integers for implementing a compute-and-forward protocol in wireless networks when channel state information is not available at the transmitter. We prove the existence of a sequence of infinite-dimensional nested lattices over Eisenstein integers where the coarse lattice is simultaneously good for quantization and additive white Gaussian noise (AWGN) channel coding and the fine lattice is good for AWGN channel coding. Using this, we show that the information rates achievable with nested lattice codebooks over Eisenstein integers can be higher than those achievable with nested lattices over integers considered by Nazer and Gastpar in [1] for some set of channel realizations. We also propose a practical coding scheme based on the concatenation of a non-binary low density parity check code with a modulation scheme derived from the ring of Eisenstein integers.

AB - We consider the use of lattice codes over Eisenstein integers for implementing a compute-and-forward protocol in wireless networks when channel state information is not available at the transmitter. We prove the existence of a sequence of infinite-dimensional nested lattices over Eisenstein integers where the coarse lattice is simultaneously good for quantization and additive white Gaussian noise (AWGN) channel coding and the fine lattice is good for AWGN channel coding. Using this, we show that the information rates achievable with nested lattice codebooks over Eisenstein integers can be higher than those achievable with nested lattices over integers considered by Nazer and Gastpar in [1] for some set of channel realizations. We also propose a practical coding scheme based on the concatenation of a non-binary low density parity check code with a modulation scheme derived from the ring of Eisenstein integers.

KW - Compute-and-Forward

KW - Eisenstein integers

KW - Lattice codes

UR - http://www.scopus.com/inward/record.url?scp=84875724867&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875724867&partnerID=8YFLogxK

U2 - 10.1109/Allerton.2012.6483196

DO - 10.1109/Allerton.2012.6483196

M3 - Conference contribution

SN - 9781467345385

SP - 33

EP - 40

BT - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012

ER -