|
|
Article: 4 The Sphere Decoder: a universal lattice decoding algorithm.(antennas)
- Article from:
- Foundations and Trends in Communications and Information Theory
- Article date:
- December 1, 2004
- Author:
CopyrightCOPYRIGHT 2004 Now Publishers, Inc. This material is published under license from the publisher through the Gale Group, Farmington Hills, Michigan. All inquiries regarding rights should be directed to the Gale Group. (Hide copyright information)
|
The Sphere Decoder is a ML decoder for arbitrary lattice constellations. It solves the closest lattice point problem, i.e., it finds the closest lattice point to a given received point. At the basis of the Sphere Decoder is the Finke-Pohst algorithm which enumerates all lattice points within a sphere centered at the origin [27]. With minor adaptations it is possible to obtain an efficient lattice decoder. Recent work [26] has shown that the Sphere Decoder can be formulated as a stack algorithm and shows its relation to other well-known detection algorithms. In this section we focus on the purely geometric interpretation of this algorithm.
The key idea which makes ...
Related newspaper, magazine, and journal articles:
|
|
Article: The study of [sigma]--index on Q([S.sub.k], ...
Scientia Magna;
June 1, 2008 ;
700+ words
...Abstract A Q([S.sub.k], [C.sub.s1], [C.sub.s2], ... , [C.sub.sk]) graphs be a graph abtained from [S.sub.k] whose every one degree vertex attached one cycle [C.sub.i](i = 1, 2, ... , k). In this ...
|
|