Published January 2006
| Published
Journal Article
Open
Algebraic lattice constellations: bounds on performance
Abstract
In this work, we give a bound on performance of any full-diversity lattice constellation constructed from algebraic number fields. We show that most of the already available constructions are almost optimal in the sense that any further improvement of the minimum product distance would lead to a negligible coding gain. Furthermore, we discuss constructions, minimum product distance, and bounds for full-diversity complex rotated Z[i]/sup n/-lattices for any dimension n, which avoid the need of component interleaving.
Additional Information
© Copyright 2006 IEEE. Reprinted with permission. Manuscript received April 6, 2004; revised February 26, 2005.Attached Files
Published - BAYieeetit06.pdf
Files
BAYieeetit06.pdf
Files
(366.3 kB)
Name | Size | Download all |
---|---|---|
md5:0104e997fa0877af22cf73fc98b4459d
|
366.3 kB | Preview Download |
Additional details
- Eprint ID
- 3978
- Resolver ID
- CaltechAUTHORS:BAYieeetit06
- Created
-
2006-07-21Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field