Efficient computation of the realizable MIMO DFE

Sander Wahls, Holger Boche

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Realizable DFEs are DFEs with stable and causal IIR filters and finite decision delay. Computational complexity of current algorithms to compute them usually grows cubically with the decision delay. In this paper, we show how complexity can be reduced to quadratic. We compare two approaches, the so-called polynomial approach and a novel state-space approach using inner-outer factorization. In both cases finite linear equation systems with structure lie at the heart of the realizable DFE. Displacement structure theory allows to solve them efficiently.

Original languageEnglish
Title of host publication2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3222-3225
Number of pages4
ISBN (Print)9781424442966
DOIs
StatePublished - 2010
Externally publishedYes
Event2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010 - Dallas, TX, United States
Duration: 14 Mar 201019 Mar 2010

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Conference

Conference2010 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2010
Country/TerritoryUnited States
CityDallas, TX
Period14/03/1019/03/10

Keywords

  • Computation time
  • Decision feedback equalizers
  • IIR digital filters
  • MIMO systems

Fingerprint

Dive into the research topics of 'Efficient computation of the realizable MIMO DFE'. Together they form a unique fingerprint.

Cite this