On Nearly Orthogonal Lattice Bases

Files in this item

Files Size Format View
Nee2005Jul1OnNearlyOr.PDF 136.4Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: On Nearly Orthogonal Lattice Bases
Author: Neelamani, Ramesh; Dash, Sanjeeb; Baraniuk, Richard G.
Type: Journal article
Keywords: lattices; shortest lattice vector; orthogonality defect; JPEG; compression
Citation: R. Neelamani, S. Dash and R. G. Baraniuk, "On Nearly Orthogonal Lattice Bases," siam journal on discrete mathematics, 2005.
Abstract: We study "nearly orthogonal" lattice bases, or bases where the angle between any basis vector and the linear subspace spanned by the other basis vectors is greater than 60°. We show that a nearly orthogonal lattice basis always contains a shortest lattice vector. Moreover, if the lengths of the basis vectors are "nearly equal", then the basis is the unique nearly orthogonal lattice basis, up to multiplication of basis vectors by ±1. These results are motivated by an application involving JPEG image compression.
Date Published: 2005-07-01

This item appears in the following Collection(s)

  • ECE Publications [1048 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students
  • DSP Publications [508 items]
    Publications by Rice Faculty and graduate students in digital signal processing.