By Topic

Approximate Lattice Decoding: Primal Versus Dual Basis Reduction

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

1 Author(s)
Cong Ling ; Dept. of Electron. Eng., King''s Coll. London

Lattice decoding enables significant complexity reduction in multi-input multi-output (MIMO) communications. Unlike most work on the lattice-reduction-aided decoding technique, this paper is aimed at a comparative study of primal versus dual basis reduction for approximate lattice decoding. We derive the respective proximity factors for the two methods, which measure the performance gap to maximum-likelihood (ML) decoding. It is found that in many cases reducing the dual can result in smaller proximity factors than reducing the primal basis

Published in:

Information Theory, 2006 IEEE International Symposium on

Date of Conference:

9-14 July 2006