On the sphere-decoding algorithm I. Expected complexity

The problem of finding the least-squares solution to a system of linear equations where the unknown vector is comprised of integers, but the matrix coefficient and given vector are comprised of real numbers, arises in many applications: communications, cryptography, GPS, to name a few. The problem i...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on signal processing Vol. 53; no. 8; pp. 2806 - 2818
Main Authors:	Hassibi, B., Vikalo, H.
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:	Additive noise Algorithms Applied sciences Closed-form solution Coding, codes Communication systems Complexity Cryptography Equations Exact sciences and technology Expected complexity Global Positioning System Information, signal and communications theory integer least-squares problem lattice problems Lattices Mathematical analysis Maximum likelihood decoding multiple-antenna systems NP hard Polynomials Satellite navigation systems Signal and communications theory Signal to noise ratio sphere decoding Studies Telecommunications and information theory Vectors Vectors (mathematics) wireless communications wireless communications Worst case method Wireless telecommunication integer least-squares problem Implementation Noise level sphere decoding NP hard Least squares method Security of data Cryptography Antenna array Additive noise GPS system Least squares problem multiple-antenna systems Algorithm Maximum likelihood decoding lattice problems Satellite navigation Linear system Telecommunication system NP hard problem Expected complexity Signal to noise ratio
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!