Iterative Processing for Superposition Mapping | Zendy

Tianbin Wo | Zendy; Meelis Noemm | Zendy; Dapeng Hao | Zendy; Peter Adam Hoeher | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Iterative Processing for Superposition Mapping

Author(s) -

Tianbin Wo,

Meelis Noemm,

Dapeng Hao,

Peter Adam Hoeher

Publication year - 2010

Publication title -

journal of electrical and computer engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.318

H-Index - 25

eISSN - 2090-0155

pISSN - 2090-0147

DOI - 10.1155/2010/706464

Subject(s) - superposition principle , focus (optics) , gaussian , quadrature amplitude modulation , modulation (music) , algorithm , tuple , computer science , constellation , iterative method , symbol (formal) , topology (electrical circuits) , theoretical computer science , mathematics , electronic engineering , bit error rate , decoding methods , physics , optics , engineering , discrete mathematics , mathematical analysis , quantum mechanics , astronomy , combinatorics , acoustics , programming language

Superposition mapping (SM) is a modulation technique which loads bit tuples onto data symbols simply vialinear superposition. Since the resulting data symbols are often Gaussian-like, SM has a good theoretical potential to approachthe capacity of Gaussian channels. On the other hand, the symbol constellation is typically nonbijective and its characteristic isvery different from that of conventional mapping schemes like QAM or PSK. As a result, its behavior is also quite different fromconventional mapping schemes, particularly when applied in the framework of bit-interleaved coded modulation. In this paper, acomprehensive analysis is provided for SM, with particular focus on aspects related to iterative processing

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

Accelerating Research