This paper is about the design and analysis of an index-assignment (IA) based multiple-description coding scheme for the n-channel asymmetric case. We use entropy constrained lattice vector quantization and restrict attention to simple reconstruction functions, which are given by the inverse IA function when all descriptions are received or otherwise by a weighted average of the received descri...

In this paper the existence of minimal lattice-subspaces of a vector lattice E containing a subset B of E+ is studied (a lattice-subspace of E is a subspace of E which is a vector lattice in the induced ordering). It is proved that if there exists a Lebesgue linear topology τ on E and E+ is τ -closed (especially if E is a Banach lattice with order continuous norm), then minimal lattice-subspace...

In this paper, we propose an overloaded multiple-input multiple-output (MIMO) signal detection scheme with slab decoding and lattice reduction (LR). The proposed scheme firstly splits the transmitted signal vector into two parts, the post-voting vector composed of the same number of signal elements as that of receive antennas, and the pre-voting vector composed of the remaining elements. Second...

Constructing an encoding of a concept lattice using short bit vectors allows for efficient computation of join operations on the lattice. Join is the central operation any unification-based parser must support. We extend the traditional bit vector encoding, which represents join failure using the zero vector, to count any vector with less than a fixed number of one bits as failure. This allows ...

In this paper, we propose an accelerated algorithm for solving the shortest vector problem (SVP). We construct our algorithm by using two novel ideas, i.e., the choice of appropriate distributions of the natural number representation and the reduction of the sum of the squared lengths of the Gram-Schmidt orthogonalized vectors. These two ideas essentially depend on statistical analysis. The fir...

We present a novel practical algorithm that given a lattice basis b1, ..., bn finds in O(n ( k 6 )) average time a shorter vector than b1 provided that b1 is ( k 6 ) times longer than the length of the shortest, nonzero lattice vector. We assume that the given basis b1, ..., bn has an orthogonal basis that is typical for worst case lattice bases. The new reduction method samples short lattice v...

Source coding based on Gaussian Mixture Models (GMM) has been recently proposed for LPC quantization. We address in this paper the related problem of designing efficient codebooks for Gaussian vector sources. A new technique of ellipsoidal lattice vector quantization (VQ) is described, based on 1) scalar companding optimized for Gaussian random variables and 2) rectangular lattice codebooks wit...

Abstract. Let P ∈ R be a lattice polytope. Then P is smooth if for each vertex v ∈ P , {wi − v} forms part of a Z-basis for Z , where wi is the first lattice vector along an edge incident at v. We say P has lattice-free edges if the only lattice points on the edges of P are the vertices of P . We present two new algorithms for constructing smooth lattice polytopes with lattice-free edges and an...

Major substep in a lattice sieve algorithm which solves the Euclidean shortest vector problem (SVP) is the computation of sums and Euclidean norms of many vector pairs. Finding a solution to the SVP is the foundation of an attack against many lattice based crypto systems. We optimize the main subfunction of a sieve for the regular main processor and for the co-processor to speed up the algorith...

A new technique to investigate small chemical potential effects on hadron quantities using lattice QCD simulations is developed. A Taylor series expansion of hadron screening mass in µ/T is used. It is successfully applied to study the properties of nucleon, pseudo-scalar and vector meson screening masses around the deconfinement phase transition at finite baryonic density by evaluating the Tay...