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

Or Ordentlich; Uri Erez

doi:10.1109/EEEI.2010.5662120

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 proceeding › Conference contribution › peer-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 language	English
Title of host publication	2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010
Pages	703-707
Number of pages	5
DOIs	https://doi.org/10.1109/EEEI.2010.5662120
State	Published - 2010
Externally published	Yes
Event	2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010 - Eilat, Israel Duration: 17 Nov 2010 → 20 Nov 2010

Publication series

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

Conference

Conference	2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010
Country/Territory	Israel
City	Eilat
Period	17/11/10 → 20/11/10

Access to Document

10.1109/EEEI.2010.5662120

Cite this

@inproceedings{c6029b345f0c43178eb17ba7a1056619,

title = "Achieving the gains promised by integer-forcing equalization with binary codes",

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.",

author = "Or Ordentlich and Uri Erez",

year = "2010",

doi = "10.1109/EEEI.2010.5662120",

language = "אנגלית",

isbn = "9781424486809",

series = "2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010",

pages = "703--707",

booktitle = "2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010",

note = "2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010 ; Conference date: 17-11-2010 Through 20-11-2010",

}

Ordentlich, O & Erez, U 2010, Achieving the gains promised by integer-forcing equalization with binary codes. in 2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010., 5662120, 2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010, pp. 703-707, 2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010, Eilat, Israel, 17/11/10. https://doi.org/10.1109/EEEI.2010.5662120

Achieving the gains promised by integer-forcing equalization with binary codes. / Ordentlich, Or; Erez, Uri.
2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010. 2010. p. 703-707 5662120 (2010 IEEE 26th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2010).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Ordentlich, Or

AU - Erez, Uri

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

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

U2 - 10.1109/EEEI.2010.5662120

DO - 10.1109/EEEI.2010.5662120

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:78651259273

SN - 9781424486809

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

SP - 703

EP - 707

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

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

Y2 - 17 November 2010 through 20 November 2010

ER -

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this