Graph-based metrics over QAM constellations
2008 IEEE International Symposium on Information Theory, 2008•ieeexplore.ieee.org
In order to propose a new metric over QAM constellations, diagonal Gaussian graphs
defined over quotients of the Gaussian integers are introduced in this paper. Distance
properties of the constellations are detailed by means of the vertex-to-vertex distribution of
this family of graphs. Moreover, perfect codes for this metric are considered. Finally, notable
subgraphs of diagonal Gaussian graphs are studied which leads to relate the proposed
metric to other well-known graph-based metrics such as the Lee distance.
defined over quotients of the Gaussian integers are introduced in this paper. Distance
properties of the constellations are detailed by means of the vertex-to-vertex distribution of
this family of graphs. Moreover, perfect codes for this metric are considered. Finally, notable
subgraphs of diagonal Gaussian graphs are studied which leads to relate the proposed
metric to other well-known graph-based metrics such as the Lee distance.
In order to propose a new metric over QAM constellations, diagonal Gaussian graphs defined over quotients of the Gaussian integers are introduced in this paper. Distance properties of the constellations are detailed by means of the vertex-to-vertex distribution of this family of graphs. Moreover, perfect codes for this metric are considered. Finally, notable subgraphs of diagonal Gaussian graphs are studied which leads to relate the proposed metric to other well-known graph-based metrics such as the Lee distance.
ieeexplore.ieee.org
Showing the best result for this search. See all results