Achieving the gains promised by integer-forcing equalization with binary codes

Or Ordentlich*, Uri Erez

*Corresponding author for this work

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

14 Scopus citations

Abstract

We address the problem of constructing practical coding schemes for Integer-Forcing (IF) equalization. Previously proposed IF schemes suggested the use of nested lattice codes or linear block codes over double-struck Z q. While such codes have good properties from a theoretic point of view, their implementation complexity may become significant when q is large. In this work we show that at high transmission rates, linear codes suitable for IF equalization may be constructed using binary codes, incurring only moderate losses compared to optimal capacity achieving nested lattice codes. The technique is based on Ungerboeck's method of mapping by set partitioning.

Original languageAmerican English
Title of host publication2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010
Pages703-707
Number of pages5
DOIs
StatePublished - 2010
Externally publishedYes
Event2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010 - Eilat, Israel
Duration: 17 Nov 201020 Nov 2010

Publication series

Name2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010

Conference

Conference2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010
Country/TerritoryIsrael
CityEilat
Period17/11/1020/11/10

Fingerprint

Dive into the research topics of 'Achieving the gains promised by integer-forcing equalization with binary codes'. Together they form a unique fingerprint.

Cite this