New Trellis codes based on lattices and cosets
IEEE Transactions on Information Theory
Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Elements of information theory
Elements of information theory
Integer matrix diagonalization
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Fast Fourier Transform for Hexagonal Aggregates
Journal of Mathematical Imaging and Vision
Multidimensional Digital Signal Processing
Multidimensional Digital Signal Processing
Theory of Information and Coding
Theory of Information and Coding
Fast algorithms for the multidimensional discrete fourier transform
Fast algorithms for the multidimensional discrete fourier transform
The role of Smith-form decomposition of integer-matrices, in multidimensional multirate systems
ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
Low complexity optimal joint detection for oversaturated multipleaccess communications
IEEE Transactions on Signal Processing
Closest point search in lattices
IEEE Transactions on Information Theory
Lattice decoding for joint detection in direct-sequence CDMA systems
IEEE Transactions on Information Theory
Near-ellipsoidal Voronoi coding
IEEE Transactions on Information Theory
Multiuser signaling in the symbol-synchronous AWGN channel
IEEE Transactions on Information Theory
Multi-user detection for DS-CDMA communications
IEEE Communications Magazine
Successive refinement lattice vector quantization
IEEE Transactions on Image Processing
| Hi-index | 754.84 |
This paper describes scale-recursive symbol constellations for the synchronous multiple-access (MA) channel, which can be seen as a generalization of Voronoi coding. The constellations are related by a fixed scaling and rotation, and are designed so that in the noise-free case, the combined signal always falls onto an appropriate lattice. This allows high throughput and a linear complexity decoding algorithm. Novel constellations of up to 24 dimensions are given that show improved performance over conventional rectangular lattices.