Soft input soft output Kalman equalizer for MIMO frequency selective fading channels

Subhadeep Roy, Tolga M. Duman

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

We consider the Kalman filter for equalization of a multiple-input multiple-output (MIMO), frequency selective, quasi-static fading channel. More specifically, we consider a coded system, where the incoming bit stream is convolutionally encoded, interleaved and then spatially multiplexed across the transmit antennas. Each substream is modulated into M-ary symbols before being transmitted over a frequency selective channel. At the receiver, we propose to use the Kalman filter as a low complexity MIMO equalizer, as opposed to the trellis based maximum a-posteriori (MAP) equalizer whose computational complexity grows exponentially with the channel memory, the number of transmit antennas and the spectral efficiency (bits/s/Hz) of the system. We modify the structure of the Kalman filter and enable it to process the a-priori (soft) information provided by the channel decoder, thereby allowing us to perform iterative (turbo) equalization on the received sequence. The iterative equalizer structure is designed for general M-ary constellations. We also propose a low complexity version of the above algorithm whose performance is comparable to its full complexity counterpart, but which achieves a significant complexity reduction. We demonstrate via simulations that for higher order constellations, when sufficient number of receive antennas are available (e.g. for a 2 transmitter, 3 receiver system, QPSK), the performance of the proposed algorithms after 4 iterations is within 1.5 dB of the non-iterative MAP algorithm with close to an order of magnitude complexity reduction. By objectively quantifying the complexity of all the considered algorithms we show that the complexity reduction for the proposed schemes becomes increasingly significant for practical systems with moderate to large constellation sizes and a large number of transmit antennas.

Original languageEnglish (US)
Pages (from-to)506-514
Number of pages9
JournalIEEE Transactions on Wireless Communications
Volume6
Issue number2
DOIs
StatePublished - Feb 2007

Fingerprint

Frequency selective fading
Equalizer
Equalizers
Fading Channels
Multiple-input multiple-output (MIMO)
Fading channels
Kalman filters
Antennas
Antenna
Output
Kalman Filter
Maximum a Posteriori
Low Complexity
Receiver
Turbo Equalization
Quadrature phase shift keying
Spectral Efficiency
Equalization
Transmitters
Computational complexity

Keywords

  • Equalizer
  • Frequency selective channel
  • Kalman filter
  • Low complexity
  • MIMO
  • Turbo equalization

ASJC Scopus subject areas

  • Engineering(all)
  • Computer Networks and Communications

Cite this

Soft input soft output Kalman equalizer for MIMO frequency selective fading channels. / Roy, Subhadeep; Duman, Tolga M.

In: IEEE Transactions on Wireless Communications, Vol. 6, No. 2, 02.2007, p. 506-514.

Research output: Contribution to journalArticle

@article{a8bb83f62f0f421d8d718f1f2de9e8ff,
title = "Soft input soft output Kalman equalizer for MIMO frequency selective fading channels",
abstract = "We consider the Kalman filter for equalization of a multiple-input multiple-output (MIMO), frequency selective, quasi-static fading channel. More specifically, we consider a coded system, where the incoming bit stream is convolutionally encoded, interleaved and then spatially multiplexed across the transmit antennas. Each substream is modulated into M-ary symbols before being transmitted over a frequency selective channel. At the receiver, we propose to use the Kalman filter as a low complexity MIMO equalizer, as opposed to the trellis based maximum a-posteriori (MAP) equalizer whose computational complexity grows exponentially with the channel memory, the number of transmit antennas and the spectral efficiency (bits/s/Hz) of the system. We modify the structure of the Kalman filter and enable it to process the a-priori (soft) information provided by the channel decoder, thereby allowing us to perform iterative (turbo) equalization on the received sequence. The iterative equalizer structure is designed for general M-ary constellations. We also propose a low complexity version of the above algorithm whose performance is comparable to its full complexity counterpart, but which achieves a significant complexity reduction. We demonstrate via simulations that for higher order constellations, when sufficient number of receive antennas are available (e.g. for a 2 transmitter, 3 receiver system, QPSK), the performance of the proposed algorithms after 4 iterations is within 1.5 dB of the non-iterative MAP algorithm with close to an order of magnitude complexity reduction. By objectively quantifying the complexity of all the considered algorithms we show that the complexity reduction for the proposed schemes becomes increasingly significant for practical systems with moderate to large constellation sizes and a large number of transmit antennas.",
keywords = "Equalizer, Frequency selective channel, Kalman filter, Low complexity, MIMO, Turbo equalization",
author = "Subhadeep Roy and Duman, {Tolga M.}",
year = "2007",
month = "2",
doi = "10.1109/TWC.2007.05175",
language = "English (US)",
volume = "6",
pages = "506--514",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Soft input soft output Kalman equalizer for MIMO frequency selective fading channels

AU - Roy, Subhadeep

AU - Duman, Tolga M.

PY - 2007/2

Y1 - 2007/2

N2 - We consider the Kalman filter for equalization of a multiple-input multiple-output (MIMO), frequency selective, quasi-static fading channel. More specifically, we consider a coded system, where the incoming bit stream is convolutionally encoded, interleaved and then spatially multiplexed across the transmit antennas. Each substream is modulated into M-ary symbols before being transmitted over a frequency selective channel. At the receiver, we propose to use the Kalman filter as a low complexity MIMO equalizer, as opposed to the trellis based maximum a-posteriori (MAP) equalizer whose computational complexity grows exponentially with the channel memory, the number of transmit antennas and the spectral efficiency (bits/s/Hz) of the system. We modify the structure of the Kalman filter and enable it to process the a-priori (soft) information provided by the channel decoder, thereby allowing us to perform iterative (turbo) equalization on the received sequence. The iterative equalizer structure is designed for general M-ary constellations. We also propose a low complexity version of the above algorithm whose performance is comparable to its full complexity counterpart, but which achieves a significant complexity reduction. We demonstrate via simulations that for higher order constellations, when sufficient number of receive antennas are available (e.g. for a 2 transmitter, 3 receiver system, QPSK), the performance of the proposed algorithms after 4 iterations is within 1.5 dB of the non-iterative MAP algorithm with close to an order of magnitude complexity reduction. By objectively quantifying the complexity of all the considered algorithms we show that the complexity reduction for the proposed schemes becomes increasingly significant for practical systems with moderate to large constellation sizes and a large number of transmit antennas.

AB - We consider the Kalman filter for equalization of a multiple-input multiple-output (MIMO), frequency selective, quasi-static fading channel. More specifically, we consider a coded system, where the incoming bit stream is convolutionally encoded, interleaved and then spatially multiplexed across the transmit antennas. Each substream is modulated into M-ary symbols before being transmitted over a frequency selective channel. At the receiver, we propose to use the Kalman filter as a low complexity MIMO equalizer, as opposed to the trellis based maximum a-posteriori (MAP) equalizer whose computational complexity grows exponentially with the channel memory, the number of transmit antennas and the spectral efficiency (bits/s/Hz) of the system. We modify the structure of the Kalman filter and enable it to process the a-priori (soft) information provided by the channel decoder, thereby allowing us to perform iterative (turbo) equalization on the received sequence. The iterative equalizer structure is designed for general M-ary constellations. We also propose a low complexity version of the above algorithm whose performance is comparable to its full complexity counterpart, but which achieves a significant complexity reduction. We demonstrate via simulations that for higher order constellations, when sufficient number of receive antennas are available (e.g. for a 2 transmitter, 3 receiver system, QPSK), the performance of the proposed algorithms after 4 iterations is within 1.5 dB of the non-iterative MAP algorithm with close to an order of magnitude complexity reduction. By objectively quantifying the complexity of all the considered algorithms we show that the complexity reduction for the proposed schemes becomes increasingly significant for practical systems with moderate to large constellation sizes and a large number of transmit antennas.

KW - Equalizer

KW - Frequency selective channel

KW - Kalman filter

KW - Low complexity

KW - MIMO

KW - Turbo equalization

UR - http://www.scopus.com/inward/record.url?scp=33847748185&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847748185&partnerID=8YFLogxK

U2 - 10.1109/TWC.2007.05175

DO - 10.1109/TWC.2007.05175

M3 - Article

VL - 6

SP - 506

EP - 514

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 2

ER -