z-logo
open-access-imgOpen Access
Set partitioning of Gaussian integer constellations and its application to two‐dimensional interleaving
Author(s) -
Freudenberger Jürgen,
Spinner Jens,
Shavgulidze Sergo
Publication year - 2014
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2013.0640
Subject(s) - interleaving , constellation , integer (computer science) , computer science , gaussian , set (abstract data type) , gaussian integer , mathematics , algorithm , discrete mathematics , physics , quantum mechanics , programming language , operating system , astronomy
Codes over Gaussian integers have been proposed for coding over two‐dimensional (2D) signal spaces, for example, using quadrature amplitude modulation. Here, it is demonstrated that the concept of set partitioning can be applied to Gaussian integer constellations that are isomorphic to 2D modules over rings of integers modulo p . This enables multilevel code constructions over Gaussian integers. The authors derive upper bounds on the achievable minimum distance in the subsets and present a construction for the set partitioning. This construction achieves optimal or close to optimal minimum distances. Furthermore, it is demonstrated that this set partitioning can be applied to an interleaving technique for correcting 2D cyclic clusters of errors. The authors propose a novel combination of generalised concatenated codes with 2D interleaving to correct 2D error clusters and independent errors.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here