Generalized approximate message-passing decoder for universal sparse superposition codes

Simple item page
dc.citation.epage1597en_US
dc.citation.spage1593en_US
dc.contributor.authorBıyık, Erdemen_US
dc.contributor.authorBarbier, J.en_US
dc.contributor.authorDia, M.en_US
dc.coverage.spatialAachen, Germany
dc.date.accessioned2018-04-12T11:45:53Z
dc.date.available2018-04-12T11:45:53Z
dc.date.issued2017-06en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionDate of Conference: 25-30 June 2017
dc.descriptionConference name: 2017 IEEE International Symposium on Information Theory (ISIT)
dc.description.abstractSparse superposition (SS) codes were originally proposed as a capacity-achieving communication scheme over the additive white Gaussian noise channel (AWGNC) [1]. Very recently, it was discovered that these codes are universal, in the sense that they achieve capacity over any memoryless channel under generalized approximate message-passing (GAMP) decoding [2], although this decoder has never been stated for SS codes. In this contribution we introduce the GAMP decoder for SS codes, we confirm empirically the universality of this communication scheme through its study on various channels and we provide the main analysis tools: state evolution and the potential. We also compare the performance of GAMP with the Bayes-optimal MMSE decoder. We empirically illustrate that despite the presence of a phase transition preventing GAMP to reach the optimal performance, spatial coupling allows to boost the performance that eventually tends to capacity in a proper limit. We also prove that, in contrast with the AWGNC case, SS codes for binary input channels have a vanishing error floor in the limit of large codewords. Moreover, the performance of Hadamard-based encoders is assessed for practical implementations. © 2017 IEEE.en_US
dc.identifier.doi10.1109/ISIT.2017.8006798en_US
dc.identifier.issn2157-8095
dc.identifier.urihttp://hdl.handle.net/11693/37618
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ISIT.2017.8006798en_US
dc.source.titleIEEE International Symposium on Information Theory - Proceedingsen_US
dc.subjectChannel codingen_US
dc.subjectCodes (symbols)en_US
dc.subjectDecodingen_US
dc.subjectGaussian noise (electronic)en_US
dc.subjectInformation theoryen_US
dc.subjectWhite noiseen_US
dc.subjectAdditive white Gaussian noise channelen_US
dc.subjectCommunication schemesen_US
dc.subjectMemoryless channelsen_US
dc.subjectMessage passing decodersen_US
dc.subjectOptimal performanceen_US
dc.subjectSpatial couplingsen_US
dc.subjectState evolutionsen_US
dc.subjectSuperposition codesen_US
dc.subjectMessage passingen_US
dc.titleGeneralized approximate message-passing decoder for universal sparse superposition codesen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Generalized approximate message-passing decoder for universal sparse superposition codes.pdf
Size:
397.58 KB
Format:
Adobe Portable Document Format
Description:
Full Printable Version
Download

Collections

Department of Electrical and Electronics Engineering