A Caltech Library Service

Modified fincke-pohst algorithm for low-complexity iterative decoding over multiple antenna channels

Vikalo, Haris and Hassibi, Babak (2002) Modified fincke-pohst algorithm for low-complexity iterative decoding over multiple antenna channels. In: 2002 IEEE International Symposium on Information Theory, Proceedings. IEEE , Piscataway, NJ, p. 390. ISBN 0-7803-7501-7.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


In recent years, soft iterative decoding techniques have been shown to greatly improve the bit error rate performance of various communication systems. For multiple antenna systems employing spacetime codes, however, it is not clear what is the best way to obtain the soft-information required of the iterative scheme with low complexity. In this paper, we propose a modification of the Fincke-Pohst (sphere decoding) algorithm to estimate the maximum a posteriori (MAP) probability of the received symbol sequence. The new algorithm (FP-MAP) solves a nonlinear integer least-squares problem and, over a wide range of rates and SNRs, has polynomial-time (often cubic) expected complexity. The FP-MAP algorithm provides soft detection information for the soft channel decoder. The soft decoder's output is then fed back to the FP-MAP, and iterated on. The performance of the FP-MAP algorithm on a multiple antenna system employing turbo code is demonstrated.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 2002 IEEE.
Record Number:CaltechAUTHORS:20150227-072029585
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:55298
Deposited By: Shirley Slattery
Deposited On:27 Feb 2015 18:56
Last Modified:10 Nov 2021 20:44

Repository Staff Only: item control page