IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Conference Publications > Information Theory, 2004. ISI ... Help

Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problem

Full Text Sign-In or Purchase

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing! close button
puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chun-Hao Hsu ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; Anastasopoulos, A.

The problem of optimal decoding of a trellis coded sequence transmitted over a frequency nonselective, time-selective fading channel is considered in this paper. In particular, the case where the channel state information (CSI) is unknown to the receiver, thus Viterbi's algorithm (VA) can not be employed to find the maximum a posteriori probability sequence detection (MAPSqD) solution with linear complexity in sequence length N. It is proved that for two-state trellis, the exact solution can indeed be obtained with only polynomial complexity in N for any signal-to-noise ratio.

Published in:
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on

Date of Conference: 27 June-2 July 2004

Print ISBN:
0-7803-8280-3
INSPEC Accession Number:
8178603
Digital Object Identifier :
10.1109/ISIT.2004.1365184
Product Type:
Conference Publications

IEEE Account

Purchase Details

Profile Information

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.