2019
DOI: 10.1186/s13638-019-1500-7
|View full text |Cite
|
Sign up to set email alerts
|

Labeling-Based Recipient Identification for 16-QAM BICM-ID

Abstract: In recent years, many efforts have been made to find the optimal labeling maps for bit-interleaved coded modulation with iterative decoding (BICM-ID) with the aim to exploit the benefits of iterative decoding to the maximal extent. The current paper reveals new opportunities that BICM-ID signal labeling brings for system designers: it enables recipient addressing without any explicitly sent identifier. Instead, the recipient ID is represented by a labeling map, selected from a set of equally optimal labelings.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(12 citation statements)
references
References 21 publications
1
6
0
Order By: Relevance
“…The resultant interleaved codeword ( ) is sliced into M -bit long blocks, i.e., ; each block is mapped onto a single constellation point by the symbol mapper. The labeling map, used for symbol mapping, depends on the recipient identifier, i , which is obtained from the MAC layer, according to the LABRID principles [ 10 ]. (For 16-QAM modulation, there are 768 asymptotically optimal labeling maps: , which bring equally good BER vs. performance after iterative decoding.)…”
Section: System Modelmentioning
confidence: 99%
See 3 more Smart Citations
“…The resultant interleaved codeword ( ) is sliced into M -bit long blocks, i.e., ; each block is mapped onto a single constellation point by the symbol mapper. The labeling map, used for symbol mapping, depends on the recipient identifier, i , which is obtained from the MAC layer, according to the LABRID principles [ 10 ]. (For 16-QAM modulation, there are 768 asymptotically optimal labeling maps: , which bring equally good BER vs. performance after iterative decoding.)…”
Section: System Modelmentioning
confidence: 99%
“…The key idea presented in the figure is to model a mechanism that blocks foreign frames from passing to the MAC layer. Similar to the first work on LABRID [ 10 ], this procedure is based on observing the convergence of the iterative process. Specifically, the mean of the absolute extrinsic demapper LLR per frame, is calculated in the last decoding pass; if it exceeds a pre-defined threshold, , the frame is claimed to be a desired frame.…”
Section: System Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…Most of the research on iterative turbo decoding stopping criteria have utilised the binary phase-shift keying (BPSK) modulation technique [6], [7], [11], [15], which is the simplest form of phase-shift keying. High-speed networks such as long-term evolution (LTE) networks and those based on fifth-generation (5G) technology require high modulation (For example, eight phase-shift keyings (8PSK), 16 phase-shift keyings (16PSK), 16-QAM, 32-QAM, and 64-QAM) to transfer data at a sufficient speed [14], [16], [25]. A higher modulation needs to be integrated into stopping criteria to meet the speed requirements of current LTE applications [14], [16].…”
Section: Introductionmentioning
confidence: 99%