Optimal 2-Dimensional 3-Dispersion Lattices

We examine 2-dimensional 3-dispersion lattice interleavers in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight lower bounds on the interleaving degree in all cases and show lattices which achieve the bounds.

• Type: Conference
• Year: 2003
• Where: AAECC
• Authors: Moshe Schwartz, Tuvi Etzion
• Keywords: 3-dispersion Lattice Interleavers, AAECC 2003, Algorithms, Rectangular Grid, Tight Lower Bounds