Approximate enumerative sphere shaping

Y.C. Gultekin; F.M.J. Willems; W.J. van Houtum; S. Serbetli

doi:10.1109/ISIT.2018.8437623

Approximate enumerative sphere shaping

Y.C. Gultekin, F.M.J. Willems, W.J. van Houtum, S. Serbetli

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

35 Citations (Scopus)

234 Downloads (Pure)

Abstract

Enumerative sphere shaping of N-dimensional constellations is discussed. It is proven that a finite-precision number representation is suitable for use in two enumerative indexing algorithms: Enumerative sphere shaping and Divide Conquer (DC) shaping. This representation decreases the storage complexities of these methods significantly. DC is the basis of the well-known shell mapping algorithm and thus our approximations also apply there.

Original language	English
Title of host publication	2018 IEEE International Symposium on Information Theory, ISIT 2018
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	676-680
Number of pages	5
ISBN (Print)	9781538647806
DOIs	https://doi.org/10.1109/ISIT.2018.8437623
Publication status	Published - 15 Aug 2018
Event	2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States Duration: 17 Jun 2018 → 22 Jun 2018

Conference

Conference	2018 IEEE International Symposium on Information Theory, ISIT 2018
Country/Territory	United States
City	Vail
Period	17/06/18 → 22/06/18

Access to Document

10.1109/ISIT.2018.8437623

ApproxShapingISIT2018Final author version , 250 KB

Cite this

@inproceedings{cdffeb3f974e44d09179546fcc9e0307,

title = "Approximate enumerative sphere shaping",

abstract = "Enumerative sphere shaping of N-dimensional constellations is discussed. It is proven that a finite-precision number representation is suitable for use in two enumerative indexing algorithms: Enumerative sphere shaping and Divide Conquer (DC) shaping. This representation decreases the storage complexities of these methods significantly. DC is the basis of the well-known shell mapping algorithm and thus our approximations also apply there.",

author = "Y.C. Gultekin and F.M.J. Willems and {van Houtum}, W.J. and S. Serbetli",

year = "2018",

month = aug,

day = "15",

doi = "10.1109/ISIT.2018.8437623",

language = "English",

isbn = "9781538647806",

pages = "676--680",

booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "2018 IEEE International Symposium on Information Theory, ISIT 2018 ; Conference date: 17-06-2018 Through 22-06-2018",

}

Gultekin, YC , Willems, FMJ , van Houtum, WJ & Serbetli, S 2018, Approximate enumerative sphere shaping. in 2018 IEEE International Symposium on Information Theory, ISIT 2018., 8437623, Institute of Electrical and Electronics Engineers, Piscataway, pp. 676-680, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, Colorado, United States, 17/06/18. https://doi.org/10.1109/ISIT.2018.8437623

Approximate enumerative sphere shaping. / Gultekin, Y.C.; Willems, F.M.J.; van Houtum, W.J. et al.
2018 IEEE International Symposium on Information Theory, ISIT 2018. Piscataway: Institute of Electrical and Electronics Engineers, 2018. p. 676-680 8437623.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Approximate enumerative sphere shaping

AU - Gultekin, Y.C.

AU - Willems, F.M.J.

AU - van Houtum, W.J.

AU - Serbetli, S.

PY - 2018/8/15

Y1 - 2018/8/15

N2 - Enumerative sphere shaping of N-dimensional constellations is discussed. It is proven that a finite-precision number representation is suitable for use in two enumerative indexing algorithms: Enumerative sphere shaping and Divide Conquer (DC) shaping. This representation decreases the storage complexities of these methods significantly. DC is the basis of the well-known shell mapping algorithm and thus our approximations also apply there.

AB - Enumerative sphere shaping of N-dimensional constellations is discussed. It is proven that a finite-precision number representation is suitable for use in two enumerative indexing algorithms: Enumerative sphere shaping and Divide Conquer (DC) shaping. This representation decreases the storage complexities of these methods significantly. DC is the basis of the well-known shell mapping algorithm and thus our approximations also apply there.

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

U2 - 10.1109/ISIT.2018.8437623

DO - 10.1109/ISIT.2018.8437623

M3 - Conference contribution

AN - SCOPUS:85052479509

SN - 9781538647806

SP - 676

EP - 680

BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 2018 IEEE International Symposium on Information Theory, ISIT 2018

Y2 - 17 June 2018 through 22 June 2018

ER -

Approximate enumerative sphere shaping

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Comparison and Optimization of Enumerative Coding Techniques for Amplitude Shaping

Enumerative sphere shaping for wireless communications with short packets

Partial enumerative sphere shaping

Cite this