SBSteffen Bittner

Steffen Bittner

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Steffen Bittner has a total of 5 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Low Complexity Soft Interference Cancellation for MIMO-Systems

    by S. Bittner, E. Zimmermann, G. Fettweis

    Iterative equalization has emerged as an efficient means of achieving near-capacity detection performance in multiple-antenna (MIMO) systems. However, many proposed detection strategies still exhibit a very high complexity which may render them unsuited for practical implementation. In this paper, we show that the appropriate use of a-priori knowledge during iterative equalization based on soft interference cancellation enables to drastically reduce detection complexity. More specifically, we propose to take into account only a subset of constellation points in the calculation of detector soft output, by considering the vicinities of the interference reduced received signal and the constellation points supported by the a-priori knowledge. Additionally, a threshold rule on symbol probabilities is used to reduce complexity in the calculation of soft symbols and residual noise during soft interference cancelling. Our results show that the computational effort required for detection can be lowered by as much as 50% for 16-QAM and 96% for higher order constellations (64-256-QAM), without any significant loss in performance


  • List Sequential MIMO Detection: Noise Bias Term and Partial Path Augmentation

    by Steffen Bittner, Ernesto Zimmermann, Wolfgang Rave, Gerhard Fettweis

    Near-capacity performance can be achieved in multiple-antenna systems by using a list sequential (LISS) detector for iterative equalization. Path augmentation is known to increase the performance of this detector, while a so-called bias term has been used to reduce its computational complexity, in applications other than MIMO detection. In this work, we extend the LISS MIMO detector [1] to incorporate different implementations of the bias term. We show that following the traditional approach of using an auxiliary stack for this purpose leads to a strong narrowing of the search tree, but also to a significant performance degradation, due to a reduced quality of the detector soft output. We therefore propose to use a so-called noise bias term instead, which can be implemented with negligible effort, significantly reduces the size of the search tree, but allows for almost retaining detector performance. Finally, we demonstrate that the extension of only a small fraction of the incomplete stack entries is sufficient to leverage the full gains of path augmentation, thus enabling further substantial savings in computational complexity.