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

On the Complexity of Sphere Decoding for Differential Detection

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)
Pauli, V. ; Inst. for Inf. Transmission, Erlangen-Nurnberg Univ., Erlangen ; Lampe, L.

Multiple-symbol differential detection (MSDD) for multiple-input-multiple-output Rayleigh-fading channels is considered. MSDD, which jointly processes blocks of N received symbols to detect N-1 data symbols, allows for power-efficient transmission without requiring channel state information at the receiver. In previous work, the authors showed that computational efficient sphere decoding algorithms can be used to accomplish MSDD. In this correspondence, the computational complexity of this sphere-decoding based MSDD is analyzed. In particular, it is proven by means of a lower bound that the complexity of the Fincke-Pohst multiple-symbol differential sphere decoder (FP-MSDSD), while being very low over wide ranges of N and signal-to-noise ratios, is exponential in N in principle. Furthermore, both exact and simple approximate expressions for the complexity of FP-MSDSD are derived, which allow for quick assessment of ranges of useful window sizes N of FP-MSDSD and show that the exponential rate of growth of the complexity of FP-MSDSD is asymptotically equal to that of brute-force MSDD

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 4 )

Date of Publication:

April 2007

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.