DocumentCode :
3495795
Title :
Achieving the gains promised by Integer-Forcing equalization with binary codes
Author :
Ordentlich, Or ; Erez, Uri
Author_Institution :
Dept. of EE-Syst., Tel Aviv Univ., Ramat Aviv, Israel
fYear :
2010
fDate :
17-20 Nov. 2010
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 Zq. 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.
Keywords :
AWGN channels; MIMO communication; binary codes; block codes; intersymbol interference; linear codes; modulation coding; AWGN channels; Gaussian MIMO channel; Ungerboeck method; Zq; binary codes; implementation complexity; integer-forcing equalization; linear block codes; mapping; moderate losses; nested lattice codes; optimal capacity; practical coding schemes; set partitioning; transmission rates; Decoding; Encoding; Labeling; Lattices; MIMO; Receivers; Relays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical and Electronics Engineers in Israel (IEEEI), 2010 IEEE 26th Convention of
Conference_Location :
Eliat
Print_ISBN :
978-1-4244-8681-6
Type :
conf
DOI :
10.1109/EEEI.2010.5662120
Filename :
5662120
Link To Document :
بازگشت