Open AccessShort block length trellis‐based codes for interference channels
Author(s) -
Dabirnia Mehdi,
Sharifi Shahrouz,
Tanc A Korhan,
Duman Tolga M.
Publication year - 2018
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2018.5198
Subject(s) - fading , decoding methods , algorithm , computer science , concatenated error correction code , block code , low density parity check code , interference (communication) , linear code , trellis (graph) , block (permutation group theory) , code (set theory) , mathematics , theoretical computer science , telecommunications , channel (broadcasting) , combinatorics , set (abstract data type) , programming language
In this study, the authors consider Gaussian interference channels and fading interference channels, and design short block length codes based on trellis‐based constructions. For both joint maximum likelihood (JML) decoding and single user minimum distance decoding, they obtain error‐rate bounds to assess the code performance. Then they employ the obtained bounds for code design and present several design examples. For the case of quasi‐static fading, they note that while the simple version of the derived bound is not sufficiently tight for code search purposes, one can obtain a tight performance bound with a higher complexity that can be used for a theoretical performance investigation. For the Gaussian case under JML decoding, they show that the newly designed codes provide significant improvements over point‐to‐point (P2P) trellis‐based codes and off‐the‐shelf low density parity check codes. They also demonstrate that, for the case of independent and identically distributed fading, the best codes obtained by performing code search are P2P optimal ones, which is also verified by simulation results.