Cart (Loading....) | Create Account
Close category search window
 

An Iterative MIMO-HSDPA Receiver Based On a K-Best-MAP Algorithm

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

4 Author(s)
Mehlfuhrer, C. ; Inst. of Commun. & Radio-Freq. Eng., Vienna Univ. of Technol., Vienna ; Seethaler, D. ; Matz, G. ; Rupp, M.

We propose an iterative receiver for horizontally encoded MIMO systems like the PARC proposal for MIMO-HSDPA. Our receiver uses a K-best-MAP demodulator to provide the channel decoder with approximate log-likelihood ratios. The complexity of K-best-MAP is reduced by exploiting the CRC present in each encoded layer. We show that K-best-MAP with list update is superior to demodulation using a fixed candidate list. Finally, our numerical results demonstrate significant SNR gains as compared to a receiver using MMSE-based successive interference cancelation.

Published in:

Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE

Date of Conference:

Nov. 27 2006-Dec. 1 2006

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.