Computer Science – Information Theory
Scientific paper
2007-03-12
IEEE Trans. Inf. Theory, vol. 55(8), Aug. 2009, pp. 3751-3780
Computer Science
Information Theory
33 pages, 1 figure, submitted to IEEE Trans. on Inform. Theory Dec. 2006
Scientific paper
It is shown why the discriminant of a maximal order within a cyclic division algebra must be minimized in order to get the densest possible matrix lattices with a prescribed nonvanishing minimum determinant. Using results from class field theory a lower bound to the minimum discriminant of a maximal order with a given center and index (= the number of Tx/Rx antennas) is derived. Also numerous examples of division algebras achieving our bound are given. E.g. we construct a matrix lattice with QAM coefficients that has 2.5 times as many codewords as the celebrated Golden code of the same minimum determinant. We describe a general algorithm due to Ivanyos and Ronyai for finding maximal orders within a cyclic division algebra and discuss our enhancements to this algorithm. We also consider general methods for finding cyclic division algebras of a prescribed index achieving our lower bound.
Hollanti Camilla
Lahtonen Jyrki
Ranto K.
Vehkalahti Roope
No associations
LandOfFree
On the densest MIMO lattices from cyclic division algebras does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the densest MIMO lattices from cyclic division algebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the densest MIMO lattices from cyclic division algebras will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-285722