Mapping design of a four-dimensional 32-ary signal constellation over an AWGN channel

Jianyong Zhang, Ivan B Djordjevic

Research output: Contribution to journalArticle

Abstract

In the bit-interleaved coded modulation with iterative decoding, it is desired that any two Hamming neighbors, i.e., signal constellation points whose binary labels are at unit Hamming distance, be separated by a large Euclidean distance. This paper determines the mappings for the 32-ary four-dimensional generalized cross constellation (32-4D-GCC) so that the minimum squared Euclidean distance d2min between Hamming neighbors is maximized. Among such mappings, those with minimum multiplicity N(d2min) are selected. To reduce the large search space, a set of ¿mapping templates,¿ each producing a collection of mappings with the same set partitions of binary labels, is introduced. Via enumeration of mapping templates, it is shown that the optimum d2min=16 and the optimum N(d2min)=16. Among thousands optimum mappings found by computer search, two of the best performance are presented.

Original languageEnglish (US)
Article number6895385
Pages (from-to)64-73
Number of pages10
JournalChina Communications
Volume11
Issue number7
DOIs
StatePublished - Jul 1 2014

Fingerprint

Labels
Hamming distance
Iterative decoding
Modulation

Keywords

  • AWGN
  • BICM-ID
  • hamming cube
  • mapping template
  • signal mapping

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Mapping design of a four-dimensional 32-ary signal constellation over an AWGN channel. / Zhang, Jianyong; Djordjevic, Ivan B.

In: China Communications, Vol. 11, No. 7, 6895385, 01.07.2014, p. 64-73.

Research output: Contribution to journalArticle

@article{08a33740fcdc44a5ac7617d2d3548701,
title = "Mapping design of a four-dimensional 32-ary signal constellation over an AWGN channel",
abstract = "In the bit-interleaved coded modulation with iterative decoding, it is desired that any two Hamming neighbors, i.e., signal constellation points whose binary labels are at unit Hamming distance, be separated by a large Euclidean distance. This paper determines the mappings for the 32-ary four-dimensional generalized cross constellation (32-4D-GCC) so that the minimum squared Euclidean distance d2min between Hamming neighbors is maximized. Among such mappings, those with minimum multiplicity N(d2min) are selected. To reduce the large search space, a set of ¿mapping templates,¿ each producing a collection of mappings with the same set partitions of binary labels, is introduced. Via enumeration of mapping templates, it is shown that the optimum d2min=16 and the optimum N(d2min)=16. Among thousands optimum mappings found by computer search, two of the best performance are presented.",
keywords = "AWGN, BICM-ID, hamming cube, mapping template, signal mapping",
author = "Jianyong Zhang and Djordjevic, {Ivan B}",
year = "2014",
month = "7",
day = "1",
doi = "10.1109/CC.2014.6895385",
language = "English (US)",
volume = "11",
pages = "64--73",
journal = "China Communications",
issn = "1673-5447",
publisher = "China Institute of Communication",
number = "7",

}

TY - JOUR

T1 - Mapping design of a four-dimensional 32-ary signal constellation over an AWGN channel

AU - Zhang, Jianyong

AU - Djordjevic, Ivan B

PY - 2014/7/1

Y1 - 2014/7/1

N2 - In the bit-interleaved coded modulation with iterative decoding, it is desired that any two Hamming neighbors, i.e., signal constellation points whose binary labels are at unit Hamming distance, be separated by a large Euclidean distance. This paper determines the mappings for the 32-ary four-dimensional generalized cross constellation (32-4D-GCC) so that the minimum squared Euclidean distance d2min between Hamming neighbors is maximized. Among such mappings, those with minimum multiplicity N(d2min) are selected. To reduce the large search space, a set of ¿mapping templates,¿ each producing a collection of mappings with the same set partitions of binary labels, is introduced. Via enumeration of mapping templates, it is shown that the optimum d2min=16 and the optimum N(d2min)=16. Among thousands optimum mappings found by computer search, two of the best performance are presented.

AB - In the bit-interleaved coded modulation with iterative decoding, it is desired that any two Hamming neighbors, i.e., signal constellation points whose binary labels are at unit Hamming distance, be separated by a large Euclidean distance. This paper determines the mappings for the 32-ary four-dimensional generalized cross constellation (32-4D-GCC) so that the minimum squared Euclidean distance d2min between Hamming neighbors is maximized. Among such mappings, those with minimum multiplicity N(d2min) are selected. To reduce the large search space, a set of ¿mapping templates,¿ each producing a collection of mappings with the same set partitions of binary labels, is introduced. Via enumeration of mapping templates, it is shown that the optimum d2min=16 and the optimum N(d2min)=16. Among thousands optimum mappings found by computer search, two of the best performance are presented.

KW - AWGN

KW - BICM-ID

KW - hamming cube

KW - mapping template

KW - signal mapping

UR - http://www.scopus.com/inward/record.url?scp=84907481042&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84907481042&partnerID=8YFLogxK

U2 - 10.1109/CC.2014.6895385

DO - 10.1109/CC.2014.6895385

M3 - Article

VL - 11

SP - 64

EP - 73

JO - China Communications

JF - China Communications

SN - 1673-5447

IS - 7

M1 - 6895385

ER -