Vikalo, H. and Hassibi, B. and Kailath, T. (2004) Iterative decoding for MIMO channels via modified sphere decoding. IEEE Transactions on Wireless Communications, 3 (6). pp. 2299-2311. ISSN 1536-1276 http://resolver.caltech.edu/CaltechAUTHORS:VIKieeetwc04
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:VIKieeetwc04
In recent years, soft iterative decoding techniques have been shown to greatly improve the bit error rate performance of various communication systems. For multiantenna systems employing space-time 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 probability of the received symbol sequence. The new algorithm solves a nonlinear integer least squares problem and, over a wide range of rates and signal-to-noise ratios, has polynomial-time complexity. Performance of the algorithm, combined with convolutional, turbo, and low-density parity check codes, is demonstrated on several multiantenna channels. The results for systems that employ space-time modulation schemes seem to indicate that the best performing schemes are those that support the highest mutual information between the transmitted and received signals, rather than the best diversity gain.
|Additional Information:||© Copyright 2004 IEEE. Reprinted with permission Manuscript received February 21, 2003; revised July 21, 2003; accepted August 26, 2003. [Posted online: 2005-01-03] The editor coordinating the review of this paper and approving it for publication is M. Shafi. This work was supported in part by the National Science Foundation under Grant CCR-0133818, by the Office of Naval Research under Grant N00014-02-1-0578, and by the Lee Center for Advanced Networking, California Institute of Technology.|
|Subject Keywords:||Expected complexity, iterative decoding, low-density parity check (LDPC) codes, multiantenna systems, polynomial-time complexity, space–time codes, sphere decoding, turbo codes, wireless communications|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||25 May 2006|
|Last Modified:||26 Dec 2012 08:53|
Repository Staff Only: item control page