Cyclic-Coded Integer-Forcing Equalization

DOI10.1109/TIT.2012.2202633MaRDI QIDQ2989773zbMATH OpenOpenAlexFDO

Authors Or Ordentlich, Uri Erez

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1012.5553

Mathematics Subject Classification ID

Cyclic codes (94B15) Channel models (including quantum) in information and communication theory (94A40)

Abstract: A discrete-time intersymbol interference channel with additive Gaussian noise is considered, where only the receiver has knowledge of the channel impulse response. An approach for combining decision-feedback equalization with channel coding is proposed, where decoding precedes the removal of intersymbol interference. This is accomplished by combining the recently proposed integer-forcing equalization approach with cyclic block codes. The channel impulse response is linearly equalized to an integer-valued response. This is then utilized by leveraging the property that a cyclic code is closed under (cyclic) integer-valued convolution. Explicit bounds on the performance of the proposed scheme are also derived.

Cited in

(3)

• Bit Error Rate Minimizing Channel Shortening Equalizers for Cyclic Prefixed Systems
• Integer-Forcing Linear Receivers
• Cyclic Prefix Based Enhanced Data Recovery in OFDM

This page was built for publication: Cyclic-Coded Integer-Forcing Equalization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989773)