By Topic

A general combinatorial sphere decoder and its application

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
$33 $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)
Dung Ngoc Dao ; Dept. of Electr. & Comput. Eng., Alberta Univ., Edmonton, Alta. ; Chintha Tellambura

The conventional problem of searching the shortest vector z of a N-dimensional lattice L(H) with generating matrix HisinRNtimesM is considered in a more general setting. There are P generating matrices HiisinRNtimesM(i=1,2,...,P) of the P lattices L(Hi). For a (bounded) integer vector bisinZM , we obtain P lattice points Hib. Let di be the Euclidean norm of Hib. The problem of interest is how to search for a vector b so that the maximum of di is minimized. We propose a new sphere decoder called combinatorial sphere decoder (CSD) to solve this problem. One of the applications of the new CSD is presented in detail to show its effectiveness

Published in:

IEEE Communications Letters  (Volume:10 ,  Issue: 12 )