On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications

In Part I, we found a closed-form expression for the expected complexity of the sphere-decoding algorithm, both for the infinite and finite lattice. We continue the discussion in this paper by generalizing the results to the complex version of the problem and using the expected complexity expression...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing Vol. 53; no. 8; pp. 2819 - 2834
Main Authors: Vikalo, H., Hassibi, B.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.08.2005
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:1053-587X, 1941-0476
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first