Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.


Download file Download BibTeX


Labeling-Based Recipient Identification with Low-Order Modulation


[ 1 ] Instytut Radiokomunikacji, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.2] Automation, electronics, electrical engineering and space technology

Year of publication


Published in


Journal year: 2024 | Journal volume: vol. 13 | Journal number: iss. 2

Article type

scientific article

Publication language


  • coded modulation
  • diversity
  • iterative decoding
  • labeling map

EN Labeling-Based Recipient Identification (LABRID) brings the possibility of representing the destination station address in a Bit-Interleaved Coded Modulation with Iterative Decoding (BICM-ID) system by a signal labeling rule. Low-order modulations, such as BPSK or QPSK, pose a general problem for BICM‑ID due to a limited convergence of iterative decoding. In the context of LABRID, they have one more drawback—a small number of different labeling rules in general; the number of the optimal ones, which exhibit the maximal asymptotic coding gain, is reduced even further. Meanwhile, LABRID needs a sizable collection of different optimal labeling rules to serve many users in large wireless networks. In this paper, the author suggests the use of hypercube BPSK or QPSK labeling to overcome all these challenges. By means of the Reactive Tabu Search (RTS) algorithm, more than 1500 equivalent optimal hypercube labeling rules are found. Analytical error bounds of the system are developed and supported by simulation experiments. Then, the focus is moved to the criterion to determine the frame destination at the LABRID receiver; a simple threshold-based method is proposed to keep the incorrect decision probability below 10−5. Finally, it is shown that LABRID outperforms a reference BICM‑ID system in terms of computational complexity.

Pages (from - to)

425-1 - 425-23





Article number: 425

License type

CC BY (attribution alone)

Open Access Mode

open journal

Open Access Text Version

final published version

Date of Open Access to the publication

at the time of publication

Full text of article

Download file

Access level to full text


Ministry points / journal


Impact Factor

2,9 [List 2022]

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.