Optimal Transmit Filters for ISI Channels under Channel Shortening Detection
(2013) In IEEE Transactions on Communications 61(12). p.4997-5005- Abstract
- We consider channels affected by intersymbol interference with reduced-complexity, mutual information optimized, channel-shortening detection. For such settings, we optimize the transmit filter, taking into consideration the reduced receiver complexity constraint. As figure of merit, we consider the achievable information rate of the entire system and with functional analysis, we establish a general form of the optimal transmit filter, which can then be optimized by standard numerical methods. As a corollary to our main result, we obtain some insight of the behavior of the standard waterfilling algorithm for intersymbol interference channels. With only some minor changes, the general form we derive can be applied to multiple-input... (More)
- We consider channels affected by intersymbol interference with reduced-complexity, mutual information optimized, channel-shortening detection. For such settings, we optimize the transmit filter, taking into consideration the reduced receiver complexity constraint. As figure of merit, we consider the achievable information rate of the entire system and with functional analysis, we establish a general form of the optimal transmit filter, which can then be optimized by standard numerical methods. As a corollary to our main result, we obtain some insight of the behavior of the standard waterfilling algorithm for intersymbol interference channels. With only some minor changes, the general form we derive can be applied to multiple-input multiple-output channels with intersymbol interference. To illuminate the practical use of our results, we provide applications of our theoretical results by deriving the optimal shaping pulse of a linear modulation transmitted over a bandlimited additive white Gaussian noise channel which has possible applications in the faster-than-Nyquist/time packing technique. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/4318720
- author
- Modenini, Andrea ; Rusek, Fredrik LU and Colavolpe, Giulio
- organization
- publishing date
- 2013
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- ISI channels, channel shortening, waterfilling algorithms, reduced, complexity detection, mismatched receivers, MIMO-ISI, faster-than-Nyquist, time packing
- in
- IEEE Transactions on Communications
- volume
- 61
- issue
- 12
- pages
- 4997 - 5005
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- wos:000330225000018
- scopus:84891606809
- ISSN
- 0090-6778
- DOI
- 10.1109/TCOMM.2013.110813.130385
- language
- English
- LU publication?
- yes
- id
- a9f50518-4738-48bc-b828-d41f9e4bae3b (old id 4318720)
- date added to LUP
- 2016-04-01 14:24:05
- date last changed
- 2022-02-04 20:42:11
@article{a9f50518-4738-48bc-b828-d41f9e4bae3b,
abstract = {{We consider channels affected by intersymbol interference with reduced-complexity, mutual information optimized, channel-shortening detection. For such settings, we optimize the transmit filter, taking into consideration the reduced receiver complexity constraint. As figure of merit, we consider the achievable information rate of the entire system and with functional analysis, we establish a general form of the optimal transmit filter, which can then be optimized by standard numerical methods. As a corollary to our main result, we obtain some insight of the behavior of the standard waterfilling algorithm for intersymbol interference channels. With only some minor changes, the general form we derive can be applied to multiple-input multiple-output channels with intersymbol interference. To illuminate the practical use of our results, we provide applications of our theoretical results by deriving the optimal shaping pulse of a linear modulation transmitted over a bandlimited additive white Gaussian noise channel which has possible applications in the faster-than-Nyquist/time packing technique.}},
author = {{Modenini, Andrea and Rusek, Fredrik and Colavolpe, Giulio}},
issn = {{0090-6778}},
keywords = {{ISI channels; channel shortening; waterfilling algorithms; reduced; complexity detection; mismatched receivers; MIMO-ISI; faster-than-Nyquist; time packing}},
language = {{eng}},
number = {{12}},
pages = {{4997--5005}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
series = {{IEEE Transactions on Communications}},
title = {{Optimal Transmit Filters for ISI Channels under Channel Shortening Detection}},
url = {{http://dx.doi.org/10.1109/TCOMM.2013.110813.130385}},
doi = {{10.1109/TCOMM.2013.110813.130385}},
volume = {{61}},
year = {{2013}},
}