Advanced

An information theoretic characterization of channel shortening receivers

Rusek, Fredrik LU and Edfors, Ove LU (2016) In IEEE Transactions on Communications 64(4). p.1490-1502
Abstract

Optimal data detection of data transmitted over a linear channel can always be implemented through the Viterbi algorithm (VA). However, in many cases of interest the memory of the channel prohibits direct application of the VA. A popular and conceptually simple method in this case, studied since the early 1970s, is to first filter the received signal in order to shorten the memory of the channel, and then to apply a VA that operates with the shorter memory. We shall refer to this general concept as a channel shortening (CS) receiver. Although studied for almost four decades, an information theoretic understanding of what such a simple receiver solution is actually doing is not available. In this paper, we show that an optimized CS... (More)

Optimal data detection of data transmitted over a linear channel can always be implemented through the Viterbi algorithm (VA). However, in many cases of interest the memory of the channel prohibits direct application of the VA. A popular and conceptually simple method in this case, studied since the early 1970s, is to first filter the received signal in order to shorten the memory of the channel, and then to apply a VA that operates with the shorter memory. We shall refer to this general concept as a channel shortening (CS) receiver. Although studied for almost four decades, an information theoretic understanding of what such a simple receiver solution is actually doing is not available. In this paper, we show that an optimized CS receiver has a direct correspondance to the chain rule of mutual information. Furthermore, we show that the tools for analyzing the ensuing achievable rates from an optimized CS receiver are precisely the same as those used for analyzing the achievable rates of a minimum mean-square-error (MMSE) receiver.

(Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
Channel shortening detection, Mismatched mutual information, Mismatched receivers, Receiver design, Reduced complexity detection
in
IEEE Transactions on Communications
volume
64
issue
4
pages
1490 - 1502
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • Scopus:84964355109
ISSN
0090-6778
DOI
10.1109/TCOMM.2016.2536664
language
English
LU publication?
yes
id
82de250a-db85-430b-8b25-60366169a36a
date added to LUP
2016-06-16 10:40:21
date last changed
2016-06-16 10:40:21
@misc{82de250a-db85-430b-8b25-60366169a36a,
  abstract     = {<p>Optimal data detection of data transmitted over a linear channel can always be implemented through the Viterbi algorithm (VA). However, in many cases of interest the memory of the channel prohibits direct application of the VA. A popular and conceptually simple method in this case, studied since the early 1970s, is to first filter the received signal in order to shorten the memory of the channel, and then to apply a VA that operates with the shorter memory. We shall refer to this general concept as a channel shortening (CS) receiver. Although studied for almost four decades, an information theoretic understanding of what such a simple receiver solution is actually doing is not available. In this paper, we show that an optimized CS receiver has a direct correspondance to the chain rule of mutual information. Furthermore, we show that the tools for analyzing the ensuing achievable rates from an optimized CS receiver are precisely the same as those used for analyzing the achievable rates of a minimum mean-square-error (MMSE) receiver.</p>},
  author       = {Rusek, Fredrik and Edfors, Ove},
  issn         = {0090-6778},
  keyword      = {Channel shortening detection,Mismatched mutual information,Mismatched receivers,Receiver design,Reduced complexity detection},
  language     = {eng},
  month        = {04},
  number       = {4},
  pages        = {1490--1502},
  publisher    = {ARRAY(0x9dba428)},
  series       = {IEEE Transactions on Communications},
  title        = {An information theoretic characterization of channel shortening receivers},
  url          = {http://dx.doi.org/10.1109/TCOMM.2016.2536664},
  volume       = {64},
  year         = {2016},
}