Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 1, 2006 | public
Journal Article Open

Efficient joint maximum-likelihood channel estimation and signal detection

Abstract

In wireless communication systems, channel state information is often assumed to be available at the receiver. Traditionally, a training sequence is used to obtain the estimate of the channel. Alternatively, the channel can be identified using known properties of the transmitted signal. However, the computational effort required to find the joint ML solution to the symbol detection and channel estimation problem increases exponentially with the dimension of the problem. To significantly reduce this computational effort, we formulate the joint ML estimation and detection as an integer least-squares problem, and show that for a wide range of signal-to-noise ratios (SNR) and problem dimensions it can be solved via sphere decoding with expected complexity comparable to the complexity of heuristic techniques.

Additional Information

© Copyright 2006 IEEE. Reprinted with permission. Manuscript received August 23, 2004; revised March 30, 2005; accepted May 17, 2005. [Posted online: 2006-08-14] The associate editor coordinating the review of this paper and approving it for publication was C. Xiao. This work was supported in part by the NSF under grant no. CCR-0133818, by the Office of Naval Research under grant no. N00014-02-1-0578, by Caltech's Lee Center for Advanced Networking, and by the Swedish Science Council (VR).

Files

VIKieeetwc06.pdf
Files (539.1 kB)
Name Size Download all
md5:92960aa7988875b6c5e5252f8137bb68
539.1 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
March 5, 2024