Advanced

An Information Theoretic Charachterization of Channel Shortening Receivers

Rusek, Fredrik LU and Edfors, Ove LU (2013) 47th Annual Asilomar Conference on Signals, Systems, and Computers, 2003 p.2108-2112
Abstract
Optimal data detection of a linear channel can always be implemented through the Viterbi algorithm (VA). However, in many cases of interest the memory of the channel prohibits application of the VA. A popular and conceptually simple method in this case, studied since the early 70s, 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 as a channel shortening (CS) receiver. Although studied for almost four decades, an information theoretic understanding of what such simple receiver solution is actually doing is not available. In this paper we will show that an optimized CS receiver is implementing the chain rule of mutual... (More)
Optimal data detection of a linear channel can always be implemented through the Viterbi algorithm (VA). However, in many cases of interest the memory of the channel prohibits application of the VA. A popular and conceptually simple method in this case, studied since the early 70s, 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 as a channel shortening (CS) receiver. Although studied for almost four decades, an information theoretic understanding of what such simple receiver solution is actually doing is not available. In this paper we will show that an optimized CS receiver is implementing the chain rule of mutual information, but only up to the shortened memory that the receiver is operating with. Further, we will show that the tools for analyzing the ensuing achievable rates from an optimized CS receiver are precisely the same as the tools that are used for analyzing the achievable rates of an minimum mean square error (MMSE) receiver. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
Receiver design, channel shortening detection, reduced complexity, detection, mismatched receivers, mismatched mutual information
host publication
2013 Asilomar Conference on Signals, Systems and Computers
pages
2108 - 2112
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
47th Annual Asilomar Conference on Signals, Systems, and Computers, 2003
conference location
Pacific Grove, CA, United States
conference dates
2003-11-03 - 2003-11-06
external identifiers
  • wos:000341772900380
  • scopus:84901251073
ISSN
1058-6393
DOI
10.1109/ACSSC.2013.6810679
language
English
LU publication?
yes
id
7884c73e-acb7-4409-afd0-ef22451979de (old id 4709830)
date added to LUP
2014-10-24 08:19:01
date last changed
2019-02-20 05:51:45
@inproceedings{7884c73e-acb7-4409-afd0-ef22451979de,
  abstract     = {Optimal data detection of a linear channel can always be implemented through the Viterbi algorithm (VA). However, in many cases of interest the memory of the channel prohibits application of the VA. A popular and conceptually simple method in this case, studied since the early 70s, 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 as a channel shortening (CS) receiver. Although studied for almost four decades, an information theoretic understanding of what such simple receiver solution is actually doing is not available. In this paper we will show that an optimized CS receiver is implementing the chain rule of mutual information, but only up to the shortened memory that the receiver is operating with. Further, we will show that the tools for analyzing the ensuing achievable rates from an optimized CS receiver are precisely the same as the tools that are used for analyzing the achievable rates of an minimum mean square error (MMSE) receiver.},
  author       = {Rusek, Fredrik and Edfors, Ove},
  issn         = {1058-6393},
  keyword      = {Receiver design,channel shortening detection,reduced complexity,detection,mismatched receivers,mismatched mutual information},
  language     = {eng},
  location     = {Pacific Grove, CA, United States},
  pages        = {2108--2112},
  publisher    = {IEEE--Institute of Electrical and Electronics Engineers Inc.},
  title        = {An Information Theoretic Charachterization of Channel Shortening Receivers},
  url          = {http://dx.doi.org/10.1109/ACSSC.2013.6810679},
  year         = {2013},
}