A Simplified 256-APSK Soft Demapping Method and Implementation

High-order amplitude phase shift keying (APSK) presents significant challenges in both hardware and software implementations for demapping due to its characteristics such as a large number of constellation points, high computational complexity, and pronounced nonlinear property. In this paper, a low complexity soft demapping method is proposed, where APSK modulation is equivalently decomposed into independent PSK and ASK modulations, and then the computational process of the Max-Log-Map algorithm is simplified in accordance with their respective distributions, resulting in an efficient yet low complexi-ty demapping algorithm. Simulation results indicate that for 256-APSK, the proposed method achieves identical performance to traditional demapping algorithms, with significantly reduced computational complexity.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icicc63565.2024.10780476
Citations
1
Primary Topic
Embedded Systems Design Techniques
Type
article
Field-Weighted Citation Impact
0.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Simplified 256-APSK Soft Demapping Method and Implementation

W.-B. Liu, Qingling Liu, Zhongqiu He
1 citations
Embedded Systems Design Techniques
0.49
article

A Simplified 256-APSK Soft Demapping Method and Implementation

W.-B. Liu, Qingling Liu, Zhongqiu He
article en
1 citations

Abstract

High-order amplitude phase shift keying (APSK) presents significant challenges in both hardware and software implementations for demapping due to its characteristics such as a large number of constellation points, high computational complexity, and pronounced nonlinear property. In this paper, a low complexity soft demapping method is proposed, where APSK modulation is equivalently decomposed into independent PSK and ASK modulations, and then the computational process of the Max-Log-Map algorithm is simplified in accordance with their respective distributions, resulting in an efficient yet low complexi-ty demapping algorithm. Simulation results indicate that for 256-APSK, the proposed method achieves identical performance to traditional demapping algorithms, with significantly reduced computational complexity.

Harbin Engineering University (CN)
Openalex Percentile: Top 34%
Embedded Systems Design Techniques
0.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.